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

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.

Saved in:
Bibliographic Details
Published in:Dynamic games and applications 2019-09, Vol.9 (3), p.724-750
Main Author: Kamneva, Liudmila
Format: Article
Language:English
Subjects:
Algorithms
Communications Engineering
Computer Systems Organization and Communication Networks
Differential games
Economic Theory/Quantitative Economics/Mathematical Methods
Economics
Game Theory
Management Science
Mathematics
Mathematics and Statistics
Networks
Operations Research
Social and Behav. Sciences
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2153-0785
2153-0793
DOI:10.1007/s13235-018-00292-x