ỨNG DỤNG ĐỒ THỊ TẦM NHÌN VÀO BÀI TOÁN TÌM ĐƯỜNG CHO ROBOT
Abstract
Tóm tắt
Article Details
Tài liệu tham khảo
S. M. Valle, 2006. Planning Algorithms. Cambridge University Press. 811 pp.
S.K. Ghosh, 2007. Visibility algorithms in the plane. Cambridge University Press. 334 pp.
E. Welzl, 1985. Constructing the Visibility Graph for n Line Segments in θ(n2)Time. In:Information Processing Letters, vol. 20, issue 4: 167-171.
D. Ferguson and A.Stentz, 2006. Multi-resolution field D*. In:Proceedings of the International Conference on Intelligent Autonomous Systems (IAS).
R. Bohlin and L. Kavraki, 2000. Path planning using lazy PRM. In:IEEE Int. Conf. on Robotics and Automation, vol. 1: 521-528.
S. LaValle, 1998. Rapidly-exploring random trees: A new tool for path planning. Technical Report TR 98-11. Computer Science Dept., Iowa State University.
D. Wooden and M. Egerstedt, 2006. Oriented Visibility Graphs: Low-Complexity Planning in Real-Time Environments. In:IEEE Conference on Robotics and Automation, Orlando, FL: 2354-2359.
J. Canny, 1987. The Complexity of Robot Motion Planning Cambridge. MA: MIT Press. 196 pp.
T. Lozano-Perez, 1987. A simple motion-planning algorithm for general robot manipulators. IEEE Journal of Robotics and Automation, vol. RA-3, No. 3: 224-238.
John E. Hershberger and Subhash Suri, 1993. Efficient Computation of Euclidean Shortest Paths in the Plane, In:IEEE 34th Annual Foundations of Computer Science: 508-517.
J. O’Rourke, 1998. Computational geometry in C. Cambridge University Press. 361 pp.
J.Park and S. Oh, 2012. A New Concave Hull Algorithm and Concaveness Measure for n-dimensional Datasets. Journal of Information science and engineering, No. 100295.
X. Shen and H. Edelsbrunner, 1987. A Tight Lower Bound on the Size of Visibility Graphs. In:Inf. Process. Lett: 61-64.
J. B. Ziegler and N. B. Nichols, 1942. Optimum settings for automatic controllers. In:ASME Transactions: 759-768.
J. Kitzinger and B.Moret, 2003. The Visibility Graph Among Polygonal Obstacles: a Comparison of Algorithms. Tech. Rep. TR-CS-2003-29. University of New Mexico.