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

DEED-ADMM: A Scalable distributed algorithm for Economic Dispatch in Multi-Energy Systems With Energy Storage

IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING 2025年 22卷 11431-11443页

作者： Zhu, Shanying Ding, Tao Chen, Cailian Chow, Mo-Yuen Guan, Xinping Shanghai Jiao Tong Univ Dept Automat Shanghai 200240 Peoples R China Minist Educ China Key Lab Syst Control & Informat Proc Shanghai 200240 Peoples R China Xi An Jiao Tong Univ Sch Elect Engn Xian 710049 Peoples R China Shanghai Jiao Tong Univ UM SJTU Joint Inst Shanghai 200240 Peoples R China

Multi-energy systems with energy storage can coordinate various energy carriers to facilitate the integration of large amounts of distributed energy sources and promote the overall efficiency of energy use, which needs distributed dispatch with the requirement of security and privacy. This paper studies the distributed economic dispatch based on information from neighboring agents only. In order to handle the non-convexity due to the complementarity constraint of energy storage, it is proved that simultaneous charging and discharging is suboptimal for the multi-energy systems. Based on this, an equivalent convex problem is reformulated. A scalable distributed algorithm based on parallel ADMM and dynamic consensus mechanism, termed DEED-ADMM, is then proposed. It is shown that DEED-ADMM is scalable in terms of per-agent energy consumption and computational complexity with centralized methods. Moreover, under general convex cost functions, convergence properties of DEED-ADMM are theoretically analyzed by adopting the Lyapunov-based approach. It is proved that the primal problem and the dual problem can be simultaneously solved. Finally, case studies demonstrate the effectiveness of the proposed algorithm.

关键词： Energy storage Electricity distributed algorithms Cost function Convergence Mercury (metals) Couplings Cogeneration Vectors Matrix decomposition Multi-energy system economic dispatch distributed algorithm Lypapunov-based approach ADMM

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for the multi-robot minimum time task allocation problem

引用

INDUSTRIAL ROBOT-THE INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH AND APPLICATION 2025年第3期52卷 334-342页

作者： Zhang, Qing Wang, Yujuan Cen, Ruping Chongqing Univ Chongqing Peoples R China Chongqing Univ Posts & Telecommun Chongqing Peoples R China

PurposeThe purpose of this study is to address the challenge of task allocation in multi-robot systems by getting the minimum overall task completion time and task allocation scheme while also minimizing robot energy consumption. This study aims to move away from traditional centralized methods and validate a more scalable distributed ***/methodology/approachThis paper proposes a distributed algorithm for the multi-robot task allocation problem, aimed at getting the minimum task completion time along with the task allocation scheme. The algorithm operates based on local interaction information rather than global information. By using the Consensus-Based Auction algorithm (CBAA), it seeks to effectively minimize energy consumption without affecting the minimum completion time required for overall task *** proposed distributed algorithm successfully reduces robot energy consumption while effectively obtaining the shortest overall task completion time and corresponding task allocation scheme. Numerical simulations conducted using MATLAB software demonstrated its superior performance, and empirical testing on the Turtlebot3-Burger robot platform further substantiated these ***/valueThe original contribution of this study lies in the development of an enhanced distributed task allocation strategy using CBAA to improve efficiency in multi-robot environments. Its value extends to applications that require rapid and resource-aware coordination, such as automated logistics or search-and-rescue operations.

关键词： Multi-robot systems distributed algorithm Minimum time task allocation

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm with dynamic event-triggered mechanism for resource allocation problems

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2025年第1期28卷 1-14页

作者： Chen, Baitong Yang, Jianhua Lu, Wei Pedrycz, Witold Sun, Changhai Dalian Univ Technol Sch Control Sci & Engn Dalian 116023 Liaoning Peoples R China Univ Alberta Dept Elect & Comp Engn Edmonton AB Canada Dalian Univ Technol Sch Elect Engn Dalian 116023 Liaoning Peoples R China

distributed algorithms have continued to attract attention due to their decentralized nature, strong robustness, and ease of scalability. However, as the scale of networks expands, the implementation of distributed algorithms also increases the demand for communication resources. In this study, we introduce a distributed algorithm incorporating a dynamic event-triggered communication mechanism to address the widespread issue of resource allocation in numerous engineering disciplines. The proposed algorithm significantly reduces communication frequency while maintaining competitive convergence speed. We prove that under the condition of strongly convex and smoothness local cost functions, by selecting appropriate parameters, the algorithm can attain linear convergence. The efficacy and benefits of our method are confirmed through several simulation experiments.

