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

Distributed Optimal Power Flow for Bulk Transmission Grid Based on Modified Equivalent Network approximation Method

IEEE TRANSACTIONS ON INDUSTRY APPLICATIONS 2025年第3期61卷 4301-4312页

作者： Hasan, Md Shamim Kamalasadan, Sukumar Univ North Carolina Energy Prod & Infrastruct Ctr EPIC Charlotte NC 28223 USA Univ North Carolina Dept Elect Comp Engn Charlotte NC 28223 USA

Expanding multi-area interconnected power systems has made centralized optimization algorithms increasingly challenging to apply. Additionally, the integration of DERs into transmission networks remains under-explored. Although equivalent network approximations (ENA) are effective for distribution systems, their application in meshed transmission systems is difficult and challenging. This article proposes optimizing power flow in bulk power transmission grids using a modified ENA (MENA) framework. The method is based on Sequential Quadratic Programming (SQP) and is distributed in nature. DERs are incorporated into the transmission network and a voltage control methodology is proposed to mitigate voltage rise and dip events. The proposed method is validated using various IEEE test cases and an extensive transmission network. This approach outperforms existing methods such as ADMM, APP, and OCDC algorithms and has also proven highly effective in controlling voltage mismatches.

关键词： Load flow Voltage control Reactive power Convex functions Convergence approximation algorithms Voltage fluctuations Quadratic programming Power demand Cost function Modified equivalent network approximation (MENA) distributed optimal power flow (D-OPF) sequential quadratic programming and voltage control

来源：评论

学校读者我要写书评

暂无评论

A Simple Finite-Time Analysis of TD Learning With Linear Function approximation

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2025年第2期70卷 1388-1394页

作者： Mitra, Aritra North Carolina State Univ Dept Elect & Comp Engn Raleigh NC 27695 USA

We study the finite-time convergence of temporal- difference (TD) learning with linear function approximation under Markovian sampling. Existing proofs for this setting either assume a projection step in the algorithm to simplify the analysis, or require a fairly intricate argument to ensure stability of the iterates. We ask: Is it possible to retain the simplicity of a projection-based analysis without actually performing a projection step in the algorithm? Our main contribution is to show this is possible via a novel two-step argument. In the first step, we use induction to prove that under a standard choice of a constant step-size alpha , the iterates generated by TD learning remain uniformly bounded in expectation. In the second step, we establish a recursion that mimics the steady-state dynamics of TD learning up to a bounded perturbation on the order of O ( alpha(2) ) that captures the effect of Markovian sampling. Combining these pieces leads to an overall approach that considerably simplifies existing proofs. We conjecture that our inductive proof technique will find applications in the analyses of more complex stochastic approximation algorithms, and conclude by providing some examples of such applications.

关键词： Temporal difference learning approximation algorithms Standards Function approximation Convergence Perturbation methods Noise Vectors Heuristic algorithms Delays Finite-time analysis reinforcement learning stochastic approximation temporal difference learning

来源：评论

学校读者我要写书评

暂无评论

Online Learning Under a Separable Stochastic approximation Framework

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2025年第2期47卷 1317-1330页

作者： Gan, Min Su, Xiang-xiang Chen, Guang-yong Chen, Jing Chen, C. L. Philip Qingdao Univ Inst Future Qingdao 266071 Peoples R China Coll Comp Sci & Technol Qingdao 266071 Peoples R China Fuzhou Univ Coll Comp & Data Sci Fuzhou 350108 Peoples R China Univ Fujian Fujian Key Lab Network Comp & Intelligent Informat Key Lab Intelligent Metro Fuzhou 350007 Peoples R China Minist Educ Engn Res Ctr Big Data Intelligence Beijing 100101 Peoples R China Jiangnan Univ Sch Sci Wuxi 214122 Peoples R China Qingdao Univ Coll Comp Sci & Technol Qingdao 266071 Peoples R China South China Univ Technol Sch Comp Sci & Engn Guangzhou 510641 Peoples R China

