Optimal topology design for dynamic networks

In this paper, we examine optimization-based methods for designing the network topology when the desired topology should have certain global variational properties, such as minimal power consumption for information exchange links, or supporting fast convergence of consensus-based distributed protocols. We first classify the optimization-based methodology for three distinct categories, namely, for construction of optimal non-geometric networks, time-invariant geometric networks, and time-varying geometric networks. We then proceed to propose optimization-based algorithms for each class of problems that aim to allocate the limited resources, e.g., communication ranges, in the most efficient way while achieving optimal performance. Examples and applications of the developed methodology are also examined.

[1]  Mehran Mesbahi,et al.  On maximizing the second smallest eigenvalue of a state-dependent graph Laplacian , 2006, IEEE Transactions on Automatic Control.

[2]  Tucker R. Balch,et al.  Behavior-based formation control for multirobot teams , 1998, IEEE Trans. Robotics Autom..

[3]  Randal W. Beard,et al.  A coordination architecture for spacecraft formation control , 2001, IEEE Trans. Control. Syst. Technol..

[4]  Stephen P. Boyd,et al.  Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization , 2008, SIAM J. Optim..

[5]  Stephen P. Boyd,et al.  Simultaneous routing and resource allocation via dual decomposition , 2004, IEEE Transactions on Communications.

[6]  L. El Ghaoui,et al.  Designing node and edge weights of a graph to meet Laplacian eigenvalue constraints , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[7]  Reza Olfati-Saber,et al.  Flocking for multi-agent dynamic systems: algorithms and theory , 2006, IEEE Transactions on Automatic Control.

[8]  Ali Jadbabaie,et al.  Decentralized Control of Connectivity for Multi-Agent Systems , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[9]  Johan Löfberg,et al.  YALMIP : a toolbox for modeling and optimization in MATLAB , 2004 .

[10]  R. Murray,et al.  Robust connectivity of networked vehicles , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[11]  Andrea J. Goldsmith,et al.  Design challenges for energy-constrained ad hoc wireless networks , 2002, IEEE Wirel. Commun..

[12]  Stephen P. Boyd,et al.  Sensor Selection via Convex Optimization , 2009, IEEE Transactions on Signal Processing.

[13]  M Mesbahi,et al.  H∞ performance and robust topology design of relative sensing networks , 2010, Proceedings of the 2010 American Control Conference.

[14]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[15]  Magnus Egerstedt,et al.  Graph Theoretic Methods in Multiagent Networks , 2010, Princeton Series in Applied Mathematics.

[16]  George J. Pappas,et al.  Potential Fields for Maintaining Connectivity of Mobile Networks , 2007, IEEE Transactions on Robotics.

[17]  Masakazu Kojima,et al.  Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations , 2003, Comput. Optim. Appl..

[18]  Zhengping Wu,et al.  THE CONSENSUS IN MULTI-AGENT SYSTEM WITH SPEED-OPTIMIZED NETWORK , 2009 .

[19]  J. Lofberg,et al.  YALMIP : a toolbox for modeling and optimization in MATLAB , 2004, 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508).

[20]  Stephen P. Boyd,et al.  Minimizing Effective Resistance of a Graph , 2008, SIAM Rev..

[21]  C. Hargraves,et al.  DIRECT TRAJECTORY OPTIMIZATION USING NONLINEAR PROGRAMMING AND COLLOCATION , 1987 .