A protruding vertex decomposition approach to complete coverage path planning

被引：0
|
作者：
Shi, Weiren
Shen, Min [1 ]
Wang, Kai
Yang, Simon X.
机构：
[1] Chongqing Univ, Coll Automat, Chongqing 400044, Peoples R China
[2] Univ Guelph, ARIS Lab, Guelph, ON N1G 2W1, Canada
来源：
DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS | 2006年 / 13E卷
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A novel complete coverage path planning algorithm for mobile robots using protruding vertex decomposition is proposed in this paper. The environment is first divided into several areas according to the vertices: leftmost, rightmost, topmost and bottommost of the obstacle. Then the way to cover the divided area is selected: landscape or portrait orientation. Using the proposed algorithm, the robot can find an efficient path with less time to generate a complete coverage path than using Trapezoidal algorithm and Boustrophedon algorithm.
引用
收藏
页码：4000 / 4004
页数：5
相关论文
共 50 条
  • [1] Complete, Decomposition-Free Coverage Path Planning
    Kusnur, Tushar
    Likhachev, Maxim
    2022 IEEE 18TH INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING (CASE), 2022, : 1431 - 1437
  • [2] A neural network approach to complete coverage path planning
    Yang, SX
    Luo, CM
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2004, 34 (01): : 718 - 725
  • [3] Linking Field Decomposition and Coverage Path Planning: A Coevolution Approach
    Bostelmann-Arp, Lukas
    Steup, Christoph
    Mostaghim, Sanaz
    2023 IEEE CONFERENCE ON ARTIFICIAL INTELLIGENCE, CAI, 2023, : 294 - 295
  • [4] Heuristic template approach to complete coverage path planning of mobile robot
    Liu, SR
    Qiu, XN
    Yang, SX
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2005, 1 : 358 - 363
  • [5] Path planning for complete coverage with agricultural machines
    Taix, Michel
    Soueres, Philippe
    Frayssinet, Helene
    Cordesses, Lionel
    FIELD AND SERVICE ROBOTICS: RECENT ADVANCES IN RESEARCH AND APPLICATIONS, 2006, 24 : 549 - +
  • [6] On the Complete Coverage Path Planning for Mobile Robots
    Hsu, Ping-Min
    Lin, Chun-Liang
    Yang, Meng-Yao
    JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, 2014, 74 (3-4) : 945 - 963
  • [7] On the Complete Coverage Path Planning for Mobile Robots
    Ping-Min Hsu
    Chun-Liang Lin
    Meng-Yao Yang
    Journal of Intelligent & Robotic Systems, 2014, 74 : 945 - 963
  • [8] The Constriction Decomposition Method for Coverage Path Planning
    Brown, Stanley
    Waslander, Steven L.
    2016 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS 2016), 2016, : 3233 - 3238
  • [9] A Probabilistic Approach for Complete Coverage Path Planning with low-cost Systems
    Rottmann, Nils
    Denz, Robin
    Bruder, Ralf
    Rueckert, Elmar
    10TH EUROPEAN CONFERENCE ON MOBILE ROBOTS (ECMR 2021), 2021,
  • [10] An Approach for Coverage Path Planning for UAVs
    Nam, L. H.
    Huang, L.
    Li, X. J.
    Xu, J. F.
    2016 IEEE 14TH INTERNATIONAL WORKSHOP ON ADVANCED MOTION CONTROL (AMC), 2016, : 411 - 416
12345