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

21st International Conference on distributed Computing and Intelligent Technology

作者： Kshemkalyani, Ajay D. Kumar, Manish Molla, Anisur Rahaman Sharma, Gokarna Univ Illinois Chicago IL USA Indian Inst Technol Madras Chennai Tamil Nadu India Indian Stat Inst Kolkata India Kent State Univ Kent OH USA

ISBN: (纸本)9783031814037;9783031814044

Leader election is a critical and extensively studied problem in distributed computing. This paper introduces the study of leader election using mobile agents. Consider n agents initially placed arbitrarily on the nodes of an arbitrary, n-node, m-edge graph G. These agents move autonomously across the nodes of G and elect one agent as the leader such that the leader is aware of its status as the leader, and the other agents know they are not the leader. The goal is to minimize both time and memory usage. We study the leader election problem in a synchronous setting where each agent performs operations simultaneously with the others, allowing us to measure time complexity in terms of rounds. We assume that the agents have prior knowledge of the number of nodes n and the maximum degree of the graph Delta. We first elect a leader deterministically in O(n log(2) n + D Delta log n) rounds with each agent using O(log n) bits of memory, where D is the diameter of the graph. Leveraging this leader election result, we then present a deterministic algorithm for constructing a minimum spanning tree of G in O(m+ n log n) rounds, with each agent using O(Delta log n) bits of memory. Finally, using the same leader election result, we improve time and memory bounds for other key distributed graph problems, including gathering, maximal independent set, and minimal dominating set. For all the aforementioned problems, our algorithms remain memory-optimal.

关键词： distributed algorithms mobile agents local communication leader election MST MIS gathering minimal dominating set time and memory complexity graph parameters

来源：评论

学校读者我要写书评

暂无评论

Mobile Agents on Chordal Graphs: Maximum Independent Set and Beyond 21st

Mobile Agents on Chordal Graphs: Maximum Independent Set and...

引用

21st International Conference on distributed Computing and Intelligent Technology

作者： Kaur, Tanvir Paul, Kaustav Mondal, Kaushik Indian Inst Thelmol Ropar Rupnagar Punjab India

ISBN: (纸本)9783031814037;9783031814044

We consider the problem of finding a maximum independent set (MaxIS) of chordal graphs using mobile agents. Suppose n agents are initially placed arbitrarily on the nodes of an n-node chordal graph G = (V, E). Agents need to find a maximum independent set M of G such that each node of M is occupied by at least one agent. Also, each of the n agents must know whether its occupied node is a part of M or not. Starting from both rooted and arbitrary initial configuration, we provide distributed algorithms for n mobile agents having O(log n) memory each to compute the MaxIS of G in O(mnlog Delta) time, where m denotes the number of edges in G and Delta is the maximum degree of the graph. Agents do not need prior knowledge of any parameters if the initial configuration is rooted. For arbitrary initial configuration, agents need to know few global parameters beforehand. We further show that using a similar approach it is possible to find the maximum clique in chordal graphs and color any chordal graph with the minimum number of colors. We also provide a dynamic programming-based approach to solve the MaxIS finding problem in trees in O(n) time.

关键词： Mobile agents Maximum Independent Set distributed algorithms Deterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

Universally-Optimal distributed Exact Min-Cut 22

Universally-Optimal Distributed Exact Min-Cut

引用

ACM Symposium on Principles of distributed Computing (PODC)

作者： Ghaffari, Mohsen Zuzic, Goran MIT Cambridge MA 02139 USA Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450392624

We present a universally-optimal distributed algorithm for the exact weighted min-cut. The algorithm is guaranteed to complete in (O) over tilde (D + root n) rounds on every graph, recovering the recent result of Dory, Efron, Mukhopadhyay, and Nanongkai [STOC'21], but runs much faster on structured graphs. Specifically, the algorithm completes in (O) over tilde (D) rounds on (weighted) planar graphs or, more generally, any (weighted) excluded-minor family. We obtain this result by designing an aggregation-based algorithm: each node receives only an aggregate of the messages sent to it. While somewhat restrictive, recent work shows any such black-box algorithm can be simulated on any minor of the communication network. Furthermore, we observe this also allows for the addition of (a small number of) arbitrarily-connected virtual nodes to the network. We leverage these capabilities to design a min-cut algorithm that is significantly simpler compared to prior distributed work. We hope this paper showcases how working within this paradigm yields simple-to-design and ultra-efficient distributed algorithms for global problems. Our main technical contribution is a distributed algorithm that, given any tree T, computes the minimum cut that 2-respects T (i.e., cuts at most 2 edges of T) in universally near-optimal time. Moreover, our algorithm gives a deterministic (O) over tilde (D)-round 2-respecting cut solution for excluded-minor families and a deterministic (O) over tilde (D + root n)-round solution for general graphs, the latter resolving a question of Dory, et al. [STOC'21]

关键词： exact minimum cut distributed algorithms message-passing algorithms CONGEST model minor-aggregation model low-congestion shortcuts universal optimality

来源：评论

学校读者我要写书评

暂无评论

