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

Energy management for PV prosumers inside microgrids based on Stackelberg-Nash game considering demand response

SUSTAINABLE ENERGY TECHNOLOGIES AND ASSESSMENTS 2024年 68卷

作者： Wu, Yan Tian, Xiaoyun Gai, Ling Lim, Boon-Han Wu, Tingdong Xu, Dachuan Zhang, Yong Beijing Univ Technol Dept Operat Res & Informat Engn Beijing 100124 Peoples R China Univ Shanghai Sci & Technol Business Sch Shanghai 200093 Peoples R China Univ Shanghai Sci & Technol Sch Intelligent Emergency Management Shanghai 200093 Peoples R China Univ Tunku Abdul Rahman Lee Kong Chian Fac Engn & Sci Dept Elect & Elect Engn Kajang 43000 Selangor Malaysia Ja Solar Technol Co Ltd Beijing 345566 Peoples R China Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen 518055 Guangdong Peoples R China

This study investigates electricity trading in a deregulated retail market, aiming to coordinate the energy consumption behavior of end-users through demand response (DR) and carbon emission mechanisms under dynamic pricing. The objective is to minimize integrated energy system (IES) operating cost while maintaining a supply-demand balance. The IES schematic includes generation, dispatch, and consumption, as well as their physical and communication connections, corresponding to the grid, retailer, and multiple PV producers and consumers. Beyond the hierarchical decision-making between the retailer and PV prosumers, the challenge lies in the non-cooperative and competitive interdependence among prosumers. Therefore, the problem is formulated as a Stackelberg-Nash game (SNG) model, with the retailer as leader and PV prosumers as followers. Emphasizing that allowing fair energy trading between prosumers in the Nash game can have a positive impact on pricing decisions. Carbon trading and DR mechanisms enhance the flexibility of coordinating energy system supply-demand balance. An efficient iterative distributed algorithm is proposed for SNG strategy, it can complete real-time scheduling and privacy protection at the same time. Finally, the validity of the model is verified by a case study, which demonstrates that its effectiveness in adapting to changes in energy prices with practicality and economic benefits. Furthermore, we also show that the transactions between prosumers and the DR policies can reduce their operating costs by 12% and 9%, respectively.

关键词： Smart grids PV prosumers Demand response Stackelberg-Nash game distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Fully distributed Optimization-Based CAV Platooning Control Under Linear Vehicle Dynamics

引用

TRANSPORTATION SCIENCE 2022年第2期56卷 381-403页

作者： Shen, Jinglai Kammara, Eswar Kumar H. Du, Lili Univ Maryland Dept Math & Stat Baltimore MD 21250 USA Univ Florida Dept Civil & Coastal Engn Gainesville FL 32608 USA

This paper develops distributed optimization-based, platoon-centered connected and autonomous vehicle (CAV) car-following schemes, motivated by the recent interest in CAV platooning technologies. Various distributed optimization or control schemes have been developed for CAV platooning. However, most existing distributed schemes for platoon centered CAV control require either centralized data processing or centralized computation in at least one step of their schemes, referred to as partially distributed schemes. In this paper, we develop fully distributed optimization based, platoon centered CAV platooning control under the linear vehicle dynamics via the model predictive control approach with a general prediction horizon. These fully distributed schemes do not require centralized data processing or centralized computation through the entire schemes. To develop these schemes, we propose a new formulation of an objective function and a decomposition method that decomposes a densely coupled central objective function into the sum of multiple locally coupled functions whose coupling satisfies the network topology constraint. We then exploit locally coupled optimization and operator splitting methods to develop fully distributed schemes. Control design and stability analysis is carried out to achieve desired traffic transient performance and asymptotic stability. Numerical tests demonstrate the effectiveness of the proposed fully distributed schemes and CAV platooning control.

关键词： connected and autonomous vehicle car-following control distributed algorithm constrained optimization control and stability

来源：评论

学校读者我要写书评

暂无评论

distributed computability: Relating k-immediate snapshot and x-set agreement

引用

INFORMATION AND COMPUTATION 2022年第PartB期285卷

作者： Delporte, Carole Fauconnier, Hugues Rajsbaum, Sergio Raynal, Michel Univ Paris Diderot IRIF Paris France Univ Nacl Autonoma Mexico Inst Matemat Mexico City Mexico Univ Rennes IRISA CNRS INRIA Rennes France Polytech Univ Hong Kong Hong Kong Peoples R China

This paper introduces a generalization of the immediate snapshot object denoted k -immediate snapshot, requiring that the snapshot returned contains at least (n - k) pairs. The case k = n -1 corresponds to the original immediate snapshot object, which requires that the snapshot returned contains at least one pair (process id, value) pair, that corresponds to the process id that invoked the operation). The paper first shows that k-immediate snapshot is impossible to implement in an asynchronous read/write system, even if k = n - 2 and t = 1. Then, the paper considers x-set agreement, another object stronger than the classical read/write t-crash read/write model (when x < t), and studies the relation with the k-immediate snapshot object, establishing strong relations linking these two fundamental distributed computing abstractions. The paper shows conditions under which x-set agreement can be solved in read/write systems enriched with k-immediate snapshot objects. It also shwos when k-immediate snapshot and consensus are equivalent.(c) 2021 Elsevier Inc. All rights reserved.

