Computation of Solvability Set for Differential Games in the Plane with Simple Motion and Non-convex Terminal Set

Liudmila Kamneva ()
Additional contact information
Liudmila Kamneva: Krasovskii Institute of Mathematics and Mechanics

Dynamic Games and Applications, 2019, vol. 9, issue 3, No 9, 724-750

Abstract: Abstract The paper suggests an algorithm for an exact construction of solvability set in a differential game with simple motion in the plane, with a fixed terminal time and a polygonal (in the general case, non-convex) terminal set. Some examples of solvability sets are computed.

Keywords: Differential games with simple motion in the plane; Solvability set; Backward reachable set; Backward procedure (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13235-018-00292-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:dyngam:v:9:y:2019:i:3:d:10.1007_s13235-018-00292-x

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/13235

DOI: 10.1007/s13235-018-00292-x

Access Statistics for this article

Dynamic Games and Applications is currently edited by Georges Zaccour

More articles in Dynamic Games and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().