四足机器人对角小跑动态控制

基于虚拟模型控制方法,根据四足机器人单腿雅克比矩阵得到支撑相与摆动相的控制法则。为实现机器人躯体的完全控制,提出了一种控制目标分解的方法,将四足机器人躯体的控制目标分解到每条支撑腿的控制上。通过构建每条支撑腿的虚拟构件,并将虚拟构件产生的虚拟力转换为期望关节力矩,从而实现支撑腿的虚拟模型控制;实时规划摆动足的运动轨迹,利用虚拟构件连接摆动腿的足端与期望的摆动轨迹,实现摆动腿的虚拟模型控制。在设定四条腿的相位轮换规律的基础上,对一个四足机器人二维平面模型进行对角小跑步态下的速度控制及抗干扰仿真试验。仿真结果证明该控制方法能够有效控制机器人躯体的高度、速度及倾角,实现四足机器人对角小跑运动的动态控制并具有一定的抗冲击干扰能力。     

基于最小误差模型估计的地空导弹飞行试验数据相容性检验

提出了基于递推最小模型误差估计(RMMEE)的地空导弹飞行试验数据相容性检验的方法,该方法采用导弹位置和弹体角位移测量,不仅能在线重构六自由度弹道参数,而且能估计捷联惯导的动态误差,从根本上克服了Klein模型的局限性。该方法对导弹速度、位置估值的初值不敏感,即使存在较大的捷联惯导动态误差,仍具有良好的收敛性和稳健性。     

磁性目标的高精度建模方法

以混合阵列模型为例 ,研究了磁性目标的高精度磁场建模方法 ,并设计测试实验 ,对用该方法建立的磁场模型的稳定可靠性进行了测试 .测试结果表明 ,用该方法建立的磁场模型不仅精度高而且稳定可靠     

随机相位信号检测模型及其在移动通信保密系统中的应用

通过对随机相位信号检测模型的分析 ,介绍了一种基于该检测模型的对于经FSK调制的随机相位信号的检测方法 ,并阐述了该方法在一种蜂窝式移动通信保密系统中的应用     

建立颗粒流方程的推广BGK模型方法

从描述颗粒流动的推广BGK模型方程出发建立颗粒流方程。其中推广BGK模型方程的处理采用了经典分子动力论中的Chapman Enskog方法。由于建立颗粒流方程的思路简单清晰 ,且方程中各量都有明确的物理意义 ,因此易于推广     

The multivariate Polya distribution in combat modeling

This paper investigates the multivariate Polya distribution (MPD) for application in combat models for which enemy targets must be randomly assigned to fighting units. Six sets of actual combat data motivate the allocation model. Scenarios include air‐to‐air combat, tank, and submarine warfare. Goodness of fit tests are derived which verify the validity of the MPD, and reinforce the notion that multinomial allocation is too simplistic for such combat models. Simulations to determine optimal allocations for minimal combat cost are applied in order to illustrate the role of the MPD in combat modeling. © 2001 John Wiley & Sons,Inc. Naval Research Logistics 48: 1–17, 2001     

Iterative coloring extension of a maximum clique

In this paper we present an improved branch and bound algorithm for the vertex coloring problem. The idea is to try to extend the coloring of a maximum clique to its adjacent vertices. If this succeeds, its successive neighbors are considered; in case of failure (i.e., in the case the initial colors are not sufficient), working on the subgraph induced by the maximum clique and its neighborhood, the lower bound is improved by seeking for an optimal coloring of this subgraph by branch and bound. The process is repeated iteratively until the whole graph is examined. The iterative scheme exploits a further lower bound obtained by integrating a simple algorithm into the maximum clique search, and a new method to compute upper bounds on subgraphs. Furthermore, a new branching rule and a method for the selection of the initial maximum clique are presented. Extensive computational results and comparisons with existing exact coloring algorithms on random graphs and benchmarks are given. © 2001 John Wiley & Sons, Inc. Naval Research Logistic 48: 518–550, 2001     

协同空战的最小共享信息集

首先提出了最小共享信息集的概念。然后 ,提出了作战飞机的智能系统模型。从它入手 ,分析了协同空战的信息 ,提出了确定协同空战的最小共享信息集的事件法 ,并应用信息论证明了事件法的确能够减少通信的信息量。在上述基础上 ,确定了超视距空对空协同作战的最小共享信息集 ;仿真结果验证了它的合理性     

PSpice模型用于电爆炸丝的数值模拟

根据细铜丝通过大电流时发生爆炸而导致电阻率的急剧变化的实验数据,建立了其PSpcie电路模型。然后将这个模型应用于一个含电爆炸丝断路开关的电感储能脉冲功率电路,以探讨电爆炸丝的参数选择对脉冲功率调制系统的影响。研究表明电爆炸丝长度主要控制电流切断的效果,而电爆炸丝的根数或截面积主要控制电爆炸丝切断的时刻,并且初始电压愈大,切断愈迅速,在负载上获得更高的电压。这些结论可以较好地解释实验结果。     

Selecting T for a periodic review inventory model with staggered deliveries

Consider a single‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. Orders can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T periods, one audits the current stock level and decides on deliveries for the next T periods, thus incurring a fixed audit cost and—when one schedules deliveries—a fixed order cost. The problem is to find a review period T and an ordering policy that satisfy the average cost criterion. The current article extends an earlier treatment of this problem, which assumed that the fixed order cost is automatically incurred once every T periods. We characterize an optimal ordering policy when T is fixed, prove that an optimal review period T** exists, and develop a global search algorithm for its computation. We also study the behavior of four approximations to T** based on the assumption that the fixed order cost is incurred during every cycle. Analytic results from a companion article (where μ/σ is large) and extensive computational experiments with normal and gamma demand test problems suggest these approximations and associated heuristic policies perform well when μ/σ ≥ 2. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 329–352, 2000