More Flexible Proximity Wildcards Path Planning with Compressed Path Databases
X Chen, Y Zhang, Y Zhang - Proceedings of the International …, 2024 - ojs.aaai.org
Grid-based path planning is one of the classic problems in AI, and a popular topic in
application areas such as computer games and robotics. Compressed Path Databases …
application areas such as computer games and robotics. Compressed Path Databases …
[PDF][PDF] Efficient Budgeted Graph Search.
J Kaur, NR Sturtevant - IJCAI, 2022 - ijcai.org
Abstract Iterative Budgeted Exponential Search (IBEX) is a general search algorithm that
can limit the number of re-expansions performed in common problems like iterative …
can limit the number of re-expansions performed in common problems like iterative …
Multi-agent algorithms with assignment strategy pursuing multiple moving targets in dynamic environments
A Afzalov - 2022 - irep.ntu.ac.uk
Devising intelligent agents to successfully plan a path to a target is a common problem in
artificial intelligence and in recent years, attention has increased to multi-agent pathfinding …
artificial intelligence and in recent years, attention has increased to multi-agent pathfinding …