Moving-Target Search: A Real-Time Search for Changing Goals
IEEE Transactions on Pattern Analysis and Machine Intelligence
Multi-Directional Search with Goal Switching for Robot Path Planning
IEA/AIE '98 Proceedings of the 11th International Conference on Industrial and Engineering Applications of Artificial In telligence and Expert Systems: Tasks and Methods in Applied Artificial Intelligence
Eighteenth national conference on Artificial intelligence
Artificial Intelligence
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Speeding up moving-target search
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Multiple-goal heuristic search
Journal of Artificial Intelligence Research
Learning to play using low-complexity rule-based policies: illustrations through Ms. Pac-Man
Journal of Artificial Intelligence Research
The fringe-saving A* search algorithm: a feasibility study
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Efficient incremental search for moving target search
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Multi-robot, multi-target particle swarm optimization search in noisy wireless environments
HSI'09 Proceedings of the 2nd conference on Human System Interactions
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Hi-index | 0.00 |
Agents often have to solve series of similar path planning problems. Adaptive A* is a recent incremental heuristic search algorithm that solves such problems faster than A*, updating a heuristic function (also known as h-values) using information from previous searches. In this paper, we address path planning with multiple targets on Adaptive A* framework. Although we can solve such problems by calculating the optimal path to each target, it would be inefficient, especially when the number of targets is large. We consider two cases whose objectives are (1) an agent reaches one of the targets, and (2) an agent has to reach all of the targets. We propose several methods to solve such problems keeping consistency of a heuristic function. Our experiments show that the proposed methods properly work on an application, i.e., maze problems.