.png){kind=icon}
返回
Asynchronous Distributed Camera Network Patrolling Under Unreliable Communication
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2017.2703926.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study the problem of real-time optimal distributed partitioning for perimeter patrolling in the context of multicamera networks for surveillance, where each camera has limited mobility range and speed, and the communication is unreliable. The objective is to coordinate the cameras in order to minimize the time elapsed between two different visits of each point of the perimeter. We address this problem by casting it into a convex problem in which the perimeter is partitioned into nonoverlapping segments, each patrolled by a camera that sweeps back and forth at the maximum speed. We then propose an asynchronous distributed algorithm that guarantees that these segments cover the whole patrolling perimeter at any time and asymptotically converge to the optimal centralized solution under reliable communication. We finally modify the proposed algorithm in order to attain the same convergence and covering properties even in the more challenging scenario, where communication is lossy and there is no channel feedback, i.e., the transmitting camera is not aware whether a packet has been received or not by its neighbors.
Keyword:
Camera networks
distributed algorithms
patrolling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Plasmapheresis in neurological disorders: Experience from a tertiary care hospital in South India
OAAI
.png){kind=icon}
OAAI分享收藏Luteinizing Hormone-Releasing Hormone (LHRH) Biosynthesis and Secretion in Embryonic LHRH Neurons
OAAI
OAAI分享收藏Consistency and complexity of response sequences as a function of schedules of noncontingent reward.
PREAI
分享收藏分享收藏
查看更多内容