Robot navigation in unknown generalized polygonal terrains using vision sensors
暂无分享,去创建一个
[1] Chee Yap,et al. Algorithmic motion planning , 1987 .
[2] Ricardo A. Baeza-Yates,et al. Searching in the Plane , 1993, Inf. Comput..
[3] Amos Fiat,et al. Online Navigation in a Room , 1992, J. Algorithms.
[4] Jean-Claude Latombe,et al. Robot motion planning , 1970, The Kluwer international series in engineering and computer science.
[5] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[6] Chee-Keng Yap,et al. A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.
[7] Michael F. Barnsley,et al. Fractals everywhere , 1988 .
[8] René Schott,et al. Parallel Searching in the Plane , 1995, Comput. Geom..
[9] Vladimir J. Lumelsky,et al. Algorithmic and complexity issues of robot motion in an uncertain environment , 1987, J. Complex..
[10] S. Sitharama Iyengar,et al. On terrain acquisition by a point robot amidst polyhedral obstacles , 1988, IEEE J. Robotics Autom..
[11] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[12] Leonidas J. Guibas,et al. An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body , 1988, J. Algorithms.
[13] L. Paul Chew,et al. Planning the shortest path for a disc in O(n2log n) time , 1985, SCG '85.
[14] Micha Sharir,et al. Algorithmic motion planning in robotics , 1991, Computer.
[15] Alfred M. Bruckstein,et al. Two-dimensional robot navigation among unknown stationary polygonal obstacles , 1993, IEEE Trans. Robotics Autom..
[16] S. Sitharama Iyengar,et al. Autonomous robot navigation in unknown terrains: incidental learning and environmental exploration , 1990, IEEE Trans. Syst. Man Cybern..
[17] Ivan E. Sutherland. A Method for Solving Arbitrary-Wall Mazes by Computer , 1969, IEEE Transactions on Computers.
[18] Chee-Keng Yap,et al. AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments , 1987, Discret. Comput. Geom..
[19] S. Sitharama Iyengar,et al. Robot navigation in unknown terrains using learned visibility graphs. Part I: The disjoint convex obstacle case , 1987, IEEE Journal on Robotics and Automation.
[20] S. Sitharama Iyengar,et al. A 'retraction' method for learned navigation in unknown terrains for a circular robot , 1991, IEEE Trans. Robotics Autom..
[21] Vladimir J. Lumelsky,et al. Incorporating range sensing in the robot navigation function , 1990, IEEE Trans. Syst. Man Cybern..
[22] Rolf Klein,et al. Walking an unknown street with bounded detour , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[23] V. Lumelsky,et al. Dynamic path planning for a mobile automaton with limited information on the environment , 1986 .
[24] Mihalis Yannakakis,et al. Shortest Paths Without a Map , 1989, Theor. Comput. Sci..
[25] Vladimir J. Lumelsky,et al. Dynamic path planning in sensor-based terrain acquisition , 1990, IEEE Trans. Robotics Autom..
[26] Nageswara S. V. Rao. Algorithmic framework for learned robot navigation in unknown terrains , 1989, Computer.
[27] Narendra Ahuja,et al. Gross motion planning—a survey , 1992, CSUR.
[28] Jean-Paul Laumond,et al. Obstacle Growing in a Nonpolygonal World , 1987, Inf. Process. Lett..