Autonomous mobile robot motion planning enhanced with extended configuration-space and half-planes

It is commonly argued that C-space buffering is too computationally expensive, consumes too much free space, keeps the robot too close to objects, seals off marginally traversable regions and does not allow for curved path segments. However, the research described in this paper uses half-planes and doors to extend C-space so that mobile robot global motion planning is not only safe and fluid, but also unhindered by tight passageways. Further, it is shown that free space consumption is limited to only what the robot needs to circumnavigate known obstacles.<<ETX>>

[1]  Ren C. Luo,et al.  Sonar windows and geometrically represented objects for mobile robot self-referencing , 1993, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93).

[2]  Ren C. Luo,et al.  Motion planning for mobile robots in a dynamic environment with moving obstacles , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

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

[4]  S. Sitharama Iyengar,et al.  A 'retraction' method for terrain model acquisition , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[5]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[6]  Russell H. Taylor,et al.  Planning and execution of straight line manipulator trajectories , 1979 .

[7]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[8]  S. M. Udupa,et al.  Collision Detection and Avoidance in Computer Controlled Manipulators , 1977, IJCAI.

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

[10]  Yunhui Liu,et al.  Proposal of tangent graph and extended tangent graph for path planning of mobile robots , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[11]  Richard Paul,et al.  Manipulator Cartesian Path Control , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  Yun-Hui Liu,et al.  A flexible algorithm for planning local shortest path of mobile robots based on reachability graph , 1990, EEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications.

[13]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

[14]  C. Lin,et al.  Formulation and optimization of cubic polynomial joint trajectories for industrial robots , 1983 .

[15]  Nageswara,et al.  On Terrain Model Acquisition by a Point Robot Amidst Polyhedral Obstacles , 1981 .

[16]  Bruce Randall Donald,et al.  On motion planning with six degrees of freedom: Solving the intersection problems in configuration space , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[17]  Vangalur S. Alagar,et al.  Algorithmic motion planning in robotics: Coordinated motion of several disks amidst polygonal obstacles , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[18]  S. Sitharama Iyengar,et al.  On terrain acquisition by a point robot amidst polyhedral obstacles , 1988, IEEE J. Robotics Autom..

[19]  Chandrajit L. Bajaj,et al.  Generation of Configuration Space Obstacles: Moving Algebraic Surfaces , 1990, Int. J. Robotics Res..