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

Cooperative Distributed Demand Management for Community Charging of PHEV/PEVs Based on KKT Conditions and consensus Networks

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2014年第3期10卷 1907-1916页

作者： Rahbari-Asr, Navid Chow, Mo-Yuen N Carolina State Univ Dept Elect & Comp Engn Raleigh NC 27606 USA

Efficient and reliable demand side management techniques for community charging of plug-in hybrid electrical vehicles (PHEVs) and plug-in electrical vehicles (PEVs) are needed, as large numbers of these vehicles are being introduced to the power grid. To avoid overloads and maximize customer preferences in terms of time and cost of charging, a constrained nonlinear optimization problem can be formulated. In this paper, we have developed a novel cooperative distributed algorithm for charging control of PHEVs/PEVs that solves the constrained nonlinear optimization problem using Karush-Kuhn-Tucker (KKT) conditions and consensus networks in a distributed fashion. In our design, the global optimal power allocation under all local and global constraints is reached through peer-to-peer coordination of charging stations. Therefore, the need for a central control unit is eliminated. In this way, single-node congestion is avoided when the size of the problem is increased and the system gains robustness against single-link/node failures. Furthermore, via Monte Carlo simulations, we have demonstrated that the proposed distributed method is scalable with the number of charging points and returns solutions, which are comparable to centralized optimization algorithms with a maximum of 2% sub-optimality. Thus, the main advantages of our approach are eliminating the need for a central energy management/coordination unit, gaining robustness against single-link/node failures, and being scalable in terms of single-node computations.

关键词： consensus algorithms decentralized control demand side management Karush-Kuhn-Tucker (KKT) conditions plug-in electric vehicle (PEV) plug-in hybrid electric vehicle (PHEV)

来源：评论

学校读者我要写书评

暂无评论

Distributed Abstract Optimization via Constraints consensus: Theory and Applications

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2011年第10期56卷 2247-2261页

作者： Notarstefano, Giuseppe Bullo, Francesco Univ Lecce Dept Engn I-73100 Lecce Italy Univ Calif Santa Barbara Ctr Control Dynam Syst & Computat Santa Barbara CA 93106 USA

Distributed abstract programs are a novel class of distributed optimization problems where i) the number of variables is much smaller than the number of constraints and ii) each constraint is associated to a network node. Abstract optimization programs are a generalization of linear programs that captures numerous geometric optimization problems. We propose novel constraints consensus algorithms for distributed abstract programs with guaranteed finite-time convergence to a global optimum. The algorithms rely upon solving local abstract programs and exchanging the solutions among neighboring processors. The proposed algorithms are appropriate for networks with weak time-dependent connectivity requirements and tight memory constraints. We show how the constraints consensus algorithms may be applied to suitable target localization and formation control problems.

关键词： consensus algorithms distributed optimization formation control linear programs target localization

来源：评论

学校读者我要写书评

暂无评论

Asymptotic Optimality of Running consensus in Testing Binary Hypotheses

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2010年第2期58卷 814-825页

作者： Braca, Paolo Marano, Stefano Matta, Vincenzo Willett, Peter Univ Salerno DIIIE I-84084 Fisciano SA Italy Univ Connecticut ECE Dept Storrs CT 06269 USA

consensus in sensor networks is a procedure to corroborate the local measurements of the sensors with those of the surrounding nodes, and leads to a final agreement about a common value that, in detection applications, represents the decision statistic. As the amount of collected data increases, the convergence toward the final statistic is ruled by suitable scaling laws, and the question arises if the asymptotic (large sample) properties of a detection statistic are retained when this statistic is approximated via consensus algorithms. We investigate the asymptotic properties of running consensus detectors both under the Neyman-Pearson paradigm (fixed number of data) and in the sequential case. An appropriate asymptotic framework is developed, and exact theoretical results are provided, showing the asymptotic optimality of the running consensus detector. In addition, numerical experiments are performed to address nonasymptotic scenarios.

关键词： Asymptotic optimality consensus algorithms detection

来源：评论

学校读者我要写书评

暂无评论

Applicability and Appropriateness of Distributed Ledgers consensus Protocols in Public and Private Sectors: A Systematic Review

引用

IEEE ACCESS 2019年 7卷 43622-43636页

作者： Shahaab, A. Lidgey, B. Hewage, C. Khan, I Cardiff Metropolitan Univ Cardiff Sch Technol Cardiff CF5 2YB S Glam Wales Co House Cardiff CF14 3UZ S Glam Wales

