Path Planning through Maze Routing for a Mobile Robot with Nonholonomic Constraints

被引:0
作者
Makhal, Abhijit [1 ]
Raj, Manish [1 ]
Singh, Karan [1 ]
Chakraborty, P. [1 ]
Nandi, G. C. [1 ]
机构
[1] Indian Inst Informat Technol, Robot & Artificial Intelligence Lab, Allahabad 211012, Uttar Pradesh, India
来源
2012 9TH INTERNATIONAL CONFERENCE ON UBIQUITOUS ROBOTS AND AMBIENT INTELLIGENCE (URAL) | 2012年
关键词
Path Planning; Maze Routing; ROS; Lee's Algorithm; Nonholonomic Mobile Robot;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
A comprehensive technique to plan path for a mobile robot with nonholonomic constraints through maze routing technique has been presented. Our robot uses a stereo vision based approach to detect the obstacles by creating dense 3D point clouds from the stereo images. ROS packages have been implemented on the robot for specific tasks of providing: i) Linear and angular velocity commands, ii) Calibration and rectification of the stereo images for generating point clouds, iii) Simulating the URDF (Unified Robot Description Format) module in real time, with respect to the real robot and iv) For visualizing the sensor data. For efficient path planning a hybrid technique using Lee's algorithm, modified by Hadlock and Soukup's algorithm has been implemented. Different path planning results have been shown using the maze routing algorithms. Preliminary results shows that Lee's algorithm is more time consuming in comparison with other algorithms. A hybrid of Lee's with Soukup's algorithm is more efficient but unpredictable for minimal path. A hybrid of Lee's with Hadlock's algorithm is the most efficient and least time consuming.
引用
收藏
页码:325 / 331
页数:7
相关论文
共 15 条
[1]  
Bradski G, LEARNING OPENCV
[2]  
Chen Shan-shan, 2011, 2011 IEEE 3rd International Conference on Communication Software and Networks (ICCSN 2011), P403, DOI 10.1109/ICCSN.2011.6014298
[3]  
Copertari L., 2007, REV DIGITAL U AUTONO, V3
[4]  
Fierro R, 1997, J ROBOTIC SYST, V14, P149, DOI 10.1002/(SICI)1097-4563(199703)14:3<149::AID-ROB1>3.0.CO
[5]  
2-R
[6]   SHORTEST PATH ALGORITHM FOR GRID GRAPHS [J].
HADLOCK, FO .
NETWORKS, 1977, 7 (04) :323-334
[7]  
Latombe J.-C., NONHOLONOMIC MULTIBO
[8]  
Lee C.Y., 1961, IRE Trans. Electron. Comput, V3, P346, DOI [10.1109/TEC.1961.5219222, DOI 10.1109/TEC.1961.5219222]
[9]  
Lewis F.L., 1993, Control of robot manipulators
[10]  
Quigley Morgan, 2009, ROS OP SOURC ROB OP