An efficient strategy for rapidly finding an object in a polygonal world
暂无分享,去创建一个
[1] Leonidas J. Guibas,et al. Finding an unpredictable target in a workspace with obstacles , 1997, Proceedings of International Conference on Robotics and Automation.
[2] Sheldon M. Ross,et al. Introduction to Probability and Statistics for Engineers and Scientists , 1987 .
[3] J. O'Rourke. Art gallery theorems and algorithms , 1987 .
[4] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[5] Hans Rohnert,et al. Shortest Paths in the Plane with Convex Polygonal Obstacles , 1986, Inf. Process. Lett..
[6] T. C. Shermer,et al. Recent results in art galleries (geometry) , 1992, Proc. IEEE.
[7] Malik Ghallab,et al. Perception planning for a multi-sensory interpretation machine , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.
[8] Bala R. Vatti. A generic solution to polygon clipping , 1992, CACM.
[9] Steven M. LaValle,et al. Optimal navigation and object finding without geometric maps or localization , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).
[10] T. Shermer. Recent Results in Art Galleries , 1992 .
[11] Héctor H. González-Baños,et al. A reactive motion planner to maintain visibility of unpredictable targets , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).
[12] Héctor H. González-Baños,et al. Navigation Strategies for Exploring Indoor Environments , 2002, Int. J. Robotics Res..
[13] Héctor H. González-Baños,et al. Motion strategies for maintaining visibility of a moving target , 1997, Proceedings of International Conference on Robotics and Automation.