Path planning among moving obstacles using spatial indexing

A method is presented for planning a path in the presence of moving obstacles. Given a set of polygonal moving obstacles, a path is generated for a mobile robot that navigates in the two-dimensional plane. Time is included as one of the dimensions of the model world. This allows the moving obstacles to be regarded as stationary in the extended world. For a solution to be feasible, the robot must not collide with any other moving obstacles and must navigate within the predetermined range of velocity, acceleration, and centrifugal force. A spatial index is used to facilitate geometric search for the path-planning task. Computer simulation results are presented to illustrate the feasibility of this approach.<<ETX>>

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

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

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

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

[5]  Rodney A. Brooks,et al.  Solving the find-path problem by good representation of free space , 1982, IEEE Transactions on Systems, Man, and Cybernetics.

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

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

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

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

[10]  Donald Meagher,et al.  Geometric modeling using octree encoding , 1982, Comput. Graph. Image Process..

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

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

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

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

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

[16]  A WesleyMichael,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979 .

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

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

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

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

[21]  Tomás Lozano-Pérez,et al.  On multiple moving objects , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

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