Skip to main content

ImpedanceGains

Struct ImpedanceGains 

Source
pub struct ImpedanceGains {
    pub cartesian_stiffness: [f64; 6],
    pub cartesian_damping: [f64; 6],
    pub joint_stiffness: [f64; 7],
    pub joint_damping: [f64; 7],
}
Expand description

The stiffness and damping of the law, all finite and non-negative.

Fields§

§cartesian_stiffness: [f64; 6]

Kx, base frame, translation first: N/m, then Nm/rad.

§cartesian_damping: [f64; 6]

Kxd, base frame, translation first: N s/m, then Nm s/rad.

§joint_stiffness: [f64; 7]

Kq, per joint, Nm/rad.

§joint_damping: [f64; 7]

Kqd, per joint, Nm s/rad.

Implementations§

Source§

impl ImpedanceGains

Source

pub const CARTESIAN: ImpedanceGains

The default for a Cartesian target: DROID’s stiffness (a medium spring, 750 N/m) and soft joint springs that settle the redundancy, with the Cartesian damping raised to about a damping ratio of 0.8 from the arm’s apparent masses at the ready pose (0.94 kg along x and y, 3.9 kg along z; DROID’s 37 N s/m leaves z at 0.34 and ringing).

Source

pub const DROID: ImpedanceGains

DROID’s production gains as they are, the parity preset: with ImpedanceOptions::velocity_feedforward and ImpedanceOptions::project_joint_gains both false the law is polymetis’s HybridJointImpedanceControl, for replaying DROID-trained policies.

Source

pub const JOINT: ImpedanceGains

A joint PD for a joint target, the gains of examples/fer_joint_impedance.rs.

Source

pub fn scaled_cartesian(stiffness: f64) -> ImpedanceGains

CARTESIAN rescaled to a translational stiffness of stiffness N/m: the six stiffnesses in proportion, the six dampings with the square root of the same ratio, so every axis keeps the preset’s damping ratio. The joint gains are the preset’s, untouched.

This is the one place the rule lives. A Cartesian stiffness an operator can move is a single number, and the law needs twelve; anything that turns the one into the twelve — a node’s configuration, a live retune — calls this rather than restating it.

Source

pub fn validate(&self) -> FrankaResult<()>

§Errors

FrankaError::InvalidArgument if a gain is not finite or negative.

Trait Implementations§

Source§

impl Clone for ImpedanceGains

Source§

fn clone(&self) -> ImpedanceGains

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Copy for ImpedanceGains

Source§

impl Debug for ImpedanceGains

Source§

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

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

impl PartialEq for ImpedanceGains

Source§

fn eq(&self, other: &ImpedanceGains) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 (const: unstable) · Source§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl StructuralPartialEq for ImpedanceGains

Auto Trait Implementations§

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
§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

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.

§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> Scalar for T
where T: 'static + Clone + PartialEq + Debug,

§

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

§

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

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

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
§

fn to_subset_unchecked(&self) -> SS

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

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.