Asynchronous and Decentralized Multiagent Trajectory Planning in Dense Environments

Zhengxiang Guo, Jinwen Hu, Chunhui Zhao, Quan Pan

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

Abstract

This paper proposes an online decentralized and asynchronous multiagent trajectory planning algorithm in dense environments. In our algorithm, the optimization problem is transformed into a quadratic programming (QP) problem to reduce the computational complexity by constructing the optimal linear flight corridors (OLFC). A cooperation-based deconfliction framework is designed to ensure the safety and feasibility under the decentralized and asynchronous architecture. We conduct a large number of simulations to verify the reliability and efficiency of our algorithm in dense environments with higher success rate, less computational time and total navigation time, which is more aggressive and cooperative.

Original languageEnglish
Title of host publicationProceedings of 2022 International Conference on Autonomous Unmanned Systems, ICAUS 2022
EditorsWenxing Fu, Mancang Gu, Yifeng Niu
PublisherSpringer Science and Business Media Deutschland GmbH
Pages153-162
Number of pages10
ISBN (Print)9789819904785
DOIs
StatePublished - 2023
EventInternational Conference on Autonomous Unmanned Systems, ICAUS 2022 - Xi'an, China
Duration: 23 Sep 202225 Sep 2022

Publication series

NameLecture Notes in Electrical Engineering
Volume1010 LNEE
ISSN (Print)1876-1100
ISSN (Electronic)1876-1119

Conference

ConferenceInternational Conference on Autonomous Unmanned Systems, ICAUS 2022
Country/TerritoryChina
CityXi'an
Period23/09/2225/09/22

Keywords

  • Decentralized system
  • Linear flight corridor
  • Multiagent
  • Trajectory planning

Fingerprint

Dive into the research topics of 'Asynchronous and Decentralized Multiagent Trajectory Planning in Dense Environments'. Together they form a unique fingerprint.

Cite this