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

19th International Conference on distributed Computing and Intelligent Technology (ICDCIT)

作者： Kumar, Manish Indian Stat Inst Kolkata India

ISBN: (纸本)9783031248474;9783031248481

We study the graph realization problem in the Congested Clique in a distributed network under the crash-fault model. We focus on the degree-sequence realization, each node v is associated with a degree value d(v), and the resulting degree sequence is realizable if it is possible to construct an overlay network with the given degrees. This paper focuses on the message and round complexity of deterministic graph realization in the anonymous network. It has been shown by Kumar et al. [ALGOSENSORS 2022] that the graph realization can be solved using O(n(2)) message and O(f) round without the knowledge of f, of which f nodes could be faulty (f < n). However, their algorithm works for KT1 (Knowledge Till 1 hop) model where nodes know their neighbors' IDs;or in the KT0 (Knowledge Till 0 hop) model, in which each node knows the IDs of all the nodes in the clique, but doesn't know which port is connecting to which node-ID. In this paper, we extend the result to KT0 when the network is anonymous, i.e., the IDs of the neighboring nodes are unknown. We present an algorithm that solves the graph realization problem in the KT0 model with matching performance guarantees as in the KT1 model.

关键词： Graph realizations Congested-Clique distributed algorithm Fault-tolerant algorithm Crash fault Time complexity Message complexity

来源：评论

学校读者我要写书评

暂无评论

A Novel distributed Consensus-Based Approach to Solve the Economic Dispatch Problem Incorporating the Valve-Point Effect and Solar Energy Sources

引用

ENERGIES 2023年第1期16卷 447页

作者： Moin, Muhammad Ahmed, Waqas Rehan, Muhammad Iqbal, Muhammad Ullah, Nasim Zeb, Kamran Uddin, Waqar Pakistan Inst Engn & Appl Sci PIEAS Dept Elect Engn Islamabad 45650 Pakistan Natl Univ Technol NUTECH Dept Comp Sci Islamabad 44000 Pakistan Taif Univ Coll Engn Dept Elect Engn POB 11099 Taif 21944 Saudi Arabia Natl Univ Sci & Technol Sch Elect Engn & Comp Sci Islamabad 44000 Pakistan Natl Univ Technol NUTECH Dept Elect Engn Islamabad 44000 Pakistan

This research focused on the design of a distributed approach using consensus theory to find an optimal solution of the economic dispatch problem (EDP) by considering the quadratic cost function along with the valve-point effect of generators and renewable energy systems (RESs). A distributed consensus approach is presented for the optimal economic dispatch under a complex valve-point effect by accounting for solar energy in addition to conventional power plants. By employing the beta distribution function and communication topology between generators, a new optimality condition for the dispatch problem was formulated. A novel distributed updation law for generation by considering the communication between generators was provided to deal with the valve-point effect. The convergence of the proposed updation law was proved analytically using Lyapunov stability and graph theory. An algorithm for ensuring a distributed economic dispatch via conventional power plants, integrated with solar energy, was addressed. To the best of the authors' knowledge, a distributed nonlinear EDP approach for dealing with the valve-point loading issue via nonlinear incremental costs has been addressed for the first time. The designed approach was simulated for benchmark systems with and without a generation capacity constraint, and the results were compared with the existing centralized and distributed strategies.

关键词： consensus distributed algorithm economic dispatch problem renewable energy sources incremental cost non-smooth cost function optimization valve-point loading effect

来源：评论

学校读者我要写书评

暂无评论

Based on the difference of Newton's method integrated energy system distributed collaborative optimization

引用

FRONTIERS IN ENERGY RESEARCH 2023年 11卷

作者： Liu, Xinying Chen, Xu Ke, Xinyu Liaoning Tech Univ Fac Elect & Control Engn Huludao Peoples R China Xinjiang Agr Univ Coll Mech & Elect Engn Urumqi Peoples R China Guizhou Univ Elect Engn Coll Guiyang Peoples R China

