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

IEEE Conference on Decision and Control

作者： Ashish Cherukuri Alireza Zolanvari Goran Banjac Ashish R. Hota Engineering and Technology Institute Groningen University of Groningen The Netherlands Automatic Control Laboratory ETH Zürich Switzerland Department of Electrical Engineering Indian Institute of Technology Kharagpur India

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

This paper focuses on solving a data-driven distributionally robust optimization problem over a network of agents. The agents aim to minimize the worst-case expected cost computed over a Wasserstein ambiguity set that is centered at the empirical distribution. The samples of the uncertainty are distributed across the agents. Our approach consists of reformulating the problem as a semi-infinite program and then designing a distributed algorithm that solves a generic semi-infinite problem that has the same information structure as the reformulated problem. In particular, the decision variables consist of both local ones that agents are free to optimize over and global ones where they need to agree on. Our distributed algorithm is an iterative procedure that combines the notions of distributed ADMM and the cutting-surface method. We show that the iterates converge asymptotically to a solution of the distributionally robust problem to any pre-specified accuracy. Simulations illustrate our results.

关键词： Uncertainty Costs Programming Approximation algorithms Iterative algorithms distributed algorithms Optimization

来源：评论

学校读者我要写书评

暂无评论

distributed Cooperative Control for DC Microgrids with Communication Time Delays Using Networked Predictive PI Scheme

Distributed Cooperative Control for DC Microgrids with Commu...

引用

On-Line Conference (ONCON), Industrial Electronics Society Annual

作者： Xiaoran Dai Guo-Ping Liu Wenshan Hu Zhongcheng Lei School of Electrical Engineering and Automation Wuhan University Wuhan China Center for Control Science and Technology Southern University of Science and Technology Shenzhen China

This paper is concerned with the communication time delay problem in the cyber-physical DC microgrid. A networked predictive PI control scheme is proposed to realize simultaneous voltage recovery and power sharing in the presence of time delays. The proposed method actively compensates for communication delays in a distributed manner. Owing to the proactive prediction, the microgrid can achieve a good performance with delays in the cyber layer. The effectiveness of the proposed scheme is validated via detailed simulations.

关键词： Industrial electronics Delay effects System performance Microgrids Delays Voltage control distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

A Learning-based distributed Algorithm for Personalized Aggregative Optimization

A Learning-based Distributed Algorithm for Personalized Aggr...

引用

IEEE Conference on Decision and Control

作者： Guido Carnevale Giuseppe Notarstefano Department of Electrical Electronic and Information Engineering Alma Mater Studiorum - Universita‘ di Bologna Bologna Italy

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

This paper addresses distributed aggregative optimization, i.e., a recently emerged framework in which agents in a network want to minimize the sum of local objective functions depending both on a local decision variable and on an aggregated version of all the variables (e.g., the mean). We consider a "personalized" set-up in which each local function is given by the sum of a known term and an unknown one capturing the user’s dissatisfaction. We propose a novel data-driven distributed algorithm taking advantage of users’ noisy feedback to learn the parameters of the unknown function concurrently with the optimization steps. We prove an upper bound for the dynamic regret related to (i) the initial conditions, (ii) the temporal variations of the objective functions, and (iii) the learning errors. Moreover, by considering the average dynamic regret, we prove that both initial conditions and learning errors do not affect the asymptotic performance of the algorithm. Finally, a numerical simulation in the context of opinion dynamics validates our findings.

关键词： Upper bound Costs Heuristic algorithms Linear programming Numerical simulation Noise measurement distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

distributed submodular maximization: trading performance for privacy

Distributed submodular maximization: trading performance for...

引用

IEEE Conference on Decision and Control

作者： Navid Rezazadeh Solmaz S. Kia Mechanical and Aerospace Eng. Dept. University of California Irvine Irvine USA

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

This paper considers a multi-agent submodular set function maximization problem subject to partition matroid in which the utility is shared, but the agents’ policy choices are constrained locally. The paper’s main contribution is a distributed algorithm that enables each agent to find a suboptimal policy locally with a guaranteed level of privacy. The submodular set function maximization problems are NP-hard. For agents communicating over a connected graph, this paper proposes a polynomial-time distributed algorithm to obtain a guaranteed near optimal solution. The proposed algorithm is based on a distributed randomized gradient ascent scheme on the multilinear extension of the submodular set function in the continuous domain. Our next contribution is the design of a distributed rounding algorithm that does not need any inter-agent communication. We base our algorithm’s privacy preservation characteristic on our proposed stochastic rounding method and tie the level of privacy to the variable γ ∈ [0, 1]. That is, the policy choice of an agent can be determined with the probability of at most γ. We show that our distributed algorithm results in a strategy set that when the team’s objective function is evaluated in the worst case, the objective function value is in 1 − (1/e) h(γ) − O(1/T ) of the optimal solution, highlighting the interplay between level of optimality gap and guaranteed level of privacy where T is the number of communication rounds between the agents.

