In this paper,a distributed consensus protocol is proposed for discrete-time single-integral multi-agent systems with communication noises under general fixed directed *** time-varying control gains satisfying the sto...
详细信息
In this paper,a distributed consensus protocol is proposed for discrete-time single-integral multi-agent systems with communication noises under general fixed directed *** time-varying control gains satisfying the stochastic approximation conditions are introduced to attenuate noises,thus the closed-loop multi-agent system is intrinsically a linear time-varying stochastic difference *** the mean square consensus convergence analysis is developed based on the Lyapunov technique,and the construction of the Lyapunov function especially does not require the balanced network topology condition assumed for the existence of quadratic Lyapunov *** is proved that the state of each agent converges in mean square to a common random variable whose mathematical expectation is the weighted average of agents' initial state values;meanwhile,the variance of the random variable is *** proposed protocol can be applicable to more general multi-agent networks,particularly when the bidirectional and/or balanced information communications are not required.
The lifetime is a critical parameter for wireless sensor networks，which is defined as the maximum time of delivering certain data to the sink node before sensor node runs out of energy under an initial energy is give...
详细信息
The lifetime is a critical parameter for wireless sensor networks，which is defined as the maximum time of delivering certain data to the sink node before sensor node runs out of energy under an initial energy is given. In this paper, we propose a distributed algorithm for data gathering in wireless sensor networks with the assistance of network coding, such that the network lifetime is maximized. We prove rigorously that the proposed algorithm converge to the optimal solution of regularized problem.
This paper investigates the generalized Nash equilibrium(GNE) seeking problem of the noncooperative *** consider the problem that the participants in the noncooperative game have two different dynamics(the second-orde...
详细信息
This paper investigates the generalized Nash equilibrium(GNE) seeking problem of the noncooperative *** consider the problem that the participants in the noncooperative game have two different dynamics(the second-order linear dynamics and Euler-Lagrange nonlinear dynamics),and the feasible decision set is subject to the coupling equality constraints,the participant only can access the necessary information of its *** on the time base generator(TBG),we propose a distributed GNE seeking algorithms,it can converge to GNE with the predefined time,and the time can be designed in advance by the user without relying on the initial value and any design ***,the effectiveness of the algorithm is verified by a practical example.
作者：
DequanLiQipengLiuXiaofan WangDepartment of Automation
Shanghai Jiao Tong University and Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai 200240 Shanghai P.R.China
The available investigations about quantized average consensus typically assume agents be confined to evolve on balanced digraphs via quantized information exchange, thus the corresponding update matrices are doub...
详细信息
The available investigations about quantized average consensus typically assume agents be confined to evolve on balanced digraphs via quantized information exchange, thus the corresponding update matrices are doubly stochastic, which is very restrictive and brings about feasibility problem in practical applications. By dropping the doubly stochastic constraint for the update matrices, this paper studies the consensus seeking for a group of agents on general strongly connected digraphs, where agents' states are communicated (may be unidirectional) through logarithmic quantizer. Under mild assumptions on network topology, we derive an upper bound for the quantization precision to guarantee the weighted average preservation of the whole network.
The paper proposes decentralized deconfliction algorithms deployed on multiple autonomous aerial vehicles in freeflight operations. The paper provides two separate algorithms for collision avoidance - one based on the...
详细信息
ISBN:
(纸本)9780981738116
The paper proposes decentralized deconfliction algorithms deployed on multiple autonomous aerial vehicles in freeflight operations. The paper provides two separate algorithms for collision avoidance - one based on the iterative peer-to-peer negotiation solving a singular collision and second based on multi-party negotiation about a cluster of collisions. The presented decentralized algorithms allow the vehicles operating in the same area to utilize the given airspace more efficiently. The algorithms have been developed and tested on a multi-agent prototype and the properties of both algorithms are discussed on a set of large scale experiments.
Problem of instability of wireless control network has been studying from many years using computation of in network method. Architecture known as "Wireless Control Network"(WCN) in which each node in networ...
详细信息
ISBN:
(纸本)9781538618882
Problem of instability of wireless control network has been studying from many years using computation of in network method. Architecture known as "Wireless Control Network"(WCN) in which each node in network maintain its own state and simultaneously update combination of output of neighboring node and node's own state, but this network has been shown to have little computational overhead, information loss, inflexibility of network, delay while sending and receiving data, security problem, scheduling problem. To overcome these problems, this paper represents fundamental topological conditions of network. For achieving this goal, "Liner iterative strategy" is used. So that wireless control network acts as linear dynamic network and analyze coupling between plants dynamic and network dynamic. Control input calculated if connectivity of vertex of network is larger than Eigen value of network. This is similar to min-cut condition which is required to problem of dissemination of information. Paper also represent conditions for stability of point to point network.
Ultra dense deployment of base stations is one of most significant features in smart city communication networks. Aiming at the large-scale wireless communication issue in smart city, we propose a distributed robust p...
详细信息
Ultra dense deployment of base stations is one of most significant features in smart city communication networks. Aiming at the large-scale wireless communication issue in smart city, we propose a distributed robust power allocation scheme with proportional fairness for cooperative orthogonal frequency-division-multiple-access relay network. With the amplify-and-forward relay mode, all of the relays assist the information transmission simultaneously on orthogonal subcarriers. Considering the uncertainty of channel gains, first we aim at achieving the maximum utility subject to the constraints of outage probability threshold and power bound. Subsequently, the problem is transformed to a solvable convex optimization problem with determination constraints. The dual-decomposition method is applied to solve the formulated optimization problem. To reduce the information exchange of the whole system, we propose a computationally efficient distributed iteration algorithm. Numerical results reveal the effectiveness of the proposed robust optimization algorithm. Copyright (c) 2016 John Wiley & Sons, Ltd.
Consider a distributed system with n processors, which receive triggers from the outside world. The distributed Trigger Counting (DTC) problem is to raise an alarm if the number of triggers over the system reaches w, ...
详细信息
ISBN:
(纸本)9781921770302
Consider a distributed system with n processors, which receive triggers from the outside world. The distributed Trigger Counting (DTC) problem is to raise an alarm if the number of triggers over the system reaches w, which is an user specified input. DTC is used as a primitive operation in many applications, such as distributed monitoring, global snapshot etc. In this paper, we propose an algorithm for the DTC problem in a ring topology with a message complexity of O(n2 log(w/n)) and each node in the system receives O(n log(w/n)) number of messages. We also discuss about the possible tuning of the algorithm which results better complexities.
In this paper,we consider the problem that a group of agents aims to compute the average of individually estimated noisy parameters by sharing information among a random network of digital *** this scenario,the averag...
详细信息
In this paper,we consider the problem that a group of agents aims to compute the average of individually estimated noisy parameters by sharing information among a random network of digital *** this scenario,the average consensus seeking is involved in a two-step ***,each agent estimates the local time-varying parameters individually,and then agents average their estimations by interaction with neighbors through quantized *** of quantization on the performance of the proposed distributed algorithm is investigated. We prove that the agents' states converge to a random variable that deviates from the average of the estimated *** derive an upper bound for the asymptotic residual mean square error of the states,which captures effects of the quantization precision and the structure of the random communication networks.
A new spanner construction algorithm is presented, working under the LOCAL model assuming unique edge IDs. Given an n-node communication graph, a spanner with a constant stretch and Õ(n1 + c) edges (for any small...
详细信息
ISBN:
(纸本)9781450362177
A new spanner construction algorithm is presented, working under the LOCAL model assuming unique edge IDs. Given an n-node communication graph, a spanner with a constant stretch and Õ(n1 + c) edges (for any small constant c > 0) is constructed efficiently --- i.e., in a constant number of rounds and a message complexity of Õ (n1 + 2c) *** of the many known applications of spanners is for reducing the number of messages of various algorithms. However, usually, one still needs to pay the cost of constructing the spanner. Due to the efficiency of the spanner construction here, we show that every t-round LOCAL algorithm can be transformed into a randomized one with the same asymptotic time complexity and Õ(t2n1 + O(1/log t)) message complexity. All previous message-reduction schemes for LOCAL algorithms incur either an O(log n)-multiplicative or an O(polylog (n))-additive blow-up of the round complexity.
暂无评论