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

40th Chinese Control Conference (CCC)

作者： Qiu, Huaxin Wang, Xiaochu Zhou, Qingrui Sun, Changhao China Acad Space Technol Qian Xuesen Lab Space Technol Beijing 100094 Peoples R China

ISBN: (纸本)9789881563804

This paper introduces a loose motion control algorithm for multi-agent systems whose interaction is described by a connected undirected graph. The proposed algorithm guarantees agents to achieve a loose formation motion. Each agent is driven by a nonlinear piecewise function of the coordination errors, to save agents from unnecessarily overcontrolling and, hence, it can reduce the energy cost in the case where input uncertainties exist. Both theoretical analyses on stability and simulations are given to demonstrate the effectiveness of the algorithm.

关键词： distributed algorithm consensus control loose formation input uncertainties

来源：评论

学校读者我要写书评

暂无评论

Communication-efficient hierarchical distributed optimization for multi-agent policy evaluation

引用

JOURNAL OF COMPUTATIONAL SCIENCE 2021年 49卷 101280-101280页

作者： Ren, Jineng Haupt, Jarvis Guo, Zehua Univ Minnesota Dept Elect & Comp Engn Minneapolis MN 55455 USA Beijing Inst Technol Beijing 100081 Peoples R China

Policy evaluation problems in multi-agent reinforcement learning (MARL) have attracted growing interest recently. In this setting, agents collaborate to learn the value of a given policy with private local rewards and jointly observed state-action pairs. However, existing fully decentralized algorithms treat each agent equally, without considering the communication structure of the agents over a given network, and the corresponding effects on communication and computation efficiency. In this paper, we propose a hierarchical distributed algorithm that differentiates the roles of each of the agents during the evaluation process. This method allows us to freely choose various mixing schemes (and corresponding mixing matrices that are not necessarily symmetric or doubly stochastic), in order to reduce the communication and computation cost, while still maintaining convergence at rates as fast as or even faster than the previous distributed algorithms. Theoretically, we show the proposed method, which contains existing distributed methods as a special case, achieves the same order of convergence rate as state-of-the-art methods. Extensive numerical experiments on real datasets verify that the performance of our approach indeed improves - sometimes significantly - over other advanced algorithms in terms of convergence and total communication efficiency.

关键词： Communication efficiency Hierarchical distributed algorithm Optimization algorithm Multi-agent policy evaluation

来源：评论

学校读者我要写书评

暂无评论

Bi-layer optimal secondary frequency control approach for energy storage clusters considering wind power uncertainty

引用

FRONTIERS IN ENERGY RESEARCH 2022年 10卷

作者： Wang, Zizhao Wu, Feng Li, Yang Huang, Weidong Shi, Linjun Hohai Univ Coll Energy & Elect Engn Nanjing Peoples R China

Increasing penetration of wind power with intermittency and variability threatens the stability of the power system frequency. The fast response capability of the energy storage system (ESS) makes it an effective measure to improve frequency regulation performance. However, designing an optimal control for numerous energy storage units (ESUs) with different power and energy characteristics is challenging. To solve the dilemma that the distributed control methods cannot achieve optimality over time horizons while the centralized optimization methods would cause high computational burdens, a bi-layer optimal control approach is proposed in this study. In the upper layer, a multi-area secondary frequency control (SFC) problem is established to determine control policies for ESS clusters under continuous wind power fluctuations and is solved by the Ito theory-based stochastic optimization (ITB-SO) method with high computational efficiency in a rolling-horizon manner. In the lower layer, the power output of ESUs is dispatched and coordinated using the distributed algorithm (DA) method via communication networks, considering different characteristics and the current state-of-charge (SoC) levels. Simulation studies carried out in a dual-region test system evidence the improvement of system frequency stability by compensating for rapid wind power fluctuations immediately via ESSs. The results show that the proposed ITB-SO method without scenario generation is suitable for real-time SFC for the ESS. The effectiveness of the DA method and its robustness in encountering loss of communication links are also verified.

关键词： energy storage frequency regulation wind power uncertainty stochastic optimization Ito theory distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Energy Management Without Iteration-A Regional Dispatch Event-Triggered algorithm for Energy Internet

引用

FRONTIERS IN ENERGY RESEARCH 2022年 10卷

作者： Tan, Jiaming Liaoning Tech Univ Fac Elect & Control Engn Huludao Peoples R China

Centralized algorithms and distributed algorithms have gained great attention on the energy Internet nowadays. The centralized algorithm presses too much communication and numeration load to its control center in large-scale and neterogeny EI. The distributed algorithm requests too many times of iteration, and the performance and convergence speed is quite slow. The current literature presents a regional dispatch event-triggered algorithm (RDETA). Energy management in RDETA can transform between a centralized model and distributed model. With the effort, the energy management does notrequire iteration times in quantity. And due to event-triggered asynchronous communication, energy management not only relieson a global synchronous clock but also decreasecommunication frequency in most cases and increasecommunication frequency in exigency. In addition, RDETA adopts regional communication and regional energy dispatch, which can automatically modulate the scale of dispatch area by the degree of the energy problem. Finally, simulation results and theoretical demonstration show the aforementioned contributions of the proposed algorithm.

