Abstract
AbstractThis paper presents a novel solution of coverage path planning for robotic mowing applications. The planning algorithm is based on the Boustrophedon motions and the rapid Voronoi diagram. The coordinate conversion and the sweeping vector is defined by minimum bounding box and the Voronoi travel paths are designed to reduce the computational cost and execution time compared to conventional heuristic methods. The tracked path is controlled via dynamic feedback in standard lawn mowing robots under robot operating system (ROS). Within ROS, the information exchanging among different tasks of both extensive simulation cases and experimental field tests can be conducted easily. When meeting unknown obstacles, the proposed algorithm can re-plan its paths dynamically. The performance of the proposed algorithm is compared to several conventional coverage algorithms in terms of time efficiency, coverage, repetition, and robustness with respect to both concave and convex shapes. The field tests are conducted to demonstrate that the applicability of the sensor fusion and robustness of the proposed algorithm for the complete coverage tasks by robotic mowers.
Funder
Ministry of Science and Technology, Taiwan
National Taiwan University
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computer Science Applications
Reference42 articles.
1. Acar, E.U., Choset, H., Zhang, Y., Schervish, M.: Path planning for robotic demining: robust sensor-based coverage of unstructured environments and probabilistic methods. Int. J. Robot. Res. 22(7–8), 441–466 (2003)
2. Arkin, E.M., Fekete, S.P., Mitchell, J.S.B.: Approximation algorithms for lawn mowing and milling. Comput. Geom. 17(1–2), 25–50 (2000)
3. Barber, C.B., Dobkin, D.P., Huhdanpaa, H.: The quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 22(4), 469–483 (1996)
4. Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. Assoc. Comput. Mach. 18(9), 509–517 (1975)
5. Bhattacharya, P., Gavrilova, M.: Roadmap-based path planning—using the Voronoi diagram for a clearance-based shortest path. IEEE Robot. Autom. Mag. 15(2), 58–66 (2008)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献