A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Approaches to macro decompositions of large Markov decision process planning problems
2002
Mobile Robots XVI
Mobile robot navigation tasks are subject to motion stochasticity arising from the robot's local controllers, which casts the navigational task into a Markov decision process framework. The MDP may, however, be intractably large; in this work we consider the prioritized package delivery problem which yields an exponentially large state space. We demonstrate that the bulk of this state space is tied to a sub-problem that is an instance of the traveling salesdroid problem and that exponential
doi:10.1117/12.457435
dblp:conf/mr/LaneK01
fatcat:3sset7xnkjb4zoxrxk6gsjlmiy