Distributed algorithm

About: Distributed algorithm is a research topic. Over the lifetime, 20416 publications have been published within this topic receiving 548109 citations.

Distributed Algorithms for Aggregative Games on Graphs

Abstract: We consider a class of Nash games, termed as aggregative games, being played over a networked system. In an aggregative game, a player's objective is a function of the aggregate of all the players' decisions. Every player maintains an estimate of this aggregate, and the players exchange this information with their local neighbors over a connected network. We study distributed synchronous and asynchronous algorithms for information exchange and equilibrium computation over such a network. Under standard conditions, we establish the almost-sure convergence of the obtained sequences to the equilibrium point. We also consider extensions of our schemes to aggregative games where the players' objectives are coupled through a more general form of aggregate function. Finally, we present numerical results that demonstrate the performance of the proposed schemes.

Deployment Algorithms for UAV Airborne Networks Toward On-Demand Coverage

Abstract: Due to the flying nature of unmanned aerial vehicles (UAVs), it is very attractive to deploy UAVs as aerial base stations and construct airborne networks to provide service for on-ground users at temporary events (such as disaster relief, military operation, and so on). In the constructing of UAV airborne networks, a challenging problem is how to deploy multiple UAVs for on-demand coverage while at the same time maintaining the connectivity among UAVs. To solve this problem, we propose two algorithms: a centralized deployment algorithm and a distributed motion control algorithm. The first algorithm requires the positions of user equipments (UEs) on the ground and provides the optimal deployment result (i.e., the minimal number of UAVs and their respective positions) after a global computation. This algorithm is applicable to the scenario that requires a minimum number of UAVs to provide desirable service for already known on-ground UEs. Differently, the second algorithm requires no global information or computation, instead, it enables each UAV to autonomously control its motion, find the UEs and converge to on-demand coverage. This distributed algorithm is applicable to the scenario where using a given number of UAVs to cover UEs without UEs’ specific position information. In both algorithms, the connectivity of the UAV network is maintained. Extensive simulations validate our proposed algorithms.

Distributed Optimal Energy Management for Energy Internet

Abstract: In this paper, a novel energy management framework for energy Internet with many energy bodies is presented, which features multicoupling of different energy forms, diversified energy roles, and peer-to-peer energy supply/demand, etc. The energy body as an integrated energy unit, which may have various functionalities and play multiple roles at the same time, is formulated for the system model development. Forecasting errors, confidence intervals, and penalty factor are also taken into account to model renewable energy resources to provide tradeoff between optimality and possibility. Furthermore, a novel distributed-consensus alternating direction method of multipliers (ADMM) algorithm, which contains a dynamic average consensus algorithm and distributed ADMM algorithm, is presented to solve the optimal energy management problem of energy Internet. The proposed algorithm can effectively handle the problems of power-heat-gas-coupling, global constraint limits, and nonlinear objective function. With this effort, not only the optimal energy market clearing price but also the optimal energy outputs/demands can be obtained through only local communication and computation. Simulation results are presented to illustrate the effectiveness of the proposed distributed algorithm.

Distributed Algorithms for Dispersion in Indoor Environments Using a Swarm of Autonomous Mobile Robots

Abstract: We describe a set of distributed algorithms used to disperse a large group of autonomous mobile robots efficiently throughout an indoor environment. Only local inter-robot communication and processing is used. Ad-hoc communications network topologies formed by gradient floods spread messages and guide robot motion. Special attention has been given to doors, hallways, and other constrictions. The network maintains a route to chargers to allow self-charging.

Acknowledgment-Based Broadcast Protocol for Reliable and Efficient Data Dissemination in Vehicular Ad Hoc Networks

Abstract: We propose a broadcast algorithm suitable for a wide range of vehicular scenarios, which only employs local information acquired via periodic beacon messages, containing acknowledgments of the circulated broadcast messages. Each vehicle decides whether it belongs to a connected dominating set (CDS). Vehicles in the CDS use a shorter waiting period before possible retransmission. At time-out expiration, a vehicle retransmits if it is aware of at least one neighbor in need of the message. To address intermittent connectivity and appearance of new neighbors, the evaluation timer can be restarted. Our algorithm resolves propagation at road intersections without any need to even recognize intersections. It is inherently adaptable to different mobility regimes, without the need to classify network or vehicle speeds. In a thorough simulation-based performance evaluation, our algorithm is shown to provide higher reliability and message efficiency than existing approaches for nonsafety applications.