Survey of Positioning Algorithms for Surveillance UGVs

development, as well as studies conducted in the interests of Swedish defence and the safety and security of society. The organisation employs approximately 1250 personnel of whom about 900 are scientists. This makes FOI Sweden’s largest research institute. FOI gives its customers access to leading-edge expertise in a large number of fields such as security policy studies, defence and security related analyses, the assessment of various types of threat, systems for control and management of crises, protection against and management of hazardous substances, IT security and the potential offered by new sensors. Survey of Positioning Algorithms for Surveillance UGVs

[1]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

[2]  Bruce A. Draper,et al.  A system to place observers on a polyhedral terrain in polynomial time , 2000, Image Vis. Comput..

[3]  Y.F. Li,et al.  Automatic sensor placement for model-based robot vision , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[4]  Pradeep K. Khosla,et al.  Distributed surveillance and reconnaissance using multiple autonomous ATVs: CyberScout , 2002, IEEE Trans. Robotics Autom..

[5]  Frédo Durand,et al.  A Multidisciplinary Survey of Visibility , 2000 .

[6]  Bettina Speckmann,et al.  Allocating Vertex π-Guards in Simple Polygons via Pseudo-Triangulations , 2003, SODA '03.

[7]  Masafumi Yamashita,et al.  The Searchlight Scheduling Problem , 1990, SIAM J. Comput..

[8]  Frank Hoffmann,et al.  The art gallery theorem for polygons with holes , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[9]  J. Mark Keil,et al.  Polygon Decomposition , 2000, Handbook of Computational Geometry.

[10]  Otfried Cheong,et al.  Finding a Guard that Sees Most and a Shop that Sells Most , 2004, SODA '04.

[11]  T. Shermer.  Recent Results in Art Galleries , 1992 .

[12]  Geoffrey A. Hollinger,et al.  Probabilistic Strategies for Pursuit in Cluttered Environments with Multiple Robots , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[13]  Mateu Sbert,et al.  Viewpoint Selection using Viewpoint Entropy , 2001, VMV.

[14]  Stephan Eidenbenz,et al.  An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee , 2003, SIAM J. Comput..

[15]  Leila De Floriani,et al.  Applications of Computational Geometry to Geographic Information Systems , 2000, Handbook of Computational Geometry.

[16]  Sariel Har-Peled,et al.  Guarding galleries and terrains , 2002, Inf. Process. Lett..

[17]  Stephan Eidenbenz.  Inapproximability Results for Guarding Polygons without Holes , 1998, ISAAC.

[18]  W. Randolph Franklin.  Higher isn ’ t Necessarily Better : Visibility Algorithms and Experiments , 1994 .

[19]  Stephan Eidenbenz,et al.  Approximation algorithms for terrain guarding , 2002, Inf. Process. Lett..

[20]  J. O'Rourke.  Art gallery theorems and algorithms , 1987 .

[21]  D. T. Lee,et al.  Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.

[22]  J. Kahn,et al.  Traditional Galleries Require Fewer Watchmen , 1983 .

[23]  Sebastian Thrun,et al.  Visibility-based Pursuit-evasion with Limited Field of View , 2004, Int. J. Robotics Res..

[24]  Joseph S. B. Mitchell,et al.  Approximation algorithms for two optimal location problems in sensor networks , 2005, 2nd International Conference on Broadband Networks, 2005..

[25]  Steve Fisk,et al.  A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.

[26]  Jorge Urrutia,et al.  Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.

[27]  Joseph S. B. Mitchell,et al.  Locating Guards for Visibility Coverage of Polygons , 2007, Int. J. Comput. Geom. Appl..

[28]  W. R. Franklin.  Siting Observers on Terrain , 2002 .

[29]  Héctor H. González-Baños,et al.  A randomized art-gallery algorithm for sensor placement , 2001, SCG '01.

[30]  Stephan Eidenbenz,et al.  Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains , 2002, SWAT.

[31]  Alejandro Sarmiento,et al.  An efficient strategy for rapidly finding an object in a polygonal world , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[32]  Euripides Markou,et al.  Maximizing the Guarded Interior of an Art Gallery , 2006 .

[33]  Nancy M. Amato,et al.  Linear-time triangulation of a simple polygon made easier via randomization , 2000, SCG '00.

[34]  Euripides Markou,et al.  How to Place Efficiently Guards and Paintings in an Art Gallery , 2005, Panhellenic Conference on Informatics.

[35]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[36]  F. Bullo,et al.  Distributed deployment of asynchronous guards in art galleries , 2006, 2006 American Control Conference.