With the integration of renewable energy into the grid, the traditional power system stability faced by huge challenges, and the development of integrated energy system, it is of essence to improve the coupling of multiple integrated energy systems of different types, management in the integrated energy system and reduce the pressure of communication and computing, in this paper, we construct a distributed Newton algorithm based on Newton's method to accelerate the solving speed, which decreases the times of iterations to reduce the pressure of communication and calculation, saving the cost of operation. Besides, privacy protection is particularly important for a distributed control system, under the premise that calculation speed is guaranteed, meanwhile, privacy protection of all agents in an integrated energy system is also critical. This study uses annular directed distributed algorithm to enhance the privacy of integrated distributed energy systems in the intelligent body, so as to fully ensure the privacy safety of all agents in the system. Moreover, the forementioned difference Newton algorithm in this study avoid the behavior of Zeno, greatly accelerating the speed of iteration and finding the best energy market price,. At the same time, the privacy safety of all agentsin the distributed energy system are ensured. Finally, a distributed integrated energy system based on the algorithm proposed by this study has went through theoretical proof and simulation experiment, whose result shows the validity of the algorithm.

关键词： difference Newton method integrated energy system energy scheduling optimization distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Investigation of Time-Constrained Multi-Agent distributed Task Allocation 25

Investigation of Time-Constrained Multi-Agent Distributed Ta...

引用

Proceedings of the 2025 3rd International Conference on Communication Networks and Machine Learning

作者： Haiwen Xie School of Information North China University of Technology Beijing China

ISBN: (纸本)9798400713231

In the face of dynamic and complex task environment, how to reasonably allocate tasks, especially under the conditions of time and resource constraints, has become an urgent problem to be solved. In this paper, we propose a distributed task allocation algorithm based on weighted cost function to maximize the number of tasks allocated, which optimizes the task allocation process by considering the urgency of the task and the energy consumption of the agent. The algorithm first generates the task sequence through the task allocation strategy, and then introduces the local search strategy to further optimize the initial task sequence to reduce the task execution cost and achieve the goal of maximizing the allocation number. Experimental results show that the proposed algorithm has significant advantages in reducing the number of iterations and optimizing the efficiency of task allocation.

关键词： distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Multiple Uniform Circle Formation by Fat Robots Under Limited Visibility 23

Multiple Uniform Circle Formation by Fat Robots Under Limite...

引用

24th International Conference on distributed Computing and Networking (ICDCN)

作者： Biswas, Mainak Rahaman, Saif Mondal, Moumita Chaudhuri, Sruti Gan Indian Inst Sci Bengaluru Karnataka India Jadavpur Univ Kolkata W Bengal India

ISBN: (纸本)9781450397964

Formation of arbitrary shapes and patterns using swarm robots is a fairly well researched topic. However, there is still a long way to go. This is due to the hindrance caused by the immense complexity of distributed algorithms and their lack of scalability. This paper proposes a scalable algorithm that allows a set of identical, homogeneous, disk shaped fat mobile robots to form multiple uniform circles. All the robots run the same proposed (completely distributed and deterministic) algorithm. The robots follow a global coordinate system. All the points that the robots must occupy are pre-computed by them. The robots in this paper are not oblivious, and use a message passing technique to prevent collisions. The robots have the same limited visibility, within which they can observe other robots. Based on one's current position and position of other robots in its visibility, a robot takes appropriate decisions so that the objective can be fulfilled. The algorithm guarantees formation of multiple uniform circles under a synchronous environment. At the end of the paper, we also discuss why this algorithm is independent of the shape the robots have to form, and can be extended to the formation of any arbitrary geometric shape by just changing the computation of the points that the robots eventually occupy.

关键词： multiple uniform circle formation message passing swarm robots fat robots limited visibility synchronous environment distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Improved Tradeoffs for Leader Election 23

Improved Tradeoffs for Leader Election

引用

42nd ACM SIGACT-SIGOPS Symposium on Principles of distributed Computing (PODC)

