pub struct FixedPolicy<T, const NX: usize, const NU: usize> { /* private fields */ }Expand description
Contains all pre-computed values for a given problem and value of rho.
Implementations§
Source§impl<T, const NX: usize, const NU: usize> FixedPolicy<T, NX, NU>
impl<T, const NX: usize, const NU: usize> FixedPolicy<T, NX, NU>
Sourcepub fn new(
rho: T,
iters: usize,
A: &SMatrix<T, NX, NX>,
B: &SMatrix<T, NX, NU>,
Q: &SMatrix<T, NX, NX>,
R: &SMatrix<T, NU, NU>,
S: &SMatrix<T, NX, NU>,
) -> Result<Self, Error>
pub fn new( rho: T, iters: usize, A: &SMatrix<T, NX, NX>, B: &SMatrix<T, NX, NU>, Q: &SMatrix<T, NX, NX>, R: &SMatrix<T, NU, NU>, S: &SMatrix<T, NX, NU>, ) -> Result<Self, Error>
Create a new FixedPolicy.
§Errors
If the calculated LQR gain is not invertible, or any of the calculated values are not normal.
Trait Implementations§
Source§impl<T, const NX: usize, const NU: usize> Policy<T, NX, NU> for FixedPolicy<T, NX, NU>
impl<T, const NX: usize, const NU: usize> Policy<T, NX, NU> for FixedPolicy<T, NX, NU>
Source§fn update_active(&mut self, _prim_residual: T, _dual_residual: T) -> Option<T>
fn update_active(&mut self, _prim_residual: T, _dual_residual: T) -> Option<T>
Updates which policy is active by evaluating the primal and dual residuals. Read more
Source§fn get_active(&self) -> &FixedPolicy<T, NX, NU>
fn get_active(&self) -> &FixedPolicy<T, NX, NU>
Get a reference to the currently active policy.
Auto Trait Implementations§
impl<T, const NX: usize, const NU: usize> Freeze for FixedPolicy<T, NX, NU>where
T: Freeze,
impl<T, const NX: usize, const NU: usize> RefUnwindSafe for FixedPolicy<T, NX, NU>where
T: RefUnwindSafe,
impl<T, const NX: usize, const NU: usize> Send for FixedPolicy<T, NX, NU>where
T: Send,
impl<T, const NX: usize, const NU: usize> Sync for FixedPolicy<T, NX, NU>where
T: Sync,
impl<T, const NX: usize, const NU: usize> Unpin for FixedPolicy<T, NX, NU>where
T: Unpin,
impl<T, const NX: usize, const NU: usize> UnwindSafe for FixedPolicy<T, NX, NU>where
T: UnwindSafe,
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<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.