Journal of KIISE:Computing Practices and Letters (한국정보과학회논문지:컴퓨팅의 실제 및 레터)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Single-Query Probabilistic Roadmap Planning Algorithm using Remembering Exploration Method

기억-탐험 방법을 이용한 단일-질의 확률 로드맵 계획 알고리즘

  • Received : 2009.12.21
  • Accepted : 2010.02.02
  • Published : 2010.04.15
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper we propose a new single-query path planning algorithm for working well in high-dimensional configuration space. With the notice of the similarity between single-query algorithms with exploration algorithms, we propose a new path planning algorithm, which applies the Remembering Exploration method, which is one of exploration algorithms, to a path-planning problem by selecting a node from a roadmap, finding out the neighbor nodes from the node, and then inserting the neighbor nodes into the roadmap, recursively. For the performance comparison, we had experiments in 2D and 3D environments and compared the time to find out the path. In the results our algorithm shows the superior performance than other path planning algorithms.

고차원의 구성 공간 상에서 빠르게 동작하는 경로 계획을 위하여, 본 논문에서는 단일-질의 알고리즘의 일종인 새로운 경로 계획 알고리즘을 제안한다. 단일-질의 알고리즘의 동작과 탐험 알고리즘의 유사성에 주목하여 탐험 알고리즘의 하나인 기억-탐험(Remembering Exploration) 방법을 응용하여, 로드맵의 한 노드를 선택하여 그 주위의 자유 공간상에 있는 노드들을 새로 로드맵에 추가하는 방법으로 로드맵을 키워나가는 것이 본 논문이 제안하는 알고리즘이다. 성능 평가를 위하여 2차원 공간상에서의 경로 계획 문제와 3차원 공간상의 움직임 계획 문제를 제안하는 알고리즘과 다른 잘 알려진 알고리즘을 이용하여 성능 비교 실험을 하였으며, 경로의 발견 유무와 발견하기까지의 시간 비교를 한 결과 제안하는 알고리즘의 성능 우위를 확인할 수 있었다.

Keywords

References

  1. J.-C. Latombe, Robot Motion Planning. Kluwer Academic, Boston, 1991.
  2. S. M. LaValle, Planning Algorithms. Cambridge University Press, 2006.
  3. V. J. Lumelsky and A. A. Stepanov, "Pathplanning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape," pp.363-390, 1990.
  4. I. Kamon and E. Rivlin, "Sensory based motion planning with global proofs," in Intelligent Robots and Systems 95. 'Human Robot Interaction and Cooperative Robots,' Proceedings. 1995 IEEE/RSJ International Conference on, vol.2, pp.435-440, Aug 1995.
  5. J. Borenstein and Y. Koren, "The vector field histogram-fast obstacle avoidance for mobile robots," Robotics and Automation, IEEE Transactions on, vol.7, no.3, pp.278-288, Jun 1991. https://doi.org/10.1109/70.88137
  6. O. Khatib, "Real-time obstacle avoidance for manipulators and mobile robots," The International Journal of Robotics Research, vol.5, pp.90-98, 1986.
  7. R. V. Benson, Euclidean Geometry and Convexity. New York: McGraw-Hill, 1966.
  8. J. A. Storer and J. H. Reif, "Shortest paths in the plane with polygonal obstacles," J. ACM, vol.41, no.5, pp.982-1012, 1994. https://doi.org/10.1145/185675.185795
  9. T. Lozano-Perez, "Spatial planning: A configuration space approach."
  10. J. H. Reif, "Complexity of the mover's problem and generalizations," in Foundations of Computer Science, 1979., 20th Annual Symposium on, Oct. pp.421-427, 1979.
  11. L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. H. Overmars, "Probabilistic roadmaps for path planning in high dimensional configuration spaces," IEEE Transactions on Robotics and Automation, vol.12, no.4, pp.566-580, 1996. https://doi.org/10.1109/70.508439
  12. L. Kavraki and J.-C. Latombe, "Randomized preprocessing of configuration space for path planning: articulated robots," in Intelligent Robots and Systems '94. 'Advanced Robotic Systems and the Real World', IROS '94. Proceedings of the IEEE/ RSJ/GI International Conference on, vol.3, pp.1764- 1771, Sep 1994.
  13. D. Hsu, J.-C. Latombe, and R. Motwani, "Path planning in expansive configuration spaces," in Proceeding of IEEE Int. Conf. on Robotics and Automation, vol.3, pp.2719-2726, Apr 1997.
  14. S. M. LaValle and J. J. Kuffner, "Rapidly- Exploring Random Trees: Progress and Prospects," in Proc. Int. Workshop Alg. Found. Robot. (WAFR), pp.SA45-SA59, 2000.
  15. J. J. Kuffner, S. M. LaValle, "RRT-Connect: An Efficient Approach to Single-Query Path Planning," in Proc. Int. Workshop Alg. Found. Robot. (WAFR), pp.SA45-SA59, 2000.
  16. Jungtae Kim, Daijin Kim, "Exploration in 2D simulation," In Proc. of the KIISE Korea Computer Congress 2008, vol.25, no.2(C), pp.198-202, Oct. 2008. (in Korean)
  17. Jungtae Kim, Daijin Kim, "Remembering Exploration," In Proceeding of The 5th International Conference on Ubiquitous Robots and Ambient Intelligent (URAI), vol.5, pp.714-718, Nov. 2008.
  18. Y.K.Hwang and N.Ahuja, "A Potential Field Approach to Path Planning," IEEE Trans. Robot. & Autom., 8(1):23-32, Feb. 1992. https://doi.org/10.1109/70.127236
  19. G. Sanchez and J.-C. Latombe, "A single-query bi-directional probabilistic roadmap planner with lazy collision checking," in Int. Symp. On Rob. Research, 2001.
  20. Parasol Lab, Texas A&M University, http://parasolwww.cs.tamu.edu/dsmft/benchmarks/mp/
  21. E. Larsen, S. Gottschalk, M. C. Lin, D. Manocha, "Fast proximity queries with swept sphere volumes," Technical Report TR99-018, Department of Computer Science, University of North Carolina at Chapel Hill, North Carolina, 1999.