作者： Kutten, Shay Robinson, Peter Ming, Ming Zhu, Xianbin Technion Israel Inst Technol Haifa Israel Augusta Univ Sch Comp & Cyber Sci Augusta GA USA City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China

ISBN: (纸本)9798400701214

We consider leader election in clique networks, where n nodes are connected by point-to-point communication links. For the synchronous clique under simultaneous wake-up, i.e., where all nodes start executing the algorithm in round 1, we show a tradeoff between the number of messages and the amount of time. The previous lower bound side of such a tradeoff, in the seminal paper of Afek and Gafni (1991), was shown only assuming adversarial wake-up. Interestingly, our new tradeoff also improves the previous lower bounds for a large part of the spectrum, even under simultaneous wake-up. More specifically, we show that any deterministic algorithm with a message complexity of n f (n) requires Omega(log n/log f(n) + 1) rounds, for f(n) > 1. Our result holds even if the node IDs are chosen from a relatively small set of size Theta(n log n), as we are able to avoid using Ramsey's theorem, in contrast to many existing lower bounds for deterministic algorithms. We also give an upper bound that improves over the previously-best tradeoff achieved by the algorithm of Afek and Gafni. Our second contribution for the synchronous clique under simultaneous wake-up is to show that Omega(n log n) is in fact a lower bound on the message complexity that holds for any deterministic algorithm with a termination time T (n) (i.e., any function of n), for a sufficiently large ID space. We complement this result by giving a simple deterministic algorithm that achieves leader election in sublinear time while sending only o(n log n) messages, if the ID space is of at most linear size. We also show that Las Vegas algorithms (that never fail) require Theta(n) messages. This exhibits a gap between Las Vegas and Monte Carlo algorithms. For the synchronous clique under adversarial wake-up, we show that Omega(n(3/2)) is a lower bound for 2-round algorithms. Our result is the first superlinear lower bound for randomized leader election algorithms in the clique. We also give a simple algorithm that matche

关键词： distributed algorithm Leader Election Lower Bound

来源：评论

学校读者我要写书评

暂无评论

An event-triggered quantization communication strategy for distributed optimal resource allocation

引用

SYSTEMS & CONTROL LETTERS 2023年第1期180卷

作者： Cai, Xin Zhong, Huiru Li, Yanbiao Liao, Junbo Chen, Xingzhi Nan, Xinyuan Gao, Bingpeng Xinjiang Univ Sch Elect Engn Urumqi 830017 Peoples R China China Huayin Weap Test Ctr Huayin 714200 Shaanxi Peoples R China

Taken limited communication resources in practical applications into consideration, this paper studies the distributed resource allocation problem for continuous-time multi-agent systems on switching networks. Transmission information among agents is quantized by a dynamic encoding/decoding scheme to reduce the amount of data transmitted in communication networks. Furthermore, an event triggered communication scheme is designed to determine when to transmit quantized information to neighboring agents. Compared with the existing distributed event-triggered resource allocation algorithms, the proposed algorithm can reduce not only the communication frequency but also the amount of transmission data. Under mild conditions, all agents' decisions asymptotically reach to the optimal allocation. It is analyzed that the proposed event-triggered quantization communication scheme is free of the Zeno behavior. A numerical example is given to verify the effectiveness of the proposed algorithm.(c) 2023 Elsevier B.V. All rights reserved.

关键词： distributed algorithm Quantization Resource allocation Switching graphs

来源：评论

学校读者我要写书评

暂无评论

distributed optimization with Markovian switching targets and stochastic observation noises with applications to DC microgrids

引用

Science China(Information Sciences) 2022年第12期65卷 232-247页

作者： Siyu XIE Leyi WANG Masoud H.NAZARI George YIN Gun LI School of Aeronautics and Astronautics University of Electronic Science and Technology of China Department of Electrical and Computer Engineering Wayne State University Department of Mathematics University of Connecticut

