Fast stochastic motion planning with optimality guarantees using local policy reconfiguration
Lists
Only you see this
Abstract
This work presents a framework for fast reconfiguration of local control policies for a stochastic system to satisfy a high-level task specification. The motion of the system is abstracted to a class of uncertain Markov models known as bounded-parameter Markov decision processes (BMDPs). During the abstraction, an efficient sampling-based method for stochastic optimal control is used to construct several policies within a discrete region of the state space in order for the system to transit between neighboring regions. A BMDP is then used to find an optimal strategy over the local policies by maximizing a continuous reward function; a new policy can be computed quickly if the reward function changes. The efficacy of the framework is demonstrated using a sequence of online tasks, showing that highly desirable policies can be obtained by reconfiguring existing local policies in just a few seconds.
BibTeX
@inproceedings{luna2014fast,
author = {Ryan Luna and Morteza Lahijanian and Mark Moll and Lydia E. Kavraki},
title = {{Fast stochastic motion planning with optimality guarantees using local policy reconfiguration}},
booktitle = {IEEE International Conference on Robotics and Automation},
year = {2014},
url = {https://openreview.net/forum?id=Yx0j6XO3mk},
}Loading related content...