[1] |
Zhao Lei.Research on complete coverage path planning in unknown environments[D].Nanchang:Nanchang University,2016.(in Chinese)
|
[2] |
Ma Yun-fei.Research on mobile robot full coverage path planning and autonomous navigation algorithm[D].Beijing:Beijing University of Posts and Telecommunications,2019.(in Chinese)
|
[3] |
Yang Jun-cheng, Li Shu-xia,Cai Zeng-yu.Research and development of path planning algorithm.[J].Control Engineering of China,2017,24(7):1473-1480.(in Chinese)
|
[4] |
Gabriely Y, Rimon E.Spanning-tree based coverage of conti- nuous areas by a mobile robot [J].Annals of Mathematics & Artificial Intelligence,2001,31(1-4):77-98.
|
[5] |
Gabriely Y,Rimon E.Competitive on-line coverage of grid environments by a mobile robot[J].Computational Geometry,2003,24(3):197-224.
|
[6] |
Gabriely Y,Rimon E.Spiral-STC:An on-line coverage algorithm of grid environments by a mobile robot[C]∥Proc of IEEE International Conference on Robotics and Automation,2002:954-960.
|
[7] |
Qin Yu-xin,Zhang Gao-feng,Wang Yu-qing.Modular grid map construction algorithm for complex environment[J].Control Engineering of China,2016,23(10):1627-1633.(in Chinese)
|
[8] |
Zelinsky A.A mobile robot exploration algorithm[J].IEEE Transactions on Robotics & Automation,1992,8(6):707-717.
|
[9] |
Zelinsky A,Jarvis R A,Byrne J C.Planning paths of complete coverage of an unstructured environment by a mobile robot [C]∥Proc of International Conference on Advanced Robotics,1993:533-538.
|
[10] |
Hao Zong-bo, Hong Bing-rong,Huang Qing-cheng. Study of coverage path planning based on grid-map[J].Application Research of Computers,2007,24(10):56-58.(in Chinese)
|
[11] |
Zhao Hui-nan,Liu Shu-hua,Wu Fu-zhang, et al. Research on boustrophedon complete coverage path planning based on binary search[J].Computer Engineering and Applications,2011,47(23):51-53.(in Chinese)
|
[12] |
Jiang Yi-bo,Wang Wei,He Cheng-long. Sub-regional dynamic optimization algorithm for path coverage of single target[J].Computer Science,2019,46(11):369-375.(in Chinese)
|
[13] |
Li Kai,Chen Yong-fu,Jin Zhi-yong. A full coverage path planning algorithm based on backtracking method[J].Computer Engineering & Science,2019,41(7):1227-1235.(in Chinese)
|
[14] |
Li Kai.Research on full coverage optimization algorithm of sweeping robot in closed unknown environment[D].Wuhan:Huazhong University of Science and Technology,2019.(in Chinese)
|
[15] |
Wang Dian-jun. Indoor mobile-robot path planning based on an improved A* algorithm[J].Journal of Tsinghua University(Science and Technology),2012,52(8):1085-1089.(in Chinese)
|
[16] |
Wang Hong-wei,Ma Yong,Xie Yong, et al. Mobile robot optimal path planning based on smoothing A* algorithm[J].Journal of Tongji University(Natural Science),2010,38(11):1647-1650.(in Chinese)
|
[17] |
Wang Xiao-hong,Ye Tao.Research on robot path planning based on improved A* algorithm[J].Computer Measurement & Control,2018,26(7):282-286.(in Chinese)
|
[18] |
Noreen I,Khan A,Habib Z.Optimal path planning for mobile robots using memory efficient A*[C]∥Proc of the International Conference on Frontiers of Information Technology,2016:142-146.
|
|
附中文参考文献:
|
[1] |
赵蕾.未知环境下全覆盖路径规划问题的研究[D].南昌:南昌大学,2016.
|
[2] |
马云飞.移动机器人全覆盖路径规划与自主导航算法研究[D].北京:北京邮电大学,2019.
|
[3] |
杨俊成,李淑霞,蔡增玉.路径规划算法的研究与发展[J].控制工程,2017,24(7):1473-1480.
|
[7] |
秦玉鑫,张高峰,王裕清.针对复杂环境的模块化栅格地图构建算法[J].控制工程,2016,23(10):1627-1633.
|
[10] |
郝宗波,洪炳镕,黄庆成.基于栅格地图的机器人覆盖路径规划研究[J].计算机应用研究,2007,24(10):56-58.
|
[11] |
赵慧南,刘淑华,吴富章,等.基于二分搜索的牛耕式全覆盖规划算法研究[J].计算机工程与应用,2011,47(23):51-53.
|
[12] |
蒋一波,王伟,何成龙.一种单目标路径覆盖分区动态优化算法[J].计算机科学,2019,46(11):369-375.
|
[13] |
李楷,陈永府,金志勇.基于回溯法的全覆盖路径规划算法[J].计算机工程与科学,2019,41(7):1227-1235.
|
[14] |
李楷.封闭未知环境下扫地机器人的路径全覆盖优化算法研究[D].武汉:华中科技大学,2019.
|
[15] |
王殿君.基于改进A*算法的室内移动机器人路径规划[J].清华大学学报(自然科学版),2012,52(8):1085-1089.
|
[16] |
王红卫,马勇,谢勇,等.基于平滑A*算法的移动机器人路径规划[J].同济大学学报(自然科学版),2010,38(11):1647-1650.
|
[17] |
王小红,叶涛.基于改进A*算法机器人路径规划研究[J].计算机测量与控制,2018,26(7):282-286.
|