Building efficient partial plans using Markov decision processes

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn 2000-January, Issue , 2000, Pages 156-163

  Laroche, P ^a  

^a LORIA   (France)

Author keywords

Actuators; Artificial intelligence; Equations; Joining processes; Mobile robots; Model driven engineering; Process planning; State space methods; Stochastic processes; Uncertainty

Indexed keywords

ACTUATORS; ARTIFICIAL INTELLIGENCE; DIRECTED GRAPHS; MARKOV PROCESSES; MOBILE ROBOTS; PROCESS PLANNING; RANDOM PROCESSES; ROBOT PROGRAMMING; STATE SPACE METHODS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

EQUATIONS; INITIAL STATE; JOINING PROCESS; MARKOV DECISION PROCESSES; MODEL-DRIVEN ENGINEERING; OPTIMAL SEQUENCE; PLANNING UNDER UNCERTAINTY; UNCERTAINTY;

INTELLIGENT ROBOTS;

EID: 84949680890     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TAI.2000.889862     Document Type: Conference Paper

References (16)

1. Richard Bellman. Dynamic Programming. Princeton University Press, 1957.
2. Craig Boutilier and Richard Dearden. Using abstractions for decision-theoretic planning with time constraints. In Proceedings of the National Conference on Artijicial Intelligence, pages 1016-1022,1994.
3. Anthony R. Cassandra, Leslie P. Kaelbling, and James A. Kurien. Acting under uncertainty: Discrete bayesian models for mobile-robot navigation. In Proceedings of IEEE International Conference on Intelligent Robots and Systems, 1996
4. Thomas Dean and Shieu-Hong Lin. Decomposition techniques for planning in stochastic domains. In Proceedings of International Joint Conference on Artificial Intelligence, 1995.
5. Thomas Dean, Leslie Kaelbling, Jak Kirman, and Ann Nicholson. Planning with deadlines in stochastic domains. In Proceedings of the 11th National Conference on Artificial Intelligence, 1993.
6. Ronald A. Howard. Dynamic Programming and Markov Processes. MIT Press, Cambridge, Massachussets, 1960.
7. Sven Koenig and Reid G. Simmons. Passive distance learning for robot navigation. In Proceedings of the thirteenth International Conference on Machine Learning, pages 266-274, 1996.
8. Daphne Koller and Ronald Parr. Computing factored value functions for policies in structured mdps. In Proceedings of International Joint Conference on Artificial Intelligence, 1999.
9. Pierre Laroche and François Charpillet. State Aggregation for Solving Markov Decision Problems - An Application to Mobile Robotics. In IEEE International Conference Tools with Artificial Intelligence, 1998.
10. Pierre Laroche, François Charpillet, and Ren Schott. Decomposition of markov decision processes using directed graphs. In Poster session of the European Conference on Planning (ECP'99), 1999.
11. Pierre Laroche, François Charpillet, and René Schott. Mobile robotics planning using abstract markov decision processes. In IEEE International Conference Tools with Artificial Intelligence, pages 299-306, 1999.
12. Michael L. Littman, Thomas L. Dean, and Leslie Pack Kaelbling. On the complexity of solving markov decision problems. Proceedings of the Eleventh Annual Conference on Uncertainty in Artificial Intelligence (UAI-95), Montreal, Quebec, Canada, 1995.
13. Christos H. Papadimitriou and John N. Tsitsiklis. The complexity of markov decision processes. Mathematics of Operations Research, 12(3):441-450, August 1987.
14. Ronald Parr. Flexible decomposition algorithms for weakly coupled markov decision problems. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, 1998.
15. Doina Precup and Richard S. Sutton. Multi-time models for temporally abstract planning. In Advances in Neural Information Processing Systems. MIT Press, 1997.
16. Ronald J. Williams and Leemon C. BairdIII. Tight performance bounds on greedy policies based on imperfect value functions. Technical Report NU-CCS-93-14, Northeastern University, 1993.