Minimax real-time heuristic search

Artificial Intelligence

Volumn 129, Issue 1-2, 2001, Pages 165-197

  Koenig, Sven ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Interleaving planning and plan executions; Localization; Minimax search; Real time heuristic search; Robot navigation

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; MATHEMATICAL MODELS; MOBILE ROBOTS; MOTION PLANNING; REAL TIME SYSTEMS;

NONDETERMINISTIC PLANNING; REAL-TIME HEURISTIC SEARCH;

ARTIFICIAL INTELLIGENCE;

EID: 0035369426     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(01)00103-5     Document Type: Article

References (51)

1. Learning to act using real-time dynamic programming
2. Planning with incomplete information as heuristic search in belief space
3. Planning as heuristic search
4. A robust and fast action selection mechanism
5. Acting under uncertainty: Discrete Bayesian models for mobile robot navigation
6. Conformant planning via model checking
7. Qualitative planning under assumptions: A preliminary report
8. Time-saving tips for problem solving with incomplete information
9. Planning as model checking
10. Solving POMDPs by searching in policy space
11. The loss from imperfect value functions in expectation-based and minimax-based tasks
12. Moving target search
13. Moving target search with intelligence
14. Two is not always better than one: Experiences in real-time bidirectional search
15. Planning and acting in partially observable stochastic domains
16. Are many reactive agents better than a few deliberative ones?
17. Real-time search in non-deterministic domains
18. Solving robot navigation problems with initial pose uncertainty using real-time heuristic search
19. Xavier: A robot navigation architecture based on partially observable Markov decision process models
20. Markov localization using correlation
21. Real-time heuristic search: First results
22. Real-time heuristic search: New results
23. Linear-space best-first search
24. Real-time heuristic search
25. Automatic synthesis of fine-motion strategies for robots
26. Rapid concept learning for mobile robots
27. Real-time planning by interleaving real-time search with subgoaling
28. The parti-game algorithm for variable resolution reinforcement learning in multidimensional state-spaces
29. Assumptive planning and execution: A simple, working robot architecture
30. Incremental path planning on graphs with cycles
31. Efficient memory-bounded search methods
32. Composing real-time systems
33. Probabilistic robot navigation in partially observable environments
34. The focussed D* algorithm for real-time replanning
35. Learning and exploitation do not conflict under minimax optimality
36. The role of exploration in learning control
37. A probabilistic approach to concurrent mapping and localization for mobile robots
38. Gridworlds as testbeds for planning with incomplete information