MOBILE ROBOT A Complete Framework for 2D-path Planning and Motion Planning

被引:0
|
作者
Zuffanti, Giuseppe [1 ,2 ]
Scozzafava, Costantino [3 ]
机构
[1] Inst Sci Interchange Fdn, Lagrange Project, CRT Fdn, I-10133 Turin, Italy
[2] Univ Turin, Dept Comp Sci, Turin, Italy
[3] Erxa Srl, I-10149 Turin, Italy
关键词
Path planning; Motion planning; Roadmap graph; Potential field; Look-ahead; Obstacle avoidance; Attraction point; Dynamice nvironment;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this work we focus on the problem of 2D path planning and motion planning for a mobile robot. The goodness of a path planning and motion planning methods can be evaluated primarily through the parameters such as safety of generated trajectory speeds and robustness against dynamic changes of the environment. In all applications that use mobile robots, the motion planning problem is of crucial importance. According to different applications one can put emphasis on the previous characteristics listed, potentially to the detriment of the others. Typically, methods that generate high trajectory speeds for the navigating robot appears to be less robust and safe. The importance that the path planning and the motion planning problem play in practical applications is also demonstrated by the several techniques developed to tackle them. We propose a complete framework which creates a clear shortest path for a robot in an environment with static obstacles and generates, in real time, the accurate trajectory taking into account the presence of dynamics obstacles. Application of the framework to the case of a differential drive robot in a dynamic indoor environment is shown and the proposed approach has been tested both with simulation and real
引用
收藏
页码:417 / 426
页数:10
相关论文
共 50 条
  • [1] A method for complete coverage path planning of mobile robot
    Wang, Jian
    Chen, Weidong
    Zhao, Heming
    [J]. Jisuanji Gongcheng/Computer Engineering, 2005, 31 (22): : 162 - 163
  • [2] Path planning based on motion constraints for mobile robot
    Chen Y.
    Jiang W.
    Yang L.
    Luo Z.
    [J]. Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2023, 29 (04): : 1186 - 1193
  • [3] PATH PLANNING FOR A MOBILE ROBOT
    ALEXOPOULOS, C
    GRIFFIN, PM
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1992, 22 (02): : 318 - 322
  • [4] Research on Mobile Robot's Motion Control and Path Planning
    Cui, Shigang
    Xu, Xuelian
    Zhao, Li
    Tian, Liguo
    Yang, Genghuang
    [J]. ADVANCES IN NEURAL NETWORKS - ISNN 2009, PT 3, PROCEEDINGS, 2009, 5553 : 197 - +
  • [5] 3-D Path Planning for a Mobile Robot
    Wang Wei
    Guo Cunsheng
    Wei Shimin
    [J]. 2010 8TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA), 2010, : 756 - 760
  • [6] A framework of mobile robot path planning with ant colony optimization
    Zhao, D. B.
    Yi, J. Q.
    [J]. DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2006, 13E : 2009 - 2014
  • [7] Simulation of mobile robot motion path planning for robot of different 2D configurations using Dijkstra algorithm
    Viswanath, DS
    Rajaprakash, BM
    Muralidhara, BK
    Basalalli, VK
    [J]. MODERN TRENDS IN MANUFACTURING TECHNOLOGY, 1998, : 208 - 214
  • [8] A Framework for Planning Comfortable and Customizable Motion of an Assistive Mobile Robot
    Gulati, Shilpa
    Jhurani, Chetan
    Kuipers, Benjamin
    Longoria, Raul
    [J]. 2009 IEEE-RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, 2009, : 4253 - +
  • [9] A complete coverage path planning method for mobile robot in uncertain environment
    Qiu, Xuena
    Song, Jiatao
    Zhang, Xuejun
    Liu, Shirong
    [J]. WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 55 - 55
  • [10] Heuristic template approach to complete coverage path planning of mobile robot
    Liu, SR
    Qiu, XN
    Yang, SX
    [J]. DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2005, 1 : 358 - 363