This paper proposes a novel class of distributed continuous-time coordination algorithms to solve network optimization problems whose cost function is a sum of local cost functions associated to the individual agents. 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, and (ii) connected graph topologies when the local costs are strongly convex with locally Lipschitz gradients. When the local cost functions are convex and the global cost function is strictly convex, we establish asymptotic convergence under connected graph topologies. We also characterize the algorithm's correctness under time-varying interaction topologies and study its privacy preservation properties. Motivated by practical considerations, we analyze the algorithm implementation with discrete-time communication. We provide an upper bound on the stepsize that guarantees exponential convergence over connected graphs for implementations with periodic communication. Building on this result, we design a provably-correct centralized event-triggered communication scheme that is free of Zeno behavior. Finally, we develop a distributed, asynchronous event-triggered communication scheme that is also free of Zeno with asymptotic convergence guarantees. Several simulations illustrate our results.
Technological advances in ad-hoc networking and the availability of low-cost reliable computing, data storage and sensing devices have made possible scenarios where the coordination of many subsystems extends the range of human capabilities. Smart grid operations, smart transportation, smart healthcare and sensing networks for environmental monitoring and exploration in hazardous situations are just a few examples of such network operations. In these applications, the ability of a network system to, in a decentralized fashion, fuse information, compute common estimates of unknown quantities, and agree on a common view of the world is critical. These problems can be formulated as agreement problems on linear combinations of dynamically changing reference signals or local parameters. This dynamic agreement problem corresponds to dynamic average consensus, which is the problem of interest of this article. The dynamic average consensus problem is for a group of agents to cooperate in order to track the average of locally available time-varying reference signals, where each agent is only capable of local computations and communicating with local neighbors, see Figure 1. Figure 1: A group of communication agents, each endowed with a time-varying reference signal. 1 arXiv:1803.04628v2 [cs.SY] 24 Nov 2018 Centralized solutions have drawbacksThe difficulty in the dynamic average consensus problem is that the information is distributed across the network. A straightforward solution, termed centralized, to the dynamic average consensus problem appears to be to gather all of the information in a single place, do the computation (in other words, calculate the average), and then send the solution back through the network to each agent. Although simple, the centralized approach has numerous drawbacks: (1) the algorithm is not robust to failures of the centralized agent (if the centralized agent fails, then the entire computation fails), (2) the method is not scalable since the amount of communication and memory required on each agent scales with the size of the network, (3) each agent must have a unique identifier (so that the centralized agent counts each value only once), (4) the calculated average is delayed by an amount which grows with the size of the network, and (5) the reference signals from each agent are exposed over the entire network which is unacceptable in applications involving sensitive data. The centralized solution is fragile due to existence of a single failure point in the network. This can be overcome by having every agent act as the centralized agent. In this approach, referred to as flooding, agents transmit the values of the reference signals across the entire network until each agent knows each reference signal. This may be summarized as "first do all communications, then do all computations". While flooding fixes the issue of robustness to agent failures, it is still subject to many of the drawbacks of the centralized solution. Also, although this approach works reasonably well for small size networks,...
This paper introduces a novel continuous-time dynamic average consensus algorithm for networks whose interaction is described by a strongly connected and weight-balanced directed graph. The proposed distributed algorithm allows agents to track the average of their dynamic inputs with some steady-state error whose size can be controlled using a design parameter.This steady-state error vanishes for special classes of input signals. We analyze the asymptotic correctness of the algorithm under time-varying interaction topologies and characterize the requirements on the stepsize for discrete-time implementations. We show that our algorithm naturally preserves the privacy of the local input of each agent. Building on this analysis, we synthesize an extension of the algorithm that allows individual agents to control their own rate of convergence towards agreement and handle saturation bounds on the driving command. Finally, we show that the proposed extension additionally preserves the privacy of the transient response of the agreement states and the final agreement value from internal and external adversaries.Numerical examples illustrate the results.
a b s t r a c tThis paper presents distributed algorithmic solutions that employ opportunistic inter-agent communication to achieve dynamic average consensus. In our solutions each agent is endowed with a local criterion that enables it to determine whether to broadcast its state to its neighbors. Our starting point is a continuous-time distributed coordination strategy that, under continuous-time communication, achieves practical asymptotic tracking of the dynamic average of the time-varying agents' reference inputs. Then, for this algorithm, depending on the directed or undirected nature of the time-varying interactions and under suitable connectivity conditions, we propose two different distributed event-triggered communication laws that prescribe agent communications at discrete time instants in an opportunistic fashion. In both cases, we establish positive lower bounds on the inter-event times of each agent and characterize their dependence on the algorithm design parameters. This analysis allows us to rule out the presence of Zeno behavior and characterize the asymptotic correctness of the resulting implementations. Several simulations illustrate the results.
a b s t r a c tIn this paper, we consider an in-network optimal resource allocation problem with multiple demand equations. We propose a novel distributed continuous-time algorithm that solves the problem over strongly connected and weight-balanced digraph network topologies when the local cost functions are strongly convex. We also discuss the extension of our convergence guarantees to dynamically changing topologies. Finally, we show that if the network is an undirected connected graph, we can guarantee stability and convergence of our algorithm for problems involving local convex functions. This convergence guarantee is to a point in the set of minimizers of our optimal resource allocation problem. The design and analysis of our algorithm are carried out using a control theoretic approach. We demonstrate our results through a numerical example.
This paper considers the problem of privacy preservation against passive internal and external malicious agents in the continuous-time Laplacian average consensus algorithm over strongly connected and weight-balanced digraphs. For this problem, we evaluate the effectiveness of use of additive perturbation signals as a privacy preservation measure against malicious agents that know the graph topology. Our results include (a) identifying the necessary and sufficient conditions on admissible additive perturbation signals that do not perturb the convergence point of the algorithm from the average of initial values of the agents; (b) obtaining the necessary and sufficient condition on the knowledge set of a malicious agent that enables it to identify the initial value of another agent; (c) designing observers that internal and external malicious agents can use to identify the initial conditions of another agent when their knowledge set on that agent enables them to do so. We demonstrate our results through a numerical example.
We report two decentralized multi-agent cooperative localization algorithms in which, to reduce the communication cost, inter-agent state estimate correlations are not maintained but accounted for implicitly. In our first algorithm, to guarantee filter consistency, we account for unknown inter-agent correlations via an upper bound on the joint covariance matrix of the agents. In the second method, we use an optimization framework to estimate the unknown inter-agent cross-covariance matrix. In our algorithms, each agent localizes itself in a global coordinate frame using a local filter driven by local dead reckoning and occasional absolute measurement updates, and opportunistically corrects its pose estimate whenever it can obtain relative measurements with respect to other mobile agents. To process any relative measurement, only the agent taken the measurement and the agent the measurement is taken from need to communicate with each other. Consequently, our algorithms are decentralized algorithms that do not impose restrictive network-wide connectivity condition. Moreover, we make no assumptions about the type of agents or relative measurements. We demonstrate our algorithms in simulation and a robotic experiment.Joint CL, which treats the team of mobile agents as one system and processes the inter-agent measurements to update the state estimate of all the agents, delivers the best localization accuracy. This is because the prior correlations allow agents other than the two involved in a relative measurement also benefit from relative measurement update (see [6] for further discussions). However, decentralized implementation of a joint CL in its naive form requires all-to-all or all-to-a-fusion-center communication at each timestep. To reduce the communication cost, [6]-[8] use decomposition techniques to fully decouple The authors are with the Mechanical and Aerospace Eng.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
334 Leonard St
Brooklyn, NY 11211
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.