Open AccessArticle
Numerical Construction of Viable Sets for Autonomous Conflict Control Systems
Received: 29 December 2013 / Revised: 6 March 2014 / Accepted: 2 April 2014 / Published: 11 April 2014
Cited by 3 | PDF Full-text (255 KB) | HTML Full-text | XML Full-text
Abstract
A conflict control system with state constraints is under consideration. A method for finding viability kernels (the largest subsets of state constraints where the system can be confined) is proposed. The method is related to differential games theory essentially developed by N. N.
[...] Read more.
A conflict control system with state constraints is under consideration. A method for finding viability kernels (the largest subsets of state constraints where the system can be confined) is proposed. The method is related to differential games theory essentially developed by N. N. Krasovskii and A. I. Subbotin. The viability kernel is constructed as the limit of sets generated by a Pontryagin-like backward procedure. This method is implemented in the framework of a level set technique based on the computation of limiting viscosity solutions of an appropriate Hamilton–Jacobi equation. To fulfill this, the authors adapt their numerical methods formerly developed for solving time-dependent Hamilton–Jacobi equations arising from problems with state constraints. Examples of computing viability sets are given.
Full article
►▼
Figures