We propose an online learning algorithm tailored for a class of machine learning models within a separable stochastic approximation framework. The central idea of our approach is to exploit the inherent separability in many models, recognizing that certain parameters are easier to optimize than others. This paper focuses on models where some parameters exhibit linear characteristics, which are common in machine learning applications. In our proposed algorithm, the linear parameters are updated using the recursive least squares (RLS) algorithm, akin to a stochastic Newton method. Subsequently, based on these updated linear parameters, the nonlinear parameters are adjusted using the stochastic gradient method (SGD). This dual-update mechanism can be viewed as a stochastic approximation variant of block coordinate gradient descent, where one subset of parameters is optimized using a second-order method while the other is handled with a first-order approach. We establish the global convergence of our online algorithm for non-convex cases in terms of the expected violation of first-order optimality conditions. Numerical experiments demonstrate that our method achieves significantly faster initial convergence and produces more robust performance compared to other popular learning algorithms. Additionally, our algorithm exhibits reduced sensitivity to learning rates and outperforms the recently proposed slimTrain algorithm (Newman et al. 2022). For validation, the code has been made available on GitHub.

关键词： Stochastic processes approximation algorithms Optimization Machine learning algorithms Machine learning Convergence Artificial neural networks Training Minimization Convex functions Online learning recursive least squares stochastic approximation variable projection

来源：评论

学校读者我要写书评

暂无评论

Deciding Truck Platooning Operational Rules With Stochastic approximation for Vehicle Safe Overtaking on Two-Lane Undivided Highways

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2025年第5期26卷 6201-6215页

作者： Song, Yu Univ Wyoming Dept Civil & Architectural Engn & Construct Manage Laramie WY 82071 USA

Truck platooning is a promising technology to improve freight transport efficiency. However, this technology has primarily been explored on multi-lane divided highways, neglecting potential applications on two-lane undivided highways prevalent in rural areas. This paper addresses the challenges of deploying truck platooning on such highways, focusing on overtaking safety. We formulate safe overtaking via stochastic approximation as a feasibility problem. An algorithm is proposed to determine operational rules for truck platooning, considering factors including traffic flow, road segment geometry, and vehicle dynamics. Values for truck platooning operational parameters such as speed, inter-truck following gap, and number of trucks in platoon are decided which ensure overall overtaking safety. The algorithm is iterative and depends on first order information, avoiding possible complex computations of stochastic objective with respect to truck platooning operational parameters. The algorithm is general and adapts to different roadway and traffic conditions and weights on platooning parameters. We show that computation of the algorithm is linear in sample size used in approximation. Simulations show that the algorithm-generated platooning rules offer an overtaking safety guarantee of up to 93% on a straight and flat road segment with sparse traffic.

关键词： Safety Roads Trajectory Geometry approximation algorithms Regulation Estimation Vehicles Vectors Sensors Connected and automated vehicle trucking road geometry passing sight distance road safety traffic regulations

来源：评论

学校读者我要写书评

暂无评论

approximation schemes for age of information minimization in UAV grid patrols

引用

AD HOC NETWORKS 2025年 166卷

作者： Wang, Weiqi Xu, Jin Univ Victoria Dept Phys & Astron 3800 Finnerty Rd Victoria BC V8P 5C2 Canada Huazhong Univ Sci & Technol Sch Management Wuhan 430074 Peoples R China

Motivated by the critical need for unmanned aerial vehicles (UAVs) to patrol grid systems in hazardous and dynamically changing environments, this study addresses a routing problem aimed at minimizing the time- average Age of Information (AoI) for edges in general graphs. We establish a lower bound for all feasible patrol policies and demonstrate that this bound is tight when the graph contains an Eulerian cycle. For graphs without Eulerian cycles, it becomes challenging to identify the optimal patrol strategy due to the extensive range of feasible options. Our analysis shows that restricting the strategy to periodic sequences still results in an exponentially large number of possible strategies. To address this complexity, we introduce two polynomial-time approximation schemes, each involving a two-step process: constructing multigraphs first and then embedding Eulerian cycles within these multigraphs. We prove that both schemes achieve an approximation ratio of 2. Further, both analytical and numerical results suggest that evenly and sparsely distributing edge visits within a periodic route significantly reduces the average AoI compared to strategies that merely minimize the route travel distance. Building on this insight, we propose a heuristic method that not only maintains the approximation ratio of 2 but also ensures robust performance across varying random graphs.

