Path planning for complete and efficient coverage operation of mobile robots

被引:25
|
作者
Kang, Jung Won [1 ]
Kim, Si Jong [1 ]
Chung, Myung Jin [1 ]
Myung, Hyun [2 ]
Park, Jun Ho [2 ]
Bang, Seok Won [2 ]
机构
[1] Korea Adv Inst Sci & Technol, Dept Elect Engn, Taejon 305701, South Korea
[2] Samsung Adv Inst Technol, Micro Syst Lab, Suwon 449712, South Korea
来源
2007 IEEE INTERNATIONAL CONFERENCE ON MECHATRONICS AND AUTOMATION, VOLS I-V, CONFERENCE PROCEEDINGS | 2007年
关键词
complete coverage algorithm; optimal coverage algorithm; cell decomposition;
D O I
10.1109/ICMA.2007.4303880
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a complete and efficient coverage path planning method for mobile robots. Its applications include robots for de-mining, cleaning, painting and so on. When a mobile robot performs area coverage task, completeness and efficiency of coverage are important factors. To achieve completeness easily, we adopt a divide and conquer strategy. We developed a novel cell decomposition algorithm that divides a given area into several cells. To achieve efficiency, each cell is covered by a robot motion that requires minimum time to cover the cell. The effectiveness of the method is verified using simulations.
引用
收藏
页码:2126 / +
页数:2
相关论文
共 50 条
  • [11] Complete Coverage Path Planning for Multi-Robots Based on
    Janchiv, Adiyabaatar
    Batsaikhan, Dugarjav
    Kim, Gook Hwan
    Lee, Soon-Geul
    2011 11TH INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION AND SYSTEMS (ICCAS), 2011, : 824 - 827
  • [12] Complete coverage planning with clustering method for autonomous mobile robots
    Aydemir, Hamza
    Tekerek, Mehmet
    Gok, Mehmet
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2023, 35 (26):
  • [13] Energy Efficient Coverage Path Planning for Autonomous Mobile Robots on 3D Terrain
    Dogru, Sedat
    Marques, Lino
    2015 IEEE INTERNATIONAL CONFERENCE ON AUTONOMOUS ROBOT SYSTEMS AND COMPETITIONS (ICARSC), 2015, : 118 - 123
  • [14] Complete Coverage Path Planning for Multiple Robots for Facade Maintenance Operations
    Xie, Bicheng
    Zhang, Xiaojun
    Computer Engineering and Applications, 2023, 59 (24) : 319 - 327
  • [15] Complete Coverage Path Planning for Cleaning Task using Multiple Robots
    Lee, Jeong H.
    Choi, Jeong S.
    Lee, Beom H.
    Lee, Kong W.
    2009 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2009), VOLS 1-9, 2009, : 3618 - 3622
  • [16] Time-Efficient and Complete Coverage Path Planning Based on Flow Networks for Multi-Robots
    Janchiv, Adiyabaatar
    Batsaikhan, Dugarjav
    Kim, ByungSoo
    Lee, Won Gu
    Lee, Soon-Geul
    INTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS, 2013, 11 (02) : 369 - 376
  • [17] Time-efficient and complete coverage path planning based on flow networks for multi-robots
    Adiyabaatar Janchiv
    Dugarjav Batsaikhan
    ByungSoo Kim
    Won Gu Lee
    Soon-Geul Lee
    International Journal of Control, Automation and Systems, 2013, 11 : 369 - 376
  • [18] Efficient Coverage Path Planning for Mobile Disinfecting Robots Using Graph-Based Representation of Environment
    Nasirian, B.
    Mehrandezh, M.
    Janabi-Sharifi, F.
    FRONTIERS IN ROBOTICS AND AI, 2021, 8
  • [19] Efficient path planning for mobile robots in environments with deformable objects
    Frank, Barbara
    Becker, Markus
    Stachniss, Cyrill
    Burgard, Wolfram
    Teschner, Matthias
    2008 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-9, 2008, : 3737 - 3742
  • [20] Optimal Path Planning for Mobile Robots Using Memory Efficient A*
    Noreen, Iram
    Khan, Amna
    Habib, Zulfiqar
    PROCEEDINGS OF 14TH INTERNATIONAL CONFERENCE ON FRONTIERS OF INFORMATION TECHNOLOGY PROCEEDINGS - FIT 2016, 2016, : 142 - 146