On terrain acquisition by a finite-sized mobile robot in plane
暂无分享,去创建一个
[1] S. Sitharama Iyengar,et al. Robot Navigation in Unknown Terrains of Convex Polygonal Obstacles Using Learned Visibility Graphs , 1986, AAAI.
[2] Chee-Keng Yap,et al. A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.
[3] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[4] Vladimir Lumelsky,et al. Effect of uncertainty on continuous path planning for an autonomous vehicle , 1984, The 23rd IEEE Conference on Decision and Control.
[5] Rodney A. Brooks,et al. Solving the find-path problem by good representation of free space , 1982, IEEE Transactions on Systems, Man, and Cybernetics.
[6] S. Sitharama Iyengar,et al. Robot navigation algorithms using learned spatial graphs , 1986, Robotica.
[7] A. K. C. Wong,et al. Low-Level Learning for a Mobile Robot: Environment Model Acquisition , 1985, CAIA.
[8] Nageswara S. V. Rao,et al. Robot navigation in an unexplored terrain , 1986, J. Field Robotics.
[9] John H. Reif,et al. Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[10] J. Schwartz,et al. On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .
[11] S. Sitharama Iyengar,et al. On terrain acquisition by a point robot amidst polyhedral obstacles , 1988, IEEE J. Robotics Autom..
[12] Christos H. Papadimitriou,et al. An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..