A distributed optimization problem with Markovian switching targets and stochastic observation noises is considered in this paper. In order to solve target following and renewable following for microgrid(MG) optimal power balancing, and to attenuate observation noises simultaneously, distributed optimization algorithms are developed. The interaction between observation noises and Markovian switching targets may introduce a fundamental tradeoff in reducing the optimization errors and choosing the step size. Furthermore, under infrequent Markovian switching assumptions, the mean-square optimization error bounds, the switching ordinary differential equation(ODE) limit, and the asymptotic distributions of the optimization errors are established rigorously and comprehensively. A simulation example on a DC MG is presented to show the main results of the paper.

关键词： constraint optimization noisy observation output variation Markovian switching target distributed algorithm DC microgrid

来源：评论

学校读者我要写书评

暂无评论

Barycentric coordinate-based distributed localization for wireless sensor networks subject to random lossy links

引用

NEUROCOMPUTING 2023年第1期550卷

作者： Wang, Ya Shi, Lei Chen, Xinming Shao, Jinliang Cheng, Yuhua Wang, Houjun Wang, Lijun Univ Elect Sci & Technol China Sch Automat Engn Chengdu 611731 Peoples R China Chengdu Technol Univ Sch Intelligent Mfg Chengdu 611730 Peoples R China

distributed localization in wireless sensor networks is essential for verifying the positions of the sensor nodes deployed in the sensing field based on information interactions. However, the information trans-mitted from the controller to the actuator for each sensor node may be lost owing to communication noise, channel interference, or network congestion. With this in mind, this paper aims at investigating the distributed localization for wireless sensor networks subject to random lossy links. The barycentric coordinate, which can be determined by the distance measurements between node pairs in the network, is used as the basic scheme for range-based localization. First, based on the characterization of random link loss in wireless sensor networks with a Bernoulli random variable, a distributed iterative localization algorithm is proposed. And then, the global convergence of the proposed localization algorithm which ensures accurate localization is theoretically proved by using the convergence of sub-stochastic matrices' product. Finally, numerical examples are conducted to illustrate the effectiveness of the proposed local-ization algorithm.& COPY;2023 Elsevier B.V. All rights reserved.

关键词： Localization Wireless sensor networks Lossy links distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Conflict-Detection and Resolution algorithm for UAV Swarms Based on Consensus algorithm and Strategy Coordination

引用

IEEE ACCESS 2019年 7卷 100552-100566页

作者： Wan, Yu Tang, Jun Lao, Songyang Natl Univ Def Technol Coll Syst Engn Changsha 410073 Hunan Peoples R China

In this paper, we study the problem of conflict detection and resolution for unmanned aerial vehicle (UAV) swarms. Specially, we propose a distributed conflict detection and resolution method for multi-UAVs in formation based on consensus algorithm and strategy coordination. When encountering threat swarms, the UAVs in one swarm act as one unit and are together treated as one control object. Each swarm in conflict selects three candidate collision avoidance maneuvers from the preset strategy pool, generates the corresponding planned trajectories with an uncertainty trajectory modeling, and then broadcasts and shares them. All of the swarms in conflict coordinate and determine an optimal combination of strategies. When a collision is imminent, the primary strategy is activated. Each swarm adopts a "leader- follower'' strategy, where the leader UAV is regarded as the controller and flies independently, and the others follow the leader UAV. During motion, a decentralized consensus algorithm is adopted for agents to converge to their positions for the desired formation and to maintain a stable geometric configuration. A temporal and spatially integrated conflict-detection model is improved, especially for UAV swarms. A token-allocation strategy is especially improved for distributed coordination to resolve the partial knowledge of the airspace condition. Damping of the coordination is proposed to address data dropouts and transmission delays. Two typical scenarios are conducted to test the methodology proposed in this paper. The simulation result demonstrates the effectiveness and rationality of the proposed methodology.

关键词： Collision avoidance strategy coordination conflict resolution distributed algorithm conflict detection and resolution automatic control path planning unmanned aerial vehicles

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：