pub struct LeaderFollowerSpace<X, const D: usize, const N: usize>where
X: SampleUniform,{ /* private fields */ }Expand description
A uniformly sampled Cuboid with normed cost function
N must be D*2
Implementations§
Source§impl<X, const D: usize, const N: usize> LeaderFollowerSpace<X, D, N>
impl<X, const D: usize, const N: usize> LeaderFollowerSpace<X, D, N>
pub fn new( bounds: Bounds<X::Element, N>, norm: NormCost, rng: RNG, sensor_range: (X::Element, X::Element), ) -> Result<Self>
pub fn intial_sensor_range(&self) -> (X::Element, X::Element)
pub fn get_sensor_range(&self) -> (X::Element, X::Element)
pub fn set_sensor_range( &mut self, sensor_range: (X::Element, X::Element), ) -> Option<()>
Trait Implementations§
Source§impl<X, const D: usize, const N: usize> CSpace<X, N> for LeaderFollowerSpace<X, D, N>
impl<X, const D: usize, const N: usize> CSpace<X, N> for LeaderFollowerSpace<X, D, N>
type Traj = LinearTrajectory<X, NormCost, N>
Source§fn cost<R1, R2, S1, S2>(
&self,
a: &Vector<X, R1, S1>,
b: &Vector<X, R2, S2>,
) -> Xwhere
R1: Dim,
R2: Dim,
S1: Storage<X, R1>,
S2: Storage<X, R2>,
ShapeConstraint: SameNumberOfRows<R1, R2>,
fn cost<R1, R2, S1, S2>(
&self,
a: &Vector<X, R1, S1>,
b: &Vector<X, R2, S2>,
) -> Xwhere
R1: Dim,
R2: Dim,
S1: Storage<X, R1>,
S2: Storage<X, R2>,
ShapeConstraint: SameNumberOfRows<R1, R2>,
Cost function between two arbitrary points within the space
Always returns a value Read more
Source§fn trajectory<S1, S2>(
&self,
start: Vector<X, Const<N>, S1>,
end: Vector<X, Const<N>, S2>,
) -> Option<FullTraj<X, Self::Traj, S1, S2, N>>
fn trajectory<S1, S2>( &self, start: Vector<X, Const<N>, S1>, end: Vector<X, Const<N>, S2>, ) -> Option<FullTraj<X, Self::Traj, S1, S2, N>>
Calculate the trajectory data between the given start and end points for the system Read more
Source§fn is_free<S>(&self, _: &Vector<X, Const<N>, S>) -> bool
fn is_free<S>(&self, _: &Vector<X, Const<N>, S>) -> bool
Determines if the given point is a valid state in the space
Source§impl<X, const D: usize, const N: usize> FromParams for LeaderFollowerSpace<X, D, N>
impl<X, const D: usize, const N: usize> FromParams for LeaderFollowerSpace<X, D, N>
Source§impl<X, const D: usize, const N: usize> LeaderFollowerCSpace<X, D, N> for LeaderFollowerSpace<X, D, N>
impl<X, const D: usize, const N: usize> LeaderFollowerCSpace<X, D, N> for LeaderFollowerSpace<X, D, N>
Source§fn get_leader<S: Storage<X, Const<N>>>(
state: &Vector<X, Const<N>, S>,
) -> Vector<X, Const<D>, SliceStorage<'_, X, Const<D>, Const<1_usize>, S::RStride, S::CStride>>
fn get_leader<S: Storage<X, Const<N>>>( state: &Vector<X, Const<N>, S>, ) -> Vector<X, Const<D>, SliceStorage<'_, X, Const<D>, Const<1_usize>, S::RStride, S::CStride>>
Get the position of the leader within the dimensional space
Auto Trait Implementations§
impl<X, const D: usize, const N: usize> Freeze for LeaderFollowerSpace<X, D, N>where
X: Freeze,
impl<X, const D: usize, const N: usize> RefUnwindSafe for LeaderFollowerSpace<X, D, N>
impl<X, const D: usize, const N: usize> Send for LeaderFollowerSpace<X, D, N>
impl<X, const D: usize, const N: usize> Sync for LeaderFollowerSpace<X, D, N>
impl<X, const D: usize, const N: usize> Unpin for LeaderFollowerSpace<X, D, N>
impl<X, const D: usize, const N: usize> UnwindSafe for LeaderFollowerSpace<X, D, 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> 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.