Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Hybrid Control Laws From Convex Dynamic Programming

In English

Författare

Summary, in English

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.

Publiceringsår

2000

Språk

Engelska

Sidor

472-477

Publikation/Tidskrift/Serie

Proceedings of the 39th IEEE Conference on Decision and Control, 2000.

Volym

1

Dokumenttyp

Konferensbidrag

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Control Engineering

Nyckelord

  • duality (mathematics)
  • discrete time systems
  • convex programming
  • dynamic programming
  • optimal control
  • linear programming

Status

Published

ISBN/ISSN/Övrigt

  • ISBN: 0-7803-6638-7