Difference between revisions of "Category:Solution characterization"

From mintOC
Jump to: navigation, search
m (Initial setup of IMA paper text)
m (Text replacement - "\<bibref\>(.*)\<\/bibref\>" to "<bib id="$1" />")
Line 1: Line 1:
The classification that we propose for switching decisions is based on insight from Pontryagin's maximum principle <bibref>Pontryagin1962</bibref> applied here only to the relaxation of the binary control functions <math>\omega(\cdot)</math>, denoted by <math>\alpha(\cdot) \in [0,1]^{n_\omega}</math>. In the analysis of linear control problems one distinguishes three cases: bang-bang arcs, sensitivity-seeking arcs, and path-constrained arcs, <bibref>Srinivasan2003</bibref>, where an arc is defined to be a nonzero time-interval. Of course a problem's solution can show two or even all three behaviors at once on different time arcs.
+
The classification that we propose for switching decisions is based on insight from Pontryagin's maximum principle <bib id="Pontryagin1962" /> applied here only to the relaxation of the binary control functions <math>\omega(\cdot)</math>, denoted by <math>\alpha(\cdot) \in [0,1]^{n_\omega}</math>. In the analysis of linear control problems one distinguishes three cases: bang-bang arcs, sensitivity-seeking arcs, and path-constrained arcs, <bib id="Srinivasan2003" />, where an arc is defined to be a nonzero time-interval. Of course a problem's solution can show two or even all three behaviors at once on different time arcs.
  
 
Additionally we characterize solutions, whenever chattering or sliding mode behavior occurs.
 
Additionally we characterize solutions, whenever chattering or sliding mode behavior occurs.

Revision as of 18:54, 20 January 2016

The classification that we propose for switching decisions is based on insight from Pontryagin's maximum principle [Pontryagin1962]Address: Chichester
Author: Pontryagin, L.S.; Boltyanski, V.G.; Gamkrelidze, R.V.; Miscenko, E.F.
Publisher: Wiley
Title: The Mathematical Theory of Optimal Processes
Year: 1962
Link to Google Scholar
applied here only to the relaxation of the binary control functions \omega(\cdot), denoted by \alpha(\cdot) \in [0,1]^{n_\omega}. In the analysis of linear control problems one distinguishes three cases: bang-bang arcs, sensitivity-seeking arcs, and path-constrained arcs, [Srinivasan2003]Author: Srinivasan, B.; Palanki, S.; Bonvin, D.
Journal: Computers \& Chemical Engineering
Pages: 1--26
Title: Dynamic Optimization of Batch Processes: I. Characterization of the Nominal Solution
Volume: 27
Year: 2003
Link to Google Scholar
, where an arc is defined to be a nonzero time-interval. Of course a problem's solution can show two or even all three behaviors at once on different time arcs.

Additionally we characterize solutions, whenever chattering or sliding mode behavior occurs.

References

<bibreferences/>

Subcategories

This category has the following 5 subcategories, out of 5 total.