ICRA'09 Paper Abstract


Paper FrB4.1

Scherer, Sebastian (Carnegie Mellon University), Ferguson, Dave (Intel Research Pittsburgh), Singh, Sanjiv (Carnegie Mellon University)

Efficient C-Space and Cost Function Updates in 3D for Unmanned Aerial Vehicles

Scheduled for presentation during the Regular Sessions "Motion and Path Planning - II" (FrB4), Friday, May 15, 2009, 10:30−10:50, Room: 402

2009 IEEE International Conference on Robotics and Automation, May 12 - 17, 2009, Kobe, Japan

This information is tentative and subject to change. Compiled on January 24, 2022

Keywords Motion and Path Planning, Aerial Robotics


When operating in partially-known environments, autonomous vehicles must constantly update their maps and plans based on new sensor information. Much focus has been placed on developing efficient incremental planning algorithms that are able to efficiently replan when the map and associated cost function changes. However, much less attention has been placed on efficiently updating the cost function used by these planners, which can represent a significant portion of the time spent replanning. In this paper, we present the Limited Incremental Distance Transform algorithm, which can be used to efficiently update the cost function used for planning when changes in the environment are observed. Using this algorithm it is possible to plan paths in a completely incremental way starting from a list of changed obstacle classifications. We present results comparing the algorithm to the Euclidean distance transform and a mask-based incremental distance transform algorithm. Computation time is reduced by an order of magnitude for a UAV application. We also provide example results from an autonomous micro aerial vehicle with on-board sensing and computing.



Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2022 PaperCept, Inc.
Page generated 2022-01-24  05:02:09 PST  Terms of use