The construction of stable bridges in differential games with phase constraints |
| |
Affiliation: | 1. Cass Business School,City, University of London United Kingdom;2. DEAMS, University of Trieste Italy |
| |
Abstract: | A differential approach-and-evasion game in a finite time interval is considered [1]. It is assumed that the positions of the game are constricted by certain constraints which represent a closed set in the space of the positions. In the case of the first player, it is necessary to ensure that the phase point falls into the terminal set at a finite instant of time and, in the case of the second player, that this terminal set is evaded at this instant [1]. A method is proposed for the approximate construction of the positional absorption set, that is, the set of all positions belonging to a constraint from which the problem of approach facing the first player is solvable. Relations are written out which determine the system of sets which approximates the positional absorption set. The main result is a proof of the convergence of the approximate system of sets to the positional absorption set and the construction of a computational procedure for constructing the approximate system of sets. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|