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

Event-Based Hybrid Bi-Level Energy Management and Control Framework of Networked Microgrid

IEEE TRANSACTIONS ON SMART GRID 2025年第2期16卷 1351-1365页

作者： Wu, Tao Wang, Jianhui Zhao, Tianqiao Zhou, Anping Chowdhury, Badrul Cox, Robert Southern Methodist Univ Dept Elect & Comp Engn Dallas TX 75275 USA Brookhaven Natl Lab Dept Elect Engn Upton NY 11973 USA Univ North Carolina Charlotte Dept Elect & Comp Engn Charlotte NC 28223 USA

Networked microgrids (NMGs) are favorable for enhancing the operating efficiency under normal operations and maintaining energy supply to critical facilities during abnormal conditions in the face of severe outages. This paper proposes an event-based hybrid bi-level energy management and control framework for NMGs. We first propose a hybrid bi-level energy management and control system, incorporating the energy management of NMGs at the upper-level and the control of distributed energy resources (DERs) at the lower-level. The upper-level aims to offer economic and resilient solutions by considering diverse operating conditions (e.g., normal and emergency). The lower-level DER control is proposed to ensure intra-hour operation in a fully distributed manner. An event-triggered module incorporating several predefined events is designed to switch the control model (i.e., operation targets and constraints) of the upper-level for different operation conditions and to reschedule DERs and breaker of NMGs. A consensus-based fully distributed control method for the lower-level is then developed considering the three-phase real power balance. Numerical simulations on the IEEE 123-bus system and a 900-bus utility-owned feeder are conducted to verify the effectiveness of the proposed framework.

关键词： Microgrids Energy management Event detection Decentralized control Switches Resilience distributed algorithms Couplings Costs Vectors Networked microgrids distributed energy resources event trigger distributed control

来源：评论

学校读者我要写书评

暂无评论

Fractional Bamboo Trimming and distributed Windows Scheduling 49th

Fractional Bamboo Trimming and Distributed Windows Schedulin...

引用

49th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM)

作者： Beikmohammadi, Arash Evans, William Tabatabaee, Seyed Ali Simon Fraser Univ Dept Comp Sci Burnaby BC Canada Univ British Columbia Dept Comp Sci Vancouver BC Canada

ISBN: (纸本)9783031521126;9783031521133

This paper studies two related scheduling problems: fractional bamboo trimming and distributed windows scheduling. In the fractional bamboo trimming problem, we are given n bamboos with different growth rates and cut fractions. At the end of each day, we can cut a fraction of one bamboo. The goal is to design a perpetual schedule of cuts to minimize the height of the tallest bamboo ever. For this problem, we present a 2-approximation algorithm. In addition, we prove upper bounds on the approximation factors of well-known algorithms Reduce-Max and Reduce-Fastest(x) for this problem. In the closely related windows scheduling problem, given a multiset of positive integers W = {w(1),..., w(n)}, we want to schedule n pages on broadcasting channels such that the time interval between any two consecutive appearances of the i-th page (1 <= i <= n) is at most w(i). The goal of this problem is to minimize the number of channels. We provide an algorithm for the windows scheduling problem that uses at most inverted right perpendicular d(W)+1/0.75 inverted left perpendicular channels, where d(W) = Sigma(n)(i=1) 1/w(i). When d(W) <= 46, our algorithm guarantees a smaller upper bound on the number of channels than the best-known algorithm in the literature. We also describe the first approximation algorithm for the windows scheduling problem in a distributed setting, where input data is partitioned among a set of m machines. Furthermore, we introduce patterns of some multisets with d(W) <= 1 for which windows scheduling on one channel (i.e., pinwheel scheduling) is impossible.

关键词： Scheduling problems Bamboo trimming Windows scheduling distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Lenzen's distributed Routing Generalized: A Full Characterization of Constant-Time Routability 2024

Lenzen's Distributed Routing Generalized: A Full Characteriz...

引用

56th Annual ACM Symposium on Theory of Computing (STOC)

作者： Ghaffari, Mohsen Wang, Brandon MIT Cambridge MA 02139 USA

