Coverage path planning for legged robots in unknown environments
Authors:
- 1 October 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 68-73
Abstract
In applications like search and rescue, industrial inspection, or construction site mapping, robots may be used to explore and map unknown areas using onboard sensing. This paper presents a novel coverage path planning (CPP) algorithm for autonomous exploration with legged robots. The algorithm decomposes the region of interest into cells by detecting landmarks in the environment. Each cell is covered using a zig-zag motion pattern. The landmark detection is based on the traversability information of the surrounding area. The detection mechanism can be applied to obstacles with any shape, and it is robust against measurement uncertainty. Unlike existing CPP algorithms, the proposed algorithm takes into account the traversability of the surrounding terrain, and it is applicable to rough terrain environments where obstacle detection is a non-trivial problem. Completeness of exploration and the trade off between completeness and efficiency are discussed. Two simulations of the proposed algorithm were conducted using the open source robotics simulator Gazebo, with the legged robot ANYmal [1] as robotic platform. The results demonstrate the feasibility of the proposed algorithm for exploring unknown, rough terrain environments.Keywords
This publication has 19 references indexed in Scilit:
- A Universal Grid Map Library: Implementation and Use Case for Rough Terrain Navigation2016
- A survey on coverage path planning for roboticsRobotics and Autonomous Systems, 2013
- Sensor-based coverage with extended range detectorsIEEE Transactions on Robotics, 2006
- BSA: A Complete Coverage Algorithm2006
- A topological coverage algorithm for mobile robots2004
- Complete Coverage by Mobile Robots Using Slice Decomposition Based on Natural Landmarks2004
- Sensor-based Coverage of Unknown Environments: Incremental Construction of Morse DecompositionsThe International Journal of Robotics Research, 2002
- Morse Decompositions for Coverage TasksThe International Journal of Robotics Research, 2002
- Coverage Path Planning: The Boustrophedon Cellular Decomposition1998
- A terrain-covering algorithm for an AUVAutonomous Robots, 1996