Skip to main content

CoppObjective

Enum CoppObjective 

Source
pub enum CoppObjective<'a> {
    Time(f64),
    ThermalEnergy(f64, &'a [f64]),
    TotalVariationTorque(f64, &'a [f64]),
    Linear(f64, &'a [f64], &'a [f64]),
}
Expand description

Objective terms for COPP optimization. Continuous formulation is shared by COPP2/COPP3; discrete form depends on how b and torque are sampled. Torque notation:

  • continuous: $\boldsymbol{\tau}(s)$.
  • discrete: tau[i][k] for joint i at s[k].
  • COPP2: tau[i][k] is the right-limit value $\boldsymbol{\tau}(s_k^+)$, i.e. computed on interval $[s_k, s_{k+1}]$ from (a[k], a[k+1], b[k]).
  • COPP3: tau[i][k] is node value $\boldsymbol{\tau}(s_k)$, computed from (a[k], b[k]).

Variants§

§

Time(f64)

Time objective.

  • Continuous: $J_{\mathrm{time}} = w_t\int_{0}^{t_f} 1 \mathrm{d}t = w_t\int_{s_0}^{s_f} \frac{1}{\sqrt{a(s)}} \mathrm{d}s$.
  • Discrete (COPP2): J_time = 2*w_t*sum_{k=0}^{n-2} (s[k+1]-s[k])/(sqrt(a[k])+sqrt(a[k+1])).
  • Discrete (COPP3): J_time = w_t*sum_k weight_a_time[k]/sqrt(a[k])
§

ThermalEnergy(f64, &'a [f64])

Thermal-energy objective.

  • Continuous: $J_{\mathrm{th}} = w_e\int_{0}^{t_f} \sum_i(\tau_i(s)\nu_i)^2\mathrm{d}t = w_e\int_{s_0}^{s_f} \sum_i(\tau_i(s)\nu_i)^2\frac{1}{\sqrt{a(s)}}\mathrm{d}s$ where nu_i = normalize[i].
  • Discrete (COPP2): J_th = 2*w_e*sum_{k=0}^{n-2} (s[k+1]-s[k])/(sqrt(a[k])+sqrt(a[k+1])) * sum_i (tau[i][k]*normalize[i])^2.
  • Discrete (COPP3): J_th = w_e*sum_k weight_a_torque[k] * sum_i (tau[i][k]*normalize[i])^2.
§

TotalVariationTorque(f64, &'a [f64])

Total-variation of torque objective.

  • Continuous: $J_{\mathrm{tv}} = w_v\sum_i \int_{0}^{t_f} \left|\frac{d\tau_i}{\mathrm{d}s}(s)\right|\nu_i\mathrm{d}t = w_v\sum_i \int_{s_0}^{s_f} \left|\frac{d\tau_i}{\mathrm{d}s}(s)\right|\nu_i\mathrm{d}s$.
  • Discrete: J_tv = w_v*sum_i sum_k |tau[i][k+1]-tau[i][k]|*normalize[i]
§

Linear(f64, &'a [f64], &'a [f64])

Linear objective over a and b.

  • Continuous: $J_{\mathrm{lin}} = w_l\int_{s_0}^{s_f}(\alpha(s)a(s)+\beta(s)b(s))\mathrm{d}s$.
  • Discrete (COPP2):
    • alpha.len()==n, beta.len()==n-1
    • J_lin = w_l*( sum_{k=0}^{n-1} alpha[k]*a[k] + sum_{k=0}^{n-2} beta[k]*b[k] )
  • Discrete (COPP3):
    • alpha.len()==beta.len()==n
    • J_lin = w_l*sum_{k=0}^{n-1} (alpha[k]*a[k] + beta[k]*b[k])

Auto Trait Implementations§

§

impl<'a> Freeze for CoppObjective<'a>

§

impl<'a> RefUnwindSafe for CoppObjective<'a>

§

impl<'a> Send for CoppObjective<'a>

§

impl<'a> Sync for CoppObjective<'a>

§

impl<'a> Unpin for CoppObjective<'a>

§

impl<'a> UnwindSafe for CoppObjective<'a>

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> 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> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
§

impl<T> Pointable for T

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

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, 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.