关键词： Resource allocation distributed algorithm Dynamic event-triggered mechanism Linear convergence

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Making Scale-Free Network by Preferential Rewiring Without Growth

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2019年第6期15卷 3125-3132页

作者： Park, Jae-Hyun Chung Ang Univ Sch Comp Sci & Engn Seoul 06974 South Korea

The digital payment system that uses crypto-currency, such as Bitcoin, is a distributed ledger working on a peer-to-peer network. We present a method to make a scale-free network for such applications. Using some biased physical quantities that are observable in sites, we can make the scale-free network through processes of cooperating distributed sites. Each node only proposes connecting to the more attractive node among randomly known nodes. The candidate node that is found by each node agrees to set two-way links if the requesting node is more attractive than the old node that is already connected. Once they establish the new bidirectional relationship, they, respectively, remove the outgoing link to the less attractive node. We analytically calculate the connectivity distribution and show that the scaling exponent is 2.5. By Monte Carlo simulations, we confirm that a power law distribution of the scaling exponent 2.5 describes the degree distribution of the topology.

关键词： distributed algorithm network modeling peer-to-peer network scale-free network

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Continuous-Type Bayesian Nash Equilibrium in Subnetwork Zero-Sum Games

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2024年第2期11卷 915-927页

作者： Zhang, Hanzheng Chen, Guanpu Hong, Yiguang Chinese Acad Sci Acad Math & Syst Sci Key Lab Syst & Control Beijing 100190 Peoples R China Univ Chinese Acad Sci Sch Math Sci Beijing 100190 Peoples R China KTH Royal Inst Technol Sch Elect Engn & Comp Sci Div Decis & Control Syst S-11428 Stockholm Sweden Tongji Univ Dept Control Sci & Engn Shanghai 201804 Peoples R China Tongji Univ Shanghai Res Inst Intelligent Autonomous Syst Shanghai 201804 Peoples R China

In this article, we consider a continuous-type Bayesian Nash equilibrium (BNE) seeking problem in subnetwork zero-sum games, which is a generalization of either deterministic subnetwork zero-sum games or discrete-type Bayesian zero-sum games. In this model, because the feasible strategy set is composed of infinite-dimensional functions and is not compact, it is hard to seek a BNE in a noncompact set and convey such complex strategies in network communication. To this end, we give a two-step design. One is a discretization step, where we discretize continuous types and prove that the BNE of the discretized model is an approximate BNE of the continuous model with an explicit error bound. The other is a communication step, where we adopt a novel compression scheme with a designed sparsification rule and prove that agents can obtain unbiased estimations through the compressed communication. Based on the two steps, we propose a distributed communication-efficient algorithm to practically seek an approximate BNE, and further provide the convergence analysis and explicit error bounds.

关键词： Games Bayes methods Approximation algorithms distributed algorithms Convergence Nash equilibrium Control systems Bayesian game communication compression discretization distributed algorithm equilibrium approximation subnetwork game zero-sum game

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for Determining Minimal Covers of Acyclic Database Schemes

引用

Journal of Computer Science & Technology 1994年第3期9卷 204-214页

作者：叶新铭 Department of Computer Science Inner Mongolia University Huhhot

Acyclic databases possess several desirable properties for their design and use. Adistributed algorithm is proposed for determining a minimal cover of an alpha-, beta-,gamma-, or Berge-acyclic database scheme over a s... 详细信息

关键词： Alpha- beta- gamma- Berge-acyclic depth-first-search tree distributed algorithm minimal cover hypergraph

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for AP association with random arrivals and departures of users

引用

IET COMMUNICATIONS 2020年第5期14卷 846-856页

作者： Chen, Zhenwei Zhang, Wenjie Zheng, Yifeng Yang, Liwei Yeo, Chai Kiat Minnan Mormal Univ Sch Comp Sci Key Lab Data Sci & Intelligence Applicat Zhangzhou Peoples R China China Univ Petr Coll Geophys & Informat Engn Beijing Peoples R China China Agr Univ Coll Informat & Elect Engn Beijing Peoples R China Nanyang Technol Univ Sch Comp Sci & Engn Singapore Singapore

Here, the authors study the novel problem of optimising access point (AP) association by maximising the network throughput, subject to the degree bound of AP. The formulated problem is a combinatorial optimisation. They resort to the Markov Chain approximation technique to design a distributed algorithm. They first approximate their optimal objective via Log-Sum-Exp function. Thereafter, they construct a special class of Markov Chain with steady-state distribution specify to their problem to yield a distributed solution. Furthermore, they extend the static problem setting to a dynamic environment where the users can randomly leave or join the system. Their proposed algorithm has provable performance, achieving an approximation gap of (1/eta)log vertical bar F vertical bar. It is simple and can be implemented in a distributed manner. Their extensive simulation results show that the proposed algorithm can converge very fast, and achieve a close-to-optimal performance with a guaranteed loss bound.

