View source for Category:Sensitivity-seeking arcs

We define sensitivity-seeking (also compromise-seeking) arcs in the sense of Srinivasan and Bonvin <bib id="Srinivasan2003" /> as arcs which are neither [[:Category:Bang bang|bang-bang]] nor [[:Category:Path-constrained arcs | path-constrained]] and for which the optimal control can be determined by time derivatives of the Hamiltonian. For control-affine systems this implies so-called ''singular arcs''.

A classical small-sized benchmark problem for a sensitivity-seeking (singular) arc is the [[Lotka Volterra fishing problem]]. The treatment of sensitivity-seeking arcs is very similar to the one of path-constrained arcs. As above, an approximation up to any a priori specified tolerance is possible, probably at the price of frequent switching. 

== References ==
<biblist />

[[Category:Solution characterization]]