关键词： asynchronous communication centralized algorithm distributed algorithm energy internet energy management multi-agent system renewable energy source zone control

来源：评论

学校读者我要写书评

暂无评论

distributed optimal control allocation for 6-dof spacecraft with redundant thrusters

引用

AEROSPACE SCIENCE AND TECHNOLOGY 2021年 118卷 106971-106971页

作者： Lang, Xiaoyu de Ruiter, Anton Ryerson Univ Toronto ON M5B 2K3 Canada

Control allocation for 6-dof spacecraft maneuvers is considered. Retired spacecraft, whose own control system is inoperable, can be reused by installing multiple cellular thruster modules to provide thrusts for translational and rotational control. Such cellular thruster modules collaborate with their neighbors in a network topology to calculate an optimal distribution matrix for thrust allocation. A pseudo inverse optimal thrust allocation scheme is extended to a distributed iteration algorithm to enable this optimal problem to be solved by cellular thruster modules in a distributed manner. Subsequently, a norm-based distributed pseudo-inverse optimal thrust allocation scheme is developed to solve the same optimal thrust allocation problem. The syntheses of two distributed optimal thrust allocation schemes are discussed. Numerical simulations are demonstrated in the end to show the effectiveness of two proposed distributed thrust allocation schemes. Performance comparisons between two schemes are analyzed as well. (C) 2021 Elsevier Masson SAS. All rights reserved.

关键词： Control allocation 6-dof spacecraft control distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Game-theoretic analysis of market-based operation mechanism for demand response resources

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2022年 134卷 107456-107456页

作者： Wang, Xian Yang, Jiaying Zhang, Kai Zhang, Shaohua Wu, Lei Shanghai Univ Sch Mech Engn & Automat Shanghai 200444 Peoples R China Stevens Inst Technol Dept Elect & Comp Engn Hoboken NJ 07030 USA

While it is well recognized that demand response (DR) can improve efficiency of the wholesale electricity market, many challenges remain to be addressed regarding DR resources' market-based operation mechanisms and specifically, how to encourage DR resources to participate in the wholesale electricity market. This paper presents a market-based operation mechanism for DR resources to participate in a day-ahead wholesale electricity market. A specific DR exchange (DRX) market is built for a demand response aggregator (DRA) to trade DR resources with DR providers, and the DRA can bid strategically and compete with other participants in the wholesale electricity market. In order to encourage the DRA to participate in the wholesale market, an incentive compensation method is also introduced, in which the DRA can receive payment from retailers because retailers earn extra profits from the DRA's participation in the wholesale market. To examine the effectiveness of the mechanism, a game-theoretic model for the interaction among participants in the wholesale electricity market and the DRX market is proposed. In this model, the supply function bid form is employed by both the DRA and generators in the wholesale market, and also by the DR providers in the DRX market. The existence and uniqueness of the Nash equilibrium is demonstrated analytically. In addition, in order to tackle the information asymmetry in practical application, a distributed algorithm is developed to obtain the equilibrium outcomes. Finally, the effectiveness of the proposed model and algorithms is validated by numerical examples. It is also shown that in the proposed market-based operation mechanism, the DRA has an incentive to voluntarily participate in the competition of the wholesale electricity market.

关键词： Demand response aggregator Wholesale electricity market Demand response exchange market Game-theoretic analysis Equilibrium model distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed Inference Acceleration with Adaptive DNN Partitioning and Offloading 38

Distributed Inference Acceleration with Adaptive DNN Partiti...

引用

39th IEEE International Conference on Computer Communications (IEEE INFOCOM)

作者： Mohammed, Thaha Joe-Wong, Carlee Babbar, Rohit Di Francesco, Mario Aalto Univ Dept Comp Sci Espoo Finland Carnegie Mellon Univ Elect & Comp Engn Pittsburgh PA 15213 USA

ISBN: (纸本)9781728164120

Deep neural networks (DNN) are the de-facto solution behind many intelligent applications of today, ranging from machine translation to autonomous driving. DNNs are accurate but resource-intensive, especially for embedded devices such as mobile phones and smart objects in the Internet of Things. To overcome the related resource constraints, DNN inference is generally offloaded to the edge or to the cloud. This is accomplished by partitioning the DNN and distributing computations at the two different ends. However, most of existing solutions simply split the DNN into two parts, one running locally or at the edge, and the other one in the cloud. In contrast, this article proposes a technique to divide a DNN in multiple partitions that can be processed locally by end devices or offloaded to one or multiple powerful nodes, such as in fog networks. The proposed scheme includes both an adaptive DNN partitioning scheme and a distributed algorithm to offload computations based on a matching game approach. Results obtained by using a self-driving car dataset and several DNN benchmarks show that the proposed solution significantly reduces the total latency for DNN inference compared to other distributed approaches and is 2.6 to 4.2 times faster than the state of the art.