关键词： UAV grid patrols Age of information approximation algorithms approximation ratio

来源：评论

学校读者我要写书评

暂无评论

Improving Accuracy of Interpolation Algorithm in EMT Simulation: A Padé approximation and Switching Theorem Based Approach

引用

IEEE TRANSACTIONS ON INDUSTRY APPLICATIONS 2025年第1期61卷 1148-1160页

作者： Cao, Yang Gu, Wei Xu, Mingwang Zhang, Fei Chen, Shuaixian Liu, Wei Southeast Univ Sch Elect Engn Nanjing 210096 Jiangsu Peoples R China Nanjing Univ Sci & Technol Sch Automat Nanjing 210094 Jiangsu Peoples R China

As renewable sources and power electronic devices become more prevalent in the power system, the characteristics of power system are now shaped by power electronics, which presents new challenges for the acceleration algorithm used in electromagnetic transient (EMT) simulation. In this context, this paper refines five key technical points of interpolation algorithms and proposes an improved interpolation algorithm. In particular, the Pade approximation is adopted and combined with numerical integration methods to establish a discrete model for accuracy and stability improvement. The switching theorem is used for re-initialization, which further reduces the switching error and reflects more realistic switching transients. Moreover, the algorithm's stability is theoretically proved through Lyapunov stability analysis. With the improved interpolation algorithm, switching transients can be accurately simulated while maintaining high simulation efficiency and stability. The performance of the proposed method is validated by both simulation and experimental tests.

关键词： Switches Interpolation Accuracy Power system stability approximation algorithms Numerical stability Transient analysis Power electronics Oscillators Stability criteria EMT simulation power electronics interpolation pad & eacute approximation switching theorem stability Lyapunov function

来源：评论

学校读者我要写书评

暂无评论

Shapley Value approximation Based on Complementary Contribution

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2024年第12期36卷 9263-9281页

作者： Sun, Qiheng Zhang, Jiayao Liu, Jinfei Xiong, Li Pei, Jian Ren, Kui Zhejiang Univ Hangzhou 310027 Zhejiang Peoples R China Zhejiang Univ Coll Comp Sci & Technol Hangzhou 310027 Zhejiang Peoples R China Emory Univ Comp Sci & Biomed Informat Atlanta GA 30322 USA Duke Univ Trinity Coll Arts & Sci Dept Comp Sci Durham NC 27708 USA

Shapley value provides a unique way to fairly assess each player's contribution in a coalition and has enjoyed many applications. However, the exact computation of Shapley value is #P-hard due to the combinatoric nature of Shapley value. Many existing applications of Shapley value are based on Monte-Carlo approximation, which requires a large number of samples and the assessment of utility on many coalitions to reach high-quality approximation, and thus is still far from being efficient. Can we achieve an efficient approximation of Shapley value by smartly obtaining samples? In this paper, we treat the sampling approach to Shapley value approximation as a stratified sampling problem. Our main technical contributions are a novel stratification design and a sampling method based on Neyman allocation. Moreover, computing the Shapley value in a dynamic setting, where new players may join the game and others may leave it poses an additional challenge due to the considerable cost of recomputing from scratch. To tackle this issue, we propose to capture changes in Shapley value, making our approaches applicable to scenarios with dynamic players. Experimental results on several real data sets and synthetic data sets demonstrate the effectiveness and efficiency of our approaches.

关键词： Resource management Heuristic algorithms Games Data models approximation algorithms Estimation Pricing Approximate algorithms dynamic datasets shapley value

来源：评论

学校读者我要写书评

暂无评论

Parameterized and approximation algorithms for finding two disjoint matchings

引用

