Entropy-Based Framework for Dynamic Coverage and Clustering Problems

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.

[1]  Eduardo Sontag.  A Lyapunov-Like Characterization of Asymptotic Controllability , 1983, SIAM Journal on Control and Optimization.

[2]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[3]  Sonia Martínez,et al.  Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.

[4]  E. Jaynes.  Information Theory and Statistical Mechanics , 1957 .

[5]  Xuemin Lin,et al.  Clustering Moving Objects for Spatio-temporal Selectivity Estimation , 2004, ADC.

[6]  Kenneth Rose.  Deterministic annealing, clustering, and optimization , 1991 .

[7]  S. Salapaka,et al.  On Combinatorial Optimization Problems with Mobile Sites and Resources , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[8]  A. Volgenant,et al.  Facility location: a survey of applications and methods , 1996 .

[9]  Geoffrey C. Fox,et al.  Constrained Clustering as an Optimization Method , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Eduardo Sontag.  A universal construction of Artstein's theorem on nonlinear stabilization , 1989 .

[11]  K. Rose.  Deterministic annealing for clustering, compression, classification, regression, and related optimization problems , 1998, Proc. IEEE.

[12]  S. Salapaka,et al.  Combinatorial Optimization Approach to Coarse Control Quantization , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[13]  C. W. Therrien,et al.  Decision, Estimation and Classification: An Introduction to Pattern Recognition and Related Topics , 1989 .

[14]  Carolyn L. Beck,et al.  Entropy based algorithm for combinatorial optimization problems with mobile sites and resources , 2008, 2008 American Control Conference.

[15]  Donald Geman,et al.  Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images , 1984 .

[16]  Sariel Har-Peled.  Clustering Motion , 2004, Discret. Comput. Geom..

[17]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[18]  Nicola Elia,et al.  Stabilization of linear systems with limited information , 2001, IEEE Trans. Autom. Control..

[19]  S Kullback,et al.  LETTER TO THE EDITOR: THE KULLBACK-LEIBLER DISTANCE , 1987 .

[20]  R. Baierlein.  Probability Theory: The Logic of Science , 2004 .

[21]  J. Fermaglich.  Electric Fields of the Brain: The Neurophysics of EEG , 1982 .

[22]  Puneet Sharma,et al.  A Scalable Approach to Combinatorial Library Design for Drug Discovery , 2008, J. Chem. Inf. Model..

[23]  Klaus-Robert Müller,et al.  The non-invasive Berlin Brain–Computer Interface: Fast acquisition of effective performance in untrained subjects , 2007, NeuroImage.

[24]  P. Sharma,et al.  A Maximum Entropy Based Scalable Algorithm for Resource Allocation Problems , 2007, 2007 American Control Conference.

[25]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .

[26]  Qiang Du,et al.  Centroidal Voronoi Tessellations: Applications and Algorithms , 1999, SIAM Rev..

[27]  T. J. Walker,et al.  The Evolutionary Ecology of Animal Migration , 1978 .

[28]  Yifan Li,et al.  Clustering moving objects , 2004, KDD.

[29]  Simon Haykin,et al.  Neural Networks: A Comprehensive Foundation , 1998 .

[30]  Mrdjan J. Jankovic,et al.  Constructive Nonlinear Control , 2011 .

[31]  J. Lambert.  Numerical Methods for Ordinary Differential Equations , 1991 .

[32]  Panos Kalnis,et al.  On Discovering Moving Clusters in Spatio-temporal Data , 2005, SSTD.

[33]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[34]  Robert M. Gray,et al.  Multiple local optima in vector quantizers , 1982, IEEE Trans. Inf. Theory.

[35]  Sanjoy K. Mitter,et al.  Control with Limited Information , 2001, Eur. J. Control.

[36]  Beng Chin Ooi,et al.  Continuous Clustering of Moving Objects , 2007, IEEE Transactions on Knowledge and Data Engineering.

[37]  Antonio Ortega,et al.  Reduced-Complexity Deterministic Annealing for Vector Quantizer Design , 2005, EURASIP J. Adv. Signal Process..

[38]  Jiuh-Biing Sheu,et al.  A fuzzy clustering-based approach to automatic freeway incident detection and characterization , 2002, Fuzzy Sets Syst..

[39]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[40]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[41]  F. Bullo,et al.  Decentralized algorithms for vehicle routing in a stochastic time-varying environment , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[42]  Padhraic Smyth,et al.  Translation-invariant mixture models for curve clustering , 2003, KDD '03.