User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse




Journal Article

Discrete supervisory control of hybrid systems based on l- complete approximations


Raisch,  J.
Systems and Control Theory, Max Planck Institute for Dynamics of Complex Technical Systems, Max Planck Society;

There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available

Moor, T., Raisch, J., & O'Young, S. (2002). Discrete supervisory control of hybrid systems based on l- complete approximations. Discrete Event Dynamic Systems, 12(1), 83-107. doi:10.1023/A:1013339920783.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0013-A0AF-C
The topic of this paper is the synthesis of discrete supervisory control for hybrid systems Sigma with discrete external signals. Such systems are in general neither l- complete nor can they be represented by finite state machines. Our solution to the control problem is as follows: we find the strongest l-complete approximation (abstraction) Sigma (l) for Sigma, represent it by a finite state machine, and investigate the control problem for the approximation. If a solution exists on the approximation level, we synthesize the maximally permissive supervisor for Sigma (l). We show that it also solves the control problem for the underlying hybrid system Sigma. If no solution exists, approximation accuracy can be increased by computing the strongest k-complete abstraction Sigma (k), k > l. The basic ideas regarding the approximation step are explained within the framework of Willems' behavioral systems theory. Implementation issues are treated in a state space framework, and the main results are interpreted from a traditional control engineering point of view. copyright 2002 Kluwer Academic Publishers [accessed 2014 April 1st]