含脉冲负载的综合电力系统储能优化配置研究

考虑到舰船环境限制和高能脉冲负载对储能的需求,有必要对储能装置进行合理的选型和优化配置,来提升综合电力系统性能。为此,基于带权极小模理想点法和层次分析法,提出了一种储能装置性能评价函数,并以其为优化目标,进行储能装置优化配置。所提出的评价函数充分考虑系统需求和脉冲负载特性,以储能装置体积、质量和经济性作为评价函数主要组成部分,同时考虑功率、能量、电压、荷电状态等约束,建立优化配置模型,并采用差分进化算法进行求解。以高性能锂电池和超级电容器为例,对所提模型进行求解计算,结果表明在所给权重系数下锂电池性能更优,更适用于综合电力系统,并给出了优化配置后的指导方案。     

弹道导弹被动段最优脉冲变轨方法

弹道导弹大气层外飞行时间长且弹道固定,易被敌方预测和拦截。针对以上问题,本文提出一种最优脉冲式变轨方法,该方法设计的弹道由2条不同的椭圆弧段组成,成功命中目标的同时,增加了敌方的拦截难度。以机动变轨所需能量和变轨后飞行剩余时间的加权最优为性能指标,设计了利用遗传算法在初始弹道上寻求最优变轨点的方法。最后,将遗传算法搜索最优点结果与遍历搜索结果进行对比,其最大误差为 ,从而验证了遗传算法在应用于导弹变轨问题,用以寻求最优变轨点是准确有效的。     

翼伞精确空投系统归航轨迹规划与控制

翼伞归航轨迹规划与控制问题是翼伞系统在一定初始状态下,利用自身可操作性,完成从初始位置到目标位置的转移问题。针对翼伞空投系统不同归航要求,规划出满足精度要求为圆径概率误差（ CEP ）小于40m的归航轨迹并经过一定量的控制完成翼伞空投系统精确空投任务。首先建立翼伞系统状态空间六自由度模型,并在此基础上提出系统简化稳态模型,通过最优控制方法,规划出满足空投要求的最优归航轨迹后对翼伞进行不断控制直至目标点。最后通过Matlab仿真试验,绘出翼伞系统归航轨迹图与控制变化图。     

弹药物资储备布局规划仿真模型＊

介绍了当前弹药物资储备布局规划的现状,对其涉及的要素进行分析,构建了弹药物资储备布局规划网络模型。在此基础上提出了分析模型,将弹药物资布局规划求解问题描述为有约束条件的多目标优化数学模型,解决了各仓库弹药存储量难以预测的问题,并通过实验进行了验证分析。     

C4ISR系统体系结构设计集成环境

C4ISR系统体系结构设计是系统综合集成的基础.针对C4ISR体系结构框架2.0,分析了体系结构产品的特点,研究了体系结构产品设计工具的分类以及应该具有的功能,提出体系结构产品设计工具的集成框架和基于体系结构核心数据库的数据管理机制,并实现了体系结构产品设计工具以及体系结构设计集成环境.     

一类随机差分方程的解序列的最优停止规则

设报酬序列{x_(?),(?),n≥0}满足随机差分方程x_(n+1)=x_n+a_n+b_nε_(n+1)(ε_1,ε_2,…为白噪声序列)。本文讨论了用有限情形{x_n,0≤n≤N}的Snell包逼近无限情形{x_n,n≥0)的Snell包的条件,得到了x_n=E(x_n|(?))((?)=σ{ε_0,ε_1,…,ε_n},ε_0=0)的Snell包r_n的分解形式和最优停时存在的条件。最后讨论了最优停止规则的迭代计算法,并得出了迭代过程在有限步停止的充分条件。     

坦克火控系统的控制主线及炮控系统

本文提出了控制主线的新概念和坦克火控系统是沿着控制主线而发展的论点.并由此发现,控制主线末端上的炮控系统是火控系统中最薄弱的控制环节,本文以现代控制理论为基础,对炮控系统进行了重新设计,使系统性能有显著改善.     

最小、最大广义最优停止规则的特征

设(X_n,F_n)_1~∞是适应的报酬序列,(γ_n)是相应的snell 包,(A_n)是(γ_n)的Doob-Meyer 分解中零初值的可料增过程。本文继J.Klass 的研究证明了σ_1=inf{K≥1:X_k≥γ_k}是最小半最优的且是最大严格正则的广义规则,而K_0=sup{n≥0:A_n=0}<∞是最大正则的广义规则,从而得出了广义最优规则唯一性的另一表述。     

An exact analysis of a joint production‐inventory problem in two‐echelon inventory systems

We consider a two‐echelon inventory system with a manufacturer operating from a warehouse supplying multiple distribution centers (DCs) that satisfy the demand originating from multiple sources. The manufacturer has a finite production capacity and production times are stochastic. Demand from each source follows an independent Poisson process. We assume that the transportation times between the warehouse and DCs may be positive which may require keeping inventory at both the warehouse and DCs. Inventory in both echelons is managed using the base‐stock policy. Each demand source can procure the product from one or more DCs, each incurring a different fulfilment cost. The objective is to determine the optimal base‐stock levels at the warehouse and DCs as well as the assignment of the demand sources to the DCs so that the sum of inventory holding, backlog, and transportation costs is minimized. We obtain a simple equation for finding the optimal base‐stock level at each DC and an upper bound for the optimal base‐stock level at the warehouse. We demonstrate several managerial insights including that the demand from each source is optimally fulfilled entirely from a single distribution center, and as the system's utilization approaches 1, the optimal base‐stock level increases in the transportation time at a rate equal to the demand rate arriving at the DC. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

On the optimal detection of an underwater intruder in a channel using unmanned underwater vehicles

Given a number of patrollers that are required to detect an intruder in a channel, the channel patrol problem consists of determining the periodic trajectories that the patrollers must trace out so as to maximized the probability of detection of the intruder. We formulate this problem as an optimal control problem. We assume that the patrollers' sensors are imperfect and that their motions are subject to turn‐rate constraints, and that the intruder travels straight down a channel with constant speed. Using discretization of time and space, we approximate the optimal control problem with a large‐scale nonlinear programming problem which we solve to obtain an approximately stationary solution and a corresponding optimized trajectory for each patroller. In numerical tests for one, two, and three underwater patrollers, an underwater intruder, different trajectory constraints, several intruder speeds and other specific parameter choices, we obtain new insight—not easily obtained using simply geometric calculations—into efficient patrol trajectory design under certain conditions for multiple patrollers in a narrow channel where interaction between the patrollers is unavoidable due to their limited turn rate.© 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011