A hierarchical strategy for path planning among moving obstacles [mobile robot]

Absrracr-A method is presented for planning a path in the presence of moving obstacles. Given a set of polygonal moving obstacles, we focus on generating a path for a mobile robot that navigates in the twodimensional plane. Our methodology is to include time as one of the dimensions of the model world. This allows us to regard the moving obstacles as being stationary in the extended world. For a solution to be feasible, the robot must not collide with any other moving obstacles, and, also, it must navigate without exceeding the predetermined range of velocity, acceleration, and centrifugal force. We investigate an appropriate model to represent the extended world for the path planning task, and give a time-optimal solution using this model.

[1]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Pere Brunet,et al.  Object representation by means of nonminimal division quadtrees and octrees , 1985, TOGS.

[3]  Rodney A. Brooks,et al.  A Robust Layered Control Syste For A Mobile Robot , 2022 .

[4]  F. Andresen,et al.  Visual algorithms for autonomous navigation , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[5]  Hanan Samet,et al.  Storing a collection of polygons using quadtrees , 1985, TOGS.

[6]  Hanan Samet,et al.  Neighbor finding techniques for images represented by quadtrees , 1982, Comput. Graph. Image Process..

[7]  Alistair C. Kilgour,et al.  An Integer Method for the Graphical Output of Conic Sections , 1983, TOGS.

[8]  John F. Canny,et al.  Collision Detection for Moving Polyhedra , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  J. Vanrosendale,et al.  An intersection algorithm for moving parts , 1984 .

[10]  S. Zucker,et al.  Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .

[11]  Martin Herman,et al.  Fast, three-dimensional, collision-free motion planning , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[12]  John F. Canny,et al.  New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[13]  Micha Sharir,et al.  Motion Planning in the Presence of Moving Obstacles , 1985, FOCS.

[14]  Sargur N. Srihari,et al.  A hierarchical data structure for multidimensional digital images , 1983, CACM.

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

[16]  Robert C. Bolles,et al.  Epipolar-plane image analysis: a technique for analyzing motion sequences , 1987 .

[17]  Narendra Ahuja,et al.  PATH PLANNING IN A THREE DIMENSIONAL ENVIRONMENT. , 1984 .

[18]  Larry S. Davis,et al.  Multiresolution path planning for mobile robots , 1986, IEEE J. Robotics Autom..

[19]  Hans P. Moravec,et al.  The Stanford Cart and the CMU Rover , 1983, Proceedings of the IEEE.

[20]  Ingrid Carlbom,et al.  A Hierarchical Data Structure for Representing the Spatial Decomposition of 3-D Objects , 1985, IEEE Computer Graphics and Applications.

[21]  Tomás Lozano-Pérez,et al.  Automatic Planning of Manipulator Transfer Movements , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

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

[23]  James L. Crowley,et al.  Navigation for an intelligent mobile robot , 1985, IEEE J. Robotics Autom..

[24]  Requicha,et al.  Solid Modeling: A Historical Summary and Contemporary Assessment , 1982, IEEE Computer Graphics and Applications.

[25]  Tosiyasu L. Kunii,et al.  A Hierarchical Space Indexing Method , 1985 .

[26]  Hanan Samet,et al.  Bintrees, CSG trees, and time , 1985, SIGGRAPH.