CGA: Corridor Generating Algorithm for Multi-Agent Environments

Arseniy Pertzovsky, Roni Stern, Roie Zivan

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

Abstract

In this work, we consider path planning for a team of mobile agents where one agent must reach a given target as soon as possible and the others must accommodate to avoid collisions. We call this practical problem the Single-Agent Corridor Generating (SACG) problem and explore several algorithms for solving it. We propose two baseline algorithms based on existing Multi-Agent Path Finding (MAPF) algorithms and outline their limitations. Then, we present the Corridor Generating Algorithm (CGA), a fast and complete algorithm for solving SACG. CGA performs well compared to the baseline approaches. In addition, we show how CGA can be generalized to address the lifelong version of MAPF, where new goals appear over time.

Original languageEnglish
Title of host publication2024 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2024
PublisherInstitute of Electrical and Electronics Engineers
Pages3455-3462
Number of pages8
ISBN (Electronic)9798350377705
DOIs
StatePublished - 1 Jan 2024
Event2024 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2024 - Abu Dhabi, United Arab Emirates
Duration: 14 Oct 202418 Oct 2024

Publication series

NameIEEE International Conference on Intelligent Robots and Systems
ISSN (Print)2153-0858
ISSN (Electronic)2153-0866

Conference

Conference2024 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2024
Country/TerritoryUnited Arab Emirates
CityAbu Dhabi
Period14/10/2418/10/24

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Software
  • Computer Vision and Pattern Recognition
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'CGA: Corridor Generating Algorithm for Multi-Agent Environments'. Together they form a unique fingerprint.

Cite this