Trajectory planning for a car-like robot by environment abstraction

被引:27
作者
Ghita, Narcis [1 ]
Kloetzer, Marius [1 ]
机构
[1] Tech Univ Gheorghe Asachi Iasi, Dept Automat Control & Appl Informat, Iasi, Romania
关键词
Path planning; Car-like robot; Nonholonomic robot; Path following; MOTION; PATHS;
D O I
10.1016/j.robot.2011.12.004
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This work proposes a fully automatic planning and control strategy for solving a navigation problem for a car-like robot with non-negligible size and constraint control inputs. The approach uses cell decompositions for abstracting the robot behavior to a final state description on which the planning problem is solved. As part of the solution, we obtain a ranking of different cell decomposition types that are suitable for planning the motion of a car-like robot. The originality of our method mainly comes from the iterative procedure for finding a feasible path based on cell decompositions. Although the approach is not complete, it benefits from a fully-automatic planning and control strategy and from a reduced computational complexity. The solution is implemented as a user-friendly freely-downloadable MATLAB package. This may come as a handy tool for employing the strategy for automatic planning and control of a car-like robot in a real scenario. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:609 / 619
页数:11
相关论文
共 38 条
[1]  
[Anonymous], ROBOTICS SCI SYSTEMS
[2]  
[Anonymous], 2006, Planning algorithms
[3]   Discrete abstractions for robot motion planning and control in polygonal environments [J].
Belta, C ;
Isler, V ;
Pappas, GJ .
IEEE TRANSACTIONS ON ROBOTICS, 2005, 21 (05) :864-874
[4]   Symbolic planning and control of robot motion - Finding the missing pieces of current methods and ideas [J].
Belta, Calin ;
Bicchi, Antonio ;
Egerstedt, Magnus ;
Frazzoli, Emilio ;
Klavins, Eric ;
Pappas, George J. .
IEEE ROBOTICS & AUTOMATION MAGAZINE, 2007, 14 (01) :61-70
[5]  
Chatti A., 2005, Studies in Informatics and Control, V14, P221
[6]   A framed-quadtree approach for determining Euclidean shortest paths in a 2-D environment [J].
Chen, DZ ;
Szczerba, RJ ;
Uhran, JJ .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1997, 13 (05) :668-681
[7]  
Chita N., 2010, B I POLITEHNIC DIN L, VLVI (LX), P81
[8]  
Choset H., 2005, Principles of robot motion: theory, algorithms, and implementation
[9]  
Conner DC, 2007, 2007 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-9, P578
[10]  
De Berg M., 2008, Computational Geometry: Algorithms and Applications, V17