Focussed processing of MDPs for path planning

David Ferguson and Anthony (Tony) Stentz
Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI '04), December, 2004, pp. 310 - 317.


Download
  • Adobe portable document format (pdf) (173KB)
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract
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.

Notes
Associated Center(s) / Consortia: Field Robotics Center
Number of pages: 8

Text Reference
David Ferguson and Anthony (Tony) Stentz, "Focussed processing of MDPs for path planning," Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI '04), December, 2004, pp. 310 - 317.

BibTeX Reference
@inproceedings{Ferguson__2004_5653,
   author = "David {Ferguson } and Anthony (Tony) Stentz",
   title = "Focussed processing of MDPs for path planning",
   booktitle = "Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI '04)",
   pages = "310 - 317",
   month = "December",
   year = "2004",
}