Automatic path planning for a mobile robot among obstacles of arbitrary shape.

A novel and fast path planning method for a mobile robot (MR) among objects of arbitrary shape is described. It comprises two phases. During the first phase, the graph including all possible collision-free paths from a top view of the environment is first obtained. During the second phase, the optimal path for the MR is then selected. For this, the proposed method uses both the fast distance transformation (FDT) and variations of some topological methods as thinning and skeletonization, to obtain the free space skeleton. Unlike conventional methods, the proposed approach is capable to include the MR and the target intrinsically in the path and, at the same time it obtains the collision-free path's graph, taking advantage of the topological concept of hole. We propose to use a logical operator over the FDT instead of the classical morphologic operators over the discrete array (erosion and dilation), to obtain a much faster algorithm. The optimal path (in terms of length) is next selected and smoothed by conventional algorithms. The resultant path is finally used as a reference by the mobile robot.

[1]  Hans Rohnert,et al.  Shortest Paths in the Plane with Convex Polygonal Obstacles , 1986, Inf. Process. Lett..

[2]  Yoram Koren,et al.  Real-time obstacle avoidance for fact mobile robots , 1989, IEEE Trans. Syst. Man Cybern..

[3]  Micha Sharir,et al.  A Survey of Motion Planning and Related Geometric Algorithms , 1988, Artificial Intelligence.

[4]  Azriel Rosenfeld,et al.  Connectivity in Digital Pictures , 1970, JACM.

[5]  M.B. Trabia Planning near-minimum-length collision-free paths for robots , 1993, IEEE Trans. Syst. Man Cybern..

[6]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[7]  Osamu Takahashi,et al.  Motion planning in a plane using generalized Voronoi diagrams , 1989, IEEE Trans. Robotics Autom..

[8]  Shyang Chang,et al.  A shortest path algorithm for a nonrotating object among obstacles of arbitrary shapes , 1993, IEEE Trans. Syst. Man Cybern..

[9]  J.M. Ibarra-Zannatha,et al.  A new roadmap approach to automatic path planning for mobile robot navigation , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.

[10]  Carme Torras,et al.  2D Path Planning: A Configuration Space Heuristic Approach , 1990, Int. J. Robotics Res..

[11]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.

[12]  G. Matheron Random Sets and Integral Geometry , 1976 .

[13]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[14]  Paul M. Griffin,et al.  Path planning for a mobile robot , 1992, IEEE Trans. Syst. Man Cybern..

[15]  A. ROSENFELD,et al.  Distance functions on digital pictures , 1968, Pattern Recognit..

[16]  Azriel Rosenfeld,et al.  Digital topology: Introduction and survey , 1989, Comput. Vis. Graph. Image Process..

[17]  Rodney A. Brooks,et al.  Solving the Find-Path Problem by Good Representation of Free Space , 1983, Autonomous Robot Vehicles.