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

Interactive optimization between active distribution network with multi-microgrids based on distributed algorithm

ENERGY REPORTS 2020年 6卷 385-391页

作者： Li, Zhaoyu Wang, Hao Ai, Qian Zhang, Yufan Shanghai Jiao Tong Univ Dept Elect Engn Key Lab Control Power Transmiss & Convers Minist Educ Shanghai 200240 Peoples R China Cisco Syst Inc Shanghai 200240 Peoples R China

Interaction between microgrid (MG) and active distribution network (ADN) can effectively improve the operating economics and reliability of power system. A bi-level interactive optimization model for ADN with MGs is studied in this paper. The upper level is a multi-objective problem that minimizes both the operation cost and voltage deviation of each node. The lower level aims to minimize the operation cost of MG. The interaction between adjacent MGs ensures a relatively lower electricity price. To achieve a low-carbon system, carbon trading cost is also considered at both levels. And the model is decoupled into several subproblems and solved using a distributed method. Therefore, the privacy of each entity is ensured. The results prove the effectiveness of the proposed method. (C) 2020 The Authors. Published by Elsevier Ltd.

关键词： Multi-microgrids Active distribution network Interactive optimization distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Event-triggered distributed algorithm for searching general Nash equilibrium with general step-size

引用

OPTIMAL CONTROL APPLICATIONS & METHODS 2021年第2期42卷 526-547页

作者： Li, Ran Mu, Xiaowu Zhengzhou Univ Sch Math & Stat Zhengzhou 450001 Peoples R China Informat Engn Univ Zhengzhou Peoples R China

In this article, searching the general Nash equilibrium in the noncooperation game is discussed under the general constraints of containing bounded constraint, coupled equality constraint, and private inequality constraint. Meanwhile, the continuous-time event-triggered distributed subgradient projective algorithm (C-ETDSP algorithm), to greatly cut down the number of communication flows, is designed. In the C-ETDSP algorithm, the demand for step-size is weakened to a general step-size of square nonsummable. Then it is proved that the Zeno behavior did not exist in the continuous-time event-triggered mechanism. In addition, the convergence of different types of step-sizes is further compared. Finally, the effectiveness of the design algorithm and the correctness of the theoretical results are verified by a simulation example.

关键词： distributed algorithm event-triggered general constraint general Nash equilibrium general step-size

来源：评论

学校读者我要写书评

暂无评论

A Gossip-Based distributed algorithm for Economic Dispatch in Smart Grids With Random Communication Link Failures

引用

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS 2020年第6期67卷 4635-4645页

作者： Wang, Rui Li, Qiqiang Li, Guanguan Liu, Huimin Shandong Univ Sch Control Sci & Engn Jinan 250061 Peoples R China Shandong Univ Inst Marine Sci & Technol Jinan 250061 Peoples R China

Motivated by the fact that gossip algorithms are asynchronous and suitable for the sensor networks with random link failures, a gossip-based distributed algorithm for the economic dispatch problem in smart grids is addressed in this paper. Random communication link failure phenomena is very common in a realistic communication network. By modeling a network as a Bernoulli network, the proposed algorithm can solve the economic dispatch problem in the imperfect communication network. Mean square consensus and almost sure consensus are adopted to analyze the convergence of the algorithm. Using matrix theory and perturbation theory, we prove that the algorithm can achieve mean square consensus and almost sure consensus. Therefore, the proposed algorithm converges to the optimal solution of the economic dispatch problem with probability 1. The convergence speed of the algorithm is discussed and simulation results show that the convergence rate is governed by the second largest eigenvalue of the system matrix. Case studies are designed to illustrate the effectiveness and plug-and-play capability of the algorithm.

关键词： distributed algorithm economic dispatch problem (EDP) random communication link failures smart grid

来源：评论

学校读者我要写书评

暂无评论

Continuation Power Flow Model for Interconnected Systems Considering the Electricity Market Influence and Its Corresponding distributed algorithm

引用

IEEE ACCESS 2019年 7卷 75910-75924页

