Abstract
Polygonal hybrid systems are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. Here, we study the problem of defining and constructing the phase portrait of such systems.We identify various important elements of it, suchas viability and controllability kernels, and propose an algorithm for computing them all. The algorithm is based on a geometric analysis of trajectories.
Cite
CITATION STYLE
Asarin, E., Schneider, G., & Yovine, S. (2002). Towards computing phase portraits of polygonal differential inclusions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2289, pp. 49–61). Springer Verlag. https://doi.org/10.1007/3-540-45873-5_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