关键词： Asynchronous system Atomic read write register Computability distributed algorithm Immediate snapshot Impossibility k-Set agreement Process crash Snapshot object t-Resilient synchronization

来源：评论

学校读者我要写书评

暂无评论

Hybrid Energy Sharing Mechanism for Integrated Energy Systems Based on the Stackelberg Game

引用

CSEE Journal of Power and Energy Systems 2021年第5期7卷 911-921页

作者： Qiao Peng Xiuli Wang Yi Kuang Yifei Wang Hongyang Zhao Zhicheng Wang Jianhu Lyu Shannxi Key Laboratory of Smart Grid School of Electrical EngineeringXi’an Jiaotong UniversityXi’an 710049China Electric Power Research Institute Nanjing 211800China

Integrating the sharing economy and the power industry is of positive significance for the development of the energy *** the energy market transforming from a traditional vertical structure to an interactive and competitive structure,users'roles need to change,along with supply and demand interacting more ***,the traditional centralized optimization method for a single energy source can hardly reveal the complex multi-entity behavior of multi-energy ***,this paper establishes a distributed electrical-gas-thermal energy sharing mechanism centered on an energy hub that can converse energy,and build a more applicable integrated energy system ***,the supply-demand interaction and the energy conversion process is constructed with reference to the operationa丨mode of’a sharing economy and the dual role of prosumers.A Stackelberg model is established with the integrated energy system operator as the leader and prosumers as the followers,to simultaneously optimize the profit of the leader in the upper level and the comfort of the fo!lowers,energy use and utility in the lower ***,for protecting the participants’privacy,a distributed algorithm is used to find the optimal solution to equilibrate the model,and the existence and uniqueness of the solution is ***,a case study validates the effectiveness of the hybrid energy sharing mechanism and provides a reference for the integration of the energy sharing economy with the integrated energy system.

关键词： distributed algorithm energy sharing energy hub integrated energy system Stackelberg game

来源：评论

学校读者我要写书评

暂无评论

distributed Methodology for Reactive Power Support of Transmission System 4

Distributed Methodology for Reactive Power Support of Transm...

引用

4th International Conference on Smart Energy Systems and Technologies (SEST)

作者： Kryonidis, Georgios C. Tsampouri, Maria E. Malamaki, Kyriaki-Nefeli D. Demoulias, Charis S. Aristotle Univ Thessaloniki Sch Elect & Comput Engn Thessaloniki Greece

ISBN: (纸本)9781728176604

This paper deals with the provision of reactive power support from distribution grids to the transmission system. To this end, a new distributed control scheme is proposed that coordinates the reactive power output of distributed generation (DG) units to meet a predefined reactive power set-point at the point of interconnection of the distribution grid with the transmission system. The coordination process is implemented in an optimal way minimizing the reactive power of DG units, while also satisfying the technical limits of the distribution grid. Time-series simulations on the IEEE 33-bus network are performed to evaluate the performance of the proposed method against existing solutions.

关键词： distributed algorithm distributed generation loss reduction reactive power support voltage control

来源：评论

学校读者我要写书评

暂无评论

Anchored coreness: efficient reinforcement of social networks

引用

VLDB JOURNAL 2022年第2期31卷 227-252页

作者： Linghu, Qingyuan Zhang, Fan Lin, Xuemin Zhang, Wenjie Zhang, Ying Univ New South Wales Sydney NSW Australia Guangzhou Univ Guangzhou Peoples R China Univ Technol Sydney Ctr AI Sydney NSW Australia

The stability of a social network has been widely studied as an important indicator for both the network holders and the participants. Existing works on reinforcing networks focus on a local view, e.g., the anchored k-core problem aims to enlarge the size of the k-core with a fixed input k. Nevertheless, it is more promising to reinforce a social network in a global manner: considering the engagement of every user (vertex) in the network. Since the coreness of a user has been validated as the "best practice" for capturing user engagement, we propose and study the anchored coreness problem in this paper: anchoring a small number of vertices to maximize the coreness gain (the total increment of coreness) of all the vertices in the network. We prove the problem is NP-hard and show it is more challenging than the existing local-view problems. An efficient greedy algorithm is proposed with novel techniques on pruning search space and reusing the intermediate results. The algorithm is also extended to distributed environment with a novel graph partition strategy to ensure the computing independency of each machine. Extensive experiments on real-life data demonstrate that our model is effective for reinforcing social networks and our algorithms are efficient.

关键词： Social network User engagement Network stability Core decomposition distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Optimal Economic Dispatch for Integrated Energy System Considering Communication Delays and Event Triggering Mechanism 33

Distributed Optimal Economic Dispatch for Integrated Energy ...

引用

第33届中国控制与决策会议

作者： Jun Yang Xinhao Zhuang College of Information Science and Engineering Northeastern University

ISBN: (纸本)9781665431293

