By Topic

Semidecidable controller synthesis for classes of linear hybrid 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)
O. Shakernia ; Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA ; G. J. Pappas ; S. Sastry

A problem of great interest in the control of hybrid systems is the design of least restrictive controllers for reachability specifications. Controller design typically uses game theoretic methods to compute the region of the state space for which there exists a control such that for all disturbances, an unsafe set is not reached. In general, the computation of the controllers requires the steady state solution of a Hamilton-Jacobi partial differential equation which is very difficult to compute, if it exists. We show that for special classes of hybrid systems where the continuous vector fields are linear, the controller synthesis problem is semidecidable: there exists a computational algorithm which, if it terminates in a finite number of steps, will exactly compute the least restrictive controller. This result is achieved by a very interesting interaction of results from mathematical logic and optimal control

Published in:

Decision and Control, 2000. Proceedings of the 39th IEEE Conference on  (Volume:2 )

Date of Conference:

2000