Journal of Mechanical Science and Technology

The Korean Society of Mechanical Engineers (대한기계학회)
권호 표지

Path Space Approach for Planning 2D Shortest Path Based on Elliptic Workspace Geometry Mapping

  • Published : 2004.01.01
Download PDF
⟨ Previous Next ⟩

Abstract

A new algorithm for planning a collision-free path based on algebraic curve is developed and the concept of collision-free Path Space (PS) is introduced. This paper presents a Geometry Mapping (GM) based on two straight curves in which the intermediate connection point is organized in elliptic locus ($\delta$, $\theta$). The GM produces two-dimensional PS that is used to create the shortest collision-free path. The elliptic locus of intermediate connection point has a special property in that the total distance between the focus points through a point on ellipse is the same regardless of the location of the intermediate connection point on the ellipse. Since the radial distance, a, represents the total length of the path, the collision-free path can be found as the GM proceeds from $\delta$=0 (the direct path) to $\delta$=$\delta$$\_$max/(the longest path) resulting in the minimum time search. The GM of elliptic workspace (EWS) requires calculation of interference in circumferential direction only. The procedure for GM includes categorization of obstacles to .educe necessary calculation. A GM based on rectangular workspace (RWS) using Cartesian coordinate is also considered to show yet another possible GM. The transformations of PS among Circular Workspace Geometry Mapping (CWS GM) , Elliptic Workspace Geometry Mapping (EWS GM) , and Rectangular Workspace Geometry Mapping (RWS GM), are also considered. The simulations for the EWS GM on various computer systems are carried out to measure performance of algorithm and the results are presented.

Keywords

