期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
Stabilization of linear time-varying systems with state and input constraints using convex optimization 被引量:1
1
作者 Feng Tan Mingzhe Hou Guangren Duan 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2016年第3期649-655,共7页
The stabilization problem of linear time-varying systems with both state and input constraints is considered. Sufficient conditions for the existence of the solution to this problem are derived and a gain-switched(ga... The stabilization problem of linear time-varying systems with both state and input constraints is considered. Sufficient conditions for the existence of the solution to this problem are derived and a gain-switched(gain-scheduled) state feedback control scheme is built to stabilize the constrained timevarying system. The design problem is transformed to a series of convex feasibility problems which can be solved efficiently. A design example is given to illustrate the effect of the proposed algorithm. 展开更多
关键词 linear time-varying stabilization state constraints convex optimization
在线阅读 下载PDF
Multiconstraint adaptive three-dimensional guidance law using convex optimization 被引量:6
2
作者 FU Shengnan LIU Xiaodong +1 位作者 ZHANG Wenjie XIA Qunli 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2020年第4期791-803,共13页
The traditional guidance law only guarantees the accuracy of attacking a target. However, the look angle and acceleration constraints are indispensable in applications. A new adaptive three-dimensional proportional na... The traditional guidance law only guarantees the accuracy of attacking a target. However, the look angle and acceleration constraints are indispensable in applications. A new adaptive three-dimensional proportional navigation(PN) guidance law is proposed based on convex optimization. Decomposition of the three-dimensional space is carried out to establish threedimensional kinematic engagements. The constraints and the performance index are disposed by using the convex optimization method. PN guidance gains can be obtained by solving the optimization problem. This solution is more rapid and programmatic than the traditional method and provides a foundation for future online guidance methods, which is of great value for engineering applications. 展开更多
关键词 proportional navigation(PN) adaptive guidance law three-dimensional space second-order cone programming(SOCP) convex optimal control
在线阅读 下载PDF
Joint optimization of LORA and spares stocks considering corrective maintenance time 被引量:10
3
作者 Linhan Guo Jiujiu Fan +1 位作者 Meilin Wen Rui Kang 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2015年第1期85-95,共11页
Level of repair analysis(LORA) is an important method of maintenance decision for establishing systems of operation and maintenance in the equipment development period. Currently, the research on equipment of repair... Level of repair analysis(LORA) is an important method of maintenance decision for establishing systems of operation and maintenance in the equipment development period. Currently, the research on equipment of repair level focuses on economic analysis models which are used to optimize costs and rarely considers the maintenance time required by the implementation of the maintenance program. In fact, as to the system requiring high mission complete success, the maintenance time is an important factor which has a great influence on the availability of equipment systems. Considering the relationship between the maintenance time and the spares stocks level, it is obvious that there are contradictions between the maintenance time and the cost. In order to balance these two factors, it is necessary to build an optimization LORA model. To this end, the maintenance time representing performance characteristic is introduced, and on the basis of spares stocks which is traditionally regarded as a decision variable, a decision variable of repair level is added, and a multi-echelon multiindenture(MEMI) optimization LORA model is built which takes the best cost-effectiveness ratio as the criterion, the expected number of backorder(EBO) as the objective function and the cost as the constraint. Besides, the paper designs a convex programming algorithm of multi-variable for the optimization model, provides solutions to the non-convex objective function and methods for improving the efficiency of the algorithm. The method provided in this paper is proved to be credible and effective according to the numerical example and the simulation result. 展开更多
关键词 level of repair spares convex optimization multi-echelon multi-indenture(MEMI)
在线阅读 下载PDF
Analysis and optimization of delays in networked control systems
4
作者 谢林柏 方华京 郑英 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2005年第3期654-659,664,共7页
The minimization problem of time delays in networked control system (NCS) is concered, which is a hot area of such research field. First, some analysis and comments on time-delayed NCS model listed in previous work ... The minimization problem of time delays in networked control system (NCS) is concered, which is a hot area of such research field. First, some analysis and comments on time-delayed NCS model listed in previous work are given. Then, time delay minimization problem based on average behavior of network queuing delay is presented. Under fixed routing scheme and certain optimization performance indexes, the delay minimization problem is translated into convex optimization problem. And the solution of the delay minimization problems is attained through optimized allocation of flow rates among network links. 展开更多
关键词 networked control system time delays convex optimization subgradient method.
在线阅读 下载PDF
DOA estimation via sparse recovering from the smoothed covariance vector 被引量:1
5
作者 Jingjing Cai Dan Bao Peng Li 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2016年第3期555-561,共7页
A direction of arrival(DOA) estimation algorithm is proposed using the concept of sparse representation. In particular, a new sparse signal representation model called the smoothed covariance vector(SCV) is establ... A direction of arrival(DOA) estimation algorithm is proposed using the concept of sparse representation. In particular, a new sparse signal representation model called the smoothed covariance vector(SCV) is established, which is constructed using the lower left diagonals of the covariance matrix. DOA estimation is then achieved from the SCV by sparse recovering, where two distinguished error limit estimation methods of the constrained optimization are proposed to make the algorithms more robust. The algorithm shows robust performance on DOA estimation in a uniform array, especially for coherent signals. Furthermore, it significantly reduces the computational load compared with those algorithms based on multiple measurement vectors(MMVs). Simulation results validate the effectiveness and efficiency of the proposed algorithm. 展开更多
关键词 array signal processing convex optimization direction of arrival(DOA) estimation sparse representation
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部