An optimization approach for planning robotic field coverage
Authors:
- 1 November 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 004032-004039
Abstract
This paper presents an optimization approach that takes the vehicle's characteristics into account to minimize the non-working travel of mobile robots in coverage path planning. Since turns are often costly for mobile robots, minimizing the cost of turns usually produces more working efficiency. Prior researches on coverage path planning for mobile robots tend to fall into two complementary categories: (1) minimize the number of turns, by finding the optimal decomposition of a complex field into subfields and the optimal driving directions; (2) minimize the cost on a fixed number of turns, by finding the optimal visiting sequence of subfields and the optimal traversal sequence of parallel tracks for each subfield. This paper firstly presents a novel traversal pattern of parallel field tracks that belongs to the second category, then extends the proposed traversal pattern to connect with algorithms in the first category, providing a complete coverage path planning method for mobile robots. Experiments show that the proposed method can provide feasible solutions and the total wasted distance can be greatly reduced when compared against classical boustrophedon path or recent state-of-the-art.Keywords
This publication has 20 references indexed in Scilit:
- Benefits from optimal route planning based on B-patternsBiosystems Engineering, 2013
- An Optimized Field Coverage Planning Approach for Navigation of Agricultural Robots in Fields Involving Obstacle AreasInternational Journal of Advanced Robotic Systems, 2013
- Coverage path planning algorithms for agricultural field machinesJournal of Field Robotics, 2009
- Minimising the non-working distance travelled by machines operating in a headland field patternBiosystems Engineering, 2008
- A random-key genetic algorithm for the generalized traveling salesman problemEuropean Journal of Operational Research, 2006
- Classification of the Dubins setRobotics and Autonomous Systems, 2001
- An effective implementation of the Lin–Kernighan traveling salesman heuristicEuropean Journal of Operational Research, 2000
- The dynamic programming method in the generalized traveling salesman problemMathematical and Computer Modelling, 1997
- On the worst‐case performance of some algorithms for the asymmetric traveling salesman problemNetworks, 1982
- On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and TangentsAmerican Journal of Mathematics, 1957