The Journal of Korea Robotics Society (로봇학회논문지)

Korea Robotics Society (한국로봇학회)
권호 표지
DOI QR코드

DOI QR Code

A Cost-Aware RRT Planning Algorithm

비용 인지 RRT 경로 계획 알고리즘

  • 서정훈 (서울대학교 전기.정보공학부) ;
  • 오성회 (서울대학교 전기.정보공학부)
  • Received : 2012.04.07
  • Accepted : 2012.04.24
  • Published : 2012.05.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose a cost-aware Rapidly-exploring Random Tree (RRT) path planning algorithm for mobile robots. A mobile robot is presented with a cost map of the field of interest and assigned to move from one location to another. As a robot moves, the robot is penalized by the cost at its current location according to the cost map. The overall cost of the robot is determined by the trajectory of the robot. The goal of the proposed cost-aware RRT algorithm is to find a trajectory with the minimal cost. The cost map of the field can represent environmental parameters, such as temperature, humidity, chemical concentration, wireless signal strength, and stealthiness. For example, if the cost map represents packet drop rates at different locations, the minimum cost path between two locations is the path with the best possible communication, which is desirable when a robot operates under the environment with weak wireless signals. The proposed cost-aware RRT algorithm extends the basic RRT algorithm by considering the cost map when extending a motion segment. We show that the proposed algorithm gives an outstanding performance compared to the basic RRT method. We also demonstrate that the use of rejection sampling can give better results through extensive simulation.

Keywords

References

  1. D. Kim and D. Kang, "Optimal Path Planning of Mobile Robot for Multiple Moving Obstacles," The Journal of Korea Robotics Society, Vol.2, pp.183-190, 2007.
  2. J. Beak and C. Lee, "An Analysis on the Influential Factors to Set the Path Planning Algorithm for Unmanned Ground Vehicle in Combat Environment," The Journal of Korea Robotics Society, Vol.4, pp.233-242, Aug. 2009.
  3. Y. Chang and Y. Yamamoto, "Path planning of wheeled mobile robot with simultaneous free space locating capability," Intelligent Service Robotics, Vol.2, pp.9-22, 2009. https://doi.org/10.1007/s11370-008-0033-4
  4. S. M. LaValle and J. J. Kuffner, "Randomized kinodynamic planning," The International Journal of Robotics Research, Vol.20, pp.378-400, May 2001. https://doi.org/10.1177/02783640122067453
  5. S. Rodriguez, X. Tang, J. Lien, and N. M. Amato, "An obstacle-based rapidly-exploring random tree," in IEEE International Conference on Robotics and Automation, May 2006.
  6. N. A. Melchior and R. Simmons, "Particle RRT for path planning with uncertainty," in IEEE International Conference on Robotics and Automation, Roma, Apr. 2007.
  7. J. V. der Berg, P. Abbeel, and K. Goldberg, "LPG-MP: Optimized path planning for robots with motion uncertainty and imperfect state information," The International Journal of Robotics Research, Vol.30, pp.895-913, Jun. 2011. https://doi.org/10.1177/0278364911406562
  8. C. Fulgenzi, C. Tay, A. Spalanzani, and C. Laugier, "Probabilistic navigation in dynamic environment using rapidly-exploring random trees and gaussian processes," in Intelligent Robots and Systems, Nice, Sep. 2008, pp.1056-1062.
  9. M. Zucker, J. Kuffner, and M. Branicky, "Multipartite rrts for rapid replanning in dynamic environments," in IEEE International Conference on Robotics and Automation, Apr. 2007.
  10. Y. Kuwata, G. A. Fiore, J. Teo, E. Frazzoli, and J. P. How, "Motion planning for urban driving using rrt," in IEEE/RSJ Intl. Conference on Intelligent Robotics and Systems, Sep. 2008.
  11. C. Urmson and R. Simmons, "Approaches for heuristically biasing rrt growth," in IEEE/RSJ Intl. Conference on Intelligent Robotics and Systems, Oct. 2003.
  12. D. Ferguson and A. Stentz, "Cost based planning with rrt in outdoor environment," in IEEE/RSJ Intl. Conference on Intelligent Robotics and Systems, Oct. 2006.
  13. J. Choi, J. Lee, and S. Oh, "Swarm intelligence for achieving the global maximum using spatio-temporal gaussian processes," in American Control Conference, Seattle, WA, Jun. 2008, pp.135-140.
  14. C. E. Rasmussen and C. K. Williams, Eds., Gaussian Processes for Machine Learning. Cambridge: The MIT Press, 2006.
  15. N. Cressie, "Kriging nonstationary data," Journal of the American Statistical Association, Vol.81, pp.625-634, Nov. 1986. https://doi.org/10.1080/01621459.1986.10478315
  16. M. N. Gibbs and D. J. C. MacKay, "Efficient implementation of gaussian processes," Cambridge, Tech. Rep. 1997.
  17. B. Ferris, D. Fox, and N. Lawrence, "WiFi-SLAM using Gaussian process latent variable models," in Proc. of the 20th International Joint Conference on Artificial Intelligence, 2007.
  18. A. Krause, A. Singh, and C. Guestrin, "Nearoptimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies," Journal of Machine Learning Research, Vol.9, pp.235-284, Feb. 2008.
  19. H. Durrant-Whyte, F. Ramos, E. Nettleton, A. Blair, and S. Vasudevan, "Gaussian process modeling of large scale terrain," in Proc. of the 2009 IEEE International Conference on Robotics and Automation, 2009.
  20. S. Petti and T. Fraichard, "Safe motion planning in dynamic environments," in IEEE-RSJ Int. Conf. on Intelligent Robots and Systems, Aug. 2005.
  21. C. M. Bishop, "Pattern Recognition and Machine Learning," Springer, New York, 2006

Cited by

  1. RRT*를 활용하여 향상된 이종의 개미군집 기반 경로 계획 알고리즘 vol.14, pp.4, 2019, https://doi.org/10.7746/jkros.2019.14.4.285