IEEE Transactions on Control of Network Systems | All Volumes | IEEE Xplore

Table of contents

Publication Year: 2016,Page(s):C1 - C1

Table of contents

Year: 2016 | Volume: 3 | Issue: 3

IEEE Transactions on Control of Network Systemspublication information

Publication Year: 2016,Page(s):C2 - C2

IEEE Transactions on Control of Network Systemspublication information

Year: 2016 | Volume: 3 | Issue: 3
This paper studies distributed strategies for average-consensus of arbitrary vectors in multiagent systems, when the interagent information exchange is corrupted by the agents states within the same network. In particular, each neighboring state received by an agent has an additive component that consists of projections of the states at other agents; the agents corrupting this exchange are unknown...Show More
Inspired by behaviors of schools of fish seeking darker (shaded) regions in environments, this paper proposes a distributed source seeking strategy for a mobile sensor network. The strategy allows each sensing agent to take instantaneous measurements of the field and collectively move against the direction of spatial gradient, without explicitly estimating the gradient. For each agent, one portion...Show More
Modeled after the hierarchical control architecture of power transmission systems, a layering of primary, secondary, and tertiary control has become the standard operation paradigm for islanded microgrids. Despite this superficial similarity, the control objectives in microgrids across these three layers are varied and ambitious, and they must be achieved while allowing for robust plug-and-play op...Show More
Automatic generation control (AGC) regulates mechanical power generation in response to load changes through local measurements. Its main objective is to maintain system frequency and keep energy balanced within each control area in order to maintain the scheduled net interchanges between control areas. The scheduled interchanges as well as some other factors of AGC are determined at a slower time...Show More
This paper is concerned with the minimum variance filtering problem for a class of time-varying systems with both additive and multiplicative stochastic noises through a sensor network with a given topology. The measurements collected via the sensor network are subject to stochastic sensor gain degradation, and the gain degradation phenomenon for each individual sensor occurs in a random way gover...Show More
This paper investigates the use of event-based communication in a distributed model predictive control (DMPC) scheme for linear subsystems interconnected by dynamics and costs. In the proposed DMPC scheme, all subsystems optimize their local input sequences in parallel, and local iterations are performed to update the global input sequence. To reduce the load on the communication network, we propo...Show More
This paper presents an algorithm for the synthesis of robust distributed controllers for interconnected linear discrete-time systems. For a network of interconnected uncertain linear time-invariant systems, the distributed controller achieves robust stability and a guaranteed level of robust performance in a well-defined H∞ sense. The setting of this paper is in discrete time. Based on the theory ...Show More
Nonconvex and structured optimization problems arise in many engineering applications that demand scalable and distributed solution methods. The study of the convergence properties of these methods is, in general, difficult due to the nonconvexity of the problem. In this paper, two distributed solution methods that combine the fast convergence properties of augmented Lagrangian-based methods with ...Show More
This paper considers dyadic-exchange networks in which individual agents autonomously form coalitions of size two and agree on how to split a transferable utility. Valid results for this game include stable (if agents have no unilateral incentive to deviate), balanced (if matched agents obtain similar benefits from collaborating), or Nash (both stable and balanced) outcomes. We design provably cor...Show More
We consider a wireless network with a set of transmitter-receiver pairs, or links, that share a common channel, and address the problem of emptying finite traffic volume from the transmitters in minimum time. This, so-called, minimum-time scheduling problem has proven to be NP-hard in general. In this paper, we study a class of minimum-time scheduling problems in which the link rates have a partic...Show More

IEEE Transactions on Control of Network Systemsinformation for authors

Publication Year: 2016,Page(s):332 - 333

IEEE Transactions on Control of Network Systemsinformation for authors

Year: 2016 | Volume: 3 | Issue: 3

Contact Information

Editor-in-Chief
Lacra Pavel
University of Toronto
Toronto,ON
Canada
ieee-tcns@ece.utoronto.ca