检索结果-内蒙古大学图书馆

American Control Conference

作者： Paulo Heredia Hasan Ghadialy Shaoshuai Mou School of Aeronautics and Astronautics Purdue University West Lafayette IN USA Northrop Grumman Corporation

ISBN: (数字)9781538682661

ISBN: (纸本)9781538682678

We will provide a finite-sample analysis to the convergence of a distributed algorithm for Q-learning in multi-agent systems, in which each agent is assigned a private reward function and can only communicate with its nearby neighbors under time-varying networks. We will provide an upper bound of the average squared error, which takes into account the time evolution of a consensus error and does not rely on the assumption of independent and identically distributed (i.i.d) samples. In addition, our results indicate that the error of each agent converges to zero asymptotically, supporting empirical results in the literature.

关键词： Time varying networks NETWORKING AGENT distributed algorithms Agents quadratic errors Identically distributed Distribute Converge

来源：评论

学校读者我要写书评

暂无评论

distributed Computation of Nash Equilibria for Monotone Aggregative Games via Iterative Regularization

Distributed Computation of Nash Equilibria for Monotone Aggr...

引用

IEEE Conference on Decision and Control

作者： Jinlong Lei Uday V. Shanbhag Jie Chen Tongji University Shanghai China Shanghai Institute of Intelligent Science and Technology Tongji University Shanghai China Pennsylvania State University University Park PA USA

ISBN: (数字)9781728174471

ISBN: (纸本)9781728174488

This work considers an aggregative game over time-varying graphs, where each player's cost function depends on its own strategy and the aggregate of its competitors' strategies. Though the aggregate is unknown to any given player, each player may interact with its neighbors to construct an estimate of the aggregate. We design a distributed iterative Tikhonov regularization method in which each player may independently choose its steplengths and regularization parameters while meeting some overall coordination requirements. Under a monotonicity assumption on the concatenated player-specific gradient map, we prove that the generated sequence converges to the least-norm Nash equilibrium (i.e., a Nash equilibrium with the smallest two-norm) and validate the proposed method on a networked Nash-Cournot equilibrium problem.

关键词： Games Aggregates Nash equilibrium distributed algorithms Cost function Stochastic processes Standards

来源：评论

学校读者我要写书评

暂无评论

A distributed Event-Triggered Algorithm for Economic Dispatch Problem over Unbalanced Directed Network

A Distributed Event-Triggered Algorithm for Economic Dispatc...

引用

Chinese Control and Decision Conference, CCDC

作者： Xiasheng Shi Lifu Ding Gangfeng Yan College of Electrical Engineering Zhejiang University

ISBN: (数字)9781728158556

ISBN: (纸本)9781728158563

In this paper, we design a distributed surplus-based event-triggered algorithm to fix the economic dispatch problem over general directed graph in smart grid. In order to avoid continuous communication, the event-triggered communication mechanism is established, in which each agent only broadcasts its information at their last triggering time, which is controlled by the designed triggering condition, rather of every sampling time. A sufficient condition is developed for guarding the consensus and achieving the optimal solution. That is the network is strongly connected and the necessary parameters are properly designed. Moreover, we offer one case to check the feasibility of above proposed algorithm.

关键词： Generators Economics Convergence Optimization distributed algorithms Smart grids Multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

Attack-Resilient Strategy for Consensus-Based distributed Economic Dispatch Problem

Attack-Resilient Strategy for Consensus-Based Distributed Ec...

引用

Chinese Control and Decision Conference, CCDC

作者： Jun Yang Chenchen Dong School of Information Science and Engineering Northeastern University Shenyang

ISBN: (数字)9781728158556

ISBN: (纸本)9781728158563

In this paper, the consensus-based distributed algorithm is introduced for solving the economic dispatch problem in a smart grid environment with distributed generators. Due to the vulnerability of distributed algorithm, we consider two kinds of false data injection attacks (FDIA): hijacking the nodes and attack on communication links together. Then an attack-resilient strategy is proposed to eliminate or weaken the influence caused by the attacks. The benefit of this strategy is that the node does not have to be isolated when a communication link is attacked until it is identified as a malicious node. Finally, the effectiveness of the proposed strategy is illustrated through simulations on the IEEE 39-bus test system.

关键词： Economics Generators Energy management Smart grids distributed algorithms Power system stability Nickel

来源：评论

学校读者我要写书评

暂无评论

