Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Institutional reposi...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
IFAC Proceedings Volumes
Article . 2009 . Peer-reviewed
License: Elsevier TDM
Data sources: Crossref
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
https://doi.org/10.1007/978-90...
Part of book or chapter of book . 2009 . Peer-reviewed
License: Springer Nature TDM
Data sources: Crossref
versions View all 3 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

A Numerical Construction Algorithm of Nash and Stackelberg Solutions for Two-person Non-zero Sum Linear Positional Differential Games

Authors: Kleimenov, A. F.; Osipov, S. I.; Kuvshinov, D. R.;

A Numerical Construction Algorithm of Nash and Stackelberg Solutions for Two-person Non-zero Sum Linear Positional Differential Games

Abstract

The report proposes a numerical method of Stackelberg and Nash solutions construction in a class of differential games. It is based upon results of the positional antagonistic differential games theory developed by N. N. Krasovskii and his scientific school. The method transforms a non-antagonistic game into socalled non-standard optimal control problem. Numerical solutions for Stackelberg games are constructed by an algorithm developed by S. Osipov. For Nash solution construction we build auxiliary bimatrix games sequence. Both algorithms make use of known antagonistic game value computation procedures and are ultimately based upon computational geometry algorithms including convex hull construction, union, intersection, and Minkowski sum of flat polygons. Results of numerical experiment for a material point motion in plane are presented. The point is moved by force formed by two players. Each player has his personal target point. Among the obtained results, there is a Nash solution such, that along the corresponding trajectory the position of the game is non-antagonistic at first, and then becomes globally antagonistic starting from some moment of time.

Keywords

OPTIMAL CONTROL SYSTEMS, OPTIMAL CONTROL PROBLEM, ALGORITHMS, COMPUTATION THEORY, CONSTRUCTION ALGORITHMS, NASH GAMES, INTERSECTION OF POLYGONS, STACKELBERG GAMES, DIFFRENTIAL GAMES, COMPUTER GAMES, COMPUTING, COMPUTATIONAL GEOMETRY, TRAJECTORIES, COMPUTATIONAL GEOMETRY ALGORITHMS

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
Green