Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции
Suboptimal decentralized blanket coverage control of mobile autonomous sensor networks. / Nasimov, M.; Matveev, A.
6th International Congress on Ultra Modern Telecommunications and Control Systems. Curran Associates, Inc. , 2015. стр. 366-371.Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции
}
TY - GEN
T1 - Suboptimal decentralized blanket coverage control of mobile autonomous sensor networks
AU - Nasimov, M.
AU - Matveev, A.
PY - 2015
Y1 - 2015
N2 - © 2014 IEEE.We propose a novel distributed control algorithm for self-deployment of a network of autonomous mobile sensors in the problem of blanket coverage. The objective is to deploy sensors in a given and a priori unknown bounded region of arbitrary shape so that any its point is sensed by at least one sensor. Moreover, this objective should be achieved by as few sensors as possible. The proposed algorithm is decentralized, computationally inexpensive, employs information exchange only between currently nearest neighbors in the sensor network, and ensures an eventual stopover of the entire network. A mathematically rigorous proof of finite time convergence of the proposed algorithm is provided. Its performance is illustrated by computer simulations carried out for various scenarios.
AB - © 2014 IEEE.We propose a novel distributed control algorithm for self-deployment of a network of autonomous mobile sensors in the problem of blanket coverage. The objective is to deploy sensors in a given and a priori unknown bounded region of arbitrary shape so that any its point is sensed by at least one sensor. Moreover, this objective should be achieved by as few sensors as possible. The proposed algorithm is decentralized, computationally inexpensive, employs information exchange only between currently nearest neighbors in the sensor network, and ensures an eventual stopover of the entire network. A mathematically rigorous proof of finite time convergence of the proposed algorithm is provided. Its performance is illustrated by computer simulations carried out for various scenarios.
U2 - 10.1109/ICUMT.2014.7002129
DO - 10.1109/ICUMT.2014.7002129
M3 - Conference contribution
SP - 366
EP - 371
BT - 6th International Congress on Ultra Modern Telecommunications and Control Systems
PB - Curran Associates, Inc.
T2 - 2014 6th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, ICUMT 2014
Y2 - 6 October 2014 through 8 October 2014
ER -
ID: 4008859