We investigate, for constrained controlled systems with impulse, the subset of initial positions contained in a set K from which starts at least one run viable in K - the hybrid viability kernel - eventually until it reaches a given closed target in finite time - the hybrid capture basin. We define a constructive algorithm which approximates this set. The knowledge of this set is essential for control problem since it provides viable hybrid feed-backs and viable runs. We apply this method for approximating the Minimal Time-to-reach Function in the presence of both constraints and impulses. Two examples are presented, the first deals with a dynamical system revealing the complexity of the structure of hybrid kernels, the second deals with a Minimal Time problem with impulses.
CITATION STYLE
Saint-Pierre, P. (2002). Hybrid kernels and capture basins for impulse constrained systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2289, pp. 378–392). Springer Verlag. https://doi.org/10.1007/3-540-45873-5_30
Mendeley helps you to discover research relevant for your work.