This paper investigates the economic dispatch problem of Integrated Energy System(IES) in a distributed fashion.A distributed double consistency algorithm is proposed to address this *** algorithm aims to minimize the operating cost of IES,achieving the same incremental cost of electricity and heat ***,an event triggering mechanism based on state information is proposed,which can effectively reduce the communication resources between *** the same time,the time-varying delay of communication between nodes is considered,which is more ***,the effectiveness of the algorithm is verified by an IES simulation system with 30-32 nodes.

关键词： Integrated Energy System Economic Dispatch distributed algorithm Delays Event Triggering

来源：评论

学校读者我要写书评

暂无评论

DistGNN: Scalable distributed Training for Large -Scale Graph Neural Networks 21

DistGNN: Scalable Distributed Training for Large -Scale Grap...

引用

International Conference for High Performance Computing, Networking, Storage and Analysis (SC21)

作者： Md, Vasimuddin Misra, Sanchit Ma, Guixiang Mohanty, Ramanarayan Georganas, Evangelos Heinecke, Alexander Kalamkar, Dhiraj Ahmed, Nesreen K. Avancha, Sasikanth Intel Corp Santa Clara CA 95052 USA

ISBN: (纸本)9781450384421

Full-batch training on Graph Neural Networks (GNN) to learn the structure of large graphs is a critical problem that needs to scale to hundreds of compute nodes to be feasible. It is challenging due to large memory capacity and bandwidth requirements on a single compute node and high communication volumes across multiple nodes. In this paper, we present DistGNN that optimizes the wellknown Deep Graph Library (DGL) for full -batch training on CPU cltrsters viaall efficient shared memory implementation, COMMUIOcation reduction using a minimum vertex-cut graph partitioning algoritlun and communication avoidance using a fluidly of delayed update algorithms. Our results on four common GNN benchmark datasets: Recldit, OGB-Products, OGB-Papers and Proteins, show up to 3.7x speed-up using a single CPU socket and up to 97x speed-up using 128 CPU sockets, respectively, over baseline DGL implementations running on a single CPU socket.

关键词： Graph Neural Networks Graph partition distributed algorithm Deep Learning Deep Graph Library

来源：评论

学校读者我要写书评

暂无评论

Towards a robust FANET: distributed node importance estimation-based connectivity maintenance for UAV swarms

引用

AD HOC NETWORKS 2022年 125卷

作者： Liu, Chao Zhang, Zhongshan Univ Sci & Technol Beijing Sch Comp & Commun Engn Beijing Peoples R China Beijing Inst Technol Sch Informat & Elect Beijing Peoples R China

The emergence of unmanned aerial vehicle (UAV) swarms has brought a variety of critical challenges to solve. Among them, connectivity maintenance has been the subject of numerous investigations. Especially in a network whose topology dynamically changes, such as the flying ad hoc network (FANET), the connectivity is prone to be lost when topology changes. Besides, the network connectivity tends to deteriorate when node failure occurs. In this paper, a distributed connectivity maintenance framework that considers the vulnerability of nodes and the robustness of a network, is proposed. Firstly, a distributed neighbor selection rule to determine the neighbor set of each node in the network is designed. Secondly, a distributed connectivity maintenance strategy to evaluate the impact of the removal of a node is developed. Based on the perturbation of algebraic connectivity (AC), a distributed node importance evaluation algorithm is designed to approximate the AC measure of the resulting network. Finally, numerical simulation results are presented to validate the effectiveness of the proposed framework.

关键词： Flying ad hoc network Algebraic connectivity Node importance ranking Connectivity maintenance distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Task Allocation for a Multi-UAV System with Time Window Constraints

引用

DRONES 2022年第9期6卷 226-226页

作者： Cui, Wei Li, Ruilin Feng, Yanxiang Yang, Yikang Xi An Jiao Tong Univ Fac Elect & Informat Engn Sch Automat Sci & Engn Xian 710049 Peoples R China Xi An Jiao Tong Univ State Key Lab Mfg Syst Engn Xian 710049 Peoples R China

This paper develops a distributed method, namely, distributed allocation with time windows (DATW) for managing the multi-UAV task assignment problem (MTAP) with complex time window constraints. By aiming directly to minimize the average task completion time, the pro-posed DATW intends to achieve a conflict-free result that allocates all tasks within the validity time windows. Based on the decentralized PI (Performance Impact) framework, the proposed algorithm addresses the MTAP in a three-phase task assignment strategy, which includes task inclusion, conflict resolution, and task reallocation. The newly introduced task allocation phase achieves a noteworthy increase in an average number of allocated tasks. Unlike the traditional PI methods, the start time of each task is broadcasted among agents via communication typology, and the significance value of each task is directly related to its validity time window, such that the vast majority of tasks are able to be assigned properly without imposing any extra communication burdens. In the obtained conflict-free allocation solution by DATW, each task is allocated to a proper UAV with all given constraints satisfied. Finally, the simulation results demonstrate the effectiveness and superiority of the proposed DATW. Compared with existing (CBBA-based) solutions, results show up to an 18% increase in success rate (SR) using the proposed method.

关键词： multi-UAV system time window constraint task allocation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：