期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Integrated fire/flight control of armed helicopters based on C-BFGS and distributionally robust optimization
1
作者 ZHOU Zeyu WANG Yuhui WU Qingxian 《Journal of Systems Engineering and Electronics》 CSCD 2024年第6期1604-1620,共17页
To meet the requirements of modern air combat,an integrated fire/flight control(IFFC)system is designed to achieve automatic precision tracking and aiming for armed helicopters and release the pilot from heavy target ... To meet the requirements of modern air combat,an integrated fire/flight control(IFFC)system is designed to achieve automatic precision tracking and aiming for armed helicopters and release the pilot from heavy target burden.Considering the complex dynamic characteristics and the couplings of armed helicopters,an improved automatic attack system is con-structed to integrate the fire control system with the flight con-trol system into a unit.To obtain the optimal command signals,the algorithm is investigated to solve nonconvex optimization problems by the contracting Broyden Fletcher Goldfarb Shanno(C-BFGS)algorithm combined with the trust region method.To address the uncertainties in the automatic attack system,the memory nominal distribution and Wasserstein distance are introduced to accurately characterize the uncertainties,and the dual solvable problem is analyzed by using the duality the-ory,conjugate function,and dual norm.Simulation results verify the practicality and validity of the proposed method in solving the IFFC problem on the premise of satisfactory aiming accu-racy. 展开更多
关键词 integrated fire/flight control(IFFC) armed helicopter improved contracting Broyden Fletcher Goldfarb Shanno(C-BFGS)algorithm memory nominal distribution Wasserstein dis-tance distributionally robust optimization
在线阅读 下载PDF
A novel hybrid estimation of distribution algorithm for solving hybrid flowshop scheduling problem with unrelated parallel machine 被引量:10
2
作者 孙泽文 顾幸生 《Journal of Central South University》 SCIE EI CAS CSCD 2017年第8期1779-1788,共10页
The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this wor... The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms. 展开更多
关键词 hybrid estimation of distribution algorithm teaching learning based optimization strategy hybrid flow shop unrelated parallel machine scheduling
在线阅读 下载PDF
Multi-objective planning model for simultaneous reconfiguration of power distribution network and allocation of renewable energy resources and capacitors with considering uncertainties 被引量:9
3
作者 Sajad Najafi Ravadanegh Mohammad Reza Jannati Oskuee Masoumeh Karimi 《Journal of Central South University》 SCIE EI CAS CSCD 2017年第8期1837-1849,共13页
This research develops a comprehensive method to solve a combinatorial problem consisting of distribution system reconfiguration, capacitor allocation, and renewable energy resources sizing and siting simultaneously a... This research develops a comprehensive method to solve a combinatorial problem consisting of distribution system reconfiguration, capacitor allocation, and renewable energy resources sizing and siting simultaneously and to improve power system's accountability and system performance parameters. Due to finding solution which is closer to realistic characteristics, load forecasting, market price errors and the uncertainties related to the variable output power of wind based DG units are put in consideration. This work employs NSGA-II accompanied by the fuzzy set theory to solve the aforementioned multi-objective problem. The proposed scheme finally leads to a solution with a minimum voltage deviation, a maximum voltage stability, lower amount of pollutant and lower cost. The cost includes the installation costs of new equipment, reconfiguration costs, power loss cost, reliability cost, cost of energy purchased from power market, upgrade costs of lines and operation and maintenance costs of DGs. Therefore, the proposed methodology improves power quality, reliability and security in lower costs besides its preserve, with the operational indices of power distribution networks in acceptable level. To validate the proposed methodology's usefulness, it was applied on the IEEE 33-bus distribution system then the outcomes were compared with initial configuration. 展开更多
关键词 optimal reconfiguration renewable energy resources sitting and sizing capacitor allocation electric distribution system uncertainty modeling scenario based-stochastic programming multi-objective genetic algorithm
在线阅读 下载PDF
Fully asynchronous distributed optimization with linear convergence over directed networks
4
作者 SHA Xingyu ZHANG Jiaqi YOU Keyou 《中山大学学报(自然科学版)(中英文)》 CAS CSCD 北大核心 2023年第5期1-23,共23页
We study distributed optimization problems over a directed network,where nodes aim to minimize the sum of local objective functions via directed communications with neighbors.Many algorithms are designed to solve it f... We study distributed optimization problems over a directed network,where nodes aim to minimize the sum of local objective functions via directed communications with neighbors.Many algorithms are designed to solve it for synchronized or randomly activated implementation,which may create deadlocks in practice.In sharp contrast,we propose a fully asynchronous push-pull gradient(APPG) algorithm,where each node updates without waiting for any other node by using possibly delayed information from neighbors.Then,we construct two novel augmented networks to analyze asynchrony and delays,and quantify its convergence rate from the worst-case point of view.Particularly,all nodes of APPG converge to the same optimal solution at a linear rate of O(λ^(k)) if local functions have Lipschitz-continuous gradients and their sum satisfies the Polyak-?ojasiewicz condition(convexity is not required),where λ ∈(0,1) is explicitly given and the virtual counter k increases by one when any node updates.Finally,the advantage of APPG over the synchronous counterpart and its linear speedup efficiency are numerically validated via a logistic regression problem. 展开更多
关键词 fully asynchronous distributed optimization linear convergence Polyak-Łojasiewicz condition
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部