ISBN: (纸本)9798400703836

A celebrated and widely used result of Lenzen and Wattenhofer [STOC'11, PODC'13] shows a constant-round (deterministic) distributed routing algorithm for the complete-graph network: if each node is the source or destination of at most Theta(n) packets, there is a constant-round deterministic distributed algorithm that routes all packets to their destinations in a constant number of rounds, on the complete-graph network. We study generalizations of this result to arbitrary network graphs and show a necessary and sufficient condition for the network so that it can route any such demand in constant rounds distributedly. One can easily see that just for the existence of a constant-round routing for all such demands, it is necessary that any cut's size, when normalized by the number of possible edges in that cut, should be lower bounded by a positive constant. That is, for any partition of nodes with exactly k is an element of [1,n/2] nodes on one side, the cut should have at least Theta(kn) edges. We call this a graph with a positive minimum normalized cut, or a positive graph for short. We show that this necessary condition is also sufficient. In particular, by tightening the Leighton-Rao multicommodity max-flow min-cut theorem for positive graphs, we show the existence of a constant-round routing in positive graphs (assuming the network graph is known globally). Then, as the main technical contribution of this paper, we also show that there is a (deterministic) distributed algorithm that computes such a constant-round routing in constant rounds in these graphs. This result allows us to vastly relax the conditions of the well-studied congested clique model of distributed computing: Any distributed algorithm for the congested clique model can be run in any positive graph network, without any asymptotic slow-down. Our results are in fact more general and they give a distributed routing bound for any network, as a function of its minimum normalized cut size (and without a

关键词： distributed algorithms routing congested clique

来源：评论

学校读者我要写书评

暂无评论

The min-move mutual visibility problem for disoriented asynchronous robots

引用

THEORETICAL COMPUTER SCIENCE 2025年 1035卷

作者： Bhagat, Subhash Mukhopadhyaya, Krishnendu Ray, Rajarshi Indian Inst Technol Jodhpur Dept Math Jheepasani India Indian Stat Inst Adv Comp & Microelect Unit Kolkata India Indian Assoc Cultivat Sci Sch Math & Computat Sci Kolkata India

We consider a distributed system of n >= 3 autonomous robots in the Euclidean plane under the obstructed visibility model. In the obstructed visibility model, robots are considered opaque, and if three robots lie on a straight line, the mid- dle robot blocks the vision of the two other robots. The mutual visibility problem requires the robots to coordinate their movements in such a way that all the robots in the system become mutually visible. This paper studies a constrained version of the mutual visibility problem, namely the min-move mutual visibility problem. The min-move mutual visibility problem asks to solve the mutual visibility problem by moving each robot at most once. One of the major implications of this constrained version of the mutual visibility problem is that it also addresses the issue of energy efficiency for the robots. We study the min-move mutual visibility problem for disoriented robots (i.e., robots not having any form of local axis agreement or common chirality). We study the problem under two of the strongest adversarial models, namely asynchronous scheduler and non- rigid movements. We first show that the min-move mutual visibility problem is not solvable for disoriented asynchronous robots with non-rigid movements in the absence of externally visible lights. Then, we analyze different characteristics of a min-move mutual visibility algorithm for disoriented robots with non-rigid movements. We use these properties to present a distributed algorithm that solves the problem for disoriented asynchronous robots with non-rigid movements and having externally visible lights (FALL light model). The algorithm uses only 7 colors for the lights. The proposed algorithm is collision-free and runs in O(n) epochs.

关键词： distributed algorithms Swarm of robots Mutual visibility Asynchronous Disoriented robots Non-rigid movement Persistent lights

来源：评论

学校读者我要写书评

暂无评论

distributed Continuous-Time algorithms for Optimal Resource Allocation With Time-Varying Quadratic Cost Functions

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2020年第4期7卷 1974-1984页

作者： Wang, Bo Sun, Shan Ren, Wei Beijing Inst Technol Sch Automat Beijing 100081 Peoples R China Univ Calif Riverside Dept Elect & Comp Engn Riverside CA 92521 USA

