Improved Hierarchical Planner Performance Using Local Path Equivalence - Robotics Institute Carnegie Mellon University

Improved Hierarchical Planner Performance Using Local Path Equivalence

Conference Paper, Proceedings of (IROS) IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 3856 - 3861, September, 2011

Abstract

We propose a motion planning algorithm that reasons about tradeoffs between the discrete decision problems and continuous optimization problems faced by a mobile robot navigating through a cluttered environment. Discrete decisions typically involve transient options as the robot selects corridors to traverse. By contrast, optimization occurs within open spaces among homotopic paths. We utilize properties of local path sets to detect decisions of immediate importance and select routes that maximize the chance of future success.

BibTeX

@conference{Knepper-2011-7362,
author = {Ross Alan Knepper and Matthew T. Mason},
title = {Improved Hierarchical Planner Performance Using Local Path Equivalence},
booktitle = {Proceedings of (IROS) IEEE/RSJ International Conference on Intelligent Robots and Systems},
year = {2011},
month = {September},
pages = {3856 - 3861},
}