Heuristic Large-Scale Multi-Agent Path Planning with Communication

Multi-agent path planning is an important topic in robotics and has significant implications in autonomous vehicles and intelligent logistics. In this paper, a heuristic multi-agent path planning method is proposed. The improved channel and spatial attention modules are utilized to extract key features from the maps of agents. Then communication is conducted through the spatio-temporal Graph Transformer, enhancing coordination among agents. To improve training efficiency, the heuristic path generated by expert algorithm is designed for model training. In addition, a distance-based function is applied to assist agents in escaping deadlock situations. Experimental results demonstrate that the proposed method performs well in multi-agent path planning tasks across various maps.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/ntci64025.2024.10776364
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Heuristic Large-Scale Multi-Agent Path Planning with Communication

Wei Pang, Degang Wang
Robotic Path Planning Algorithms
article

Heuristic Large-Scale Multi-Agent Path Planning with Communication

Wei Pang, Degang Wang
article en

Abstract

Multi-agent path planning is an important topic in robotics and has significant implications in autonomous vehicles and intelligent logistics. In this paper, a heuristic multi-agent path planning method is proposed. The improved channel and spatial attention modules are utilized to extract key features from the maps of agents. Then communication is conducted through the spatio-temporal Graph Transformer, enhancing coordination among agents. To improve training efficiency, the heuristic path generated by expert algorithm is designed for model training. In addition, a distance-based function is applied to assist agents in escaping deadlock situations. Experimental results demonstrate that the proposed method performs well in multi-agent path planning tasks across various maps.

Dalian University of Technology (CN)
Openalex Percentile: Top 77%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.