By Topic

Applications of polytopic approximations of reachable sets to linear dynamic games and a class of nonlinear systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Inseok Hwang ; Dept. of Aeronaut. & Astronaut., Stanford Univ., CA, USA ; D. M. Stipanovic ; C. J. Tomlin

This paper presents applications of polytopic approximation methods for reachable set computations using dynamic optimization. The problem of computing exact reachable sets can be formulated in terms of Hamilton-Jacobi partial differential equation (PDE). Numerical solutions, which provide convergent approximations of this PDE, have computational complexity, which is exponential in the continuous variable dimension. Using dynamic optimization and polytopic approximation, computationally efficient algorithms for overapproximative reachability analysis have been developed for linear dynamical systems by P. Varaiya (1998). In this paper, we show that these can be extended to feedback linearizable nonlinear systems, linear dynamic games, and norm-bounded nonlinear systems. Three illustrative examples are presented.

Published in:

American Control Conference, 2003. Proceedings of the 2003  (Volume:6 )

Date of Conference:

4-6 June 2003