Advancement of consensus protocols in recent years has enabled distributed ledger technologies (DLTs) to find its application and value in sectors beyond cryptocurrencies. Here we reviewed 66 known consensus protocols and classified them into philosophical and architectural categories, also providing a visual representation. As a case study, we focus on the public sector and highlighted potential protocols. We have also listed these protocols against basic features and sector preference in a tabular format to facilitate selection. We argue that no protocol is a silver bullet, therefore should be selected carefully, considering the sector requirements and environment.

关键词： Blockchain technology consensus algorithms distributed consensus protocols distributed ledger technology DLTs for public sector distributed systems Govtech permissioned and permissionless blockchains

来源：评论

学校读者我要写书评

暂无评论

consensus Computation in Unreliable Networks: A System Theoretic Approach

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2012年第1期57卷 90-104页

作者： Pasqualetti, Fabio Bicchi, Antonio Bullo, Francesco Univ Calif Santa Barbara Ctr Control Dynam Syst & Computat Santa Barbara CA 93106 USA Univ Pisa Ctr IR E Piaggio I-56100 Pisa Italy

This paper addresses the problem of ensuring trustworthy computation in a linear consensus network. A solution to this problem is relevant for several tasks in multi-agent systems including motion coordination, clock synchronization, and cooperative estimation. In a linear consensus network, we allow for the presence of misbehaving agents, whose behavior deviate from the nominal consensus evolution. We model misbehaviors as unknown and unmeasurable inputs affecting the network, and we cast the misbehavior detection and identification problem into an unknown-input system theoretic framework. We consider two extreme cases of misbehaving agents, namely faulty (non-colluding) and malicious (Byzantine) agents. First, we characterize the set of inputs that allow misbehaving agents to affect the consensus network while remaining undetected and/or unidentified from certain observing agents. Second, we provide worst-case bounds for the number of concurrent faulty or malicious agents that can be detected and identified. Precisely, the consensus network needs to be 2k + 1 (resp. k + 1) connected for k malicious (resp. faulty) agents to be generically detectable and identifiable by every well behaving agent. Third, we quantify the effect of undetectable inputs on the final consensus value. Fourth, we design three algorithms to detect and identify misbehaving agents. The first and the second algorithm apply fault detection techniques, and affords complete detection and identification if global knowledge of the network is available to each agent, at a high computational cost. The third algorithm is designed to exploit the presence in the network of weakly interconnected subparts, and provides local detection and identification of misbehaving agents whose behavior deviates more than a threshold, which is quantified in terms of the interconnection structure.

关键词： Autonomous agents consensus algorithms distributed control fault detection intrusion detection multi-agent systems network topology network theory (graphs) sensor networks

来源：评论

学校读者我要写书评

暂无评论

A Unified Approach to consensus Control of Three-Link Manipulators

引用

JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS 2020年第1期97卷 3-15页

作者： Zhai, Guisheng Nakamura, Satoshi Mardlijah Shibaura Inst Technol Dept Math Sci Saitama Japan Institut Teknol Sepuluh Nopember Dept Math Surabaya Indonesia

We consider a consensus control problem for a set of three-link manipulators connected by digraphs. Assume that the control inputs of each manipulator are the torques on its links and they are generated by adjusting the weighted difference between the manipulator's states and those of its neighbor agents. Then, we propose a condition for adjusting the weighting coefficients in the control inputs, so that full consensus is achieved among the manipulators. By designing complex Hurwitz polynomials, we obtain a necessary and sufficient condition for achieving the consensus. Moreover, the discussion is extended to the case of designing convergence rate of consensus. Numerical examples are provided to illustrate the condition and the design conditions.

关键词： Three-link manipulators consensus algorithms Graph Laplacian Complex Hurwitz polynomials consensus rate

来源：评论

学校读者我要写书评

暂无评论

Amaurotic-Entity-Based consensus Selection in Blockchain-Enabled Industrial IoT

引用

IEEE INTERNET OF THINGS JOURNAL 2021年第14期9卷 11648-11655页

作者： Tapwal, Riya Deb, Pallav Kumar Misra, Sudip Pal, Surjya Kanta Indian Inst Technol Kharagpur Dept Comp Sci & Engn Kharagpur 721302 W Bengal India Indian Inst Technol Kharagpur Ctr Excellence Adv Mfg Technol Kharagpur 721302 W Bengal India

