Cooperative Game-based Multi-Agent Path Planning with Obstacle Avoidance

Yaning Guo, Quan Pan, Qi Sun, Chunhui Zhao, Dong Wang, Min Feng

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

15 Scopus citations

Abstract

This paper investigates multi-agent cooperative path planning with obstacle avoidance based on game theory and multi-agent reinforcement learning algorithm. It aims to extend the traditional single agent Q-learning algorithm to multi-agent systems by using the cooperative game framework. This framework takes into account the selection of joint actions at joint states for multi-agent cooperative path planning with obstacle avoidance. First, a cooperative game model is presented for agents to achieve cooperative path planning with obstacle avoidance in complicated environment. Second, a multi-agent Q-learning algorithm in continuous state space is proposed for solving Nash equilibrium, where the local minimum problem is well resolved. Finally, a numerical example is conducted to verify the effectiveness of the proposed approach.

Original languageEnglish
Title of host publicationProceedings - 2019 IEEE 28th International Symposium on Industrial Electronics, ISIE 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1385-1390
Number of pages6
ISBN (Electronic)9781728136660
DOIs
StatePublished - Jun 2019
Event28th IEEE International Symposium on Industrial Electronics, ISIE 2019 - Vancouver, Canada
Duration: 12 Jun 201914 Jun 2019

Publication series

NameIEEE International Symposium on Industrial Electronics
Volume2019-June

Conference

Conference28th IEEE International Symposium on Industrial Electronics, ISIE 2019
Country/TerritoryCanada
CityVancouver
Period12/06/1914/06/19

Keywords

  • cooperative game
  • obstacle avoidance
  • path planning
  • Reinforcement learning

Fingerprint

Dive into the research topics of 'Cooperative Game-based Multi-Agent Path Planning with Obstacle Avoidance'. Together they form a unique fingerprint.

Cite this