Struct Pid 

pub struct Pid<T> {
    pub order: Order,
    pub gain: Gains<T>,
    pub limit: Gains<T>,
    pub setpoint: T,
    pub min: T,
    pub max: T,
}

PID Controller parameters

Fields

order: Order

Feedback term order

gain: Gains<T>

Gain

• Sequence: [I², I, P, D, D²]
• Units: output/intput * second**order where Action::I2 has order=-2
• Gains outside the range order..=order + 3 are ignored
• P gain sign determines sign of all gains

limit: Gains<T>

Gain imit

• Sequence: [I², I, P, D, D²]
• Units: output/intput
• P gain limit is ignored
• Limits outside the range order..order + 3 are ignored
• P gain sign determines sign of all gain limits

setpoint: T

Setpoint

Units: input

min: T

Output lower limit

Units: output

max: T

Output upper limit

Units: output

Trait Implementations

impl<T, Y, C> Build<BiquadClamp<C, Y>> for Pid<T>

where Y: 'static + Copy + Mul<C, Output = Y> + Div<C, Output = Y>, C: Add<Output = C> + Copy, T: AsPrimitive<Y> + Float, BiquadClamp<C, Y>: From<[C; 5]>, Builder<T>: Build<[C; 5], Context = T>,

fn build(&self, units: &Units<T>) -> BiquadClamp<C, Y>

Return the Biquad

Builder intermediate type I, coefficient type C

type Context = Units<T>

The context of the convesion.

impl<T: Clone> Clone for Pid<T>

fn clone(&self) -> Pid<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug> Debug for Pid<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: Float + Default> Default for Pid<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> TreeAny for Pid<T>

where Gains<T>: TreeAny, T: TreeAny,

fn ref_any_by_key(&self, keys: impl Keys) -> Result<&dyn Any, ValueError>

Obtain a reference to a dyn Any trait object for a leaf node.

fn mut_any_by_key( &mut self, keys: impl Keys, ) -> Result<&mut dyn Any, ValueError>

Obtain a mutable reference to a dyn Any trait object for a leaf node.

fn ref_by_key<T>(&self, keys: impl IntoKeys) -> Result<&T, ValueError>

where T: Any,

Obtain a reference to a leaf of known type by key.

fn mut_by_key<T>(&mut self, keys: impl IntoKeys) -> Result<&mut T, ValueError>

where T: Any,

Obtain a mutable reference to a leaf of known type by key.

impl<'de, T> TreeDeserialize<'de> for Pid<T>

where Gains<T>: TreeDeserialize<'de>, T: TreeDeserialize<'de>,

fn deserialize_by_key<D: Deserializer<'de>>( &mut self, keys: impl Keys, de: D, ) -> Result<(), SerdeError<D::Error>>

Deserialize a leaf node by its keys.

fn probe_by_key<D: Deserializer<'de>>( keys: impl Keys, de: D, ) -> Result<(), SerdeError<D::Error>>

Blind deserialize a leaf node by its keys.

impl<T> TreeSchema for Pid<T>

where Gains<T>: TreeSchema, T: TreeSchema,

const SCHEMA: &'static Schema

Schema for this tree level

fn nodes<N, const D: usize>() -> ExactSize<NodeIter<N, D>>

Return an exact size iterator of all leaf nodes

impl<T> TreeSerialize for Pid<T>

where Gains<T>: TreeSerialize, T: TreeSerialize,

fn serialize_by_key<S: Serializer>( &self, keys: impl Keys, ser: S, ) -> Result<S::Ok, SerdeError<S::Error>>

Serialize a node by keys.