In this article, we propose distributed continuous-time algorithms to solve the optimal resource allocation problem with certain time-varying quadratic cost functions for multiagent systems. The objective is to allocate a quantity of resources while optimizing the sum of all the local time-varying cost functions. Here, the optimal solutions are trajectories rather than some fixed points. We consider a large number of agents that are connected through a network, and our algorithms can be implemented using only local information. By making use of the prediction-correction method and the nonsmooth consensus idea, we first design two distributed algorithms to deal with the case when the time-varying cost functions have identical Hessians. We further propose an estimator-based algorithm which uses distributed average tracking theory to estimate certain global information. With the help of the estimated global information, the case of nonidentical constant Hessians is addressed. In each case, it is proved that the solutions of the proposed dynamical systems with certain initial conditions asymptotically converge to the optimal trajectories. We illustrate the effectiveness of the proposed distributed continuous-time optimal resource allocation algorithms through simulations.

关键词： Cost function Resource management Heuristic algorithms Prediction algorithms Time-varying systems Trajectory distributed algorithms optimization resource allocation time-varying cost functions

来源：评论

学校读者我要写书评

暂无评论

A hybrid energy storage array group control strategy for wind power smoothing

引用

IET CONTROL THEORY AND APPLICATIONS 2024年第17期18卷 2267-2276页

作者： Tong, Tong Wei, Le Chen, Yuanye Fang, Fang North China Elect Power Univ Sch Control & Comp Engn Beijing Peoples R China

With the increase of wind power generation, the safety and economy of power system operations are greatly influenced by the intermittency and fluctuation of wind power. To take the advantage of the complementary characteristics between different energy storage devices, a Hybrid Energy Storage System (HESS) consisting of Battery Energy Storage System (BESS) and Flywheel Energy Storage System (FESS) can alleviate the uncertainty of wind power. This article has proposed a coordinated control strategy through group consensus algorithm based on Model Predictive Control (MPC) for Hybrid Energy Storage Array (HESA) to smooth wind power fluctuations. To allocate power commands to the FESS and BESS, the fluctuation of wind power output is extracted with different frequency domain characteristics as instructions by Empirical Mode Decomposition (EMD) technology. Moreover, a group consensus algorithm based on MPC is proposed to complete the adaptive power allocation of energy storage units. Eventually, the actual wind farm data is used for the simulation to verify the effect of control strategy proposed in this paper. It can be seen that the developed group consensus algorithm based on MPC can cope with different frequency power commands, avoid overcharging and discharging of energy storage media, and smooth wind power effectively. This article has proposed a coordinated control strategy through group consensus algorithm based on model predictive control for hybrid energy storage array to smooth wind power *** simulation shows that the developed algorithm can cope with different frequency power commands, avoid overcharging and discharging of energy storage media, and smooth wind power effectively. image

关键词： adaptive control distributed algorithms multi-agent systems smoothing methods wind power

来源：评论

学校读者我要写书评

暂无评论

A Collaborative Adaptive Cybersecurity Algorithm for Cognitive Cities

引用

JOURNAL OF COMPUTER INFORMATION SYSTEMS 2025年

作者： Abonamah, Abdullah Sibai, Fadi N. George Washington Univ Washington DC USA Gulf Univ Sci & Technol Mubarak Al Abdullah Kuwait

We propose a Collaborative Cybersecurity Algorithm with distributed Success Scores (CCAwDSS) as an adaptive cybersecurity defense system within cognitive city systems. In this system, nodes have responsibilities to detect and neutralize threats using AI-based adaptive cybersecurity algorithms. They are aware of the other nodes performance in dealing with cyber threats and can utilize other nodes' successful algorithms and defense controls in a sharing arrangement. The collaboration is achieved by requiring that each active node in the defense system to share its neutralization algorithms and defense responses and broadcasts its "success score" immediately after detecting and neutralizing a threat to the other nodes. This continuous broadcasting mechanism would ensure that each node is continuously updated on the performance capability of its peers in real time.

关键词： Cyber-security distributed algorithms IoT smart cities fog computing edge computing

