Filters








1,413 Hits in 4.8 sec

Periodic and event-triggered communication for distributed continuous-time convex optimization

Solmaz S. Kia, Jorge Cortes, Sonia Martinez
2014 2014 American Control Conference  
We also characterize the privacy preservation properties of our algorithm and extend the convergence guarantees to the case of time-varying, strongly connected, weight-balanced digraphs.  ...  We propose a distributed continuous-time algorithm to solve a network optimization problem where the global cost function is a strictly convex function composed of the sum of the local cost functions of  ...  ACKNOWLEDGMENTS This work was supported by L3 Communications through the UCSD Cymer Center for Control Systems and Dynamics and NSF Award ECCS-1307176.  ... 
doi:10.1109/acc.2014.6859122 dblp:conf/amcc/KiaCM14 fatcat:avbzs5zizjdj3oo7fwhyvrag5i

Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication [article]

Solmaz S. Kia, Jorge Cortes, Sonia Martinez
2014 arXiv   pre-print
We establish the exponential convergence of the proposed algorithm under (i) strongly connected and weight-balanced digraph topologies when the local costs are strongly convex with globally Lipschitz gradients  ...  We provide an upper bound on the stepsize that guarantees exponential convergence over connected graphs for implementations with periodic communication.  ...  Strongly Connected, Weight-Balanced Digraphs Here, we study the convergence of the distributed optimization algorithm (3) over strongly connected and weight-balanced digraph topologies.  ... 
arXiv:1401.4432v3 fatcat:3jyg7s47kva4bcol2ltoxh7cgi

Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication

Solmaz S. Kia, Jorge Cortés, Sonia Martínez
2015 Automatica  
We establish the exponential convergence of the proposed algorithm under (i) strongly connected and weight-balanced digraph topologies when the local costs are strongly convex with globally Lipschitz gradients  ...  We provide an upper bound on the stepsize that guarantees exponential convergence over connected graphs for implementations with periodic communication.  ...  Strongly Connected, Weight-Balanced Digraphs Here, we study the convergence of the distributed optimization algorithm (3) over strongly connected and weight-balanced digraph topologies.  ... 
doi:10.1016/j.automatica.2015.03.001 fatcat:oxj5a262fvgf7d56gv5vobzyse

Distributed Resource Allocation over Time-varying Balanced Digraphs with Discrete-time Communication [article]

Lanlan Su, Mengmou Li, Vijay Gupta, Graziano Chesi
2021 arXiv   pre-print
We provide a passivity-based perspective for the continuous-time algorithm, based on which an intermittent communication scheme is developed.  ...  This work is concerned with the problem of distributed resource allocation in continuous-time setting but with discrete-time communication over infinitely jointly connected and balanced digraphs.  ...  A digraph is strongly connected if for every pair of nodes there exists a directed path connecting them.  ... 
arXiv:1907.13003v3 fatcat:dtzebczl55dnlgp6uarxgcn2ca

A Distributed Algorithm for a Finite Time Horizon Resource Allocation over a Directed Network

li wei, Lin Zhiyun, Gangfeng Yan, Kai Cai
2020 IET Control Theory & Applications  
The authors show that the convergence and optimality can be ensured provided that the digraph within the time horizon is strongly connected.  ...  Introduction The resource allocation problem, seeking to find an optimal allocation of a fixed amount of resources for a network of agents (also called users) has been intensively investigated for decades  ...  (k) ≠ 0 in a strongly connected digraph if V > 1.  ... 
doi:10.1049/iet-cta.2019.1404 fatcat:jjttherqo5gbblfvieujxn7yty

Page 5272 of Mathematical Reviews Vol. , Issue 98H [page]

1998 Mathematical Reviews  
for optimally increasing the edge connectivity.  ...  The degree of cyclicity cyc(G) of graph G is defined as the maximum cardinality of the strongly connected components of G.  ... 

Digraph Spectral Clustering with Applications in Distributed Sensor Validation

Yue-Jin Du, Hui Lu, Li-Dong Zhai
2014 International Journal of Distributed Sensor Networks  
In this paper, we develop a generalized digraph spectral clustering method.  ...  However, the traditional spectral clustering is developed for undirected graph, and the naive generalization for directed graph by symmetrization of the adjacency matrix will lead to loss of network information  ...  Conflict of Interests The authors declare that there is no conflict of interests regarding the publication of this paper.  ... 
doi:10.1155/2014/536901 fatcat:ze7l3fblkje3tmvalr4xwf3oaq

Distributed event-triggered coordination for average consensus on weight-balanced digraphs [article]

Cameron Nowzari, Jorge Cortes
2015 arXiv   pre-print
This paper proposes a novel distributed event-triggered algorithmic solution to the multi-agent average consensus problem for networks whose communication topology is described by weight-balanced, strongly  ...  connected digraphs.  ...  For a strongly connected and weight-balanced digraph, zero is a simple eigenvalue of L s .  ... 
arXiv:1407.7921v3 fatcat:zqidw7awondd3gkoa57unn4r7a

