Jump to content

Rao Mease: Difference between revisions

From mintOC
No edit summary
No edit summary
Line 7: Line 7:
The '''Rao Mease problem''' is a very sensitive one-dimensional toy [[:Category:ODE model|ODE model]] which is especially suited for multiple shooting solvers. It aims to minimize a quadratic Lagrange term.
The '''Rao Mease problem''' is a very sensitive one-dimensional toy [[:Category:ODE model|ODE model]] which is especially suited for multiple shooting solvers. It aims to minimize a quadratic Lagrange term.


The optimal integer control functions exhibits a [[:Category:Sensitivity-seeking arcs|singular arc]].
The optimal control function exhibits a [[:Category:Sensitivity-seeking arcs|singular arc]].


== Mathematical formulation ==
== Mathematical formulation ==

Revision as of 13:16, 21 August 2025

Rao Mease
State dimension: 1
Differential states: 1
Discrete control functions: 1


The Rao Mease problem is a very sensitive one-dimensional toy ODE model which is especially suited for multiple shooting solvers. It aims to minimize a quadratic Lagrange term.

The optimal control function exhibits a singular arc.

Mathematical formulation

minx,w010(x(t)2+w(t)2)dtsubject tox˙(t)=x(t)3+w(t),x(0)=1,x(10)=1.5

Reference Solutions

Here is one local solution to the above control problem.

Miscellaneous and Further Reading

The problem description and further references can be found in the PhD thesis of Michael Ernst Geiger [1].

References

[1] "Adaptive Multiple Shooting for Boundary Value Problems and Constrained Parabolic Optimization Problems" by M. E. Geiger