MpcQp

it.grypho.scala.leonardo.control.MpcQp
final case class MpcQp(h: _MatrixValue, f: Vector[Double], ineq: Option[(_MatrixValue, Vector[Double])], lb: Vector[Double], ub: Vector[Double], m: Int, nc: Int, incremental: Boolean, uPrev: Vector[Double])

The condensed MPC quadratic programme min ½ zᵀHz + fᵀz under A z ≤ b and lb ≤ z ≤ ub, ready for optimize.qpSolve (F_0299), with z the Nc·m moves followed by the slacks.

Value parameters

f

the linear term

h

the Hessian, 2(GᵀQ̄G + R̄) with the slacks' 2ρ₂ on the diagonal

incremental

whether z holds increments

ineq

the inequality rows, or None

lb

lower bounds of z

m

inputs per move

nc

the control horizon

uPrev

u(k−1)

ub

upper bounds of z

Attributes

Graph
Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
Show all

Members list

Value members

Concrete methods

def solve(warm: Set[QpConstraint], env: Environment): Either[MpcFailure, MpcSolution]

Solves the programme and maps the optimum back to the moves (F_0299).

Solves the programme and maps the optimum back to the moves (F_0299).

Value parameters

env

the precision the certificate holds and the QP budgets

warm

the previous step's active set, or empty

Attributes

Returns

the step, or why the QP declined

Inherited methods

def productElementNames: Iterator[String]

Attributes

Inherited from:
Product
def productIterator: Iterator[Any]

Attributes

Inherited from:
Product