A systematic literature review of A* pathfinding
D Foead, A Ghifari, MB Kusuma, N Hanafiah… - Procedia Computer …, 2021 - Elsevier
A* is a search algorithm that has long been used in the pathfinding research community. Its
efficiency, simplicity, and modularity are often highlighted as its strengths compared to other …
efficiency, simplicity, and modularity are often highlighted as its strengths compared to other …
Multi-agent path finding–an overview
R Stern - Artificial Intelligence: 5th RAAI Summer School …, 2019 - Springer
Abstract Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents
such that every agent reaches its goal and the agents do not collide. In recent years, there …
such that every agent reaches its goal and the agents do not collide. In recent years, there …
Searching with consistent prioritization for multi-agent path finding
We study prioritized planning for Multi-Agent Path Finding (MAPF). Existing prioritized MAPF
algorithms depend on rule-of-thumb heuristics and random assignment to determine a fixed …
algorithms depend on rule-of-thumb heuristics and random assignment to determine a fixed …
Multi-agent pathfinding with continuous time
Abstract Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents
such that each agent reaches its goal and the agents do not collide. In recent years, variants …
such that each agent reaches its goal and the agents do not collide. In recent years, variants …
Pairwise symmetry reasoning for multi-agent path finding search
Abstract Multi-Agent Path Finding (MAPF) is a challenging combinatorial problem that asks
us to plan collision-free paths for a team of cooperative agents. In this work, we show that …
us to plan collision-free paths for a team of cooperative agents. In this work, we show that …
Branch-and-cut-and-price for multi-agent path finding
Abstract The Multi-Agent Path Finding problem aims to find a set of collision-free paths that
minimizes the total cost of all paths. The problem is extensively studied in artificial …
minimizes the total cost of all paths. The problem is extensively studied in artificial …
[PDF][PDF] Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search.
Abstract Conflict-Based Search (CBS) and its enhancements are among the strongest
algorithms for Multi-Agent Path Finding. Recent work introduced an admissible heuristic to …
algorithms for Multi-Agent Path Finding. Recent work introduced an admissible heuristic to …
Multi-agent path finding for large agents
Abstract Multi-Agent Path Finding (MAPF) has been widely studied in the AI community. For
example, Conflict-Based Search (CBS) is a state-of-the-art MAPF algorithm based on a …
example, Conflict-Based Search (CBS) is a state-of-the-art MAPF algorithm based on a …
[HTML][HTML] Priority inheritance with backtracking for iterative multi-agent path finding
Abstract In the Multi-Agent Path Finding (MAPF) problem, a set of agents moving on a graph
must reach their own respective destinations without inter-agent collisions. In practical MAPF …
must reach their own respective destinations without inter-agent collisions. In practical MAPF …
A digital twin for 3D path planning of large-span curved-arm gantry robot
W Wenna, D Weili, H Changchun, Z Heng… - Robotics and Computer …, 2022 - Elsevier
Gantry robots enjoy important applications in unmanned factories and intelligent
manufacturing tasks. Aiming at the automated production of customized wooden furniture …
manufacturing tasks. Aiming at the automated production of customized wooden furniture …