Skip to main content

FopdtModel

Struct FopdtModel 

Source
pub struct FopdtModel<T> { /* private fields */ }
Expand description

First-Order Plus Dead Time (FOPDT) process model.

Models a process as:

G(s) = K · e^(-Ls) / (τs + 1)

where K is the static gain, τ is the time constant, and L is the dead time (transport delay).

§Example

use numeris::control::FopdtModel;

let model = FopdtModel::new(2.5_f64, 3.0, 0.5).unwrap();
assert_eq!(model.gain(), 2.5);
assert_eq!(model.tau(), 3.0);
assert_eq!(model.delay(), 0.5);

Implementations§

Source§

impl<T: FloatScalar> FopdtModel<T>

Source

pub fn new(gain: T, tau: T, delay: T) -> Result<Self, ControlError>

Create a new FOPDT model.

§Parameters
  • gain: static process gain K (non-zero, finite)
  • tau: time constant τ (positive, finite)
  • delay: dead time L (non-negative, finite)
§Errors

Returns ControlError::InvalidFrequency if parameters are out of range.

Source

pub fn gain(&self) -> T

Static process gain K.

Source

pub fn tau(&self) -> T

Time constant τ.

Source

pub fn delay(&self) -> T

Dead time (transport delay) L.

Source

pub fn ziegler_nichols(&self) -> PidGains<T>

Ziegler-Nichols open-loop tuning (reaction curve method).

Based on the process reaction curve (step response). Gives aggressive tuning with ~25% overshoot.

§Panics

Panics if L == 0 (Ziegler-Nichols requires non-zero dead time).

§Example
use numeris::control::FopdtModel;

let model = FopdtModel::new(1.0_f64, 1.0, 0.2).unwrap();
let gains = model.ziegler_nichols();
// Kp = 1.2·τ/(K·L), Ti = 2L, Td = L/2
assert!((gains.kp - 6.0).abs() < 1e-10);
Source

pub fn cohen_coon(&self) -> PidGains<T>

Cohen-Coon tuning rule.

Better than Ziegler-Nichols for processes with large dead time (L/τ > 0.5). Targets quarter-decay ratio.

§Panics

Panics if L == 0.

§Example
use numeris::control::FopdtModel;

let model = FopdtModel::new(1.0_f64, 1.0, 0.5).unwrap();
let gains = model.cohen_coon();
assert!(gains.kp > 0.0);
assert!(gains.ki > 0.0);
assert!(gains.kd > 0.0);
Source

pub fn simc(&self, tau_c: T) -> PidGains<T>

SIMC (Skogestad Internal Model Control) tuning rule.

Provides a good balance between performance and robustness. The tau_c parameter controls the closed-loop time constant: larger values give more conservative (robust) tuning.

A common starting point is tau_c = L (aggressive) or tau_c = τ (conservative).

§Parameters
  • tau_c: desired closed-loop time constant (positive)
§Panics

Panics if tau_c <= 0.

§Example
use numeris::control::FopdtModel;

let model = FopdtModel::new(1.0_f64, 2.0, 0.3).unwrap();
let gains = model.simc(0.3); // tau_c = L (aggressive)
assert!(gains.kp > 0.0);

Trait Implementations§

Source§

impl<T: Clone> Clone for FopdtModel<T>

Source§

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

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl<T: Debug> Debug for FopdtModel<T>

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<T: Copy> Copy for FopdtModel<T>

Auto Trait Implementations§

§

impl<T> Freeze for FopdtModel<T>
where T: Freeze,

§

impl<T> RefUnwindSafe for FopdtModel<T>
where T: RefUnwindSafe,

§

impl<T> Send for FopdtModel<T>
where T: Send,

§

impl<T> Sync for FopdtModel<T>
where T: Sync,

§

impl<T> Unpin for FopdtModel<T>
where T: Unpin,

§

impl<T> UnsafeUnpin for FopdtModel<T>
where T: UnsafeUnpin,

§

impl<T> UnwindSafe for FopdtModel<T>
where T: UnwindSafe,

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.