返回
Entropy-Based Framework for Dynamic Coverage and Clustering Problems
DOI:10.1109/TAC.2011.2166713.png)
摘要
En 中文
We propose a computationally efficient framework to solve a large class of dynamic coverage and clustering problems, ranging from those that arise from deployment of mobile sensor networks to classification of cellular data for diagnosing cancer stages. This framework provides the ability to identify natural clusters in the underlying data set. In particular, we define the problem of minimizing instantaneous coverage as a combinatorial optimization problem in a Maximum Entropy Principle (MEP) framework that we formulate specifically for the dynamic setting, and which allows us to address inherent tradeoffs such as those between the resolution of the identified clusters and computational cost. The proposed MEP framework addresses both the coverage and the tracking aspects of these problems. Locating cluster centers of swarms of moving objects and tracking them is cast as a control design problem ensuring that the algorithm achieves progressively better coverage with time. Simulation results are presented that highlight the features of this framework; these results demonstrate that the proposed algorithm attains target coverage costs five to seven times faster than related frame-by-frame methods.
Keyword:
Maximum entropy principle (MEP)
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
The pandemic appears to have spared Africa so far. Scientists are struggling to explain why
Science
IF0
Antiviral Activities of Tragacanthin Polysaccharides on Punta Toro Virus Infections in Mice
Chemotherapy
IF0
Crystal chemistry and metal-hydrogen bonding in anisotropic and interstitial hydrides of intermetallics of rare earth (R) and transition metals (T), RT3 and R2T7稀土 (R) 和过渡金属 (T) 的金属间化合物的各向异性和间隙氢化物中的晶体化学和金属氢键,RT3 和R2T7

