COVERAGE PATH PLANNING BASED ON IMPROVED CELLULAR DECOMPOSITION, 301-310.
The traditional unit decomposition method for full coverage pathplanning in static environments overlooked the robot’s turningweight and failed to consider the input–output direction ofsub-regions when constructing the travelling salesman problem(TSP).
Authors
- Yuhe Qiu (ORCID: https://orcid.org/0009-0001-9695-4858)
- Jian Zhou (ORCID: https://orcid.org/0000-0001-6952-410X)
- Xinfu He (ORCID: https://orcid.org/0000-0002-1410-2724)
- Hu He (ORCID: https://orcid.org/0000-0003-3239-430X)
- Taihong Lv
Publication Details
- Journal
- International Journal of Robotics and Automation
- Published
- 2025-01-01
- DOI
- https://doi.org/10.2316/j.2025.206-1168
- Citations
- 1
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 1.28