pub struct LqrController {
pub k: Vec<f64>,
pub n: usize,
pub m: usize,
}Expand description
Discrete Linear Quadratic Regulator (LQR) controller.
Solves the discrete algebraic Riccati equation (DARE) iteratively and computes the optimal gain matrix K such that u = -K*x minimizes J = Σ (x’Qx + u’Ru).
Fields§
§k: Vec<f64>Optimal gain matrix K (m×n), row-major.
n: usizeNumber of states n.
m: usizeNumber of inputs m.
Implementations§
Source§impl LqrController
impl LqrController
Sourcepub fn solve(
a: &[f64],
b: &[f64],
q: &[f64],
r: &[f64],
n: usize,
m: usize,
max_iter: usize,
tol: f64,
) -> Option<Self>
pub fn solve( a: &[f64], b: &[f64], q: &[f64], r: &[f64], n: usize, m: usize, max_iter: usize, tol: f64, ) -> Option<Self>
Solve DARE and compute LQR gain.
a— state matrix (n×n)b— input matrix (n×m)q— state cost matrix (n×n), positive semi-definiter— input cost matrix (m×m), positive definitemax_iter— maximum iterations for Riccati iterationtol— convergence tolerance (Frobenius norm of P change)
Trait Implementations§
Source§impl Clone for LqrController
impl Clone for LqrController
Source§fn clone(&self) -> LqrController
fn clone(&self) -> LqrController
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for LqrController
impl RefUnwindSafe for LqrController
impl Send for LqrController
impl Sync for LqrController
impl Unpin for LqrController
impl UnsafeUnpin for LqrController
impl UnwindSafe for LqrController
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<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.