Visibility-based multi-agent deployment in orthogonal environments

Proceedings of the American Control Conference

Volumn , Issue , 2007, Pages 3426-3431

  Ganguli, Anurag ^a,b   Cortés, Jorge ^c   Bullo, Francesco ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b University of California   (United States)

^c University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIONAL CONSTRAINT; CONNECTIVITY CONSTRAINTS; DISCRETE TIME (DT); DISTRIBUTED ALGORITHMS; FIRST ORDERS; LINE-OF SIGHT (LOS); MULTI AGENTS; OMNI DIRECTIONAL VISION; PAPER ADDRESSES; POINT MASSES; PRIOR KNOWLEDGE; ROBOTIC AGENTS; ROBUSTNESS PROPERTIES; VISIBILITY GRAPHS;

AGENTS; CONTROL THEORY; MILITARY DATA PROCESSING; OPTICAL PROPERTIES; PARALLEL ALGORITHMS; ROBUST CONTROL; ROBUSTNESS (CONTROL SYSTEMS); VISIBILITY;

STABILIZERS (AGENTS);

EID: 39549107367     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACC.2007.4283034     Document Type: Conference Paper

References (12)

1. V. Chvátal, "A combinatorial theorem in plane geometry," Journal of Combinatorial Theory. Series B, vol. 18, pp. 39-41, 1975.
2. J. Kahn, M. Klawe, and D. Kleitman, "Traditional galleries require fewer watchmen," SIAM Journal on Algebraic and Discrete Methods, vol. 4, no. 2, pp. 194-206, 1983.
3. V. Pinciu, "Connected guards in orthogonal art galleries," in Computational Science and Its Applications (ICCSA) (V. Kumar, M. L. Gavrilova, C. J. K. Tan, and P. L'Ecuyer, eds.), vol. 2669 of Lecture Notes in Computer Science, pp. 886-893, Springer Verlag, 2003.
4. A. Howard, M. J. Matarić, and G. S. Sukhatme, "An incremental self-deployment algorithm for mobile sensor networks," Autonomous Robots, vol. 13, no. 2, pp. 113-126, 2002.
5. J. Cortés, S. Martínez, T. Karatas, and F. Bullo, "Coverage control for mobile sensing networks," IEEE Transactions on Robotics and Automation, vol. 20, no. 2, pp. 243-255, 2004.
6. R. Simmons, D. Apfelbaum, D. Fox, R. Goldman, K. Haigh, D. Musliner, M. Pelican, and S. Thrun, "Coordinated deployment of multiple heterogenous robots," in IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, vol. 3, (Takamatsu, Japan), pp. 2254-2260, 2000.
7. I. Rekleitis and V. Dujmović, "Efficient topological exploration," in IEEE Int. Conf. on Robotics and Automation, (Detroit, MI), pp. 676-681, May 1999.
8. G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, "Topological exploration with multiple robots," in International Symposium on Robotics and Applications, (Anchorage, Alaska), May 1998.
9. M. Dynia, J. Kutylowski, F. Meyer auf der Heide, and C. Schindelhauer, "Smart robot teams exploring sparse trees," in International Symposium of Matematical Foundations of Computer Science, (Stará Lesná, Slovakia), Aug. 2006.
10. P. Fraigniaud, L. Ga̧sieniec, D. R. Kowalski, and A. Pelc, "Collective tree exploration," in LATIN 2004 (M. Farach-Colton, ed.), vol. 2976 of Lecture Notes in Computer Science, pp. 141-151, Springer Verlag, 2004.
11. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Belmont, MA: Athena Scientific, 1997.
12. A. Lubiw, "Decomposing polygonal regions into convex quadrilaterals," in First Annual Symposium on Computational Geometry, (Baltimore, MA), pp. 97-106, 1985.