참고문헌 (16)

1. 10.1109/TRO.2009.2035745 M. Baumann, S. Leonard, E. A. Croft, and J. J. Little, “Path Planning for Improved Visibility Using a Probabilistic Road Map,” IEEE Trans. on Robotics, Vol.26, No.1, pp. 195-200, 2010. 

   상세보기

2. 10.1007/s10846-012-9776-4 M. Kothari and I. Postlethwaite, “A Probabilistically Robust Path Planning Algorithm for UAVs Using Rapidly-Exploring Random Trees,” J. of Intelligent & Robotic Systems, Vol.71, Issue 2, pp. 231-253, 2013. 

   상세보기

3. Z. Zhu, E. Schmerling, and M. Pavone, “A Convex Optimization Approach to Smooth Trajectories for Motion Planning with Car-Like Robots,” Proc. of the 2015 54th IEEE Conf. on Decision and Control (CDC), pp. 835-842, 2015. 

4. D. J. Webb and J. Van Den Berg, “Kinodynamic RRT * : Asymptotically Optimal Motion Planning for Robots with Linear Differential Dynamics,” Proc. of the 2013 IEEE Int. Conf. on Robotics and Automation, pp. 5054-5061, 2013. 

5. J. D. Gammell, S. S. Srinivasa, and T. D. Barfoot, “Informed RRT * : Optimal Sampling-based Path Planning Focused via Direct Sampling of an Admissible Ellipsoidal Heuristic,” Proc. of the 2014 IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, pp. 2997-3004, 2014. 

6. 10.3390/s18082585 A. V. Le, V. Prabakaran, V. Sivanantham, and R. E. Mohan, “Modified A-Star Algorithm for Efficient Coverage Path Planning in Tetris Inspired Self-Reconfigurable Robot with Integrated Laser Sensor,” Sensors, Vol.18, No.8, Article No.2585, 2018. 

   상세보기

7. M. Likhachev, G. J. Gordon, and S. Thrun, “ARA * : Anytime A * with Provable Bounds on Sub-optimality,” Proc. of the 16th Int. Conf. on Neural Information Processing Systems, pp. 767-774, 2004. 

8. D. Harabor and A. Grastien, “Online Graph Pruning for Pathfinding on Grid Maps,” Proc. of the 25th AAAI Conf. on Artificial Intelligence (AAAI’11), pp. 1114-1119, 2011. 

9. 10.1177/0278364909359210 D. Dolgov, S. Thrun, M. Montemerlo, and J. Diebel, “Path Planning for Autonomous Vehicles in Unknown Semi-structured Environments,” The Int. J. of Robotics Research, Vol.29, Issue 5, pp. 485-501, 2010. 

   상세보기

10. K. Kurzer, “Path Planning in Unstructured Environments: A Real-time Hybrid A * Implementation for Fast and Deterministic Path Generation for the KTH Research Concept Vehicle,” Master Thesis, KTH Royal Institute of Technology, 2016. 

11. 10.2140/pjm.1990.145.367 J. A. Reeds and L. A. Shepp, “Optimal Paths for a Car That Goes Both Forwards and Backwards,” Pacific J. of Mathematics, Vol.145. No.2, pp. 367-393, 1990. 

    상세보기

12. O. Khatib, “Real-time Obstacle Avoidance for Manipulators and Mobile Robots,” Proc. of the 1985 IEEE Int. Conf. on Robotics and Automation, pp. 500-505, 1985. 

13. 10.2991/acaai-18.2018.47 Z. Jin, B. Yan, and R. Ye, “The Flight Navigation Planning Based on Potential Field Ant Colony Algorithm,” Proc. of the 2018 Int. Conf. on Advanced Control, Automation and Artificial Intelligence (ACAAI 2018), pp. 200-204, 2018. 

    

14. 10.1515/jaiscr-2015-0028 T. Weerakoon, K. Ishii, and A. A. F. Nassiraei, “An Artificial Potential Field Based Mobile Robot Navigation Method to Prevent from Deadlock,” J. of Artificial Intelligence and Soft Computing Research, Vol.5, No.3, pp. 189-203, 2015. 

    상세보기

15. Z.-Z. Yu, J.-H. Yan, J. Zhao, Z.-F. Chen, and Y.-H. Zhu, “Mobile Robot Path Planning Based on Improved Artificial Potential Field Method,” J. of Harbin Institute of Technology, Vol.43, No.1, pp. 50-55, 2011 (in Chinese). 

16. 10.1109/ROBIO.2017.8324485 N. Zhang, Y. Zhang, C. Ma, and B. Wang, “Path Planning of Six-DOF Serial Robots Based on Improved Artificial Potential Field Method,” Proc. of the 2017 IEEE Int. Conf. on Robotics and Biomimetics (ROBIO), pp. 617-621, 2017.