排序方式: 共有54条查询结果,搜索用时 46 毫秒
41.
42.
零动态设计方法在鱼雷纵向运动控制中的应用 总被引:2,自引:0,他引:2
鱼雷纵向运动方程是非线性微分方程 ,非线性系统近似线性化建模方法有着不可忽视的局限性 .非线性系统的精确线性化设计方法由于其复杂性而限制了它的应用 .将零动态设计方法应用于鱼雷纵向系统 ,为解决鱼雷非线性控制系统稳定设计提供了新的途径 . 相似文献
43.
本文利用一种采用应力分离法的杂交/混合板壳有限元模型分析板壳结构静力学问题。分析表明,该元素在总体水平上没有多余零能模式。而且,该元素通过了薄板的闭锁试验,对薄壳算例也没有观察到闭锁现象。与参考解相比,该元素对各种壳结构均能适用,且收敛性较好,精度也较高。 相似文献
44.
We study optimal pricing for tandem queueing systems with finite buffers. The service provider dynamically quotes prices to incoming price sensitive customers to maximize the long-run average revenue. We present a Markov decision process model for the optimization problem. For systems with two stations, general-sized buffers, and two or more prices, we describe the structure of the optimal dynamic pricing policy and develop tailored policy iteration algorithms to find an optimal pricing policy. For systems with two stations but no intermediate buffer, we characterize conditions under which quoting either a high or a low price to all customers is optimal and provide an easy-to-implement algorithm to solve the problem. Numerical experiments are conducted to compare the developed algorithms with the regular policy iteration algorithm. The work also discusses possible extensions of the obtained results to both three-station systems and two-station systems with price and congestion sensitive customers using numerical analysis. 相似文献
45.
针对OFDM系统中基于补零DFT实现信道插值的算法,对传统的时域方法和变换域方法进行了分析,并提出了一种新的补零方法。首先通过理论分析指出传统的基于补零DFT实现信道插值算法中,时域方法和变换域方法是等效的;通过对信道插值算法中冲激响应估计序列进行补零的分析,指出补零操作是为了重构出冲激响应的N点采样序列(N表示总子载波数),并针对传统补零方法在一定条件下产生的重构误差,提出了一种新的补零方法。仿真结果表明以上理论分析是正确的,新补零方法可以减小一定条件下的重构误差,增强信道插值算法对信道延迟分布的鲁棒性,有效提高系统的性能。 相似文献
46.
47.
基于预见控制理论,采用零相位误差跟踪控制器,实现巡航导弹的前馈控制,能使导弹飞行良好地跟踪地形,还给出了前馈控制器的设计方法,并对导弹飞行过程作了系统仿真. 相似文献
48.
In an accumulation game, a HIDER attempts to accumulate a certain number of objects or a certain quantity of material before a certain time, and a SEEKER attempts to prevent this. In a continuous accumulation game the HIDER can pile material either at locations $1, 2, …, n, or over a region in space. The HIDER will win (payoff 1) it if accumulates N units of material before a given time, and the goal of the SEEKER will win (payoff 0) otherwise. We assume the HIDER can place continuous material such as fuel at discrete locations i = 1, 2, …, n, and the game is played in discrete time. At each time k > 0 the HIDER acquires h units of material and can distribute it among all of the locations. At the same time, k, the SEEKER can search a certain number s < n of the locations, and will confiscate (or destroy) all material found. After explicitly describing what we mean by a continuous accumulation game on discrete locations, we prove a theorem that gives a condition under which the HIDER can always win by using a uniform distribution at each stage of the game. When this condition does not hold, special cases and examples show that the resulting game becomes complicated even when played only for a single stage. We reduce the single stage game to an optimization problem, and also obtain some partial results on its solution. We also consider accumulation games where the locations are arranged in either a circle or in a line segment and the SEEKER must search a series of adjacent locations. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 60–77, 2002; DOI 10.1002/nav.1048 相似文献
49.
在交汇式双联装火炮武器系统中,火炮装置通过联装两座火炮单元来提高发射率,由于火炮单元自动机轴线与火炮装置的实际架位存在偏差,常规标定方法无法获取此类武器系统火炮架位与跟踪传感器的偏差。本文提出一种交汇式双联装火炮武器系统的零位检测和规正方法,本方法通过零飞方式检查火炮瞄准误差,并根据火炮高低指向实时地计算炮管指向和火炮架位的实际偏差,以准确测量火炮与跟踪传感器的零位偏差,实现交汇式双联装火炮武器系统快速标定。 相似文献
50.