作者： Ding, Chong Yan, Wei Ren, Zhouyang Zhao, Ruifeng Lee, Wei-Jen Tang, Xinyan Chongqing Univ State Key Lab Power Transmiss Equipment & Syst Se Chongqing 400044 Peoples R China Guangdong Grid Co China Southern Power Grid Power Dispatching Control Ctr Guangzhou 510600 Guangdong Peoples R China Univ Texas Arlington Energy Syst Res Ctr Arlington TX 76013 USA China Resources Grp Chongqing Snow Div Chongqing 400050 Peoples R China

The existing continuation power flow (CPF) methods, which mainly focus on regional independent systems, are not suitable for multi-area interconnected bulk systems in the electricity market environment. These existing CPF models cannot simulate the control behaviors of active/reactive power exchange among subsystems, and the corresponding CPF algorithms cannot satisfy the requirements of data sharing. This study presents a novel CPF model and its corresponding distributed algorithm for interconnected systems in which the influence of the electricity market is considered. This CPF method has the following unique features: 1) Regarding the bilateral power trading contracts (BPTCs) among regional subsystems, the nonlinear constraint equations of the directional trading active power via the interface are derived, and a multi-balancing machine strategy is introduced for realizing the active power balance of each subsystem. 2) Based on the simulation of the constant-voltage control behavior of the pilot buses in the regional automatic voltage control (AVC) system, the constant-voltage control behavior of the boundary buses of the tie-lines is further simulated to realize the reactive power balance among the regional subsystems. 3) According to the characteristics of the proposed CPF model, a novel distributed CPF algorithm based on block matrix computations is presented for realizing the decomposition and coordination calculation of multiple regional subsystems. This distributed algorithm preserves the precision and convergence of integrated CPF algorithms and has an advantage in terms of the calculation speed. The performance of the proposed CPF model and distributed algorithm is demonstrated via case studies and comparative analyses.

关键词： Automatic voltage control (AVC) bilateral power trading contract (BPTC) continuation power flow (CPF) distributed algorithm interconnected bulk systems

来源：评论

学校读者我要写书评

暂无评论

Optimization and control of cable forces in a hybrid beam cable-stayed bridge based on a distributed algorithm

引用

ENGINEERING OPTIMIZATION 2024年第5期56卷 720-739页

作者： Wang, Da Wang, Lei Li, Zheng Xiang, Shengtao Cent South Univ Forestry & Technol Sch Civil Engn Changsha Peoples R China Wuhan Univ Technol Sch Civil Engn & Architecture Wuhan Peoples R China Changsha Univ Sci & Technol Sch Civil Engn Changsha Peoples R China

Based on the existing permanent load equilibrium method, influence matrix method and adaptive control method, a distributed algorithm and control method for the cable forces of hybrid laminated girder cable-stayed bridges is proposed. The method uses the permanent load equilibrium approach to initially determine the permanent load cable forces, then adjusts it based on the influence matrix of the main girder displacement, and finally combines the calculation of finite element software to determine the cable forces that satisfy the internal force requirements of each member of the hybrid laminated girder cable-stayed bridge under the joint action of permanent load and live load. Through adjusting the cable force of an actual bridge, it can be found that this method is highly efficient in calculation, and the efficiency and accuracy of control of the cable forces are high, ensuring that the cable forces and alignment of the bridge structure after completion are in line with the design expectations.

关键词： Bridge engineering cable forces optimization and control distributed algorithm rational bridge state construction process control

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for Exploration of Unknown Environments with Multiple Robots

引用

JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS 2019年第3-4期95卷 1021-1040页

作者： Aguilar, Gabriel Bravo, Luis Ruiz, Ubaldo Murrieta-Cid, Rafael Chavez, Edgar Ctr Invest Matemat CIMAT Guanajuato Mexico CICESE Ensenada Baja California Mexico