In this article, we propose a dynamic-consensus-based blockchain system-A-Blocks-for efficiently managing the data produced by the sensors in an Industrial Internet of Things (IIoT) environment. Typically, industries deal with a heterogeneous set of data from a diverse range of sensors. Conventional blockchain adoptions are a popular choice in such scenarios for data security while satisfying both transparency and immutability. However, stringent consensus algorithms are inadequate for managing heterogeneous data, especially due to its implicit constraints. For instance, while PoW provides inevitable security and is highly distributive, it is not scalable and requires more energy. In contrast, PoS is energy efficient but has reduced scalability and PBFT is suitable for faster processing. A-Blocks exploits the features of the available consensus algorithms and dynamically selects the best one in real time. It operates in two phases: 1) categorizing the data into groups based on their traits and then 2) selecting the appropriate consensus algorithm. Extensive experimental results using open industrial data sets demonstrate the effectiveness of A-Blocks with 8% CPU and 78% memory consumptions on resource-constrained devices. Furthermore, compared to the existing methods, although A-Blocks increases energy consumption by 11%, it also reduces mining time by 7%.

关键词： Blockchains consensus algorithm Industrial Internet of Things Sensors Security Scalability Middleware Agglomerative clustering blockchain consensus algorithms Industrial Internet of Things (IIoT)

来源：评论

学校读者我要写书评

暂无评论

The deformed consensus protocol

引用

AUTOMATICA 2013年第10期49卷 3049-3055页

作者： Morbidi, Fabio Johannes Kepler Univ Linz Inst Design & Control Mechatron Syst A-4040 Linz Austria

This paper studies a generalization of the standard continuous-time consensus protocol, obtained by replacing the Laplacian matrix of the communication graph with the so-called deformed Laplacian. The deformed Laplacian is a second-degree matrix polynomial in the real variable s which reduces to the standard Laplacian for s equal to unity. The stability properties of the ensuing deformed consensus protocol are studied in terms of parameter s for some special families of undirected and directed graphs, and for arbitrary graph topologies by leveraging the spectral theory of quadratic eigenvalue problems. Examples and simulation results are provided to illustrate our theoretical findings. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Multi-agent systems consensus algorithms Cooperative control Sensor networks Autonomous mobile robots

来源：评论

学校读者我要写书评

暂无评论

consensus and cooperation in networked multi-agent systems

引用

PROCEEDINGS OF THE IEEE 2007年第1期95卷 215-233页

作者： Olfati-Saber, Reza Fax, J. Alex Murray, Richard M. Thayer Sch Engn Dartmouth Coll Hanover NH 03755 USA Northrop Grumman Corp Woodland Hills CA 91367 USA CALTECH Control & Dynam Syst Pasadena CA 91125 USA

This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees. An overview of basic concepts of information consensus in networks and methods of convergence and performance analysis for the algorithms are provided. Our analysis framework is based on tools from matrix theory, algebraic graph theory, and control theory. we discuss the connections between consensus problem in networked dynamic systems and diverse applications including synchronization of coupled oscillators, flocking, formation control, fast consensus in small-world networks, Markov processes and gossip-based algorithms, load balancing in networks, rendezvous in space, distributed sensor fusion in sensor networks, and belief propagation. We establish direct connections between spectral and structural properties of complex networks and the speed of information diffusion of consensus algorithms. A brief introduction is provided on networked systems with nonlocal information flow that are considerably faster than distributed systems with lattice-type nearest neighbor interactions. Simulation results are presented that demonstrate the role of small-world effects on the speed of consensus algorithms and cooperative control of multivehicle formations.

关键词： consensus algorithms cooperative control flocking graph Laplacians information fusion multi-agent systems networked control systems synchronization of coupled oscillators

来源：评论

学校读者我要写书评

暂无评论

consensus-Based Current Sharing and Voltage Balancing in DC Microgrids With Exponential Loads

引用

IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY 2022年第4期30卷 1668-1680页

作者： Nahata, Pulkit Turan, Mustafa Sahin Ferrari-Trecate, Giancarlo Ecole Polytech Fed Lausanne Inst Engn Mech CH-1015 Lausanne Switzerland

In this work, we present a novel consensus-based secondary control scheme for current sharing and voltage balancing in dc microgrids (DCmGs), composed of distributed generation units (DGUs), dynamic RLC lines, and nonlinear ZIE (constant impedance, constant current, and exponential) loads. Situated atop a primary voltage control layer, our secondary controllers have a distributed structure and utilize information exchanged over a communication network to compute necessary control actions. Besides showing that the desired objectives are always attained in steady state, we deduce sufficient conditions for the existence and uniqueness of an equilibrium point for constant power loads--E loads with zero exponent. Our control design hinges only on the local parameters of the generation units, facilitating plug-and-play operations. We provide a voltage stability analysis and illustrate the performance and robustness of our designs via simulations. All results hold for arbitrary, albeit connected, mG and communication network topologies.

关键词： Voltage control Load modeling Steady-state Microgrids Topology Impedance Communication networks consensus algorithms distributed control microgrids (mGs) nonlinear control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：