Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Artificial Intelligence
Intention is choice with commitment
Artificial Intelligence
Commitment and effectiveness of situated agents
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Case-based subgoaling in real-time heuristic search for video game pathfinding
Journal of Artificial Intelligence Research
Escaping heuristic depressions in real-time heuristic search
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Real-time heuristic search with depression avoidance
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Avoiding and escaping depressions in real-time heuristic search
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We previously proposed the moving target search (MTS) algorithm, where the location of the goal may change during the course of the search. MTS is the first search algorithm concerned with problem solving in a dynamically changing environment. However, since we constructed the algorithm with the minimum operations necessary for guaranteeing its completeness, the algorithm as proposed is neither efficient nor intelligent. In this paper, we introduce innovative notions created in the area of resource-bounded planning into the formal search algorithm, MTS. Our goal is to improve the efficiency of MTS, while retaining its completeness. Notions that are introduced are (1) commitment to goals, and (2) deliberation for selecting plans. Evaluation results demonstrate that the intelligent MTS is 10 to 20 times more efficient than the original MTS in uncertain situations.