Planning in partially-observable switching-mode continuous domains

Emma Brunskill, Leslie Pack Kaelbling, Tomás Lozano-Pérez, Nicholas RoyAnn. Math. Artif. Intell 2010 · DOI · OpenReview

Abstract

Continuous-state POMDPs provide a natural representation for a variety of tasks, including many in robotics. However, most existing parametric continuous-state POMDP approaches are limited by their reliance on a single linear model to represent the world dynamics. We introduce a new switching-state dynamics model that can represent multi-modal state-dependent dynamics. We present the Switching Mode POMDP (SM-POMDP) planning algorithm for solving continuous-state POMDPs using this dynamics model. We also consider several procedures to approximate the value function as a mixture of a bounded number of Gaussians. Unlike the majority of prior work on approximate continuous-state POMDP planners, we provide a formal analysis of our SM-POMDP algorithm, providing bounds, where possible, on the quality of the resulting solution. We also analyze the computational complexity of SM-POMDP. Empirical results on an unmanned aerial vehicle collisions avoidance simulation, and a robot navigation simulation where the robot has faulty actuators, demonstrate the benefit of SM-POMDP over a prior parametric approach.
BibTeX
@article{brunskill2010planning,
  author = {Emma Brunskill and Leslie Pack Kaelbling and Tomás Lozano-Pérez and Nicholas Roy},
  title = {{Planning in partially-observable switching-mode continuous domains}},
  journal = {Ann. Math. Artif. Intell.},
  year = {2010},
  doi = {10.1007/s10472-010-9202-1},
}
Figure