Path Planning of Arbitrary Shaped Mobile Robots With Safety Consideration

被引:11
作者
Zhao, Zhan [1 ]
Jin, Mingzhi [1 ]
Lu, En [1 ]
Yang, Simon X. [2 ]
机构
[1] Jiangsu Univ, Sch Agr Engn, Zhenjiang 212013, Jiangsu, Peoples R China
[2] Univ Guelph, Sch Engn, Adv Robot & Intelligent Syst Lab, Guelph, ON N1G 2W1, Canada
基金
中国国家自然科学基金;
关键词
Robots; Path planning; Mobile robots; Safety; Shape; Planning; Collision avoidance; Mobile robot; arbitrary shaped; path planning; obstacle avoidance; safety factor; biological neural dynamics; convolutional neural network; A-ASTERISK; ALGORITHM; ENVIRONMENTS; NETWORKS; SYSTEM; SLAM;
D O I
10.1109/TITS.2021.3128411
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
This paper presents a neural network-based approach for the path planning of arbitrary shaped mobile robots in complex environments, with the consideration of safety. A 2D workspace is discretized to a topologically organized map using a biological neural network, in which the dynamic neural activity landscape represents the environmental information. A set of kernel matrices are established to describe the shape and orientation features of the robot. Taking the safety factor into consideration, the translation and rotation performances of the robot on each neuron node of the workspace are determined using a convolutional neural network (CNN). Then, from the initial state of the robot to the target state, a node rooted tree is constructed by searching the adjacent neurons, and the moving path of the robot is generated by backward searching the node rooted tree. By changing the bias coefficient in the convolutional calculation, the clearance between the planned path and the obstacles can be conveniently adjusted. The effectiveness of the proposed method is demonstrated through several simulations conducted in both static and dynamic environments. The results show that the method can effectively solve the ``path blocked'' issue caused by small densely scattered obstacles, and also solve the ''too close'' and ''too far'' path planning problems.
引用
收藏
页码:16474 / 16483
页数:10
相关论文
共 52 条
[41]   Heuristic approaches in robot path planning: A survey [J].
Thi Thoa Mac ;
Copot, Cosmin ;
Duc Trung Tran ;
De Keyser, Robin .
ROBOTICS AND AUTONOMOUS SYSTEMS, 2016, 86 :13-28
[42]   Learning image-based spatial transformations via convolutional neural networks: A review [J].
Tustison, Nicholas J. ;
Avants, Brian B. ;
Gee, James C. .
MAGNETIC RESONANCE IMAGING, 2019, 64 :142-153
[43]   An efficient dynamic system for real-time robot-path planning [J].
Willms, Allan R. ;
Yang, Simon X. .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2006, 36 (04) :755-766
[44]   Path planning in complex 3D environments using a probabilistic roadmap method [J].
Yan F. ;
Liu Y.-S. ;
Xiao J.-Z. .
International Journal of Automation and Computing, 2013, 10 (06) :525-533
[45]   A roadmap construction algorithm for mobile robot path planning using skeleton maps [J].
Yang, Dong-Hoon ;
Hong, Suk-Kyo .
ADVANCED ROBOTICS, 2007, 21 (1-2) :51-63
[46]   An efficient neural network method for real-time motion planning with safety consideration [J].
Yang, SX ;
Meng, M .
ROBOTICS AND AUTONOMOUS SYSTEMS, 2000, 32 (2-3) :115-128
[47]   A Dynamic Path Planning Approach for Multirobot Sensor-Based Coverage Considering Energy Constraints [J].
Yazici, Ahmet ;
Kirlik, Gokhan ;
Parlaktuna, Osman ;
Sipahioglu, Aydin .
IEEE TRANSACTIONS ON CYBERNETICS, 2014, 44 (03) :305-314
[48]   Recursive Path Planning Using Reduced States for Car-Like Vehicles on Grid Maps [J].
Yoon, Sangyol ;
Yoon, Sung-Eui ;
Lee, Unghui ;
Shim, David Hyunchul .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2015, 16 (05) :2797-2813
[49]   USING PATH TRANSFORMS TO GUIDE THE SEARCH FOR FINDPATH IN 2D [J].
ZELINSKY, A .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 1994, 13 (04) :315-325
[50]   An Efficient Fine-to-Coarse Wayfinding Strategy for Robot Navigation in Regionalized Environments [J].
Zhong, Chaoliang ;
Liu, Shirong ;
Lu, Qiang ;
Zhang, Botao ;
Yang, Simon X. .
IEEE TRANSACTIONS ON CYBERNETICS, 2016, 46 (12) :3157-3170