References

  1. Alsultan, K. S. and Aliyu, M. D. S., 1996, 'A New Potential Field-Based Algorithm For Path Planning,' Journal of Intelligent & Roboti Systems, Vol. 17, No. 3, pp. 265-282 https://doi.org/10.1007/BF00339664
  2. Barbehenn, M. and Hutchinson, S., 1995, 'A Efficient Searh and Hierarchical Motion Planning by Dynamically Maintaining Single-Source Shortest Paths Trees,' IEEE Transactions on Robotics and Automation, Vol. 11, No. 2, pp. 198-214 https://doi.org/10.1109/70.370502
  3. Barraquand, J. and Latombe, J. C., 1991, 'Robot Motion Planning : A Distributed Representation Approach,' International Jouranl of Robotics Researh, Vol. 10 No. 6, pp. 460-468 https://doi.org/10.1177/027836499101000604
  4. Bernabeu, E. J. and Tornero, J., 2000, 'Optimal geometric modeler for robot motion planning,' Journal of Robotic Systems, Vol. 17, No. 11, pp. 593-608 https://doi.org/10.1002/1097-4563(200011)17:11<593::AID-ROB2>3.0.CO;2-9
  5. Bezier, P., 1972, Numerical Control-Mathematics and Application, Translated by A. R. Forrest and A. F. Pankhurst, John Wiley & Sons, New York
  6. Fujimura, K., 1994, 'Motion Planning Amid Transient Obstacles,' International Journal of Robotics Research, Vol. 13 No. 5, pp. 395-407 https://doi.org/10.1177/027836499401300502
  7. Ge, S. S. and Cui, Y. J., 2000, 'New Potential Functions for Mobile robot path Planning,' IEEE Transations on Robotics & Automation, Vol. 16, No. 5, pp. 615-620 https://doi.org/10.1109/70.880813
  8. Ge, S. S. and Cui, Y. J., 2002, 'Dynamic Motion Planning for Mobile Robots Using Potential Field Method,' Autonomous Robots, No. 13, Vol. 3, pp. 207-222 https://doi.org/10.1023/A:1020564024509
  9. Hwang, Y. K. and Ahuja, N., 1992, 'A Potential Field Approach to Path Planing,' IEEE Transactions on Robotics and Automation, Vol. 8, No. 1, pp. 23-32 https://doi.org/10.1109/70.127236
  10. Jiang, K. C., Seneviratne, L. D. and Earles, S. W. E., 1999, 'A Shortest Path Based Path Planning Algorithm for Nonholonomic Mobile Robots,' Journal of Intelligent & Robotic Systems, Vol. 24, No. 4, pp. 347-366 https://doi.org/10.1023/A:1008070923246
  11. Jun, S. and Shin, K. G., 1991, 'Shortest Path Planing in Discretized Workspaces Using Dominance Relation,' IEEE Transactions on Robotics and Automation, Vol. 7, No. 3, pp. 342-518 https://doi.org/10.1109/70.88143
  12. Jung, D. and Gupta, K. K., 1997, 'Octree-Based Hierarhical Distance Maps For Collision Detection,' Journal of Robotic Systems, Vol. 14, No. 11, pp. 789-806 https://doi.org/10.1002/(SICI)1097-4563(199711)14:11<789::AID-ROB3>3.0.CO;2-Q
  13. Kambhampati, S. and Davis, L. S., 1986, 'Multiresolution Path Planning for Mobile Robot,' IEEE Journal of Robotics and Automation, Vol. RA-2, No. 3, pp. 135-145
  14. Khatib, O., 1986, 'Real-Time Obstacle Avoidance for Manipulators and Mobile Robots,' International Journal of Robotic Research, Vol. 5, No. 1, pp. 90-98 https://doi.org/10.1177/027836498600500106
  15. Khosla, P. and Volpe, R., 1988, 'Superquadric Artificial Potential for Obstacle Avoidance and Approach,' IEEE Proc. Int. Conf. on Robotics and Automation, Philadelphia, pp. 1778-1784 https://doi.org/10.1109/ROBOT.1988.12323
  16. Koditschek, D. E. and Rimon, E., 1992, 'Exact Robot Navigation Using Artifiial Potential Function,' IEEE Transactions on Robotis and Automation, Vol. 8, No. 5, pp. 501-518 https://doi.org/10.1109/70.163777
  17. Li, Z. X. and Bui, T. D., 1998, 'Robot Path Planning Using Fluid Model,' Journal of Intelligent & Robotic Systems, Vol. 21, No. 1, pp. 29-50 https://doi.org/10.1023/A:1007963408438
  18. Lozano-Perez, T. and Wesley, M. A., 1979, 'An Algorithm for Planning Collision-Free Paths Among Polyhedral Obstacles,' Communications of ACM, Vol. 22, No. 10, pp. 560-570 https://doi.org/10.1145/359156.359164
  19. Lozano-perez, T., 1981, 'Automatic Planning of Manipulator Transfer Movements,' IEEE Trans. System, Man, and Cybernetics, Vol. SMC-11, No. 10, pp. 681-698
  20. Lynch, K. M., Shiroma, N., Arai, H. and Tanie, K., 2000, 'Collision-Free Trajectory Planning For A 3-Dof Robot With A Passive Joint,' International Jouranl of Robotics Research, Vol. 19, No. 12, pp. 1171-1184 https://doi.org/10.1177/02783640022068011
  21. Mansor, M. A. and Morris, A. S., 1999, 'Path Planning in Unknown Environment with Obstacles Using Virtual Window,' Journal of Intelligent & Robotic Systems, Vol. 24, No. 3, pp. 235-251 https://doi.org/10.1023/A:1008047425796
  22. Moutarlier, P., Mirtich, B. and Canny, J., 1996, 'Shortest Paths for a Car-like Robot to Manifolds in onfiguration Space,' International Journal of Robotics Research, Vol. 15, No. 1, pp. 36-60 https://doi.org/10.1177/027836499601500103
  23. Namgung, I. and Duffy, J., 1997, 'Two Dimensional Collision-Free Path Planning Using Linear Parametric Curve,' Journal of Robotic Systems, Vol. 14, No. 9, pp. 659-673 https://doi.org/10.1002/(SICI)1097-4563(199709)14:9<659::AID-ROB3>3.0.CO;2-K
  24. Nampung, I., 1996, 'A Global Collision-Free Path Planning Using Parametric Parabola Through Geometry Mapping of Obstacles in Robot Work Space,' KSME International Journal, Vol. 10, No. 4, pp. 443-449 https://doi.org/10.1007/BF02942780
  25. Namgung, I., 1989, 'Planning Collision-Free Paths with Applications to Robot Manipulators,' Ph. D. Dissertation, University of Florida
  26. Nearchou, A. C. and Aspragathos, N. A., 1998, 'Collision-Free Cartesian Trajectory Generation Using Raster Scanning And Genetic Algorithm,' Journal of Intelligent & Robotic Systems, Vol. 23, No. 2-4, pp. 351-377 https://doi.org/10.1023/A:1008001930450
  27. Ong, C. J. and Gilbert, E. G., 1998, 'Robot path planning with penetration growth distance,' Journal of Robotic Systems, Vol. 15, No. 2, pp. 57-74 https://doi.org/10.1002/(SICI)1097-4563(199802)15:2<57::AID-ROB1>3.0.CO;2-R
  28. Rogers, D. F. and Adams, J. A., 1990, Mathematical Elements for Computer Graphics, 2nd Ed., McGraw-Hill, New York
  29. Singth, J. S. and Wagh, M. D., 1987, 'Robot Path Planing Using Intersecting Convex Shapes: Analysis and Simulation,' IEEE Journal of Robotics and Automation, Vol. RA-3, No. 2, pp. 101-108
  30. Szczerba, R. J., Chen, D. Z. and Uhran, J. J., 1998, 'Planning Shortest Paths among 2D and 3D Weighted Regions Using Framed-Subspaces,' International Journal of Robotics Research, Vol. 17, No. 5, pp. 531-546 https://doi.org/10.1177/027836499801700505
  31. Wang, D. and Hamam, Y., 1992, 'Optimal Tranjectory Planning of Manipulators With Collision Detection and Avoidance,' International Journal of Robotics Research, Vol. 11, No. 5, pp. 460-468 https://doi.org/10.1177/027836499201100503
  32. Wu, Y. F., Widmayer, P., Schlag, M. D. F. and Wong, C. K., 1987, 'Rectilinear Shortest Path and Minimum Spanning Trees in the Presence of Rectilinear Obstacles,' IEEE Trans. On Computer, Vol. C-36, No. 3, pp. 321-331 https://doi.org/10.1109/TC.1987.1676904
  33. Xue, Q., Sheu, P. C. Y., Maciejewski, A. A. and Chien, S. Y. P., 1996, 'Planning Of Collision-Free Paths For A Reconfigurable Dual manipulator Equipped Mobile Robot,' Journal of Intelligent & Robotic Systems, Vol. 17, No. 3, pp. 223-242 https://doi.org/10.1007/BF00339662
  34. Zelinsky, A., 1994, 'Using Path Transforms to Guide the Search for Findpath in 2D,' International Journal of Robotics Research, Vol. 13, No. 5, pp. 395-407 https://doi.org/10.1177/027836499401300403