Standard

Computation of Stackelberg trajectories in a class of linear differential games on plane: book chapter. / Osipov, S.; Kleimenov, A.
ICM MILLENNIUM LECTURES ON GAMES: book. ed. / Leon A. Petrosyan. Heidelberg: Springer, Berlin, Heidelberg, 2003. p. 391-396.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Harvard

Osipov, S & Kleimenov, A 2003, Computation of Stackelberg trajectories in a class of linear differential games on plane: book chapter. in LA Petrosyan (ed.), ICM MILLENNIUM LECTURES ON GAMES: book. Springer, Berlin, Heidelberg, Heidelberg, pp. 391-396.

APA

Osipov, S., & Kleimenov, A. (2003). Computation of Stackelberg trajectories in a class of linear differential games on plane: book chapter. In L. A. Petrosyan (Ed.), ICM MILLENNIUM LECTURES ON GAMES: book (pp. 391-396). Springer, Berlin, Heidelberg.

Vancouver

Osipov S, Kleimenov A. Computation of Stackelberg trajectories in a class of linear differential games on plane: book chapter. In Petrosyan LA, editor, ICM MILLENNIUM LECTURES ON GAMES: book. Heidelberg: Springer, Berlin, Heidelberg. 2003. p. 391-396

Author

Osipov, S. ; Kleimenov, A. / Computation of Stackelberg trajectories in a class of linear differential games on plane : book chapter. ICM MILLENNIUM LECTURES ON GAMES: book. editor / Leon A. Petrosyan. Heidelberg : Springer, Berlin, Heidelberg, 2003. pp. 391-396

BibTeX

@inproceedings{f7339ae1bca24ca6aac23141a7d38658,
title = "Computation of Stackelberg trajectories in a class of linear differential games on plane: book chapter",
abstract = "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.",
author = "S. Osipov and A. Kleimenov",
year = "2003",
language = "English",
isbn = "978-3-540-00615-2",
pages = "391--396",
editor = "Petrosyan, {Leon A.}",
booktitle = "ICM MILLENNIUM LECTURES ON GAMES",
publisher = "Springer, Berlin, Heidelberg",
address = "Germany",

}

RIS

TY - GEN

T1 - Computation of Stackelberg trajectories in a class of linear differential games on plane

T2 - book chapter

AU - Osipov, S.

AU - Kleimenov, A.

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

UR - https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=tsmetrics&SrcApp=tsm_test&DestApp=WOS_CPL&DestLinkType=FullRecord&KeyUT=000189346700025

M3 - Conference contribution

SN - 978-3-540-00615-2

SN - 978-3-662-05219-8

SP - 391

EP - 396

BT - ICM MILLENNIUM LECTURES ON GAMES

A2 - Petrosyan, Leon A.

PB - Springer, Berlin, Heidelberg

CY - Heidelberg

ER -

ID: 44803946