Connected and automated vehicle platoon formation control via differential games

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F22%3A10250156" target="_blank" >RIV/61989100:27240/22:10250156 - isvavai.cz</a>

Výsledek na webu

<a href="https://ietresearch.onlinelibrary.wiley.com/doi/10.1049/itr2.12260" target="_blank" >https://ietresearch.onlinelibrary.wiley.com/doi/10.1049/itr2.12260</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1049/itr2.12260" target="_blank" >10.1049/itr2.12260</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Connected and automated vehicle platoon formation control via differential games

Popis výsledku v původním jazyce

In this study, the connected and automated vehicles platooning problem is resolved under a differential game framework. Three information topologies are considered here. Firstly, the Predecessor-following topology is utilised where the vehicles control the distance with respect to the merely nearest predecessor via a sensor link-based information flow. Secondly, the Two-predecessor-following topology is exploited where each vehicle controls the distance with respect to the two nearest predecessors. In this topology, the second predecessor is communicated via a Vehicle-to-vehicle link. The individual trajectories of connected and automated vehicles under the Nash equilibrium are derived in closed-form for these two information topologies. Finally, general information topology is examined and the differential game is formulated in this context. In all these options, Pontryagin&apos;s principle is employed to investigate the existence and uniqueness of the Nash equilibrium and obtain its corresponding trajectories. In the general topology, we suppose numerical computation of eigenvalues and eigenvectors. Finally, the stability behaviour of the platoon for the Predecessor-following, Two-predecessor-following and general topologies are investigated. All these approaches represent promising and powerful analytical representations of the connected and automated vehicle platoons under the differential games. Simulation experiments have verified the efficiency of the proposed models and their solutions as well as their better results in comparison with the Model Predictive Control.

Název v anglickém jazyce

Connected and automated vehicle platoon formation control via differential games

Popis výsledku anglicky

In this study, the connected and automated vehicles platooning problem is resolved under a differential game framework. Three information topologies are considered here. Firstly, the Predecessor-following topology is utilised where the vehicles control the distance with respect to the merely nearest predecessor via a sensor link-based information flow. Secondly, the Two-predecessor-following topology is exploited where each vehicle controls the distance with respect to the two nearest predecessors. In this topology, the second predecessor is communicated via a Vehicle-to-vehicle link. The individual trajectories of connected and automated vehicles under the Nash equilibrium are derived in closed-form for these two information topologies. Finally, general information topology is examined and the differential game is formulated in this context. In all these options, Pontryagin&apos;s principle is employed to investigate the existence and uniqueness of the Nash equilibrium and obtain its corresponding trajectories. In the general topology, we suppose numerical computation of eigenvalues and eigenvectors. Finally, the stability behaviour of the platoon for the Predecessor-following, Two-predecessor-following and general topologies are investigated. All these approaches represent promising and powerful analytical representations of the connected and automated vehicle platoons under the differential games. Simulation experiments have verified the efficiency of the proposed models and their solutions as well as their better results in comparison with the Model Predictive Control.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10200 - Computer and information sciences

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2022

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

IET Intelligent Transport Systems

ISSN

1751-956X

e-ISSN

1751-9578

Svazek periodika

2022

Číslo periodika v rámci svazku

2022

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

15

Strana od-do

nestrankovano

Kód UT WoS článku

000841004700001

EID výsledku v databázi Scopus

—