A rolling method for complete coverage path planning in uncertain environments

被引:0
|
作者
Qiu, XN [1 ]
Liu, SR [1 ]
Yang, SX [1 ]
机构
[1] Ningbo Univ, Res Inst Automat, Ningbo 315211, Zhejiang, Peoples R China
关键词
mobile robot; biologically inspired neural networks; rolling windows; heuristic algorithm;
D O I
暂无
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
Motion planning with obstacles avoidance in uncertain environments is an essential issue in robotics. Complete coverage path planning of a mobile robot requires to pass through every area in the workspace with the robot as collision-free, which has many applications, e.g., various cleaning robots, painter robots, automated harvesters, land mine detectors and so on. A novel planning method integrating rolling windows and biologically inspired neural networks is proposed in this paper. The real-time environmental information can be represented by the dynamic activity landscape of the biological neural network. The rolling window approach is used to detect the local environments. Thus, a heuristic planning algorithm is performed on-line in rolling strategy. Three cases on complete coverage path planning in uncertain environments and the comparison of the proposed method and the planning approach based on the biologically inspired neural networks are studied by simulations. Simulation results show that the proposed method is capable of planning collision-free complete covet-age robot motion path.
引用
收藏
页码:146 / 151
页数:6
相关论文
共 50 条
  • [41] Complete coverage path planning of mobile robots for humanitarian demining
    Dakulovic, Marija
    Petrovic, Ivan
    INDUSTRIAL ROBOT-THE INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH AND APPLICATION, 2012, 39 (05): : 484 - 493
  • [42] Complete Coverage Path Planning and Obstacle Avoidance Strategy of the Robot
    Wu, JunHui
    Qin, TongDi
    Chen, Jie
    Si, HuiPing
    Lin, KaiYan
    Zhou, Qiang
    Zhang, ChiBin
    PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION APPLICATIONS (ICCIA 2012), 2012, : 346 - 351
  • [43] Complete Coverage Path Planning for Data Collection with Multiple UAVs
    Chen, Yuhong
    Mou, Zhiyu
    Lin, Bo
    Zhang, Tengyu
    Gao, Feifei
    2024 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, WCNC 2024, 2024,
  • [44] Complete coverage path planning based on secondary area division
    Jiang L.
    Zhang Y.
    Ma X.
    Zhu J.
    Lei B.
    Harbin Gongcheng Daxue Xuebao/Journal of Harbin Engineering University, 2022, 43 (10): : 1483 - 1490
  • [45] DISCRETE BIOINSPIRED NEURAL NETWORK FOR COMPLETE COVERAGE PATH PLANNING
    Zhang, Jianfeng
    Lv, Houyong
    He, Dongjian
    Huang, Lvwen
    Dai, Yuan
    Zhang, Zhiyong
    INTERNATIONAL JOURNAL OF ROBOTICS & AUTOMATION, 2017, 32 (02): : 186 - 193
  • [46] A solution to vicinity problem of obstacles in complete coverage path planning
    Luo, CM
    Yang, SX
    Stacey, DA
    Jofriet, JC
    2002 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS I-IV, PROCEEDINGS, 2002, : 612 - 617
  • [47] Research on complete coverage path planning algorithms based on A* Algorithms
    Cai, Zengyu
    Li, Shuxia
    Gan, Yong
    Zhang, Ran
    Zhang, Qikun
    Open Cybernetics and Systemics Journal, 2014, 8 (01): : 418 - 426
  • [48] Complete Coverage Path Planning Based on Ant Colony Algorithm
    Zhang Chibin
    Wang Xingsong
    Du Yong
    2008 15TH INTERNATIONAL CONFERENCE ON MECHATRONICS AND MACHINE VISION IN PRACTICE (M2VIP), 2008, : 346 - 350
  • [49] An Algorithm of Complete Coverage Path Planning for Autonomous Underwater Vehicles
    Yan, Mingzhong
    Zhu, Daqi
    MATERIALS, MECHATRONICS AND AUTOMATION, PTS 1-3, 2011, 467-469 : 1377 - 1385
  • [50] 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