비용 인지 RRT 경로 계획 알고리즘
A Cost-Aware RRT Planning Algorithm
2
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
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.
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.
참고문헌 (21)
- 김대광, "복수의 동적 장애물에 대한 이동로봇의 최적경로설계", 로봇학회 논문지, 2(2), pp.183~190 (2007), 한국로봇학회
- 백종성, "전장환경에서 무인전투차량의 경로계획 알고리즘설정 영향요인 분석", 로봇학회 논문지, 4(3), pp.233~242 (2009), 한국로봇학회
- Y. Chang, "Path planning of wheeled mobile robot with simultaneous free space locating capability", Intelligent Service Robotics, 2, pp.9~22 (2009)
- S. M. LaValle, "Randomized kinodynamic planning", The International Journal of Robotics Research, 20, pp.378~400
- S. Rodriguez, "An obstacle-based rapidly-exploring random tree", in IEEE International Conference on Robotics and Automation (2006)
- N. A. Melchior, "Particle RRT for path planning with uncertainty", in IEEE International Conference on Robotics and Automation (2007)
- J. V. der Berg, "LPG-MP: Optimized path planning for robotswith motion uncertainty and imperfect stateinformation", The International Journal of RoboticsResearch, 30, pp.895~913 (2011)
- C. Fulgenzi, "Probabilistic navigation in dynamic environment using rapidly-exploring random trees and gaussian processes", in Intelligent Robots and Systems, pp.1056~1062 (2008)
- M. Zucker, "Multipartite rrts for rapid replanning in dynamicenvironments", in IEEE International Conferenceon Robotics and Automation (2007)
- Y. Kuwata, "Motion planning for urban driving using rrt", in IEEE, 2008, ~
- C. Urmson, "Approaches for heuristically biasing rrt growth", in IEEE, 2003, ~
- D. Ferguson, "Cost based planning with rrt in outdoor environment", in IEEE, 2006, ~
- J. Choi, "Swarm intelligence for achieving the global maximum using spatio-temporal gaussian processes", in American Control Conference, pp.135~140 (2008)
- C. E. Rasmussen, "Gaussian Processes for Machine Learning" (2006), The MIT Press
- N. Cressie, "Kriging nonstationary data", of the American Statistical Association, 81, pp.625~634 (1986)
- M. N. Gibbs, "Efficient implementation of gaussian processes", Cambridge, Tech. Rep (1997)
- B. Ferris, "WiFi- SLAM using Gaussian process latent variable models", in Proc. of the 20th International Joint Conference on Artificial Intelligence (2007)
- A. Krause, "Nearoptimal sensor placements in gaussian processes: Theory, efficient algorithms and empirical studies", Journal of Machine Learning Research, 9, pp.235~284 (2008)
- H. Durrant-Whyte, "Gaussian process modeling of large scale terrain", in Proc. of the 2009 IEEE International Conference on Robotics and Automation (2009)
- S. Petti, "Safe motion planning in dynamic environments", in IEEE-RSJ Int. Conf. on Intelligent Robots and Systems (2005)
- C. M. Bishop, "Pattern Recognition and Machine Learning" (2006), Springer