Hybrid Control Laws From Convex Dynamic Programming

Sven Hedlund, Anders Rantzer

Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

143 Nedladdningar (Pure)

Sammanfattning

In a previous paper, we showed how classical ideas for dynamicprogramming in discrete networks can be adapted to hybrid systems. The approach is based on discretization of the continuous Bellman inequality which gives a lower bound on the optimal cost. The lower bound is maximized by linear programming to get an approximation of the optimal solution.In this paper, we apply ideas from infinite-dimensional convex analysis to get an inequality which is dual to the well known Bellman inequality. The result is a linear programming problem that gives an estimate of the approximation error in the previous numerical approaches.
Originalspråkengelska
Titel på värdpublikationProceedings of the 39th IEEE Conference on Decision and Control, 2000.
FörlagIEEE - Institute of Electrical and Electronics Engineers Inc.
Sidor472-477
Volym1
ISBN (tryckt)0-7803-6638-7
DOI
StatusPublished - 2000

Publikationsserier

Namn
Volym1

Ämnesklassifikation (UKÄ)

  • Reglerteknik

Fingeravtryck

Utforska forskningsämnen för ”Hybrid Control Laws From Convex Dynamic Programming”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här