Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Artificial Intelligence
Do the right thing: studies in limited rationality
Do the right thing: studies in limited rationality
Incremental path planning on graphs with cycles
Proceedings of the first international conference on Artificial intelligence planning systems
Automatic acquisition of task theories for robotic manipulation
Automatic acquisition of task theories for robotic manipulation
Linear-space best-first search
Artificial Intelligence
Learning to act using real-time dynamic programming
Artificial Intelligence - Special volume on computational research on interaction and agency, part 1
Complexity Analysis of Real-Time Reinforcement Learning Applied to Finding Shortest Paths in Deterministic Domains
Automatic OBDD-based generation of universal plans in non-deterministic domains
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Value-update rules for real-time search
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Terrain coverage with ant robots: a simulation study
Proceedings of the fifth international conference on Autonomous agents
Efficient and inefficient ant coverage methods
Annals of Mathematics and Artificial Intelligence
Planning and Control in Artificial Intelligence: A Unifying Perspective
Applied Intelligence
Towards Building Terrain-Covering Ant Robots
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Perspectives on artificial intelligence planning
Eighteenth national conference on Artificial intelligence
Supervision of real-time software systems using optimistic path prediction and rollbacks
ISSRE '96 Proceedings of the The Seventh International Symposium on Software Reliability Engineering
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Performance bounds for planning in unknown terrain
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Speeding up moving-target search
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Task decomposition on abstract states, for planning under nondeterminism
Artificial Intelligence
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
OBDD-based universal planning for synchronized agents in non-deterministic domains
Journal of Artificial Intelligence Research
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Easy and hard testbeds for real-time search algorithms
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
Many search domains are non-deterministic. Although real-time search methods have traditionally been studied in deterministic domains, they are well suited for searching nondeterministic domains since they do not have to plan for every contingency they can react to the actual outcomes of actions. In this paper, we introduce the min-max LRTA* algorithm, a simple extension of Korf's Learning Real-Time A* algorithm (LRTA*) to nondeterministic domains. We describe which nondeterministic domains min-max LRTA* can solve, and analyze its performance for these domains. We also give tight bounds on its worst-case performance and show how this performance depends on properties of both the domains and the heuristic functions used to encode prior information about the domains.