In this paper, we present a complete algorithm for exploration of unknown environments containing disjoint obstacles with multiple robots. We propose a distributed approach considering several variants. The robots are modeled as points or discs, the obstacles are distinguishable or they are not distinguishable, the point robots only communicate at rendezvous, the disc-shaped robots can communicate if they are visible to each other, finally the free subset of the configuration space has one or several connected components. Two possible applications of our algorithms are: 1) Search of a static object in an unknown environment. 2) Damage verification in unknown environments composed by multiple elements (e.g. buildings). The main contributions of this work are the following: 1) The algorithms guarantee exploring the whole environment in finite time even though the robots are no capable of building an exact map of the environment, they cannot estimate their positions and each robot does not have full information about the part of the environment explored by other robots. 2) The method only requires limited communication between the robots. 3) We combine and extend the velocity obstacle method with our proposed approach to explore the environment using disc-shaped robots that are able to avoid collisions with both moving and static obstacles. 4) We propose an exploration strategy such that even if the configuration space has several connected components this strategy guarantees covering the largest possible portion of the environment with an omnidirectional sensor detecting the visibility regions. 5) The algorithm scales well to hundreds of robots and obstacles. We tested in several simulations the performance of our algorithms using different performance metrics.

关键词： Multi-robot Exploration distributed algorithm Collision avoidance

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for inter-layer network coding-based multimedia multicast in Internet of Things

引用

COMPUTERS & ELECTRICAL ENGINEERING 2016年 52卷 125-137页

作者： Wang, Junyi Liu, Zhihui Shen, Yuxiang Chen, Hongbin Zheng, Lin Qiu, Hongbing Shu, Shi Guangxi Expt Ctr Informat Sci Guilin 541004 Peoples R China Guilin Univ Elect Technol Guangxi Key Lab Cryptog & Informat Secur Guilin 541004 Peoples R China Beijing Univ Posts & Telecommun Key Lab Universal Wireless Commun Minist Educ Beijing 100876 Peoples R China Guilin Univ Elect Technol Key Lab Cognit Radio & Informat Proc Guilin 541004 Peoples R China Xiangtan Univ Sch Math & Computat Sci Xiangtan 411005 Peoples R China

With the development of the Internet of Things (IoT), more and more devices that have diverse computing and communication capabilities are interconnected. For,multimedia multicast in the IoT, a fixed flow rate cannot meet the quality-of-service requirements of heterogeneous devices and each device may not get the information from all other devices. In order to satisfy the heterogeneous requirements, we develop a distributed algorithm to solve the inter-layer flow optimization problem based on network coding for multimedia multicast in the IoT, by using primal decomposition and primal-dual analysis. We also apply Lyapunov theory to prove the convergence and global stability of the proposed iterative algorithm. Numerical results demonstrate that the proposed algorithm has better flexibility, stability, and implementation advantages than the previous intra-layer ones. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Internet of Things Multimedia multicast Inter-layer network coding Flow optimization distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A Real-Time Simulation for P2P Energy Trading Using a distributed algorithm

引用

IEEE ACCESS 2024年 12卷 44135-44146页

作者： Zahraoui, Younes Korotko, Tarmo Rosin, Argo Zidane, Tekai Eddine Khalil Mekhilef, Saad Tallinn Univ Technol FinEst Ctr Smart Cities EE-19086 Tallinn Estonia Tallinn Univ Technol Dept Elect Power Engn & Mech EE-19086 Tallinn Estonia Malardalen Univ Dept Sustainable Energy Syst S-72123 Vasteras Sweden Swinburne Univ Technol Sch Software & Elect Engn Fac Sci Engn & Technol Hawthorn Vic 3122 Australia Univ Malaya Dept Elect Engn Power Elect & Renewable Energy Res Lab PEARL Fac Engn Kuala Lumpur 50603 Malaysia Presidency Univ Dept Elect & Elect Engn Bengaluru 560064 Karnataka India

