DOI QR코드

DOI QR Code

Efficient Online Path Planning Algorithm for Mobile Robots in Dynamic Indoor Environments

이동 로봇을 위한 동적 실내 환경에서의 효율적인 온라인 경로 계획 알고리즘

  • Received : 2011.02.10
  • Accepted : 2011.04.19
  • Published : 2011.07.01

Abstract

An efficient modified $D^*$ lite algorithm is suggested, which can perform online path planning for mobile robots in dynamic indoor environment. Online path planning should plan and execute alternately in a short time, and hence it enables the robot avoid unknown dynamic obstacles which suddenly appear on robot's path. Based on $D^*$ Lite algorithm, we improved representation of edge cost, heuristic function, and priority queue management, to build a modified $D^*$ Lite algorithm. Performance of the proposed algorithm is revealed via extensive simulation study.

Keywords

References

  1. D. Kurabayashi, J. Ota, T. Arai, and E. Yoshida, "Cooperative sweeping by multiple mobile robots," Proc. IEEE International. Conference on Robotics and Automation, Minneapolis, MN, pp. 1744-1749, Apr. 1996. https://doi.org/10.1109/ROBOT.1996.506964
  2. M. Gerke, "Genetic path planning for mobile robots," Proc. American Control Conference, San Diego, CA, pp. 2424-2429, Jun. 1999.
  3. S. X. Yang and C. Luo, "A neural network approach to complete coverage path planning," IEEE Transactions on System. Man and Cybernetics, vol. 34, no. 1, pp. 718-725, Feb. 2004. https://doi.org/10.1109/TSMCB.2003.811769
  4. Y. Koren and J. Borenstein, "Potential field methods and their inherent limitations for mobile robot navigation," Proc. IEEE Conference on Robotics and Automation, Sacramento, CA, pp. 1398-1404, Apr. 1991. https://doi.org/10.1109/ROBOT.1991.131810
  5. J. Borenstein and Y. Koren, "The Vector field histogram - fast obstacle avoidance for mobile robots," IEEE Transactions on Robotics and Automation, vol. 7, no. 3, pp. 278-288, 1991. https://doi.org/10.1109/70.88137
  6. D. An and H. Wang, "VPH: a new laser radar based obstacle avoidance method for intelligent mobile robots," Proc. 5th World Congress on Intelligent Control and Automation, Hangzhou, China, pp. 4681-4685, Jun. 2004.
  7. J. Bruce and M. Veloso, "Real-time randomized path planning for robot navigation," Proceedings IEEE/RSJ International. Conference on Intelligent Robots and Systems, Lausanne, Switzerland, pp. 2383-2388, Oct. 2002. https://doi.org/10.1109/IRDS.2002.1041624
  8. J.S. Zelek, "Complete real-time path planning during sensorbased discovery," Proceedings IEEE/RSJ International Conference on Intelligent Robots and Systems, Victoria, B.C., Canada, pp. 1399-1404, Oct. 1998. https://doi.org/10.1109/IROS.1998.724783
  9. L. Podsedkowski, J. Nowakowski, M. Idzikowski, and I. Vizvary, "A new solution for path planning in partially known or unknown environment for nonholonomic mobile robots," Robotics and Autonomous Systems, vol. 34, pp. 145-152, 2001. https://doi.org/10.1016/S0921-8890(00)00118-4
  10. A. Stentz, "The focussed D* algorithm for real-time replanning," in Proc. International Joint Conference Artificial Intelligence, pp. 1652-1659, 2005.
  11. S. Koenig and M. Likhachev, "Fast replanning for navigation in unknown terrain," IEEE Transactions on Robotics, vol. 21, no. 3, pp. 354-363, Jun. 2005. https://doi.org/10.1109/TRO.2004.838026
  12. K. Loudon, Mastering Algorithms with C, O'Reilly, 2000.
  13. H. M. Choset et al., Principles of Robot Motion, MIT press Cambridge, 2005.
  14. Y. H. Kim, "Design of a robot task planning system with a state partitioning technique," M.S. thesis, Dept. of Electrical Engineering, KAIST, 2007.
  15. Scanning Laser Range Finder URG-04LX Specifications, HOKUYO, 2005.