Standard

Computation of Stackelberg trajectories in a class of two-person linear differential games with terminal players' payoffs and polygonal constrainings for controls. / Osipov, S.; Kleimenov, A.
IFAC Workshop Series: book. Vol. 36 8. ed. Elsevier, 2003. p. 191-195 (CONTROL APPLICATIONS OF OPTIMISATION 2003).

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 two-person linear differential games with terminal players' payoffs and polygonal constrainings for controls. in IFAC Workshop Series: book. 8 edn, vol. 36, CONTROL APPLICATIONS OF OPTIMISATION 2003, Elsevier, pp. 191-195.

APA

Osipov, S., & Kleimenov, A. (2003). Computation of Stackelberg trajectories in a class of two-person linear differential games with terminal players' payoffs and polygonal constrainings for controls. In IFAC Workshop Series: book (8 ed., Vol. 36, pp. 191-195). (CONTROL APPLICATIONS OF OPTIMISATION 2003). Elsevier.

Vancouver

Osipov S, Kleimenov A. Computation of Stackelberg trajectories in a class of two-person linear differential games with terminal players' payoffs and polygonal constrainings for controls. In IFAC Workshop Series: book. 8 ed. Vol. 36. Elsevier. 2003. p. 191-195. (CONTROL APPLICATIONS OF OPTIMISATION 2003).

Author

Osipov, S. ; Kleimenov, A. / Computation of Stackelberg trajectories in a class of two-person linear differential games with terminal players' payoffs and polygonal constrainings for controls. IFAC Workshop Series: book. Vol. 36 8. ed. Elsevier, 2003. pp. 191-195 (CONTROL APPLICATIONS OF OPTIMISATION 2003).

BibTeX

@inproceedings{1b03eba489f449c98fd80f1da5948efb,
title = "Computation of Stackelberg trajectories in a class of two-person linear differential games with terminal players' payoffs and polygonal constrainings for controls",
abstract = "The report suggests a numerical method for constructing Stackelberg trajectories in a linear two-person n-dimensional differential game with terminal payoffs of players and polygonal constrainings for controls. Formalization of players' strategies in the game is based on formalization and the results of positional antagonistic differential games theory, developed by N. N. Krasovskii and his scientific school. The game is reduced to a game on the plane and the problem is transformed to solving 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 = "0-08-044074-6",
volume = "36",
series = "CONTROL APPLICATIONS OF OPTIMISATION 2003",
publisher = "Elsevier",
pages = "191--195",
booktitle = "IFAC Workshop Series",
address = "Netherlands",
edition = "8",

}

RIS

TY - GEN

T1 - Computation of Stackelberg trajectories in a class of two-person linear differential games with terminal players' payoffs and polygonal constrainings for controls

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 terminal payoffs of players and polygonal constrainings for controls. Formalization of players' strategies in the game is based on formalization and the results of positional antagonistic differential games theory, developed by N. N. Krasovskii and his scientific school. The game is reduced to a game on the plane and the problem is transformed to solving 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 terminal payoffs of players and polygonal constrainings for controls. Formalization of players' strategies in the game is based on formalization and the results of positional antagonistic differential games theory, developed by N. N. Krasovskii and his scientific school. The game is reduced to a game on the plane and the problem is transformed to solving 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=000189430100032

UR - http://www.scopus.com/inward/record.url?partnerID=8YFLogxK&scp=85029319662

M3 - Conference contribution

SN - 0-08-044074-6

VL - 36

T3 - CONTROL APPLICATIONS OF OPTIMISATION 2003

SP - 191

EP - 195

BT - IFAC Workshop Series

PB - Elsevier

ER -

ID: 44819238