Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Speeding up problem solving by abstraction: a graph oriented approach
Artificial Intelligence - Special volume on empirical methods
IEEE Transactions on Knowledge and Data Engineering
Eighteenth national conference on Artificial intelligence
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
Optimal solutions for moving target search
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Graph abstraction in real-time heuristic search
Journal of Artificial Intelligence Research
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
The focussed D* algorithm for real-time replanning
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Efficient incremental search for moving target search
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Autonomous Agents and Multi-Agent Systems
Generalized Fringe-Retrieving A*: faster moving target search on state lattices
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Fast replanning for navigation in unknown terrain
IEEE Transactions on Robotics
Real-Time Edge Follow: A Real-Time Path Search Approach
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
A new approach for continual planning
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Hi-index | 0.00 |
Incremental search algorithms, such as Generalized Fringe-Retrieving A* and D* Lite, reuse search trees from previous searches to speed up the current search and thus often find cost-minimal paths for series of similar search problems faster than by solving each search problem from scratch. However, existing incremental search algorithms have limitations. For example, D* Lite is slow on moving target search problems, where both the start and goal states can change over time. In this paper, we therefore introduce Moving Target D* Lite, an extension of D* Lite that uses the principle behind Generalized Fringe-Retrieving A* to repeatedly calculate a cost-minimal path from the hunter to the target in environments whose blockages can change over time. We demonstrate experimentally that Moving Target D* Lite is four to five times faster than Generalized Adaptive A*, which so far was believed to be the fastest incremental search algorithm for solving moving target search problems in dynamic environments.