New A** algorithm improves dynamic multi-agent pathfinding

A new paper introduces A**, an improved algorithm for dynamic multi-agent pathfinding (D-MAPF). This method enhances pathfinding in environments with moving obstacles, partial visibility, and agent conflicts. A** achieves better solution quality by decoupling geometric path generation from temporal adaptation, allowing it to dynamically reconnect to precomputed candidate paths. AI

IMPACT Introduces a novel algorithm for D-MAPF, potentially improving efficiency in robotics and autonomous systems.

RANK_REASON The cluster contains a new academic paper detailing a novel algorithm. [lever_c_demoted from research: ic=1 ai=0.7]

Read on arXiv cs.MA (Multiagent) →

• Dijkstra
• D* Lite
• Space-Time A*
• WHCA*
• Wieslaw Marszalek

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →