Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCoordination on Time-Varying Antagonistic Networks
141
0
0.0
(
0
)
Authors
Wentao Zhang
Ask ChatGPT about the research
No Arabic abstract
This paper studies coordination problem for time-varying networks suffering from antagonistic information, quantified by scaling parameters. By such a manner, interacting property of the participating individuals and antagonistic information can be quantified in a fully decoupled perspective, thus benefiting from merely directed spanning tree hypothesis is needed, in the sense of usual algebraic graph theory. We start with rigorous argument on the existence of weighted gain, and then derive relation among weighted gain, scaling parameter and Laplacian matrix guaranteeing antagonistic information cannot diverge system state. Based on these arguments, we devise coordination algorithm constrained by topology-dependent average time condition, thus relaxing the examination of directed spanning tree requirement for the union graph that is usually intractable. Moreover, the induced theoretical results are applied to time-varying networks with several mutually uninfluenced agents, in accompanying with some discussions and comparisons with respect to the existing developments.
rate research
Read More
In this paper, we consider the problem of optimally coordinating the response of a group of distributed energy resources (DERs) so they collectively meet the electric power demanded by a collection of loads, while minimizing the total generation cost and respecting the DER capacity limits. This problem can be cast as a convex optimization problem, where the global objective is to minimize a sum of convex functions corresponding to individual DER generation cost, while satisfying (i) linear inequality constraints corresponding to the DER capacity limits and (ii) a linear equality constraint corresponding to the total power generated by the DERs being equal to the total power demand. We develop distributed algorithms to solve the DER coordination problem over time-varying communication networks with either bidirectional or unidirectional communication links. The proposed algorithms can be seen as distribute
In this paper, we equip the conventional discrete-time queueing network with a Markovian input process, that, in addition to the usual short-term stochastics, governs the mid- to long-term behavior of the links between the network nodes. This is reminiscent of so-called Jump-Markov systems in control theory and allows the network topology to change over time. We argue that the common back-pressure control policy is inadequate to control such network dynamics and propose a novel control policy inspired by the paradigms of model-predictive control. Specifically, by defining a suitable but arbitrary prediction horizon, our policy takes into account the future network states and possible control actions. This stands in clear contrast to most other policies which are myopic, i.e. only consider the next state. We show numerically that such an approach can significantly improve the control performance and introduce several variants, thereby trading off performance versus computational complexity. In addition, we prove so-called throughput optimality of our policy which guarantees stability for all network flows that can be maintained by the network. Interestingly, in contrast to general stability proofs in model-predictive control, our proof does not require the assumption of a terminal set (i.e. for the prediction horizon to be large enough). Finally, we provide several illustrating examples, one of which being a network of synchronized queues. This one in particular constitutes an interesting system class, in which our policy exerts superiority over general back-pressure policies, that even lose their throughput optimality in those networks.
We propose a mathematical model to study coupled epidemic and opinion dynamics in a network of communities. Our model captures SIS epidemic dynamics whose evolution is dependent on the opinions of the communities toward the epidemic, and vice versa. In particular, we allow both cooperative and antagonistic interactions, representing similar and opposing perspectives on the severity of the epidemic, respectively. We propose an Opinion-Dependent Reproduction Number to characterize the mutual influence between epidemic spreading and opinion dissemination over the networks. Through stability analysis of the equilibria, we explore the impact of opinions on both epidemic outbreak and eradication, characterized by bounds on the Opinion-Dependent Reproduction Number. We also show how to eradicate epidemics by reshaping the opinions, offering researchers an approach for designing control strategies to reach target audiences to ensure effective epidemic suppression.
This paper investigates bilateral control of teleoperators with closed architecture and subjected to arbitrary bounded time-varying delay. A prominent challenge for bilateral control of such teleoperators lies in the closed architecture, especially in the context not involving interaction force/torque measurement. This yields the long-standing situation that most bilateral control rigorously developed in the literature is hard to be justified as applied to teleoperators with closed architecture. With a new class of dynamic feedback, we propose kinematic and adaptive dynamic controllers for teleoperators with closed architecture, and we show that the proposed kinematic and dynamic controllers are robust with respect to arbitrary bounded time-varying delay. In addition, by exploiting the input-output properties of an inverted form of the dynamics of robot manipulators with closed architecture, we remove the assumption of uniform exponential stability of a linear time-varying system due to the adaptation to the gains of the inner controller in demonstrating stability of the presented adaptive dynamic control. The application of the proposed approach is illustrated by the experimental results using a Phantom Omni and a UR10 robot.
Load modeling is difficult due to its uncertain and time-varying properties. Through the recently proposed ambient signals load modeling approach, these properties can be more frequently tracked. However, the large dataset of load modeling results becomes a new problem. In this paper, a hierarchical temporal and spatial clustering method of load models is proposed, after which the large size load model dataset can be represented by several representative load models (RLMs). In the temporal clustering stage, the RLMs of one load bus are picked up through clustering to represent all the load models of the load bus at different time. In the spatial clustering stage, the RLMs of all the load buses form a new set and the RLMs of the system are picked up through spatial clustering. In this way, the large sets of load models are represented by a small number of RLMs, through which the storage space of the load models is significantly reduced. The validation results in IEEE 39 bus system have shown that the simulation accuracy can still be maintained after replacing the load models with the RLMs. In this way, the effectiveness of the proposed hierarchical clustering framework is validated.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
