The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

相位非线性畸变对GPS伪距测量的影响

基于直接序列扩频体制的伪距测量在卫星导航、雷达、航天测控、深空探测等领域获得了广泛应用.射频链路、电缆多径等引入的相位非线性畸变会对扩频信号的传输时延产生影响,进而影响延迟锁定环(DLL)的伪距测量结果.传统群时延的定义难以描述一定带宽内的相位畸变,也难以与扩频信号时延建立对应关系.在对相频曲线进行Taylor展开的基础上给出了群时延的新定义,利用零阶群时延、线性群时延和抛物线群时延等来描述相位畸变,并定量研究各阶群时延对DLL伪距测量的影响.所得结论表明抛物线(二阶)群时延对伪距测量的影响最大.     

车辆悬挂系统的主动优化控制器设计及仿真

基于特征结构配置参数化结果,提出了车辆悬挂系统的主动优化控制器设计方法。该方法直接基于车辆悬挂系统的参数矩阵,便于工程应用。车辆悬挂系统的仿真实例表明所提主动优化控制器设计方法简单且有效。     

船体结构刚度对桅杆振动特性的影响及控制

采用Euler Bellouli梁理论推导出桅下船体结构旋转刚度和桅杆首阶固有频率参数之间的关系.用桅下船体结构的旋转刚度kα和桅杆参数EIl的比值判断桅下船体结构的旋转刚度对首阶固有频率的影响,对一个安装在不同旋转刚度基础上的桅杆实例进行了有限元计算,找出了桅下船体结构旋转刚度的合理设计范围.有限元软件仿真计算结果表明,合理地选择kα值可使桅杆首阶振动频率得到主动控制.     

基于 ∆TOA 和方位角测量辅以间歇高度信息的双基地定位跟踪技术

本文讨论了双基地雷达系统中一种以收站△TOA和方位角测量为基础并辅以发射站传送的间歇高度信息的运动目标三维定位跟踪算法,详细分析了该技术的定位原理。在电子对抗条件下,发射站数据往往难以连续传送到接收站加以融合,因此有必要对间断传送的数据加以利用的方法进行研究。本文通过典型目标航迹的计算机仿真对该算法的性能做了评估。由于这种融合方法在双基地研究领域尚属初探,因此有待于在今后的研究中加以完善。     

遥控武器站的自抗扰控制

遥控武器站系统是一个具有强后坐力、变摩擦力和变转动惯量的非线性系统,采用自抗扰控制技术对该系统进行稳定控制.系统利用自抗扰控制器的扩张状态观测器,对系统未建模特性和不确定性外扰进行动态估计和反馈补偿,提高了系统的抗干扰能力.实物系统稳定控制实验结果表明,所设计的自抗扰控制器具有良好的动态品质和较强的抗干扰性能,系统实现...     

基于频域分离的拖曳式诱饵与目标辨识

诱饵与目标的辨识是拖曳式诱饵干扰对抗的基本问题.干扰过程中导弹、目标、诱饵三角几何关系的变化导致了目标与诱饵的多普勒频率存在差异,为从频域实现目标与诱饵的分辨提供了可能.在详细分析迎头及尾追场景下目标与诱饵频域可分性的基础上,采用L类魏格纳分布(LWVD),利用其能够提高方位向分辨率和抑制交叉项的优点,实现了导引头波束...     

基于Digital UNIX平台的实时数字引导实现方法

根据导弹飞行试验任务中对测控设备进行数字引导的实际需求,介绍了数字引导在飞行试验任务中的作用和基于Digital UNIX平台实现对测控设备数字引导的原理,从确保数字引导实时性、引导数据可靠性、引导外推点确定及修正引导方法四个方面介绍实现数字引导的关键技术,为导弹飞行试验任务中确保测量设备及时捕获和跟踪目标,成功地实现数字引导提供了实用的实现方法。     

高炮旅(团)作战面向对象Petri网模型

概要分析了高炮旅(团)指挥控制与信息处理分发过程,对基本Petri进行扩展构建了面向对象Petri网模型,采用其分层次构建了高炮旅(团)作战OPN模型,较好地实现了对传统指控体制下高炮群作战与信息分发过程的静态与动态描述,为下一步具体仿真实现,找出现有传统指控体制存在的薄弱环节,进行相应改进提供了基础和依据。