Premium
Constructing Robust Feedback Laws by Set Oriented Numerical Methods
Author(s) -
Grüne Lars,
Junge Oliver
Publication year - 2005
Publication title -
pamm
Language(s) - English
Resource type - Journals
ISSN - 1617-7061
DOI - 10.1002/pamm.200510059
Subject(s) - discretization , mathematics , piecewise , shortest path problem , mathematical proof , computation , hypergraph , directed graph , mathematical optimization , bellman equation , graph , computer science , algorithm , discrete mathematics , mathematical analysis , geometry
Abstract In [8, 6] a numerical method for the construction of optimally stabilizing feedback laws was proposed. The method is based on a set oriented discretization of phase space in combination with graph theoretic algorithms for the computation of shortest paths in directed weighted graphs. The resulting approximate optimal value function is piecewise constant, yielding an approximate optimal feedback which might not be robust with respect to perturbations of the system. In this contribution we extend the approach to the case of perturbed control systems. Based on the concept of a multivalued game we show how to derive a directed weighted hypergraph from the original system and generalize the corresponding shortest path algorithm. The resulting optimal value function yields a robustly stabilizing approximate optimal feedback law. This note is an abbreviated version of [5]. For the proofs of the statements here we refer to the full paper. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)