Hybrid Boustrophedon and Partition Tree Group Algorithm for Coverage Path Planning Problem with Energy Constraints-Reference-Cited by-同舟云学术

Hybrid Boustrophedon and Partition Tree Group Algorithm for Coverage Path Planning Problem with Energy Constraints

Published:2022 Issue: Volume: Page:626-640
ISSN:1865-0929
Container-title:Recent Challenges in Intelligent Information and Database Systems
language:
Short-container-title:

Author:

Giang Tran Thi Cam,Binh Huynh Thi Thanh

Publisher

Springer Nature Singapore

Link

https://link.springer.com/content/pdf/10.1007/978-981-19-8234-7_49

Reference12 articles.

1. Galceran, E., Carreras, M.: A survey on coverage path planning for robotics. Robot. Auton. Syst. 61(12), 1258–1276 (2013)

2. Bormann, R., Jordan, F., Hampp, J., Hagele, M.: Indoor coverage path planning: survey, implementation, analysis. In: 2018 IEEE International Conference on Robotics and Automation (ICRA), pp. 1718–1725. IEEE (2018)

3. Sharma, G., Dutta, A., Kim, J. H.: Optimal online coverage path planning with energy constraints. In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, pp. 1189–1197 (2019)

4. Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59, 3 (1992)

5. Shnaps, I., Rimon, E.: Online coverage of planar environments by a battery powered autonomous mobile robot. IEEE Trans. Autom. Sci. Eng. 13(2), 425–436 (2016)

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. BWave framework for coverage path planning in complex environment with energy constraint;Expert Systems with Applications;2024-08

2. Inter-Reconfigurable Robot Path Planner for Double-Pass Complete Coverage Problem;Mathematics;2024-03-19