介绍机器人路径规划的外文文献

以下是一些关于机器人路径规划的外文文献：

1. Kavraki, L. E., Svestka, P., Latombe, J. C., & Overmars, M. H. (1996). Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation, 12(4), 566-580.

2. LaValle, S. M. (2006). Planning algorithms. Cambridge University Press.

3. Choset, H., Lynch, K. M., Hutchinson, S., Kantor, G., Burgard, W., Kavraki, L. E., & Thrun, S. (2005). Principles of robot motion: theory, algorithms, and implementations. MIT press.

4. Thrun, S., Burgard, W., & Fox, D. (2005). Probabilistic robotics. MIT Press.

5. Likhachev, M., Ferguson, D., Gordon, G. J., & Stentz, A. (2008). Anytime dynamic A*: An anytime, replanning algorithm. In Proceedings of the International Conference on Robotics and Automation (ICRA), 2369-2374.

6. Karaman, S., & Frazzoli, E. (2011). Sampling-based algorithms for optimal motion planning. International Journal of Robotics Research, 30(7), 846-894.

7. Kuffner Jr, J. J., & LaValle, S. M. (2000). RRT-connect: An efficient approach to single-query path planning. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), 995-1001.

8. Borenstein, J., & Koren, Y. (1991). The vector field histogram-fast obstacle avoidance for mobile robots. IEEE Transactions on Robotics and Automation, 7(3), 278-288.

9. Barraquand, J., Langlois, B., & Latombe, J. C. (1992). Numerical potential field techniques for robot path planning. IEEE Transactions on Systems, Man, and Cybernetics, 22(2), 224-241.

10. Choset, H. (1998). Coverage for robotics-a survey of recent results. Annals of Mathematics and Artificial Intelligence, 31(1-4), 113-126.