×

zbMATH — the first resource for mathematics

A synthesis algorithm for hybrid systems. (English) Zbl 1132.93330
Artemov, Sergei N. (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2007, New York, NY, USA, June 4–7, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72732-3/pbk). Lecture Notes in Computer Science 4514, 254-268 (2007).
Summary: Hybrid systems are systems of continuous plants, subject to disturbances, interacting with sequential automata in a network. By the synthesis problem for hybrid systems we mean extracting a finite state digital controller automaton from the system equations, constraints, and cost function which define the hybrid system. This automaton senses system state, and on the basis of its state, changes state and issues a chattering control to the actuators to control the system with epsilon optimal control for a fixed epsilon in real time. We address this problem by extracting a local cost function for the control system which transforms the infinite-dimensional optimization problem into a finite-dimensional problem.
For the entire collection see [Zbl 1121.03005].
Reviewer: Reviewer (Berlin)
MSC:
93C30 Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems)
PDF BibTeX XML Cite
Full Text: DOI