Skip to main content

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

  • Conference paper
ICM Millennium Lectures on Games

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Basar, T., Olsder, G. J. (1982): Dynamic Noncooperative Game Theory. Acad. Press, N.Y.

    Google Scholar 

  2. Isakova, E. A., Logunova, G. V., Patsko, V. S. (1984): Stable Bridges Construction in Linear Differential Game with Fixed Final Time. In: Subbotin, A. I., Patsko, V. S. (Eds.): Algorithms and Programs for Linear Differential Games Solutions. Ural Sci. Center of Acad. Sci. of USSR, Sverdlovsk, 127–158 (in Russian)

    Google Scholar 

  3. Kleimenov, A. F. (1993): Positional Differential Nonantagonistic Games. Nauka, Urals Brunch, Ekaterinburg (in Russian)

    Google Scholar 

  4. Krasovskii, A. N., Krasovskii, N. N. (1995): Control under Lack of Information. Birkhäuser, Berlin

    Google Scholar 

  5. Krasovskii, N. N., Subbotin, A. I. (1988): Game-Theoretical Control Problems. Springer—Verlag, N. Y.

    Google Scholar 

  6. Osipov, S. I. (1989): A Minkowski Sum Algorithm for Non-Convex Connected and Convex Polygons. In: Problems of Theoretical and Applied Mathematics. Ural Sci. Center of Acad. Sci. of USSR, Sverdlovsk, 11–12 (in Russian)

    Google Scholar 

  7. Vahrushev, V. A., Tarasiev, A. M., Ushakov, V. N. (1987): An Algorithm of Union and Intersection of Sets in Plane. In: Subbotin, A. I., Ushakov, V. N. (Eds.): Control with Guaranteed Result. Ural Sci. Center of Acad. Sci. of USSR, Sverdlovsk, 28–36 (in Russian)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Osipov, S., Kleimenov, A. (2003). Computation of Stackelberg Trajectories in a Class of Linear Differential Games on Plane. In: Petrosyan, L.A., Yeung, D.W.K. (eds) ICM Millennium Lectures on Games. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05219-8_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-05219-8_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05618-5

  • Online ISBN: 978-3-662-05219-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics