Numerical solution of the game of two cars with a neurosimulator and grid computing

Publikation: Beitrag in Buch/Bericht/Sammelwerk/KonferenzbandBeitrag in Buch/SammelwerkForschungPeer-Review

Autoren

Organisationseinheiten

Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Titel des SammelwerksAnnals of the International Society of Dynamic Games
Herausgeber (Verlag)Birkhauser Boston
Seiten207-230
Seitenumfang24
PublikationsstatusVeröffentlicht - 2009

Publikationsreihe

NameAnnals of the International Society of Dynamic Games
Band10
ISSN (Print)2474-0179
ISSN (elektronisch)2474-0187

Abstract

The famous game of two cars is a pursuit-evasion dynamic game. In the extended version presented here, a correct driver (evader) on a freeway detects a wrong-way driver (pursuer in a worst case scenario), i.e., a car driving on the wrong lanes of the road or in the wrong direction. The correct driver must try to avoid collision against all possible maneuvers of the wrong-way driver. Additionally, he must try to stay on the freeway lanes. Analytically, the game is not fully solvable. The state-space is cut by various singular manifolds, e.g., barriers, universal, and dispersal manifolds. Here, discretized Stackelberg games are solved numerically for many positions in the state-space. The resulting trajectories and their adherent information are used to synthesize optimal strategies with artificial neural networks. These networks learn the optimal turn rates and optimal velocity change rates. The networks are trained with the high-end neurosimulator FAUN (Fast Approximation with Universal Neural Networks). A grid computing implementation is used which allows significantly shorter computing times. This implementation runs on low-budget, idle PC clusters and moreover power saving allows to wake up and shut down computers automatically. Parallelization on cheap hardware is one of the key benefits of the presented approach as it leads to fast but nonetheless good results. The computed artificial neural networks approximate the Stackelberg strategies accurately. The approach presented here is applicable to many other complex dynamic games which are not (fully) solvable analytically.

ASJC Scopus Sachgebiete

Zitieren

Numerical solution of the game of two cars with a neurosimulator and grid computing. / Breitner, Michael H.; von Mettenheim, Hans Jörg.
Annals of the International Society of Dynamic Games. Birkhauser Boston, 2009. S. 207-230 (Annals of the International Society of Dynamic Games; Band 10).

Publikation: Beitrag in Buch/Bericht/Sammelwerk/KonferenzbandBeitrag in Buch/SammelwerkForschungPeer-Review

Breitner, MH & von Mettenheim, HJ 2009, Numerical solution of the game of two cars with a neurosimulator and grid computing. in Annals of the International Society of Dynamic Games. Annals of the International Society of Dynamic Games, Bd. 10, Birkhauser Boston, S. 207-230. https://doi.org/10.1007/978-0-8176-4834-3_12
Breitner, M. H., & von Mettenheim, H. J. (2009). Numerical solution of the game of two cars with a neurosimulator and grid computing. In Annals of the International Society of Dynamic Games (S. 207-230). (Annals of the International Society of Dynamic Games; Band 10). Birkhauser Boston. https://doi.org/10.1007/978-0-8176-4834-3_12
Breitner MH, von Mettenheim HJ. Numerical solution of the game of two cars with a neurosimulator and grid computing. in Annals of the International Society of Dynamic Games. Birkhauser Boston. 2009. S. 207-230. (Annals of the International Society of Dynamic Games). doi: 10.1007/978-0-8176-4834-3_12
Breitner, Michael H. ; von Mettenheim, Hans Jörg. / Numerical solution of the game of two cars with a neurosimulator and grid computing. Annals of the International Society of Dynamic Games. Birkhauser Boston, 2009. S. 207-230 (Annals of the International Society of Dynamic Games).
Download
@inbook{e3a1ef13254e4923a7b99cf3d456983b,
title = "Numerical solution of the game of two cars with a neurosimulator and grid computing",
abstract = "The famous game of two cars is a pursuit-evasion dynamic game. In the extended version presented here, a correct driver (evader) on a freeway detects a wrong-way driver (pursuer in a worst case scenario), i.e., a car driving on the wrong lanes of the road or in the wrong direction. The correct driver must try to avoid collision against all possible maneuvers of the wrong-way driver. Additionally, he must try to stay on the freeway lanes. Analytically, the game is not fully solvable. The state-space is cut by various singular manifolds, e.g., barriers, universal, and dispersal manifolds. Here, discretized Stackelberg games are solved numerically for many positions in the state-space. The resulting trajectories and their adherent information are used to synthesize optimal strategies with artificial neural networks. These networks learn the optimal turn rates and optimal velocity change rates. The networks are trained with the high-end neurosimulator FAUN (Fast Approximation with Universal Neural Networks). A grid computing implementation is used which allows significantly shorter computing times. This implementation runs on low-budget, idle PC clusters and moreover power saving allows to wake up and shut down computers automatically. Parallelization on cheap hardware is one of the key benefits of the presented approach as it leads to fast but nonetheless good results. The computed artificial neural networks approximate the Stackelberg strategies accurately. The approach presented here is applicable to many other complex dynamic games which are not (fully) solvable analytically.",
keywords = "Artificial neural networks, Dynamic game, Game of two cars, Grid computing, Parallel computation, Stackelberg game, Synthesis of optimal strategies",
author = "Breitner, {Michael H.} and {von Mettenheim}, {Hans J{\"o}rg}",
note = "Publisher Copyright: {\textcopyright} Birkh{\"a}user Boston, a part of Springer Science + Business Media, LLC 2009. Copyright: Copyright 2018 Elsevier B.V., All rights reserved.",
year = "2009",
doi = "10.1007/978-0-8176-4834-3_12",
language = "English",
series = "Annals of the International Society of Dynamic Games",
publisher = "Birkhauser Boston",
pages = "207--230",
booktitle = "Annals of the International Society of Dynamic Games",
address = "United States",

}

Download

TY - CHAP

T1 - Numerical solution of the game of two cars with a neurosimulator and grid computing

AU - Breitner, Michael H.

AU - von Mettenheim, Hans Jörg

N1 - Publisher Copyright: © Birkhäuser Boston, a part of Springer Science + Business Media, LLC 2009. Copyright: Copyright 2018 Elsevier B.V., All rights reserved.

PY - 2009

Y1 - 2009

N2 - The famous game of two cars is a pursuit-evasion dynamic game. In the extended version presented here, a correct driver (evader) on a freeway detects a wrong-way driver (pursuer in a worst case scenario), i.e., a car driving on the wrong lanes of the road or in the wrong direction. The correct driver must try to avoid collision against all possible maneuvers of the wrong-way driver. Additionally, he must try to stay on the freeway lanes. Analytically, the game is not fully solvable. The state-space is cut by various singular manifolds, e.g., barriers, universal, and dispersal manifolds. Here, discretized Stackelberg games are solved numerically for many positions in the state-space. The resulting trajectories and their adherent information are used to synthesize optimal strategies with artificial neural networks. These networks learn the optimal turn rates and optimal velocity change rates. The networks are trained with the high-end neurosimulator FAUN (Fast Approximation with Universal Neural Networks). A grid computing implementation is used which allows significantly shorter computing times. This implementation runs on low-budget, idle PC clusters and moreover power saving allows to wake up and shut down computers automatically. Parallelization on cheap hardware is one of the key benefits of the presented approach as it leads to fast but nonetheless good results. The computed artificial neural networks approximate the Stackelberg strategies accurately. The approach presented here is applicable to many other complex dynamic games which are not (fully) solvable analytically.

AB - The famous game of two cars is a pursuit-evasion dynamic game. In the extended version presented here, a correct driver (evader) on a freeway detects a wrong-way driver (pursuer in a worst case scenario), i.e., a car driving on the wrong lanes of the road or in the wrong direction. The correct driver must try to avoid collision against all possible maneuvers of the wrong-way driver. Additionally, he must try to stay on the freeway lanes. Analytically, the game is not fully solvable. The state-space is cut by various singular manifolds, e.g., barriers, universal, and dispersal manifolds. Here, discretized Stackelberg games are solved numerically for many positions in the state-space. The resulting trajectories and their adherent information are used to synthesize optimal strategies with artificial neural networks. These networks learn the optimal turn rates and optimal velocity change rates. The networks are trained with the high-end neurosimulator FAUN (Fast Approximation with Universal Neural Networks). A grid computing implementation is used which allows significantly shorter computing times. This implementation runs on low-budget, idle PC clusters and moreover power saving allows to wake up and shut down computers automatically. Parallelization on cheap hardware is one of the key benefits of the presented approach as it leads to fast but nonetheless good results. The computed artificial neural networks approximate the Stackelberg strategies accurately. The approach presented here is applicable to many other complex dynamic games which are not (fully) solvable analytically.

KW - Artificial neural networks

KW - Dynamic game

KW - Game of two cars

KW - Grid computing

KW - Parallel computation

KW - Stackelberg game

KW - Synthesis of optimal strategies

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

U2 - 10.1007/978-0-8176-4834-3_12

DO - 10.1007/978-0-8176-4834-3_12

M3 - Contribution to book/anthology

AN - SCOPUS:84865202657

T3 - Annals of the International Society of Dynamic Games

SP - 207

EP - 230

BT - Annals of the International Society of Dynamic Games

PB - Birkhauser Boston

ER -

Von denselben Autoren