来源：评论

学校读者我要写书评

暂无评论

The Structure of Hypergraphs Arising in Cellular Mobile Communication Systems

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2025年第1期24卷 150-164页

作者： Ganesan, Ashwin Atlas SkillTech Univ Mumbai 400070 Maharashtra India

An assumption that researchers have often used to model interference in a wireless network is the unit disk graph model. While many theoretical results and performance guarantees have been obtained under this model, an open research direction is to extend these results to hypergraph interference models. Motivated by recent results that the worst-case performance of the distributed maximal scheduling algorithm is characterized by the interference degree of the hypergraph, in the present work we investigate properties of the interference degree of the hypergraph and the structure of hypergraphs arising from physical constraints. We show that the problem of computing the interference degree of a hypergraph is NP-hard and we prove some properties and results concerning this hypergraph invariant. We investigate which hypergraphs are realizable, i.e. which hypergraphs arise in practice, based on physical constraints, as the interference model of a wireless network. In particular, a question that arises naturally is: what is the maximal value of r such that the hypergraph K-1,K-r is realizable? We determine this quantity for various integral and nonintegral values of the path loss exponent of signal propagation. We also investigate hypergraphs generated by line networks.

关键词： Interference Scheduling algorithms Stars Scheduling Signal to noise ratio Propagation losses Applications of hypergraph theory applied algorithms cellular systems distributed algorithms hypergraph models interference degree maximal scheduling unit disk graphs wireless networks wireless networks

来源：评论

学校读者我要写书评

暂无评论

Adaptive Multi-view Radiance Caching for Heterogeneous Participating Media

引用

COMPUTER GRAPHICS FORUM 2025年

作者： Stadlbauer, P. Tatzgern, W. Mueller, J. H. Winter, M. Stojanovic, R. Weinrauch, A. Steinberger, M. Graz Univ Technol Inst Visual Comp Graz Austria Huawei Technol Vienna Austria

Achieving lifelike atmospheric effects, such as fog, is essential in creating immersive environments and poses a formidable challenge in real-time rendering. Highly realistic rendering of complex lighting interacting with dynamic fog can be very resource-intensive, due to light bouncing through a complex participating media multiple times. We propose an approach that uses a multi-layered spherical harmonics probe grid to share computations temporarily. In addition, this world-space storage enables the sharing of radiance data between multiple viewers. In the context of cloud rendering this means faster rendering and a significant enhancement in overall rendering quality with efficient resource utilization.

关键词： CCS Concepts distributed algorithms Parallel algorithms Rendering • Computing methodologies → Ray tracing

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant mutual visibility without any axis agreement in presence of mobility failure

引用

THEORETICAL COMPUTER SCIENCE 2025年 1025卷

作者： Pramanick, Subhajit Jana, Saswata Mandal, Partha Sarathi Indian Inst Technol Guwahati Dept Math Gauhati 781039 Assam India

We aim to solve the mutual visibility problem using N autonomous, indistinguishable, homogeneous, oblivious and opaque point robots in the presence of mobility failure. The faulty robot cannot move when it becomes faulty, but the light remains working. Initially, from any arbitrary configuration, the problem of mutual visibility using robots aims to reach a configuration where any two robots can see each other. The challenge is to reach to such a configuration in the presence of faulty robots along with obstructed visibility under which two robots see each other only if the line segment joining them does not have any robots. Every robot operates in the conventional Look-Compute-Move cycles. Robots neither have any agreement in their coordinate system nor have the knowledge of N. The problem is not solvable for a specific symmetric initial configuration of the robots. We propose an algorithm that tolerates f (<= N) number of faulty robots and uses a constant number of colors in the FSYNC setting. To be specific, the algorithm requires 21 colors and runs in O(N2) synchronous rounds. We present another algorithm much simpler than the prior one but can tolerate a single faulty robot. This algorithm needs only 2 colors in the SSYNC and 5 colors in the ASYNC setting.

关键词： distributed algorithms Mobile robots Mobility failure Luminous robots Mutual visibility

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：