Anytime Lifelong Multi-Agent Pathfinding in Topological Maps
This study addresses a lifelong multi-agent path finding (lifelong MAPF) problem that continuously solves an MAPF instance online according to newly assigned goals. Specifically, we focus on lifelong MAPF in a topological map. This problem is challenging because the movement of the agent is restrict...
Main Authors: | Soohwan Song, Ki-In Na, Wonpil Yu |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2023-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10054055/ |
Similar Items
-
Cooperative Pathfinding Based on Memory-Efficient Multi-Agent RRT*
by: Jinmingwu Jiang, et al.
Published: (2020-01-01) -
A Compact Answer Set Programming Encoding of Multi-Agent Pathfinding
by: Rodrigo N. Gomez, et al.
Published: (2021-01-01) -
A Comprehensive Review on Leveraging Machine Learning for Multi-Agent Path Finding
by: Jean-Marc Alkazzi, et al.
Published: (2024-01-01) -
Multi-Robot Navigation System Design Based on Proximal Policy Optimization Algorithm
by: Ching-Chang Wong, et al.
Published: (2024-08-01) -
A decoupling method for solving the multi-agent path finding problem
by: Bin Liao, et al.
Published: (2023-05-01)