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
Real-Time Bidirectional Search: Coordinated Problem Solving in Uncertain Situations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Real-Time Search for Autonomous Agents and Multiagent Systems
Autonomous Agents and Multi-Agent Systems
Real-Time Requirements for the Implementation of Speech-Controlled Artificial Actors
CAPTECH '98 Proceedings of the International Workshop on Modelling and Motion Capture Techniques for Virtual Environments
Controlling the learning process of real-time heuristic search
Artificial Intelligence
RTTES: Real-time search in dynamic environments
Applied Intelligence
Moving target search in grid worlds
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Performance simulations of moving target search algorithms
International Journal of Computer Games Technology - Artificial Intelligence for Computer Games
Real-Time Moving Target Search
Agent Computing and Multi-Agent Systems
Novel moving target search algorithms for computer gaming
Computers in Entertainment (CIE) - SPECIAL ISSUE: Media Arts and Games (Part II)
Optimal solutions for moving target search
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Learning in real-time search: a unifying framework
Journal of Artificial Intelligence Research
Multiple agents moving target search
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Utility-based on-line exploration for repeated navigation in an embedded graph
Artificial Intelligence
Real-time moving target evaluation search
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Evaluating strategies for running from the cops
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Autonomous Agents and Multi-Agent Systems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Improving the learning efficiencies of realtime search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Robot routing approaches for convoy merging maneuvers
TAROS'11 Proceedings of the 12th Annual conference on Towards autonomous robotic systems
Optimization of route planning and exploration using multi agent system
Multimedia Tools and Applications
Cops and robber game without recharging
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Implementation of robot routing approaches for convoy merging manoeuvres
Robotics and Autonomous Systems
| Hi-index | 0.14 |
We consider the case of heuristic search where the goal may change during the course of the search. For example, the goal may be a target that actively avoids the problem solver. We present a moving-target search algorithm (MTS) to solve this problem. We prove that if the average speed of the target is slower than that of the problem solver, then the problem solver is guaranteed to eventually reach the target in a connected problem space.The original MTS algorithm was constructed with the minimum operations necessary to guarantee its completeness, and hence is not very efficient. To improve its efficiency, we introduce ideas from the area of resource-bounded planning into MTS, includingcommitment to goals, anddeliberation for selecting plans.Experimental results demonstrate that the improved MTS is 10 to 20 times more efficient than the original MTS in uncertain situations.