Route optimization for multiple searchers

We consider a discrete time‐and‐space route‐optimization problem across a finite time horizon in which multiple searchers seek to detect one or more probabilistically moving targets. This article formulates a novel convex mixed‐integer nonlinear program for this problem that generalizes earlier models to situations with multiple targets, searcher deconfliction, and target‐ and location‐dependent search effectiveness. We present two solution approaches, one based on the cutting‐plane method and the other on linearization. These approaches result in the first practical exact algorithms for solving this important problem, which arises broadly in military, rescue, law enforcement, and border patrol operations. The cutting‐plane approach solves many realistically sized problem instances in a few minutes, while existing branch‐and‐bound algorithms fail. A specialized cut improves solution time by 50[percnt] in difficult problem instances. The approach based on linearization, which is applicable in important special cases, may further reduce solution time with one or two orders of magnitude. The solution time for the cutting‐plane approach tends to remain constant as the number of searchers grows. In part, then, we overcome the difficulty that earlier solution methods have with many searchers. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Nonlinear pricing with consumer satiation

In various scenarios, consumers may become satiated with products, and the degree of satiation is directly associated with their prior experiences. Confronted with consumer satiation, the seller is unable to either identify consumers who have a higher likelihood of being satiated ex ante or distinguish satiated from non‐satiated consumers ex post. Therefore, the seller should address dynamic selling, valuation uncertainty, and quantity decisions, all of which are important operational issues. We consider a two‐period problem in which consumer types are influenced by their prior consumption experiences. Faced with these consumers, the seller intends to optimize quantities and adjust the prices of the products in each period to maximize revenue. We find that the seller may reduce ex ante production quantity as some consumers become satiated. Moreover, the ex ante quantity is first decreasing and then increasing with regard to the satiation rate. Furthermore, two‐period information asymmetries may provide a rationale for upward distortion in quantity when consumer preferences are highly sensitive to first‐period consumption. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 386–400, 2016     

纯方位角目标运动分析的可观测性研究

纯方位角目标运动分析的可观测性是纯方位角观测系统中的一个基本问题.只有解决了系统的可观测性,才能进行有效的目标定位及跟踪.从随机系统的角度分析了纯方位角观测系统的可观测性,引入状态参量的Fisher信息矩阵作为判断系统可观测性的依据,提出了完全不同于判定确定性系统可观测性的随机观测系统可观测性的判定方法.最后给出了一个静止目标纯方位角观测系统的实例,说明了该方法的有效性.     

车辆运动模拟器运动参数实时监测系统

针对车辆运动模拟器运动参数的实时测量要求研制了一套计算机实时在线监测系统,介绍了监测系统的组成和功能,通过对车辆运动模拟器油缸位移的分析,推导了模拟器运动参数的理论解算方法,并从数据通讯、处理和管理等方面对监测软件进行分析与设计,从而实现了模拟器运动参数监测模式的多样化。     

运动矢径对AUV协同定位精度影响的仿真

针对在基于运动矢径的自主水下航行器(AUV)协同定位算法中运动矢径对定位精度的影响进行了仿真分析.利用扩展卡尔曼滤波设计了AUV协同定位算法,通过设定不同的运动矢径对该协同定位算法进行仿真,分析研究了运动矢径的变化对定位精度的影响.仿真结果表明,该定位算法受运动矢径的影响,增大运动矢径会使滤波误差波动变大,降低定位精度.     

某型飞机起落架收放机构性能仿真

为了验证某型飞机起落架收放机构采用理论计算值的收放性能,建立了该型飞机起落架收放机构的数学模型,采用起落架三维模型和收放作动筒、下落加速器的一维模型进行联合仿真。结果表明:采用理论计算值能够实现起落架在有限时间里的收放任务,各部件在收放运动中无干涉。此外,利用该联合仿真模型研究了收放作动筒、下落加速器结构参数对起落架收放性能的影响,指出收放作动筒活塞截面积和下落加速器活塞杆腔截面积可作为优化设计的优先选取参数,为该型飞机起落架收放机构性能的进一步优化提供参考。     

一种改进的运动目标检测方法

提出的运动目标检测方法是基于动态阈值二值化图像,将帧差法与背景差法相融合,最终检测并提取出运动目标。通过VC++开发平台编程,并对监控图像中的运动目标进行检测实验,结果表明该方法与基于固定阈值二值化图像的方法相比能够更精确地检测出监控图像中的运动目标,且具备一定的鲁棒性。     

锁相环在电流隔离测量中的应用研究

探讨了采用锁相环频率跟踪,通过环路补偿达到磁平衡的方法,隔离测量直流和低频、中频交流电流,利用磁性材料自身特性,进行温度补偿,用低成本达到较高的稳定度和测量精度.     

稀土永磁减振器特性的数值模拟分析

简要介绍了目前稀土永磁减振器的研究现状和单质量稀土永磁减振器的结构与工作原理,运用大型有限元软件ANSYS对稀土永磁减振器的工作过程进行数值模拟,分析其在工作过程中的磁通密度、磁力线分布、力学特性以及它们之间的相互关系。研究表明:稀土永磁减振器具有较好的非线性减振效果;ANSYS在模拟稀土永磁减振器工作过程时,能形象直观的反映其在工作过程中的各种特性参数。     

纯方位系统TMA非线性最小二乘法——理论数学模型与常规算法

对非线性最小二乘法应用于纯方位系统目标运动分析进行了综合评述,介绍了经典的非线性最小二乘法及几种常规算法：高斯—牛顿迭代法,麦夸脱迭代法,自适应非线性最小二乘法,给出了非线性最小二乘法对纯方位目标运动分析的四个数学模型：高度非线性模型,减弱非线性模型,再减弱非线性模型,再进一步减弱非线性模型。