By Topic

IEEE Transactions on Control of Network Systems

Issue 2 • June 2014

Filter Results

Displaying Results 1 - 9 of 9
  • Table of contents

    Publication Year: 2014, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (418 KB)
    Freely Available from IEEE
  • IEEE Transactions on Control of Network Systems publication information

    Publication Year: 2014, Page(s): C2
    Request permission for commercial reuse | PDF file iconPDF (144 KB)
    Freely Available from IEEE
  • Cognitive Cooperative Random Access for Multicast: Stability and Throughput Analysis

    Publication Year: 2014, Page(s):135 - 144
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2139 KB) | HTML iconHTML

    In this paper, we investigate the queue stability and throughput of a two-user cognitive radio system with multicast traffic. We study the impact of network-level cooperation, in which one of the nodes can relay the packets of the other user that are not received at the destinations. Under this approach, if a packet transmitted by the primary user is not successfully received by the destination se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Projection-Based Model Reduction of Multi-Agent Systems Using Graph Partitions

    Publication Year: 2014, Page(s):145 - 154
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1492 KB) | HTML iconHTML

    In this paper, we establish a projection-based model reduction method for multiagent systems defined on a graph. Reduced order models are obtained by clustering the vertices (agents) of the underlying communication graph by means of suitable graph partitions. In the reduction process, the spatial structure of the network is preserved and the reduced order models can again be realized as multiagent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collective Circular Motion of Unicycle Type Vehicles With Nonidentical Constant Velocities

    Publication Year: 2014, Page(s):167 - 176
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2051 KB) | HTML iconHTML

    This paper addresses formation control problems for heterogeneous groups of unicycle type mobile agents with fixed cruising speed. The heterogeneity in the group is caused by the cruising speeds being nonidentical, which complicates the motion coordination problem but is of practical relevance, for example, in unmanned aerial vehicle applications. We show that two different types of collective cir... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiagent Flocking Under General Communication Rule

    Publication Year: 2014, Page(s):155 - 166
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2211 KB) | HTML iconHTML

    In this paper, we consider a multiagent system consisting of mobile agents with second-order dynamics. The communication network is determined by a general interaction rule based on the distance between agents. The goal of this paper is to determine practical conditions ensuring that the agents asymptotically agree on a common velocity, i.e., a flocking behavior is achieved. Unlike previous studie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convex Relaxation of Optimal Power Flow—Part II: Exactness

    Publication Year: 2014, Page(s):177 - 189
    Cited by:  Papers (56)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (635 KB) | HTML iconHTML

    This tutorial summarizes recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural properties rather than algorithms. Part I presents two power flow models, formulates OPF and their relaxations in each model, and proves equivalence relations among them. Part II presents sufficient conditions under which the convex relaxations are exact. View full abstract»

    Open Access
  • Distributed Weight Balancing Over Digraphs

    Publication Year: 2014, Page(s):190 - 201
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (993 KB) | HTML iconHTML

    A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role in a number of applications, including cooperative control, distributed optimization, and distributed averaging. We propose distributed algorithms that operate over static topolo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Transactions on Control of Network Systems information for authors

    Publication Year: 2014, Page(s):202 - 203
    Request permission for commercial reuse | PDF file iconPDF (139 KB)
    Freely Available from IEEE

Aims & Scope

The IEEE Transactions on Control of Network Systems is committed to the timely publication of high-impact papers at the intersection of control systems and network science.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Ioannis Ch. Paschalidis
Boston University