A high-efficiency, information-based exploration path planning method for active simultaneous localization and mapping

13Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The efficiency of exploration in an unknown scene and full coverage of the scene are essential for a robot to complete simultaneous localization and mapping actively. However, it is challenging for a robot to explore an unknown environment with high efficiency and full coverage autonomously. In this article, we propose a novel exploration path planning method based on information entropy. An information entropy map is first constructed, and its boundary features are extracted. Then a Dijkstra-based algorithm is applied to generate candidate exploration paths based on the boundary features. The dead-reckoning algorithm is used to predict the uncertainty of the robot’s pose along each candidate path. The exploration path is selected based on exploration efficiency and/or high coverage. Simulations and experiments are conducted to evaluate the proposed method’s effectiveness. The results demonstrated that the proposed method achieved not only higher exploration efficiency but also a larger coverage area.

Cite

CITATION STYLE

APA

Li, P., Yang, C. Y., Wang, R., & Wang, S. (2020). A high-efficiency, information-based exploration path planning method for active simultaneous localization and mapping. International Journal of Advanced Robotic Systems, 17(1). https://doi.org/10.1177/1729881420903207

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