Methodology for Path Planning and Optimization of Mobile Robots: A Review

被引:149
作者
Zafar, Mohd. Nayab [1 ]
Mohanta, J. C. [1 ]
机构
[1] Motilal Nehru Natl Inst Technol, Dept Mech Engn, Allahabad 211004, Uttar Pradesh, India
来源
INTERNATIONAL CONFERENCE ON ROBOTICS AND SMART MANUFACTURING (ROSMA2018) | 2018年 / 133卷
关键词
Mobile Robot; Path Planning; Classical Methods; AI Techniques; Optimization Methods; PARTICLE SWARM OPTIMIZATION; PROBABILISTIC ROADMAP; ENVIRONMENT; NAVIGATION; ALGORITHM; OBSTACLE; COLONY;
D O I
10.1016/j.procs.2018.07.018
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Mobile robotics research is an emerging area since last three decades. The present research on mobile robotics addresses the problems which are mainly on path planning algorithm and optimization in static as well as dynamic environments. A detailed review has been made in the broad field of mobile robotic research especially focussing on the path planning strategy in various cluttered environments, their advantages and disadvantages of each of these strategies/methods have been highlighted. The path planning strategy of mobile robots can be categorised as Classical Methods and Heuristic Methods. Further subcategorized as (i) Analytical Methods, (ii) Enumerative Methods, (iii) Evolutionary Methods and (iv) Meta-Heuristic Methods. Each of these aforesaid methods has its own advantages and disadvantages. However, the main weakness arises from the fact that, analytical methods are too complex for intangible applications, whereas the enumerative methods are anxious by the extent of the search space. On the other hand, when search space is too large in path planning strategy, many evolutionary methods have been shown to be ineffective. To overcome these drawbacks, meta-heuristic methods have been fascinating considerably in this broad field of research. Many techniques are developed in path planning for mobile robot worldwide, however, the most commonly used techniques are presented here for further study. (C) 2018 The Authors. Published by Elsevier Ltd.
引用
收藏
页码:141 / 152
页数:12
相关论文
共 77 条
[1]  
[Anonymous], 1995, Artificial Intelligence
[2]  
[Anonymous], CSM404 U ESS
[3]  
[Anonymous], FDN COMP SCI 26 ANN
[4]  
[Anonymous], 1985, Computational Geometry, DOI [10.1016/B978-0-444-87806-9.50012-8, DOI 10.1016/B978-0-444-87806-9.50012-8]
[5]   A microscopic model of ballistic-diffusive crossover [J].
Bagchi, Debarshee ;
Mohanty, P. K. .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2014,
[6]  
BARBEHENN M, 1995, IROS '95 - 1995 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS: HUMAN ROBOT INTERACTION AND COOPERATIVE ROBOTS, PROCEEDINGS, VOL 3, P39, DOI 10.1109/IROS.1995.525859
[7]  
Beard Randal W., 2003, MOTION PLANNING USIN
[8]  
Bhattacharjee Preetha, 2011, IEEE NAT BIOL INSP C
[9]  
Bohlin Robert, 2000, P 2000 IEEE INT C RO
[10]  
Canny J., 1988, The complexity of robot motion planning.