Robot Motion Planning in an Unknown Environment with Danger Space

被引:27
作者
Jahanshahi, Hadi [1 ]
Jafarzadeh, Mohsen [2 ]
Sari, Naeimeh Najafizadeh [1 ]
Viet-Thanh Pham [3 ]
Van Van Huynh [4 ]
Xuan Quynh Nguyen [5 ]
机构
[1] Univ Tehran, Fac New Sci & Technol, Dept Aerosp Engn, Tehran 143951561, Iran
[2] Univ Texas Dallas, Dept Elect & Comp Engn, Richardson, TX 75080 USA
[3] Ton Duc Thang Univ, Fac Elect & Elect Engn, Nonlinear Syst & Applicat, Ho Chi Minh City, Vietnam
[4] Ton Duc Thang Univ, Fac Elect & Elect Engn, Modeling Evolutionary Algorithms Simulat & Artifi, Ho Chi Minh City, Vietnam
[5] Natl Council Sci & Technol Policy, Hanoi, Vietnam
关键词
robot path planning; danger space; unknown environment; modified Markov decision processes; A-ASTERISK ALGORITHM; PATH; NAVIGATION;
D O I
10.3390/electronics8020201
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper discusses the real-time optimal path planning of autonomous humanoid robots in unknown environments regarding the absence and presence of the danger space. The danger is defined as an environment which is not an obstacle nor free space and robot are permitted to cross when no free space options are available. In other words, the danger can be defined as the potentially risky areas of the map. For example, mud pits in a wooded area and greasy floor in a factory can be considered as a danger. The synthetic potential field, linguistic method, and Markov decision processes are methods which have been reviewed for path planning in a free-danger unknown environment. The modified Markov decision processes based on the Takagi-Sugeno fuzzy inference system is implemented to reach the target in the presence and absence of the danger space. In the proposed method, the reward function has been calculated without the exact estimation of the distance and shape of the obstacles. Unlike other existing path planning algorithms, the proposed methods can work with noisy data. Additionally, the entire motion planning procedure is fully autonomous. This feature makes the robot able to work in a real situation. The discussed methods ensure the collision avoidance and convergence to the target in an optimal and safe path. An Aldebaran humanoid robot, NAO H25, has been selected to verify the presented methods. The proposed methods require only vision data which can be obtained by only one camera. The experimental results demonstrate the efficiency of the proposed methods.
引用
收藏
页数:27
相关论文
共 49 条
[1]   Speeding up single-query sampling-based algorithms using case-based reasoning [J].
Abdelwahed, Mustafa F. ;
Saleh, Mohamed ;
Mohamed, Amr E. .
EXPERT SYSTEMS WITH APPLICATIONS, 2018, 114 :524-531
[2]  
[Anonymous], 2014, Markov decision processes: discrete stochastic dynamic programming
[3]  
[Anonymous], 2007, Markov Decision Processes with Their Applications
[4]  
[Anonymous], [No title captured]
[5]   Mobile robots path planning: Electrostatic potential field approach [J].
Bayat, Farhad ;
Najafinia, Sepideh ;
Aliyari, Morteza .
EXPERT SYSTEMS WITH APPLICATIONS, 2018, 100 :68-78
[6]   A MARKOVIAN DECISION PROCESS [J].
BELLMAN, R .
JOURNAL OF MATHEMATICS AND MECHANICS, 1957, 6 (05) :679-684
[7]  
Buniyamin N., 2011, Int. J. Syst. Appl. Eng. Dev., V5, P151
[8]  
Cheng D. K., 1989, FIELD WAVE ELECTROMA
[9]  
CHESTNUTT J, 2003, P IEEE INT C HUM ROB
[10]  
Choset H., 2005, Principles of Robot Motion: Theory, Algorithms, and Implementations