pub struct RrtxState<X, CS, OS, const N: usize>{
pub graph: RrtxGraph<X, CS::Traj, N>,
pub current_path: Option<(SVector<X, N>, CS::Traj, NodeIndex)>,
pub pose: SVector<X, N>,
pub obs_space: OS,
pub radius: X,
pub robot_specs: RobotSpecs<X>,
pub params: RrtxParams<X>,
}Expand description
Rrtx Serializable State information
Fields§
§graph: RrtxGraph<X, CS::Traj, N>All the nodes with their associated costs and edges that connect them
current_path: Option<(SVector<X, N>, CS::Traj, NodeIndex)>The current path being travelled from some point to a node in the graph and the trajectory of how to get there
pose: SVector<X, N>The last know current pose of the system
obs_space: OSTracks the obstacles in the space
radius: XShrinking ball radius
robot_specs: RobotSpecs<X>Robot specifications
params: RrtxParams<X>Trait Implementations§
Source§impl<'de, X, CS, OS, const N: usize> Deserialize<'de> for RrtxState<X, CS, OS, N>where
X: Scalar + DeserializeOwned,
CS: CSpace<X, N>,
OS: ObstacleSpace<X, CS, N> + DeserializeOwned,
CS::Traj: DeserializeOwned,
impl<'de, X, CS, OS, const N: usize> Deserialize<'de> for RrtxState<X, CS, OS, N>where
X: Scalar + DeserializeOwned,
CS: CSpace<X, N>,
OS: ObstacleSpace<X, CS, N> + DeserializeOwned,
CS::Traj: DeserializeOwned,
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations§
impl<X, CS, OS, const N: usize> Freeze for RrtxState<X, CS, OS, N>
impl<X, CS, OS, const N: usize> RefUnwindSafe for RrtxState<X, CS, OS, N>
impl<X, CS, OS, const N: usize> Send for RrtxState<X, CS, OS, N>
impl<X, CS, OS, const N: usize> Sync for RrtxState<X, CS, OS, N>
impl<X, CS, OS, const N: usize> Unpin for RrtxState<X, CS, OS, N>
impl<X, CS, OS, const N: usize> UnwindSafe for RrtxState<X, CS, OS, N>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.