AN ALTERNATIVE APPROACH FOR distributed PARAMETER ESTIMATION UNDER GAUSSIAN SETTINGS 32

AN ALTERNATIVE APPROACH FOR DISTRIBUTED PARAMETER ESTIMATION...

引用

IEEE 32nd International Workshop on Machine Learning for Signal Processing (MLSP)

作者： Das, Subhro IBM Res MIT IBM Watson Lab Cambridge MA 02142 USA

ISBN: (数字)9781665485470

ISBN: (纸本)9781665485470

This paper takes a different approach for the distributed linear parameter estimation over a multi-agent network. The parameter vector is considered to be stochastic with a Gaussian distribution. The sensor measurements at each agent are linear and corrupted with additive white Gaussian noise. Under such settings, this paper presents a novel distributed estimation algorithm that fuses the the concepts of consensus and innovations by incorporating the consensus terms (of neighboring estimates) into the innovation terms. Under the assumption of distributed parameter observability, introduced in this paper, we design the optimal gain matrices such that the distributed estimates are consistent and achieves fast convergence.

关键词： parameter estimation distributed algorithms multiagent system consensus consistency

来源：评论

学校读者我要写书评

暂无评论

Efficient Balance Detection for Modular Robots

Efficient Balance Detection for Modular Robots

引用

2024 International Conference on Intelligent Robots and Systems

作者： Yazidi, Ikrame Piranda, Benoit Ouisse, Morvan Bourgeois, Julien

ISBN: (纸本)9798350377712;9798350377705

In this paper, we explore the field of self-reconfigurable modular robots, representing a significant advance in robotic technology. These robots have many capabilities, offering high adaptability and flexibility for a variety of applications. However, computing the stability is challenging as it is computationally intensive, it needs to be distributed and fast, as close as possible of real-time. In this article, we introduce a distributed algorithm designed to overcome these challenges while taking mechanical constraints into account. At the heart of this algorithm is the notion of the "support polygon", which enables the stability of a modular robot to be assessed in real time. The algorithm is based on a fully distributed tree partitioning approach, facilitating efficient communication and collaboration between modules. The algorithm also uses a polygon merging approach to reduce the number of messages when creating the polygon support, thus significantly reducing response time. In fact, the response time of the method used is very small compared to other research. We also present simulation results on a simulator, VisibleSim, as well as experimental validation on real robotic modules, which underlines the practical viability of the approach. Overall, this work lays a solid base for further advances aiming to guarantee the stability of modular robots.

关键词： Modular robots distributed algorithms Stability Support polygon

来源：评论

学校读者我要写书评

暂无评论

distributed Optimization of Islanded Microgrids Integrating Multi-Type VSG Frequency Regulation and Integrated Economic Dispatch

引用

ENERGIES 2024年第7期17卷 1618页

作者： Xu, Huixin Sun, Jiahang Huang, Jingguang Lin, Xinyuan Ma, Chenghao China Three Gorges Univ Natl Virtual Simulat Expt Ctr Elect Engn Yichang 443002 Peoples R China

The question of how to simultaneously perform frequency regulation and integrated economic scheduling for microgrids with low-inertia islanding operation under communication constraints is a difficult problem that needs to be solved for many current applications. To this end, this paper establishes a microgrid scheduling control model containing a virtual synchronous generator (VSG) with multiple types of power sources and proposes a distributed optimization algorithm that integrates frequency regulation and comprehensive economic scheduling to simultaneously realize frequency regulation and economic scheduling in a microgrid. Firstly, a distributed economic dispatch problem is proposed based on a comprehensive consideration of the costs and benefits of various types of power VSGs, as well as the overall inertia and standby capacity requirements of the microgrid, which minimizes the integrated costs incurred by the participation of each type of VSG in the frequency regulation and improves the stable operation of the microgrid in terms of frequency under perturbation. Then, the optimal scheduling problem is solved by reconstructing the optimization problem based on considering the dynamic characteristics of microgrid inverters and using event-triggered communication to sense and compensate for the supply-demand imbalance online. The proposed method can avoid inter-layer coordination across time scales, improve the inertia, frequency regulation capability, and economy of the system, and enhance its robustness to short-term communication failures. Finally, simulation results are used to verify the effectiveness of the method.

关键词： virtual synchronization machine optimized scheduling frequency regulation distributed algorithms isolated island microgrid

来源：评论

学校读者我要写书评

暂无评论

Comparative Study of distributed Consensus Gossip algorithms for Network Size Estimation in Multi-Agent Systems

引用

FUTURE INTERNET 2021年第5期13卷 134页

作者： Kenyeres, Martin Kenyeres, Jozef Slovak Acad Sci Inst Informat Dribravska Cesta 9 Bratislava 84507 Slovakia EBCONT Proconsult GmbH Millennium TowerHandelskai 94-96 A-1200 Vienna Austria

