Author:
Khaksar Weria,Hong Tang Sai,Khaksar Mansoor,Motlagh Omid
Publisher
Springer Science and Business Media LLC
Reference38 articles.
1. Canny J (1988) The complexity of robot motion planning. The MIT Press, Massachusetts
2. Asano T, Asano T, Guibas L, Hershberger J, Imai H (1985) Visibility-polygon search and Euclidean shortest paths. In: Proceedings of 26th Annual Symposium on Foundations of Computer Science, Oct 21-23, Portland, USA, 155-164
3. Canny J (1985) Voronoi method for the piano-mover’s problem. In: Proceedings of IEEE International Conference on Robotics and Automation. Mar 25-28, St. Louis, USA, pp 530-535
4. Khatib O (1986) Real-Time Obstacle Avoidance for Manipulators and Mobile Robots. Int J Rob Res 5:90–99. doi: 10.1177/027836498600500106
5. Lumelsky VJ, Stepanov AA (1987) Path-planning strategies for a point mobile automaton moving amidst unknown obstacles for arbitrary shape. Algorithmica 2:403–430. doi: 10.1007/BF01840369
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献