Information-theoretic planning with trajectory optimization for dense 3D mapping

149Citations
Citations of this article
217Readers
Mendeley users who have this article in their library.

Abstract

We propose an information-theoretic planning approach that enables mobile robots to autonomously construct dense 3D maps in a computationally efficient manner. Inspired by prior work, we accomplish this task by formulating an information-theoretic objective function based on Cauchy-Schwarz quadratic mutual information (CSQMI) that guides robots to obtain measurements in uncertain regions of the map. We then contribute a two stage approach for active mapping. First, we generate a candidate set of trajectories using a combination of global planning and generation of local motion primitives. From this set, we choose a trajectory that maximizes the information-theoretic objective. Second, we employ a gradient-based trajectory optimization technique to locally refine the chosen trajectory such that the CSQMI objective is maximized while satisfying the robot's motion constraints. We evaluated our approach through a series of simulations and experiments on a ground robot and an aerial robot mapping unknown 3D environments. Real-world experiments suggest our approach reduces the time to explore an environment by 70% compared to a closest frontier exploration strategy and 57% compared to an information-based strategy that uses global planning, while simulations demonstrate the approach extends to aerial robots with higher-dimensional state.

Cite

CITATION STYLE

APA

Charrow, B., Kahn, G., Patil, S., Liu, S., Goldberg, K., Abbeel, P., … Kumar, V. (2015). Information-theoretic planning with trajectory optimization for dense 3D mapping. In Robotics: Science and Systems (Vol. 11). MIT Press Journals. https://doi.org/10.15607/RSS.2015.XI.003

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free