Increasing the deployment of Renewable Energy Resources (RES), along with innovations in Information and Communication Technologies (ICT), would allow prosumers to engage in the energy market and trade their excess energy with each other and with the main grid. To ensure an efficient and safe operation of energy trading, the Peer-to-Peer (P2P) energy trading approach has emerged as a viable paradigm to provide the necessary flexibility and coordinate the energy sharing between a pair of prosumers. The P2P approach is based on the concept of decentralized energy trading between prosumers (i.e., production capabilities or energy consumers). However, security protection and real-time transaction issues in the P2P market present serious challenges. In this paper, we propose a decentralized P2P energy trading approach for the energy market with high penetration of RE. First, the P2P energy market platform proposed coordinating the energy trading between energy providers and consumers to maximize their social welfare. A distributed algorithm is applied to solve the market-clearing problem based on the Alternating Direction Method of Multipliers (ADMM). In this way, the computational complexity can be reduced. Furthermore, a P2P Manager (P2PM) utility is introduced as an entity to solve the synchronization problem between peers during the market clearing. Finally, through a real-time application using Hardware-In-the-Loop (HIL), the effectiveness of the proposed P2PM is verified in terms of synchronizing the market participants and improving the power transaction.

关键词： Peer-to-peer computing Microgrids Biological system modeling Real-time systems Optimization distributed algorithms Synchronization Energy management Power markets distributed processing Energy consumption Peer-to-peer energy market energy trading distributed algorithm alternating direction method of multipliers

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for Computing the Node Search Number in Trees

引用

algorithmICA 2012年第1-2期63卷 158-190页

作者： Coudert, David Huc, Florian Mazauric, Dorian Univ Nice Sophia MASCOTTE INRIA I3SCNRS F-06902 Sophia Antipolis France Ecole Polytech Fed Lausanne Lab Distributed Programming Stn 14 Bat INR CH-1015 Lausanne Switzerland

We present a distributed algorithm to compute the node search number in trees. This algorithm extends the centralized algorithm proposed by Ellis et al. (Inf. Comput. 113(1):50-79, 1994). It can be executed in an asynchronous environment, requires an overall computation time of O(nlog n), and n messages of log (3) n+4 bits each. The main contribution of this work lies in the data structure proposed to design our algorithm, called hierarchical decomposition. This simple and flexible data structure is used for four operations: updating the node search number after addition or deletion of any tree-edges in a distributed fashion;computing it in a tree whose edges are added sequentially and in any order;computing other graph invariants such as the process number and the edge search number, by changing only initialization rules;extending our algorithms for trees and forests of unknown size (using messages of up to 2log (3) n+5 bits).

关键词： distributed algorithm Edge search number Graph searching Node search number Pathwidth Process number

来源：评论

学校读者我要写书评

暂无评论

Urban Internet of Electric Vehicle Parking System for Vehicle-to-Grid Scheduling: Formulation and distributed algorithm

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2024年第1期73卷 67-79页

作者： Zhang, Shengyu Zhang, Shiyao Yeung, Lawrence K. Yu, James J. Q. Univ Hong Kong Dept Elect & Elect Engn Hong Kong Peoples R China Southern Univ Sci & Technol Res Inst Trustworthy Autonomous Syst Shenzhen 518055 Peoples R China Univ York Dept Comp Sci York YO10 5DD England Southern Univ Sci & Technol Dept Comp Sci & Engn Shenzhen Peoples R China

The application of Internet of electric vehicles has greatly enhanced the efficiency of the urban intelligent transportation system. The coordination of Internet of electric vehicles is crucial for improving the quality of public services in smart cities, such as vehicle-to-grid regulation and edge computing service. However, existing studies have unilaterally considered the application of one of these two services, which neglects the potential benefits of their combined optimization. In this article, we propose an urban Internet of electric vehicle parking system for vehicle-to-grid scheduling. Specifically, we solve the problems of Internet of electric vehicles allocation and scheduling with joint vehicle-to-grid regulation service and edge computing service. First of all, we formulate the joint problem as a mixed-integer quadratic programming problem. Then, through the alternating direction method of multipliers method, we decouple the main problem into sub-problems for Internet of electric vehicles. Then, we devise a distributed algorithm to solve each sub-problem. The simulation results show that our proposed model is effective in Internet of electric vehicles' allocation and vehicle-to-grid scheduling for the joint regulation and edge computing service. Furthermore, the power fluctuations of the city power grid can be well flattened by providing the vehicle-to-grid regulation service through effective communication network protocols.

关键词： Vehicle-to-grid Smart cities Scheduling Processor scheduling Wireless communication Edge computing distributed algorithms ADMM distributed algorithm edge computing IoEV V2G scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：