Complete coverage path planning algorithm based on energy compensation and obstacle vectorization
Authors:
- Longda GaoLGLongda Gao
- Weiyang LvWLWeiyang Lv
- Xuyang YanXYXuyang Yan
- Yanzheng HanYHYanzheng Han
- 7 May 2022
- journal article
- research article
- Published by Elsevier in Expert Systems with Applications
- Vol. 203
Abstract
No abstract availableKeywords
Funding Information
- Specialized Research Fund for the Technology Innovation of Foshan City (BK20AE005)
This publication has 20 references indexed in Scilit:
- Applying the MOVNS (multi-objective variable neighborhood search) algorithm to solve the path planning problem in mobile roboticsExpert Systems with Applications, 2016
- Side-to-side 3D coverage path planning approach for agricultural robots to minimize skip/overlap areas between swathsRobotics and Autonomous Systems, 2016
- Fast and templatable path planning of spray painting robots for regular surfaces2015
- A survey on coverage path planning for roboticsRobotics and Autonomous Systems, 2013
- On the Complete Coverage Path Planning for Mobile RobotsJournal of Intelligent & Robotic Systems, 2013
- Coverage Algorithms for an Under-actuated Car-Like Vehicle in an Uncertain EnvironmentProceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (cat. No.01ch37164), 2007
- Uniform Coverage of Automotive Surface PatchesThe International Journal of Robotics Research, 2005
- A Neural Network Approach to Complete Coverage Path PlanningIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2004
- Complete coverage path planning and guidance for cleaning robots2002
- Region filling operations with random obstacle avoidance for mobile robotsJournal of Robotic Systems, 1988