pub struct BipedalPlanner { /* private fields */ }Expand description
Planner for the PythonRobotics-style bipedal footstep adjustment demo.
Implementations§
Source§impl BipedalPlanner
impl BipedalPlanner
pub fn new(config: BipedalPlannerConfig) -> Self
pub fn config(&self) -> BipedalPlannerConfig
Sourcepub fn plan(
&self,
reference_footsteps: &[Footstep],
) -> RoboticsResult<BipedalPlan>
pub fn plan( &self, reference_footsteps: &[Footstep], ) -> RoboticsResult<BipedalPlan>
Compute modified footsteps and a coarse COM trajectory.
Auto Trait Implementations§
impl Freeze for BipedalPlanner
impl RefUnwindSafe for BipedalPlanner
impl Send for BipedalPlanner
impl Sync for BipedalPlanner
impl Unpin for BipedalPlanner
impl UnsafeUnpin for BipedalPlanner
impl UnwindSafe for BipedalPlanner
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> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.