16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04) Focussed Propagation of MDPs for Path Planning Boca Raton, Florida November 15-November 17 ISBN: 0-7695-2236-X
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICTAI.2004.64
We present a heuristic-based algorithm for solving restricted Markov decision processes (MDPs). Our approach, which combines ideas from deterministic search and recent dynamic programming methods, focusses computation towards promising areas of the state space. It is thus able to significantly reduce the amount of processing required to produce a solution. We demonstrate this improvement by comparing the performance of our approach to the performance of several existing algorithms on a robotic path planning domain.
Citation:
Dave Ferguson, Anthony Stentz, "Focussed Propagation of MDPs for Path Planning," ictai, pp.310-317, 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04), 2004 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||