Determining the network size is a critical process in numerous areas (e.g., computer science, logistic, epidemiology, social networking services, mathematical modeling, demography, etc.). However, many modern real-world systems are so extensive that measuring their size poses a serious challenge. Therefore, the algorithms for determining/estimating this parameter in an effective manner have been gaining popularity over the past decades. In the paper, we analyze five frequently applied distributed consensus gossip-based algorithms for network size estimation in multi-agent systems (namely, the Randomized gossip algorithm, the Geographic gossip algorithm, the Broadcast gossip algorithm, the Push-Sum protocol, and the Push-Pull protocol). We examine the performance of the mentioned algorithms with bounded execution over random geometric graphs by applying two metrics: the number of sent messages required for consensus achievement and the estimation precision quantified as the median deviation from the real value of the network size. The experimental part consists of two scenarios-the consensus achievement is conditioned by either the values of the inner states or the network size estimates-and, in both scenarios, either the best-connected or the worst-connected agent is chosen as the leader. The goal of this paper is to identify whether all the examined algorithms are applicable to estimating the network size, which algorithm provides the best performance, how the leader selection can affect the performance of the algorithms, and how to most effectively configure the applied stopping criterion.

关键词： consensus algorithms count data aggregation distributed algorithms distributed computing gossip algorithms information fusion network size network size estimation sensor fusion

来源：评论

学校读者我要写书评

暂无评论

distributed Optimal Assignment Algorithm for Collective Foraging

Distributed Optimal Assignment Algorithm for Collective Fora...

引用

American Control Conference (ACC)

作者： Miyano, Tatsuya Romberg, Justin Egerstedt, Magnus Toyota Motor North Amer Inc 1555 Woodridge Ave Ann Arbor MI 48105 USA Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA Univ Calif Irvine Samueli Sch Engn Irvine CA 92697 USA

ISBN: (数字)9781665451963

ISBN: (纸本)9781665451963

We consider the problem of collectively transporting multiple objects by multiple agents. The objective is to find the optimal matching between the objects and agents that minimizes the energy of the overall system. We show that combining a proximal gradient method with continuous relaxation yields a distributed algorithm which converges to a near-optimal solution for the associated optimization problem. Furthermore, by using this solution as an initial solution, a distributed negative-cycle canceling algorithm, which monotonically decreases the matching cost at each step, provides the globally optimal solution for the problem. Numerical simulations demonstrate the performance on practical problems.

关键词： Gradient methods Costs Numerical simulation Optimal matching distributed algorithms Optimization

来源：评论

学校读者我要写书评

暂无评论

SRSSIS: Super-Resolution Screen Space Irradiance Sampling for Lightweight Collaborative Web3D Rendering Architecture 18th

SRSSIS: Super-Resolution Screen Space Irradiance Sampling fo...

引用

18th International Conference on Computer-Aided Design and Computer Graphics (CAD/Graphics)

作者： Long, Huzhiyuan Yang, Yufan Liu, Chang Jia, Jinyuan Tongji Univ 1239 Siping Rd Shanghai Peoples R China Nanchang Hangkong Univ 696 Fenghe South Ave Nanchang Jiangxi Peoples R China

ISBN: (纸本)9789819996650;9789819996667

traditional collaborative rendering architecture, the front-end computes direct lighting, which imposes certain performance requirements on the front-end devices. To further reduce the front-end load in complex 3D scenes, we propose a Super-resolution Screen Space Irradiance Sampling technique (SRSSIS), which is applied to our designed architecture, a lightweight collaborative rendering system built on Web3D. In our system, the back-end samples low-resolution screen-space irradiance, while the front-end implements our SRSSIS technique to reconstruct high-resolution and high-quality images. We also introduce frame interpolation in the architecture to further reduce the backend load and the transmission frequency. Moreover, we propose a self-adaptive sampling strategy to improve the robustness of super-resolution. Our experiments show that, under ideal conditions, our reconstruction performance is comparable to DLSS and FSR real-time super-resolution technology. The bandwidth consumption of our system ranges from 8% to 66% of pixel streaming at different super-resolution rates, while the back-end's computational cost is approximately 33% to 46% of pixel streaming at different super-resolution rates.

关键词： Collaborative rendering Web3D Super resolution distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed Algorithm Design for Resource Allocation Problems of Second-Order Multi-Agent Systems 41

Distributed Algorithm Design for Resource Allocation Problem...

引用

第41届中国控制会议

作者： Tao Chen Jin Luo Zhenhua Deng Xiaolon Zuo Xuepeng Zhou Yong-min Liu School of Automation Central South University College of Computer and Information Engineering Central South University of Forestry and Technology Research Center of Smart Forestry Cloud Central South University of Forestry and Technology

ISBN: (数字)9789887581536

ISBN: (纸本)9781665482561

In this paper,we investigate distributed resource allocation problems of second-order multi-agent systems,where the decisions of agents are subjected to inequality network resource *** contrast to well-known resource allocation problems,the second-order dynamics of agents and the coupling inequality constraints are considered in our problem at the same *** order to optimally allocate the network resource,a distributed algorithm is developed via state feedback and gradient ***,the convergence of the algorithm is analyzed with the help of convex analysis and Lyapunov stability *** the algorithm,the second-order agents globally asymptotically converge to the optimal ***,the effectiveness of our method is verified by the numerical example.

关键词： Resource allocation inequality constraints second-order multi-agent systems distributed algorithms cyberphysical systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：