Multi-agent deployment for visibility coverage in polygonal environments with holes

International Journal of Robust and Nonlinear Control

Volumn 21, Issue 12, 2011, Pages 1467-1492

  Obermeyer, Karl J ^a   Ganguli, Anurag ^b   Bullo, Francesco ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UTOPIACOMPRESSION CORPORATION   (United States)

Author keywords

coverage; deployment; line of sight; multi agent system; robotic network; sensor network; swarm; visibility

Indexed keywords

COVERAGE; DEPLOYMENT; LINE OF SIGHT; ROBOTIC NETWORK; SWARM;

COMPUTER SIMULATION; INTELLIGENT AGENTS; MULTI AGENT SYSTEMS; ROBOTICS; SENSOR NETWORKS; VISIBILITY;

AUTONOMOUS AGENTS;

EID: 79960095530     PISSN: 10498923     EISSN: 10991239     Source Type: Journal    
DOI: 10.1002/rnc.1700     Document Type: Article

References (29)

1. Lee DT, Lin AK,. Computational complexity of art gallery problems. IEEE Transactions on Information Theory 1986; 32 (2): 276-282. (Pubitemid 16613634)
2. Eidenbenz S, Stamm C, Widmayer P,. Inapproximability results for guarding polygons and terrains. Algorithmica 2001; 31 (1): 79-113. (Pubitemid 33709129)
3. Efrat A, Har-Peled S,. Guarding galleries and terrains. Information Processing Letters 2006; 100 (6): 238-245. (Pubitemid 44572356)
4. Liaw BC, Huang NF, Lee RCT,. The minimum cooperative guards problem on k-spiral polygons. Canadian Conference on Computational Geometry, Waterloo, Canada, 1993; 97-102.
5. Urrutia J,. Art gallery and illumination problems. In Handbook of Computational Geometry, Sack JR, Urrutia J, (eds). North-Holland: Amsterdam, 2000; 973-1027.
6. O'Rourke J,. Art Gallery Theorems and Algorithms. Oxford University Press: Oxford, 1987.
7. Shermer TC,. Recent results in art galleries. Proceedings of the IEEE 1992; 80 (9): 1384-1399.
8. Chvátal V,. A combinatorial theorem in plane geometry. Journal of Combinatorial Theory, Series B 1975; 18: 39-41.
9. Fisk S,. A short proof of Chvátal's watchman theorem. Journal of Combinatorial Theory, Series B 1978; 24: 374.
10. Bjorling-Sachs I, Souvaine D,. An efficient algorithm for guard placement in polygons with holes. Discrete and Computational Geometry 1995; 13 (1): 77-109.
11. Hoffmann F, Kaufmann M, Kriegel K,. The art gallery theorem for polygons with holes. IEEE Symposium on Foundations of Computer Science (FOCS), San Juan, Puerto Rico, 1991; 39-48.
12. Hernández-Peñalver G,. Controlling guards. Canadian Conference on Computational Geometry, Saskatoon, Canada, 1994; 387-392.
13. Pinciu V,. A coloring algorithm for finding connected guards in art galleries. Discrete Mathematical and Theoretical Computer Science. Lecture Notes in Computer Science, vol. 2731/2003. Springer: Berlin, 2003; 257-264.
14. González-Baños H, Latombe JC,. A randomized art-gallery algorithm for sensor placement. ACM Symposium on Computational Geometry, Medford, MA, 2001; 232-240. (Pubitemid 32865867)
15. Erdem UM, Sclaroff S,. Automated camera layout to satisfy task-specific and floor plan-specific coverage requirements. Computer Vision and Image Understanding 2006; 103 (3): 156-169. (Pubitemid 44234110)
16. Thrun S, Burgard W, Fox D,. Probabilistic Robotics. MIT Press: Cambridge, MA, 2005.
17. Simmons R, Apfelbaum D, Fox D, Goldman R, Haigh K, Musliner D, Pelican M, Thrun S,. Coordinated deployment of multiple heterogenous robots. IEEE/RSJ International Conference on Intelligent Robots and Systems, Takamatsu, Japan, 2000; 2254-2260. (Pubitemid 32380045)
18. Howard A, MatariÄ MJ, Sukhatme GS,. An incremental self-deployment algorithm for mobile sensor networks. Autonomous Robots 2002; 13 (2): 113-126.
19. Suri S, Vicari E, Widmayer P,. Simple robots with minimal sensing: from local visibility to global geometry. International Journal of Robotics Research 2008; 27 (9): 1055-1067.
20. Ganguli A, Cortés J, Bullo F,. Distributed deployment of asynchronous guards in art galleries. American Control Conference, Minneapolis, MN, 2006; 1416-1421. (Pubitemid 46531013)
21. Ganguli A, Cortés J, Bullo F,. Visibility-based multi-agent deployment in orthogonal environments. American Control Conference, New York, 2007; 3426-3431.
22. Ganguli A,. Motion coordination for mobile robotic networks with visibility sensors. Ph.D. Thesis, Electrical and Computer Engineering Department, University of Illinois at Urbana-Champaign, April 2007.
23. Bullo F, Cortés J, Martínez S,. Distributed Control of Robotic Networks, Applied Mathematics Series. Princeton University Press: Princeton, NJ, 2009. Available from:.
24. Cruz D, McClintock J, Perteet B, Orqueda OAA, Cao Y, Fierro R,. Decentralized cooperative control: a multivehicle platform for research in networked embedded systems. IEEE Control Systems Magazine 2007; 27 (3): 58-78. (Pubitemid 46864827)
25. Obermeyer K, Ganguli A, Bullo F,. Multi-agent deployment for visibility coverage in polygonal environments with holes, August 2010. Available from:.
26. Nilsson NJ,. A mobile automaton: an application of artificial intelligence techniques. International Conference on Artificial Intelligence, Washington, DC, 1969; 509-520.
27. Obermeyer KJ,. The VisiLibity library, 2008. Available from:.
28. Moore BJ, Passino KM,. Distributed task assignment for mobile agents. IEEE Transactions on Automatic Control 2007; 52 (4): 749-753. (Pubitemid 46621603)
29. Zavlanos MM, Spesivtsev L, Pappas GJ,. A distributed auction algorithm for the assignment problem. IEEE Conference on Decision and Control, Cancun, Mexico, 2008; 1212-1217.