THEORETICAL COMPUTER SCIENCE 2014年第0期556卷 85-93页

作者： Chen, Zhi-Zhong Fan, Ying Wang, Lusheng Tokyo Denki Univ Div Informat Syst Design Hatoyama Saitama 3500394 Japan City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China

We first present a randomized fixed-parameter algorithm for the NP-hard problem of deciding if there are two matchings M-1 and M-2 in a given graph G such that vertical bar M-1 vertical bar+ vertical bar M-2 vertical bar is a given number k. The algorithm runs in O (2(k)k(m + n)) expected time and can be derandomized to run in O (2(2k+12 log2 (2k)) kn (m + n) time, where n (respectively, m) is the number of vertices (respectively, edges) in G. We then extend the algorithm to the weighted version of the problem. We further present a combinatorial approximation algorithm for the NP-hard problem of finding two disjoint matchings in a given edge-weighted graph G so that their total weight is maximized. The algorithm achieves an approximation ratio close to 0.76 and runs in O(m + n(3) alpha(n)) time, where alpha is the inverse Ackermann function. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Fixed-parameter algorithms approximation algorithms Color-coding Universal sets Matchings

来源：评论

学校读者我要写书评

暂无评论

A dynamic edge covering and scheduling problem: complexity results and approximation algorithms

引用

OPTIMIZATION LETTERS 2014年第4期8卷 1201-1212页

作者： Qiu, Jiaming Sharkey, Thomas C. Rensselaer Polytech Inst Dept Ind & Syst Engn Troy NY 12180 USA

We consider a new dynamic edge covering and scheduling problem that focuses on assigning resources to nodes in a network to minimize the amount of time required to process all edges in it. Resources need to be co-located at the endpoints of an edge for it to be processed and, therefore, this problem contains both edge covering and scheduling decisions. These new problems have motivating applications in traffic systems and military intelligence operations. We provide complexity results for the dynamic edge covering and scheduling problem over different types of networks. We then show that existing approximation algorithms for parallel machine scheduling problems can be leveraged to provide approximation algorithms for this new class of problems over certain types of networks.

关键词： Endpoint covering Scheduling Complexity approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Fast 3-D Radio Map Reconstruction via Cross Tensor approximation

引用

IEEE INTERNET OF THINGS JOURNAL 2024年第24期11卷 40619-40633页

作者： Li, Chunmei Dou, Zheng Lin, Yun Harbin Engn Univ Coll Informat & Commun Engn Harbin 150001 Peoples R China

3-D radio maps provide significantly richer information than their 2-D counterparts in spectrum cartography. However, reconstruction methods for 3-D radio maps remain underexplored. Classic methods, such as spatial interpolation and matrix completion, can be adapted for 3-D scenarios, but they are often computationally intensive and require a substantial number of sampling measurements. To address these challenges, we propose a novel and efficient 3-D radio map reconstruction paradigm inspired by cross tensor approximation (CTA). During the measurement phase, only piecewise straight-line paths are required, making this method well-suited for the flying trajectories of unmanned aerial vehicles (UAVs). In the reconstruction phase, we utilize the inherent tensor structure of 3-D radio maps by employing the fiber sampling tensor decomposition (FSTD) algorithm, which ensures high-quality and computationally efficient reconstruction from the measurements. To further reduce the number of measurements, we introduce a new algorithm called interpolation-integrated FSTD (II-FSTD). This algorithm builds on the original FSTD yet exploits the smoothness of radio maps to incorporate interpolation, thereby reducing the required measurement frequency. Extensive experimental results demonstrate that the proposed paradigm can reconstruct 3-D radio maps with high quality, using fewer measurements and less computational time compared to state-of-the-art techniques. Notably, in scenarios with lower measurement frequency, II-FSTD outperforms other methods, achieving superior reconstruction performance.

关键词： Three-dimensional displays Tensors Matrix decomposition Solid modeling Computational modeling Accuracy approximation algorithms Fiber sampling tensor decomposition (FSTD) radio map spatial interpolation spectrum cartography (SC) tensor decomposition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：