Polygon exploration with time-discrete vision
暂无分享,去创建一个
[1] Tomio Hirata,et al. An incremental algorithm for constructing shortest watchman routes , 1993, Int. J. Comput. Geom. Appl..
[2] Xiaotie Deng,et al. How to learn an unknown environment. I: the rectilinear case , 1998, JACM.
[3] Sándor P. Fekete,et al. Online Searching with an Autonomous Robot , 2004, WAFR.
[4] Bengt J. Nilsson,et al. Competitive exploration of rectilinear polygons , 2003, Theor. Comput. Sci..
[5] Hans-Dietrich Hecker,et al. Two NP-Hard Art-Gallery Problems for Ortho-Polygons , 1995, Math. Log. Q..
[6] Andrea Bottino,et al. A nearly optimal sensor placement algorithm for boundary coverage , 2008, Pattern Recognit..
[7] Erik D. Demaine,et al. Online searching with turn cost , 2004, Theor. Comput. Sci..
[8] XUEHOU TAN,et al. Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes" , 1999, Int. J. Comput. Geom. Appl..
[9] Joseph S. B. Mitchell,et al. Geometric Shortest Paths and Network Optimization , 2000, Handbook of Computational Geometry.
[10] Joel W. Burdick,et al. Online Algorithms with Discrete Visibility - Exploring Unknown Polygonal Environments , 2008, IEEE Robotics & Automation Magazine.
[11] Esther M. Arkin,et al. Angewandte Mathematik Und Informatik Universit at Zu K Oln Approximation Algorithms for Lawn Mowing and Milling Ss Andor P.fekete Center for Parallel Computing Universitt at Zu Kk Oln D{50923 Kk Oln Germany Approximation Algorithms for Lawn Mowing and Milling , 2022 .
[12] Svante Carlsson,et al. Computing Vision Points in Polygons , 1999, Algorithmica.
[13] Rolf Klein,et al. The Polygon Exploration Problem , 2001, SIAM J. Comput..
[14] Sándor P. Fekete,et al. Searching with an autonomous robot , 2004, SCG '04.
[15] Subir Kumar Ghosh,et al. Approximation algorithms for art gallery problems in polygons , 2010, Discret. Appl. Math..
[16] Joachim Hertzberg,et al. Automatic Classification of Objects in 3D Laser Range Scans , 2003 .
[17] Simeon C. Ntafos,et al. Optimum watchman routes , 1986, SCG '86.
[18] Christian Icking,et al. An Optimal Competitive Strategy for Looking Around a Corner , 1994 .
[19] Tomio Hirata,et al. Corrigendum to "An Incremental Algorithm for Constructing Shortest Watchman Routes" , 1991, Int. J. Comput. Geom. Appl..
[20] V. Chvátal. A combinatorial theorem in plane geometry , 1975 .
[21] J. O'Rourke. Art gallery theorems and algorithms , 1987 .
[22] Susanne Albers,et al. Exploring Unknown Environments with Obstacles , 1999, SODA '99.
[23] Joel W. Burdick,et al. An on-line algorithm for exploring an unknown polygonal environment by a point robot , 1997, CCCG.
[24] Svante Carlsson,et al. Finding the Shortest Watchman Route in a Simple Polygon , 1993, ISAAC.
[25] Jon M. Kleinberg,et al. On-line search in a simple polygon , 1994, SODA '94.
[26] Rolf Klein,et al. How to Look Around a Corner , 1993, CCCG.
[27] Joachim Hertzberg,et al. An autonomous mobile robot with a 3D laser range finder for 3D exploration and digitalization of indoor environments , 2003, Robotics Auton. Syst..