Focussed dynamic programming : extensive comparative results
journal contributionposted on 01.01.2004, 00:00 by Dave Ferguson, Anthony Stentz
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."