Double Heuristic Optimization Based on Hierarchical Partitioning for Coverage Path Planning of Robot Mowers

被引:0
|
作者
Wang, Jingyu [1 ]
Chen, Junfeng [1 ,2 ,3 ]
Cheng, Shi [4 ]
Xie, Yingjuan [1 ,2 ,3 ]
机构
[1] Hohai Univ, Coll IOT Engn, Changzhou, Peoples R China
[2] Hohai Univ, Jiangsu Key Lab Power Transmiss & Distribut Equip, Changzhou, Peoples R China
[3] Changzhou Key Lab Sensor Networks & Environm Sens, Changzhou, Peoples R China
[4] Shaanxi Normal Univ, Sch Comp Sci, Xian, Peoples R China
基金
中国国家自然科学基金;
关键词
robot mowers; coverage path planning; hierarchical partitioning; ant colony optimization; tabu search;
D O I
10.1109/CIS.2016.50
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Coverage path planning is one of the important issues for robot mowers, which brings great convenience to our life. In this paper, hierarchical partitioning strategy is employed to fulfill robot's environment modeling and the double heuristic optimization algorithms have been adopted to plan optimal coverage paths. Ant Colony Optimization (ACO) is used for global path planning in the upper layer, and Tabu Search (TS) is used for local coverage planning in the lower layer. Finally, simulation experiments are carried out and the results show the proposed method obtains satisfactory coverage path planning.
引用
收藏
页码:186 / 189
页数:4
相关论文
共 50 条
  • [31] Virtual Door-Based Coverage Path Planning for Mobile Robot
    Myung, Hyun
    Jeon, Hae-min
    Jeong, Woo-Yeon
    Bang, Seok-Won
    ADVANCES IN ROBOTICS, 2009, 5744 : 197 - 207
  • [32] Robot path planning optimization method based on heuristic multi-directional rapidly-exploring tree
    Qian, Kui
    Liu, Yiting
    Tian, Lei
    Bao, Jiatong
    COMPUTERS & ELECTRICAL ENGINEERING, 2020, 85
  • [33] HIERARCHICAL PATH-PLANNING FOR A MOBILE ROBOT
    JOHNSON, CM
    GRAY, JO
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 1994, 7 (02) : 137 - 149
  • [34] Hierarchical dynamic programming for robot path planning
    Bakker, B
    Zivkovic, Z
    Kröse, B
    2005 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-4, 2005, : 3720 - 3725
  • [35] Mobile Robot Path Planning Based on Ant Colony Algorithm With A* Heuristic Method
    Dai, Xiaolin
    Long, Shuai
    Zhang, Zhiwen
    Gong, Dawei
    FRONTIERS IN NEUROROBOTICS, 2019, 13
  • [36] Heuristic Dynamic Programming for Mobile Robot Path Planning Based on Dyna Approach
    Al Dabooni, Seaar
    Wunsch, Donald
    2016 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2016, : 3723 - 3730
  • [37] Optimization Techniques for Robot Path Planning
    Shurbevski, Aleksandar
    Hirosue, Noriaki
    Nagamochi, Hiroshi
    ICT INNOVATIONS 2013: ICT INNOVATIONS AND EDUCATION, 2014, 231 : 111 - 120
  • [38] Distributed Cooperative Complete Coverage Path Planning in an Unknown Environment Based on a Heuristic Method
    Dong, Qichen
    Zhang, Jia
    UNMANNED SYSTEMS, 2024, 12 (01) : 149 - 160
  • [39] Path planning of moving robot based on path optimization of D* Lite algorithm
    Huang L.
    Zhou F.-T.
    Kongzhi yu Juece/Control and Decision, 2020, 35 (04): : 877 - 884
  • [40] The Robot Path Planning Based on Region Partition to Node Optimization
    Liu Yunshan
    MANUFACTURING SCIENCE AND TECHNOLOGY, PTS 1-8, 2012, 383-390 : 605 - 609