Skip to main navigation Skip to search Skip to main content

An efficient message dissemination scheme for cooperative drivings via multi-agent hierarchical attention reinforcement learning

  • Bingyi Liu
  • , Weizhen Han
  • , Enshu Wang
  • , Xin Ma
  • , Shengwu Xiong
  • , Chunming Qiao
  • , Jianping Wang
  • Wuhan University of Technology
  • SUNY Buffalo
  • University of Texas at Arlington
  • City University of Hong Kong

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

A group of connected and autonomous vehicles (CAVs) with common interests can drive in a cooperative manner, namely cooperative driving, which has been verified to significantly improve road safety, traffic efficiency, and environmental sustainability. A more general scenario with various types of cooperative driving applications such as truck platooning and vehicle clustering will coexist on roads in the foreseeable future. To support such multiple cooperative drivings, it is critical to design an efficient message dissemination scheduling for vehicles to broadcast their kinetic status, i.e., beacon periodically. Most ongoing researches suggest designing the communication protocols via traffic and communication modeling on top of dedicated short range communications (DSRC) or cellular-based vehicle-to-vehicle (C-V2V) communications as a potential remedy. However, most of the existing researches are designed for a simple or specific traffic scenario, e.g., ignoring the impacts of the complex communication environment and emerging hybrid traffic scenarios. Moreover, some studies design beaconing strategies based on the implication of channel and traffic conditions in the beacons of other vehicles. However, the delayed perception of these information may seriously deteriorate the beaconing performance. In this paper, we take the perspective of cooperative drivings and formulate their decision-making process as a Markov game. Furthermore, we propose a multi-agent hierarchical attention reinforcement learning (MAHA) framework to solve the Markov game. More concretely, the hierarchical structure of the proposed MAHA can lead cooperative drivings to be foresightful. Hence, even without immediate incentives, the well-trained agents can still take favorable actions that benefit their long-term rewards. Besides, we integrate each hierarchical level of MAHA separately with the graph attention network (GAT) to incorporate agents' mutual influences in the decision-making process. Besides, we set up a simulator and adopt this simulator to generate dynamic traffic scenarios, which reflect the different real-world scenarios faced by cooperative drivings. We conduct extensive experiments to evaluate the proposed MAHA framework's performance. The results show that MAHA can significantly improve the beacon reception rate and guarantee low communication delay in all of these scenarios.

Original languageEnglish
Title of host publicationProceedings - 2021 IEEE 41st International Conference on Distributed Computing Systems, ICDCS 2021
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages326-336
Number of pages11
ISBN (Electronic)9781665445139
DOIs
StatePublished - Jul 2021
Event41st IEEE International Conference on Distributed Computing Systems, ICDCS 2021 - Virtual, Online, United States
Duration: Jul 7 2021Jul 10 2021

Publication series

NameProceedings - International Conference on Distributed Computing Systems
Volume2021-July
ISSN (Print)1063-6927
ISSN (Electronic)2575-8411

Conference

Conference41st IEEE International Conference on Distributed Computing Systems, ICDCS 2021
Country/TerritoryUnited States
CityVirtual, Online
Period07/7/2107/10/21

Keywords

  • Cooperative Driving
  • Graph Attention Network
  • Hierarchical Reinforcement Learning
  • Multi-agent Reinforcement Learning

Fingerprint

Dive into the research topics of 'An efficient message dissemination scheme for cooperative drivings via multi-agent hierarchical attention reinforcement learning'. Together they form a unique fingerprint.

Cite this