Distributed deployment of asynchronous guards in art galleries

被引:39
作者
Ganguli, Anurag [1 ,2 ]
Cortes, Jorge [3 ]
Bullo, Francesco [2 ]
机构
[1] Univ Illinois, Coordinated Sci Lab, Champaign, IL 61820 USA
[2] Univ Calif Santa Barbara, Dept Mech & Environm Engn, Santa Barbara, CA 93106 USA
[3] Univ Calif Santa Cruz, Dept Appl Math & Stat, Santa Cruz, CA 95064 USA
来源
2006 AMERICAN CONTROL CONFERENCE, VOLS 1-12 | 2006年 / 1-12卷
关键词
D O I
10.1109/ACC.2006.1656416
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents deployment algorithms for multiple mobile robots with line-of-sight sensing and communication capabilities in a simple nonconvex polygonal environment. The objective of the proposed algorithms is to achieve full visibility of the environment. We solve the problem by constructing a novel data structure called the vertex-induced tree and designing schemes to deploy over the nodes of this tree by means of distributed algorithms. The agents are assumed to have access to a local memory and their operation is partially asynchronous.
引用
收藏
页码:1416 / +
页数:2
相关论文
共 8 条
[1]  
Bertsekas D., 2015, Parallel and distributed computation: numerical methods
[2]   COMBINATORIAL THEOREM IN PLANE GEOMETRY [J].
CHVATAL, V .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1975, 18 (01) :39-41
[3]   SHORT PROOF OF CHVATAL-WATCHMAN THEOREM [J].
FISK, S .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1978, 24 (03) :374-374
[4]  
Grace J, 2005, IEEE DECIS CONTR P, P2200
[5]  
Guilamo L., 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566), P3456
[6]   An incremental self-deployment algorithm for mobile sensor networks [J].
Howard, A ;
Mataric, MJ ;
Sukhatme, GS .
AUTONOMOUS ROBOTS, 2002, 13 (02) :113-126
[7]  
ISLER V, 2005, IN PRESS IEEE T ROBO
[8]   RECENT RESULTS IN ART GALLERIES [J].
SHERMER, TC .
PROCEEDINGS OF THE IEEE, 1992, 80 (09) :1384-1399