- 期刊
Research on Path Planning Algorithm for Water Surface Garbage Cleaning Robots
摘要
To achieve full coverage path planning for lake surfaces and reduce the repetition rate of travel paths for water surface garbage cleaning robots, a full coverage path planning algorithm combined with the A* algorithm has been designed, integrating the Zigzag_path function with the A* algorithm, and optimizations were made targeting the issue of path repetition rates. And the the results of the program before and after optimization were compared. The results of the program indicate that the optimized program is capable of fulfilling the requirements of full coverage for water surface garbage cleaning robots and has significantly reduced the repetition rate of paths.
參考文獻
CARVALHO R N, VIDAL H, HIEIRA P. Complete coverage path planning and guidance for cleaning robots[C]//Proceedings of the IEEE International Symposium on Industrial Electronics, Guimaraes, Portugal: Institute of Electrical and Electronics Enginee, 1997 :677-682.
ITAIA,PAP ADIMITRIO C, SZW ARCFITER L. Hamilton paths in grid graphs[J]. S IAM Journal on Computing,1982,11(4):676-686.
GAGE D. Randomized search strategies with imperfect sensors[C]//Proc of SPIE Mobile Robots VI. Boston, 1993:270-279.
LATOME J-C, BARRAQUAND J.Robot motion planning:a distributed presentation approach[J]. International Journal of Robotics Research, 1991,10:628-649.
BALCH T.The case for randomized search[C]//Proc of IEEE Inter-national Conference on Robotics and Automation. San F rancisco,CA, 2000:264-275.