关键词： DNN inference task partitioning task offloading distributed algorithm matching game

来源：评论

学校读者我要写书评

暂无评论

Skin-Health Monitoring system using a Wireless Body Area Network 18

Skin-Health Monitoring system using a Wireless Body Area Net...

引用

IEEE 18th Annual Consumer Communications and Networking Conference (CCNC)

作者： Kumar, Suman Siddiqui, Kazi Amanul Islam Kumar, Mukesh Troy Univ Dept Comp Sci Troy AL 36082 USA

ISBN: (纸本)9781728197944

A new class of sensing paradigm known as lab-on-skin where stretchable and flexible smart sensor devices are integrated into the skin, provides direct monitoring and diagnostic interfaces to the body. distributed lab-on-skin wireless sensors have the ability to provide continuous long term assessment of the skin health. This paper proposes a distributed skin health monitoring system using a wireless body area network. The system is responsive to the dynamic changes in the skin health, and remotely reports on the same. The proposed algorithm detects the abnormal skin and creates an energy efficient data aggregation tree covering the affected area while putting the unnecessary sensors to sleep mode. The algorithm responds to the changing conditions of the skin by dynamically adapting the size and shape of the monitoring trees to that of the abnormal skin areas thus providing a comprehensive monitoring. Simulation results demonstrate the application and utility of the proposed algorithm for changing wound shapes and sizes.

关键词： distributed algorithm Skin Monitoring Body Area Network Sensor Network Health Monitoring Lab-On-Skin

来源：评论

学校读者我要写书评

暂无评论

Translation based Self Reconfiguration algorithm for 6-lattice Modular Robots 20

Translation based Self Reconfiguration Algorithm for 6-latti...

引用

20th International Symposium on Parallel and distributed Computing (ISPDC)

作者： Buchi, Baptiste Mabed, Hakim Lassabe, Frederic Gaber, Jaafar Abdou, Wahabou Univ Bourgogne Franche Comte UTBM FEMTO ST UMR 6174 CNRS F-90010 Belfort France Univ Bourgogne Franche Comte FEMTO ST UMR 6174 CNRS UFC F-25200 Montbeliard France Univ Bourgogne Franche Comte ESIREM F-21000 Besancon France

ISBN: (纸本)9781665432818

Modular robot network architectures are experiencing growing popularity. The problem of automatically reconfiguring a set of modular robots into a given target shape presents a real challenge to distributed computing. Many works on the subject restrict the nature of the constructed target forms. The bolder approaches focus on reducing the number of overall required movements. In this work, we propose a distributed asynchronous self-reconfiguration algorithm allowing to distribute the effort made by each robot to reach the final shape. This makes it possible to extend the life of the network of micro-robots. We compare our TBSR algorithm with C2SR self-reconfiguration algorithm using VisibleSim simulator. The obtained results show that globally TBSR outperforms C2SR except for rare cases. The TBSR algorithm allows reducing the number of required moves up to 17%. Besides, the ability of TBSR to balance the number of moves over the modular robots makes that the maximum number of moves per robot is reduced up to 40%.

关键词： Self-reconfiguration modular robots system distributed algorithm programmable matter energy aware reconfiguration

来源：评论

学校读者我要写书评

暂无评论

distributed Core Decomposition in Probabilistic Graphs

引用

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH 2021年第5期38卷 2140008-2140008页

作者： Luo, Qi Yu, Dongxiao Li, Feng Cheng, Xiuzheng Cai, Zhipeng Yu, Jiguo Shandong Univ Sch Comp Sci & Technol 72 Binhai Rd Qingdao 266237 Peoples R China Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA Qilu Univ Technol Sch Comp Sci & Technol Jinan Peoples R China

This paper initializes distributed algorithm studies for core decomposition in probabilistic graphs. Core decomposition has been proven to be a useful primitive for a wide range of graph analyses, but it has rarely been studied in probabilistic graphs, especially in a distributed environment. In this work, under a distributed model underlying Pregel and live distributed systems, we present the first known distributed solutions for core decomposition in probabilistic graphs, where there is an existence probability for each edge. In the scenario that the existence probability of edges are known to nodes, the proposed algorithm can get the exact coreness of nodes with a high probability guarantee. The proposed algorithm can also be used to efficiently update the coreness of nodes in dynamic graphs, where a set of edges are inserted/deleted into/from the graph. In the harsher case that the existence probability is unknown, we present a novel method to estimate the existence probability of edges, based on which the coreness of nodes with small approximation ratio guarantee can be computed. Extensive experiments are conducted on different types of real-world graphs and synthetic graphs. The results illustrate that the proposed algorithms exhibit good efficiency, stability and scalability.

关键词： Probabilistic graph core decomposition distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：