Focussed Dynamic Programming: Extensive Comparative Results
Tech. Report, CMU-RI-TR-04-13, Robotics Institute, Carnegie Mellon University, March, 2004
Abstract
We present a heuristic-based propagation algorithm for solving 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 in producing a solution. We present a number of results comparing our approach to existing algorithms on a robotic path planning domain.
BibTeX
@techreport{Ferguson-2004-8866,author = {David Ferguson and Anthony (Tony) Stentz},
title = {Focussed Dynamic Programming: Extensive Comparative Results},
year = {2004},
month = {March},
institute = {Carnegie Mellon University},
address = {Pittsburgh, PA},
number = {CMU-RI-TR-04-13},
keywords = {path planning, MDPs},
}
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.