关键词： Privacy Linear programming Partitioning algorithms distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

A Formally Verified Leader Election Algorithm for Autonomous Driving Systems

A Formally Verified Leader Election Algorithm for Autonomous...

引用

IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

作者： Ryuta Kambe Benjamin Gilby Yuuki Takano TIER IV Inc. Tokyo Japan

ISBN: (数字)9798350387957

ISBN: (纸本)9798350387964

As autonomous driving systems mature, the importance of fault tolerance to provide safe operation even in hazardous conditions becomes a key issue in deployment. In an autonomous driving system composed of redundant devices, it is necessary to maintain consistency across the system regarding which devices should currently be handling processing. In this paper, we present a new leader election algorithm for autonomous driving systems that guarantees consistency in the presence of the failure of any single system component. To make the algorithm practical for autonomous driving systems, we design it to both handle network link failures and guarantee liveness in the presence of a single failure. Due to the safety-critical nature of our environment and the known difficulty of testing distributed algorithms, we use formal verification to validate our proposed algorithm. Our experiments show that the algorithm completes with reasonable time in a simulated environment of an autonomous driving system.

关键词： Fault tolerance Voting Fault tolerant systems Real-time systems distributed algorithms Autonomous vehicles Formal verification Testing

来源：评论

学校读者我要写书评

暂无评论

Asynchronous Separation of Unconscious Colored Robots

Asynchronous Separation of Unconscious Colored Robots

引用

International Symposium on Computing and Networking Workshops (CANDARW)

作者： Paola Flocchini Debasish Pattanayak Francesco Piselli Nicola Santoro Yukiko Yamauchi School of Electrical Engineering and Computer Science University of Ottawa Ottawa Canada School of Computer Science Carleton University Ottawa Canada Department of Mathematics and Computer Science University of Perugia Perugia Italy Faculty of ISEE Kyushu University Fukuoka Japan

ISBN: (数字)9798331505349

ISBN: (纸本)9798331505356

We consider the recently introduced model of autonomous computational mobile entities called unconscious colored robots. The entities are the traditional oblivious silent mobile robots operating in the Euclidean plane in Look-Compute-Move cycles. However, each robot has a permanent external mark (or color) from a finite set, visible by the other robots, but not by the robot itself. The basic problem for these robots is separation, requiring all the robots with the same color to separate from the other robots, each group forming a recognizable geometric shape (e.g., circle, point, line); this task must be performed in finite time, in spite of the robots being unconscious of their own color, unable to communicate, and oblivious. This problem has been studied and solved in the synchronous setting (SSS 2023). In this paper we show that the problem is solvable also under the more difficult asynchronous adversary, provided the robots agree on the orientation of one axis, and no robot is uniquely colored. The proof is constructive: we present a distributed algorithm that allows unconscious colored robots with one-axis agreement to separate into parallel lines under the asynchronous scheduler.

关键词： Shape Robot kinematics Computational modeling Conferences Color Mobile robots distributed algorithms Robots

来源：评论

学校读者我要写书评

暂无评论

Implementing the Abstract MAC Layer via Inductive Coloring Under the Rayleigh-Fading Model

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2021年第9期20卷 6167-6178页

作者： Yu, Dongxiao Zou, Yifei Wang, Yuexuan Yu, Jiguo Cheng, Xiuzhen Lau, Francis C. M. Shandong Univ Sch Comp Sci & Technol Inst Intelligent Comp Qingdao 266237 Peoples R China Zhejiang Univ Coll Comp Sci & Technol Hangzhou 310027 Peoples R China Qilu Univ Technol Sch Comp Sci & Technol Shandong Acad Sci Jinan 250014 Peoples R China Natl Supercomp Ctr Jinan Shandong Comp Sci Ctr Jinan 250014 Peoples R China Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China