distributed Continuous-Time Algorithm Resorting to Finite-Time Consensus Protocol for Convex Optimization Problem with Inequality Constraint and Closed Convex Set Constraint

Distributed Continuous-Time Algorithm Resorting to Finite-Ti...

引用

International Conference on Control and Automation (ICCA)

作者： Hongzhe Liu Wenwu Yu Southeast University Nanjing China

ISBN: (数字)9781728190938

ISBN: (纸本)9781728190945

In this study, the optimization problem with inequality constraint and closed convex set constraint is investigated. Accordingly, the certain distributed continuous-time algorithm is designed for solving the considered optimization problem over the time-varying undirected and connected topologies. In the existing results where distributed optimization is studied, the achieving of consensus resorts to an additional equality constraint, that is, an extra generated system of associated multiplier is needed in the designed algorithms, which leads to a higher complexity of the proposed algorithm. In this work, the reality of consensus benefits from the finite-time protocol, which makes the total dimensions of involved updated vectors lower. Under the assumption that the closed convex set involved in the constraint is bounded, all the states generated by the designed algorithm converge to a common optimal solution. Moreover, the simulation results are provided.

关键词： Optimization Consensus protocol Convergence Topology distributed algorithms Simulation Linear matrix inequalities

来源：评论

学校读者我要写书评

暂无评论

Bounding the locality of distributed routing algorithms

引用

distributed COMPUTING 2013年第1期26卷 39-58页

作者： Bose, Prosenjit Carmi, Paz Durocher, Stephane Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada Ben Gurion Univ Negev Dept Comp Sci Beer Sheva Israel Univ Manitoba Dept Comp Sci Winnipeg MB R3T 2N2 Canada

We examine bounds on the locality of routing. A local routing algorithm makes a sequence of distributed forwarding decisions, each of which is made using only local information. Specifically, in addition to knowing the node for which a message is destined, an intermediate node might also know (1) its local neighbourhood (the subgraph corresponding to all network nodes within hops of itself, for some fixed ), (2) the node from which the message originated, and (3) the incoming port (which of its neighbours last forwarded the message). Our objective is to determine, as varies, which of these parameters are necessary and/or sufficient to permit local routing on a network modelled by a connected undirected graph. In particular, we establish tight bounds on for the feasibility of deterministic -local routing for various combinations of these parameters, as well as corresponding bounds on dilation (the worst-case ratio of actual route length to shortest path length).

关键词： distributed algorithms Local routing Dilation

来源：评论

学校读者我要写书评

暂无评论

distributed scheduling algorithms for channel access in TDMA wireless mesh networks

引用

JOURNAL OF SUPERCOMPUTING 2013年第2期63卷 407-430页

作者： Cheng, Hongju Xiong, Naixue Yang, Larence T. Jeong, Young-Sik Fuzhou Univ Dept Comp Sci Fuzhou 350002 Peoples R China Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA St Francis Xavier Univ Dept Comp Sci Antigonish NS B2G 1C0 Canada Wonkwang Univ Dept Comp Engn Iksan South Korea

In this paper, we have considered the distributed scheduling problem for channel access in TDMA wireless mesh networks. The problem is to assign time-slot(s) for nodes to access the channels, and it is guaranteed that nodes can communicate with all their one-hop neighbors in the assigned time-slot(s). And the objective is to minimize the cycle length, i.e., the total number of different time-slots in one scheduling cycle. In single-channel ad hoc networks, the best known result for this problem is proved to be K (2) in arbitrary graphs (IEEE Trans Comput C-36(6):729-737, 1987) and 25K in unit disk graphs (IEEE/ACM Trans Netw pp 166-177, 1993) with K as the maximum node degree. There are multiple channels in wireless mesh networks, and different nodes can use different control channels to reduce congestion on the control channels. In this paper, we have considered two scheduling models for wireless mesh networks. The first model is that each node has two radios, and the scheduling is simultaneously done on the two radios. We have proved that the upper bound of the cycle length in arbitrary graphs can be 2K. The second model is that the time-slots are scheduled for the nodes regardless of the number of radios on them. In this case, we have proved that the upper bound can be (4K-2). We also have proposed greedy algorithms with different criterion. The basic idea of these algorithms is to organize the conflicting nodes by special criterion, such as node identification, node degree, the number of conflicting neighbors, etc. And a node cannot be assigned to a time-slot(s) until all neighbor nodes, which have higher criterion and might conflict with the current node, are assigned time-slot(s) already. All these algorithms are fully distributed and easy to realize. Simulations are also done to verify the performance of these algorithms.

