Learn More
— This paper introduces a new method for reducing large directed graphs to simpler graphs with fewer nodes. The reduction is carried out through node and edge aggregation, where the simpler graph is representative of the original large graph. Representativeness is measured using a metric defined herein, which is motivated by thermodynamic free energy and(More)
In this technical note, we consider the dynamic coverage control problem from a clustering perspective, to which we apply control-theoretic methods to identify and track the cluster center dynamics. To the authors’ knowledge, this is the first work to consider tracking cluster centers when the dynamics of the system elements involve acceleration fields. We(More)
This paper proposes a state transition probability model for an elementary traffic network with four intersections, which is substantially the extension of the state transition probability model for a link based on a queue dynamic model. The state of this model is the combination of states of roads between these four intersections, so as the reward of each(More)
— Analysis, prediction and control of parametric generative models for stochastic processes arise in numerous applications, such as in biology, telecommunications, geography, seismology and finance. In many of these applications, it is desirable to obtain an aggregated behavior from an underlying network of stochastic interactions. This paper focuses on the(More)
  • 1