In this paper, we study distributed algorithms to realize efficient communications under the Rayleigh-fading model. This model extends the popular deterministic SINR model using stochastic propagations to address the fading effects observed in reality. Stochastic propagations can greatly increase the difficulty of handling interference and collisions, especially in a local context without much global knowledge. We present a new technique called Inductive Coloring that can be used to schedule fast transmissions with Rayleigh-fading interference. The computation of inductive coloring takes only O(log(2) n) time with the proposed distributed algorithm, where n is the number of nodes in the network. We illustrate the power of inductive coloring by giving a distributed and randomized algorithm to implement the abstract MAC (absMAC) layer, which was first proposed by Kuhn et al.. With two basic time-guaranteed communication primitives, namely acknowledgement and progress, which correspond to the operations of node local broadcasts and message receptions from others, the absMAC layer decomposes the algorithm design and analysis in networks into two independent components, i.e., implementing the absMAC layer over a physical network and designing algorithms with the help of the two primitives in the absMAC layer. Thus, it sharply reduces the fussy and complicated process of algorithm design and analysis over the physical network. Our proposed algorithm implements the absMAC layer under the Rayleigh-fading model with no more than a logarithmic factor inferior to the optimal solution in terms of time complexity. The presented simulation results indicate that our algorithm performs well in realistic environments. Furthermore, we show that by making full use of our proposed absMAC layer algorithm, many network primitives such as Neighbor Discovery, Single/Multiple-Message Broadcast, and Consensus, can be efficiently implemented.

关键词： Multi-hop wireless networks distributed algorithms abstract MAC layer Rayleigh-fading model

来源：评论

学校读者我要写书评

暂无评论

Generalized Nash equilibrium problems under partial-decision information with biased agents

Generalized Nash equilibrium problems under partial-decision...

引用

IEEE Conference on Decision and Control

作者： Barbara Franci Filippo Fabiani Lorenzo Zino Department of Advanced Computing Sciences Maastricht University Maastricht Netherlands IMT School for Advanced Studies Lucca Lucca Italy Department of Electronics and Telecommunications Politecnico di Torino Turin Italy

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

We consider generalized Nash equilibrium (GNE) problems under a partial-decision information regime, in which each agent typically reconstructs the opponents’ strategies through a linear averaging dynamics. In contrast, we consider a state-dependent, nonlinear susceptibility term within the communication mechanism, thereby modelling possible biases on the part of agents in processing information. By including such a term in a relaxed forward-backward iteration scheme, we design a distributed algorithm possessing convergence guarantees to a GNE. Simulation results illustrate how the susceptibility term affects the GNE computation.

关键词： Simulation Computational modeling Nash equilibrium Iterative algorithms Numerical models Nonlinear dynamical systems distributed algorithms Testing Convergence

来源：评论

学校读者我要写书评

暂无评论

A Lightweight Leader Election Algorithm for IoT: Cloud Storage Use Case 23

A Lightweight Leader Election Algorithm for IoT: Cloud Stora...

引用

Proceedings of the 7th International Conference on Future Networks and distributed Systems

作者： Ahcene Bounceur Information and Computer Science Departmenet King Fahd University of Petroleum and Minerals Saudi Arabia

ISBN: (纸本)9798400709036

In a distributed environment where IoT devices collaborate on shared data, ensuring a secure turn-taking process during data updates remains crucial. Unlike in centralized systems, the concept of mutexes is no longer applicable in distributed systems. This is where distributed locks and leader election mechanisms become essential. The BROGO (Branch Optima to Global Optimum) Leader Election Algorithm, known for its low power consumption, presents a compelling solution tailored for IoT systems. Notably, this algorithm achieves a remarkable 95% reduction in energy consumption compared to conventional techniques. In the context of this paper, we use the BROGO algorithm as a case study within the realm of cloud storage.

关键词： Cloud computing distributed algorithms IoT Leader Election spanning tree

来源：评论

学校读者我要写书评

暂无评论

A nearly optimal distributed algorithm for computing the weighted girth

引用

Science China(Information Sciences) 2021年第11期64卷 80-94页

作者： Qiang-Sheng HUA Lixiang QIAN Dongxiao YU Xuanhua SHI Hai JIN National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and Technology School of Computer Science and Technology Shandong University

Computing the weighted girth, which is the sum of weights of edges in the minimum weight cycle,is an important problem in network analysis. The problem for distributively computing girth in unweighted graphs has garnered lots of attention, but there are few studies in weighted graphs. In this paper, we propose a distributed randomized algorithm for computing the weighted girth in weighted graphs with integral edge weights in the range [1, nc], where n is the number of vertices and c is a constant. The algorithm is devised under the standard synchronous CON GE S T model, which limits each vertex can only transfer O（log n） bits information along each incident edge in a round. The upper bound of the algorithm is O（n log2n） rounds. We also prove the lower bound for computing the weighted girth is ?（D + n/log n） where D is the hop diameter of the weighted graph. This means our distributed algorithm is optimal within a factor of O（log3n）.

关键词： distributed algorithms weighted girth \({\cal C}{\cal O}{\cal N}{\cal G}{\cal E}{\cal S}{\cal T}\) model communication complexity round complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：