关键词： Markov processes combinatorial mathematics distributed algorithms approximation theory optimisation wireless LAN distributed algorithm AP association random arrivals user departures access point association combinatorial optimisation Markov Chain approximation technique Log-Sum-Exp function steady-state distribution static problem WLAN wireless local area networks

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm to reduce contention in emergency situations by deploying cognitive radio ad-hoc controllers

引用

IET COMMUNICATIONS 2019年第17期13卷 2814-2819页

作者： Sudhakaran, Chitra M, Suganthi Thiagarajar Coll Engn Dept Elect & Commun Engn Madurai Tamil Nadu India

Nowadays, the main focus of emergency communication research is directed to the use of cognitive radio ad-hoc networks for disaster scenarios. This study addresses an efficient cooperative game-theoretic channel access scheme for data offloading and cooperation of emergency user using cooperative cognitive ad-hoc controllers in order to reduce the blocking probability of the newly incoming emergency user. The main objective is to connect all the users who are in need of urgent spectrum and it is considered that their data size is too large. Also, a hybrid overlay-underlay approach was undertaken which provides higher spectrum flexibility. A distributed algorithm is proposed which comprises a criterion assignment, merge and split algorithm and an auction mechanism to provide incentives to those controllers who participate in cooperation. An aggregate throughput of 18% is obtained as an improvement when compared with other conventional heuristics algorithm.

关键词： probability cognitive radio game theory ad hoc networks telecommunication control distributed algorithms cooperative communication wireless channels distributed algorithm emergency communication research disaster scenarios data offloading hybrid overlay-underlay approach blocking probability reduction spectrum flexibility heuristics algorithm cooperative game-theoretic channel access scheme merge and split algorithm auction mechanism cooperative cognitive radio ad-hoc network controllers

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for Lifetime Maximization in a Delay-Tolerant Wireless Sensor Network with a Mobile Sink

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2013年第10期12卷 1920-1930页

作者： Yun, YoungSang Xia, Ye Behdani, Behnam Smith, J. Cole Univ Florida Dept Comp & Informat Sci & Engn Gainesville FL 32611 USA Univ Florida Dept Ind & Syst Engn Gainesville FL 32611 USA

We propose an algorithm for maximizing the lifetime of a wireless sensor network when there is a mobile sink and the underlying application can tolerate some amount of delay in delivering the data to the sink. The algorithm is distributed, and in addition, mostly uses local information. Such an algorithm can be implemented by parallel and/or distributed execution and the overhead of message passing is low. It is also possible to embed the algorithm into a network protocol so that the sensor nodes and the sink can run it directly as part of the network operation. We give a proof of the algorithm's optimality and the boundedness of the queue sizes, both in the long-run average sense. The proof is based on analyzing a Lyapunov drift.

关键词： Wireless sensor network lifetime maximization distributed algorithm delay-tolerant applications mobile sink

来源：评论

学校读者我要写书评

暂无评论

distributed algorithm for the maximal 2-packing in geometric outerplanar graphs

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 2014年第3期74卷 2193-2202页

作者： Antonio Trejo-Sanchez, Joel Alberto Fernandez-Zepeda, Jose Ctr Sci Res & Higher Educ Ensenada CICESE Dept Comp Sci Ensenada 22860 BC Mexico Univ Caribe Dept Basic Sci Cancun 77528 Quintana Roo Mexico

In this paper, we present a deterministic distributed algorithm that computes the maximal 2-packing set in a geometric outerplanar graph. In a geometric outerplanar graph, all the vertices have location coordinates in the plane and lie on the boundary of the graph. Our algorithm consists of three phases. First, it elects a vertex as the leader. Second, it explores the graph to determine relevant information about the structure of the input graph. Third, with this information, it computes a maximal 2-packing set. When the input graph is a ring, the algorithm computes a maximum 2-packing set. The execution time of this algorithm is O(n) steps and it uses O(n log n) messages. This algorithm does not require knowledge of the size of the input graph. To the best of our knowledge, this is the first deterministic distributed algorithm that solves such a problem for a geometric outerplanar graph in a linear number of steps. (C) 2013 Elsevier Inc. All rights reserved.

关键词： distributed algorithm Geometric graph Outerplanar graph Ear decomposition 2-packing set

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：