MpcTerminal

it.grypho.scala.leonardo.control.MpcTerminal
final case class MpcTerminal(weight: _MatrixValue, prediction: MpcPredictionMatrices, target: Option[Vector[Double]] = ...)

The terminal cost of an MPC programme (F_0304, AIACE L_0007): ‖x(k+Np) − x_s‖²_P.

The stage cost already weighs y(k+Np), so the weight that completes the infinite-horizon (LQR) cost-to-go is P − CᵀQC with P from dare / dlqr, not P itself; with it an unconstrained MPC reproduces the LQR law u = −K·x exactly. P alone also stabilises, more conservatively.

Value parameters

prediction

the state prediction at the horizon's end, from mpcTerminalPrediction or mpcAccumulatedTerminalPrediction, in the same form (absolute, incremental or accumulated) as the output prediction

target

x_s, n entries; None for the origin

weight

P, n×n

Attributes

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

Members list

Value members

Inherited methods

def productElementNames: Iterator[String]

Attributes

Inherited from:
Product
def productIterator: Iterator[Any]

Attributes

Inherited from:
Product