Computation of Stackelberg Trajectories in a Class of Linear Differential Games on Plane

Sergei Osipov and Anatolii Kleimenov ()
Additional contact information
Sergei Osipov: Ural State University, Chair of Theoretical Mechanics
Anatolii Kleimenov: Inst. of Mathematics and Mechanics of RAS, Dynamical Systems Department

A chapter in ICM Millennium Lectures on Games, 2003, pp 391-396 from Springer

Abstract: Summary The report suggests a numerical method for constructing Stackelberg trajectories in a linear two-person n-dimensional differential game with special terminal payoffs for players. The game is reduced to a game on the plane and the problem is transformed into a non-standard optimal control problem. For the approximation of the trajectories sets for this problem a set of computational geometry algorithms in plane is used, including convex hull construction, union and intersection of polygons and a Minkowski sum for polygons.

Keywords: Optimal Trajectory; Differential Game; Convex Polygon; Admissible Trajectory; Stable Bridge (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:sprchp:978-3-662-05219-8_25

Ordering information: This item can be ordered from
http://www.springer.com/9783662052198

DOI: 10.1007/978-3-662-05219-8_25

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().