关键词： Scheduling algorithms Time Division Multiple Access (TDMA) Wireless mesh networks distributed algorithms Channel access

来源：评论

学校读者我要写书评

暂无评论

Efficient distributed solutions for sharing energy resources at the local level: a cooperative game approach

Efficient distributed solutions for sharing energy resources...

引用

IEEE Conference on Decision and Control

作者： Diego Kiedanski Ana Bušić Daniel Kofman Ariel Orda Télécom Paris France École Normale Supérieure CNRS PSL Research University Paris France Technion Haifa Israel

ISBN: (数字)9781728174471

ISBN: (纸本)9781728174488

Local energy generation as well as local energy storage represent key opportunities for energy transition. Nevertheless, their massive deployment is being delayed mainly due to cost reasons. Sharing resources at the local level enables not only reducing these costs significantly, but also to further optimize the cost of the energy exchanged with providers external to the neighbourhood. A key question that arises while sharing resources is how to distribute the obtained benefits among the various local players that cooperate. In this paper we propose a cooperative game model, where the players are the holders of energy resources (generation and storage); they cooperate in order to reduce their individual electricity costs. We prove that the core of the game is non-empty; i.e., the proposed cooperative game has a stable solution (distribution of the payoffs among the players) for the case where all players participate in a unique community, and no strict subset of players can obtain a better gain by leaving the *** propose a formulation of this game, based on the theory of linear production games, which lead us to the two main contributions of this paper. First, we propose an efficient (with linear complexity) centralized algorithm for finding a stable payoff. Second, we provide an efficient distributed algorithm that computes an allocation in the core of the game without any requirement for the players to share any private information. The distributed algorithm requires the exchange of intermediate solutions among players. The topology of the network that enables these exchanges is closely related to the performance of the distributed algorithm. We show, by way of simulations, which are the best topologies for these communication graphs.

关键词： Games Batteries distributed algorithms Graph theory Topology Linear programming Production

来源：评论

学校读者我要写书评

暂无评论

Resilient distributed Hypothesis Testing with Time-Varying Network Topology

Resilient Distributed Hypothesis Testing with Time-Varying N...

引用

American Control Conference

作者： Bo Wu Steven Carr Suda Bharadwaj Zhe Xu Ufuk Topcu University of Texas Austin

ISBN: (数字)9781538682661

ISBN: (纸本)9781538682678

We study the problem of distributed hypothesis testing, where a team of mobile agents aims to agree on the true hypothesis (out of a finite set of hypotheses) that best explains a sequence of their local and possibly noisy observations. The setting requires team collaborations through a time-varying network topology due to mobility and limited communication range. We also assume that there is an unknown subset of compromised agents that may deliberately share wrong information to undermine the team objective. We propose a distributed algorithm where each agent maintains two sets of beliefs (i.e., probability distributions over hypotheses), namely local and actual beliefs. For each agent at each time step, the local belief is updated based on its local observations. Then the actual belief is updated with its local belief and shared actual beliefs from the other agents within the communication range. We show that the actual belief of each non-adversarial agent converges almost surely to the true hypothesis. Unlike most of the existing literature, we guarantee the convergence without a connectivity constraint of the time-varying network topology.

关键词： communication range Hypothesis testing Time varying networks Beliefs Network topology Agents misinformation topology Mobile agents distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Nash and Wardrop Equilibria in Aggregative Games With Coupling Constraints

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2019年第4期64卷 1373-1388页

作者： Paccagnan, Dario Gentile, Basilio Parise, Francesca Kamgarpour, Maryam Lygeros, John Swiss Fed Inst Technol Automat Control Lab CH-8092 Zurich Switzerland MIT Lab Informat & Decis Syst Cambridge MA 02139 USA

We consider the framework of aggregative games, in which the cost function of each agent depends on his own strategy and on the average population strategy. As first contribution, we investigate the relations between the concepts of Nash and Wardrop equilibria. By exploiting a characterization of the two equilibria as solutions of variational inequalities, we bound their distance with a decreasing function of the population size. As second contribution, we propose two decentralized algorithms that converge to such equilibria and are capable of coping with constraints coupling the strategies of different agents. Finally, we study the applications of charging of electric vehicles and of route choice on a road network.

关键词： Aggregative games coupling constraints generalized Nash equilibrium distributed algorithms large-scale systems electric vehicles vehicle routing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：