Decentralized topology control for robotic networks with limited field of view sensors

D. Di Paola, R. De Asmundis, A. Gasparri, A. Rizzo
2012 2012 American Control Conference (ACC)  
This paper addresses the problem of estimating an approximated minimum strongly connected digraph contained in a given digraph.  ...  Preserving connectivity of a network topology is a crucial aspect for multi-robot systems in order to perform almost any collaborative task.  ...  CONCLUSION In this paper the problem of estimating an approximated minimum strongly connected digraph for the topology control of a network of heterogeneous robotic agents with limited field of view has  ... 
doi:10.1109/acc.2012.6315292 fatcat:zuzeevm4tffplfyfnscbitiwd4

IFP-based Distributed Optimization With Event-triggered Communication [article]

Mengmou Li, Lanlan Su, Tao Liu
2020 arXiv   pre-print
First, we analyze a distributed continuous-time algorithm over uniformly jointly strongly connected balanced digraphs and show its exponential convergence over strongly connected digraphs.  ...  Then, we propose an event-triggered communication mechanism for this algorithm.  ...  Recently, a periodic sampling communication mechanism is proposed in [13] over weight-balanced and uniformly jointly strongly connected digraphs for resource allocation problem.  ... 
arXiv:2003.01933v1 fatcat:p7tb6lcgbnfx3c4oboog4n6wqm

Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships

Yanhua Li, Wei Chen, Yajun Wang, Zhi-Li Zhang
2013 Proceedings of the sixth ACM international conference on Web search and data mining - WSDM '13  
In particular, we extend the classic voter model to signed networks and analyze the dynamics of influence diffusion of two opposite opinions.  ...  We then apply our results to solve the influence maximization problem and develop efficient algorithms to select initial seeds of one opinion that maximize either its short-term influence coverage or long-term  ...  A sink component of a signed digraph is a strongly connected component that has no outgoing edges to any nodes outside the component.  ... 
doi:10.1145/2433396.2433478 dblp:conf/wsdm/Li0WZ13 fatcat:crgh3uqwavhjnkjyonvj7jc2ai

Convergence of Gossip Algorithms for Consensus in Wireless Sensor Networks with Intermittent Links and Mobile Nodes

Shaochuan Wu, Jiayan Zhang, Yuguan Hou, Xu Bai
2014 Mathematical Problems in Engineering  
For partitionally strongly connected digraphs, simulation results illustrate that gossip algorithms actually converge, and broadcast gossip algorithms can converge faster than pairwise gossip algorithms  ...  In addition we characterize the supremum for the mean squared error of convergence as a function associated with the initial states and the number of nodes.  ...  Conflict of Interests The authors declare that there is no conflict of interests regarding the publication of this paper.  ... 
doi:10.1155/2014/836584 fatcat:ivwve523vfazpgwva3cn4ym3cm

Distributed event-triggered coordination for average consensus on weight-balanced digraphs

Cameron Nowzari, Jorge Cortés
2016 Automatica  
connected digraphs.  ...  possibility of an infinite number of events happening in a finite time period.  ...  For a strongly connected and weight-balanced digraph, zero is a simple eigenvalue of L s .  ... 
doi:10.1016/j.automatica.2016.01.069 fatcat:gkd6j275obggbh5ejweulkcpty

Computing periodic request functions to speed-up the analysis of non-cyclic task models

Haibo Zeng, Marco Di Natale
2014 Real-time systems  
., those modeled with a single source vertex and a period parameter specifying the minimum amount of time that must elapse between successive activations of the source job) allow for efficient schedulability  ...  Tasks are units of sequential code implementing the system actions and executed concurrently by an operating system.  ...  for strongly connected task digraphs.  ... 
doi:10.1007/s11241-014-9209-5 fatcat:mayz6looc5cn3knlnnp5ligm7e

Self-diclique circulant digraphs

Marietjie Frick, Bernardo Llano, Rita Zuazua
2015 Mathematica Bohemica  
Dicliques have frequently appeared in the literature the last years in connection with the construction and analysis of different types of networks, for instance biochemical, neural, ecological, sociological  ...  Consider X and Y (not necessarily disjoint) nonempty subsets of vertices (or nodes) of In this paper, we provide a characterization of the self-diclique circulant digraphs and an infinite family of non-circulant  ...  Are there, besides the directed cycles, more k-periodic digraphs in the family of all finite strongly connected digraphs?  ... 
doi:10.21136/mb.2015.144401 fatcat:ncfa4eib55g7zkmnqf2u42fywy
« Previous Showing results 1 — 15 out of 1,413 results