pub struct PidController {
pub kp: f64,
pub ki: f64,
pub kd: f64,
pub n: f64,
pub integral_limit: f64,
pub out_min: f64,
pub out_max: f64,
pub integral: f64,
pub deriv_filter: f64,
pub prev_error: f64,
}Expand description
A PID controller with anti-windup, derivative filter, and output clamping.
Implements the parallel form:
u = Kp*e + Ki*integral(e) + Kd*derivative(e)
Anti-windup: integral is clamped to [-integral_limit, integral_limit].
Derivative filter: low-pass via N-pole (derivative filter coefficient).
Output clamping: output is clamped to [out_min, out_max].
Fields§
§kp: f64Proportional gain.
ki: f64Integral gain.
kd: f64Derivative gain.
n: f64Derivative filter coefficient (N = filter pole; larger = less filtering).
integral_limit: f64Maximum absolute value of the integral term (anti-windup limit).
out_min: f64Minimum output value.
out_max: f64Maximum output value.
integral: f64Accumulated integral state.
deriv_filter: f64Previous filtered derivative state.
prev_error: f64Previous error (for derivative computation).
Implementations§
Source§impl PidController
impl PidController
Trait Implementations§
Source§impl Clone for PidController
impl Clone for PidController
Source§fn clone(&self) -> PidController
fn clone(&self) -> PidController
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 PidController
impl RefUnwindSafe for PidController
impl Send for PidController
impl Sync for PidController
impl Unpin for PidController
impl UnsafeUnpin for PidController
impl UnwindSafe for PidController
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.