GPS/INS全组合制导火箭弹姿态仿真研究

建立了状态变量为15维的组合系统动态方程,对运用GPS姿态测量系统的GPS/INS组合导航系统进行了分析,得出了增加不同种类的外部导航信息观测量将有效提高惯导系统误差修正能力的结论.应用卡尔曼滤波方法对GPS姿态测量系统信息对惯性导航系统的误差修正能力进行了仿真.仿真结果表明,GPS姿态信息的引入可以大大提高制导火箭弹的航向测量精度,能较好地改善INS的导航性能.     

GPS姿态测量技术综述

利用GPS进行载体姿态测量是GPS应用的重要分支,是目前国内外研究的热点之一.与传统的姿态测量系统相比,GPS姿态测量系统成本低廉,精度适中.与GPS定位技术相比,它是GPS应用的一个全新领域.文中综述了目前正受到广泛重视的多天线GPS姿态测量技术,并提出了该技术研究发展的方向.     

用GPS标校平台罗经方位安装误差与航向精度测量

提高实船平台罗经方位安装精度是超视距作战系统的需要 ,为此提出用GPS标校平台罗经新方案。该方案曾在某国制造的导弹艇上首次进行了实船检验 ,取得了圆满成功。主要介绍该方案的具体操作方法、数据处理、误差分析及总结的初步经验。     

基于UKF算法的SINS/GPS全组合导航系统研究

将UKF算法用于低成本的SINS/GPS全姿态组合导航系统中,提出了一种GPS测量姿态角的方法,推导了姿态角误差与平台失准角的关系,建立了系统的非线性误差模型,设计了UKF滤波器。仿真结果表明,通过将UKF算法用于SINS/GPS全姿态组合导航系统中,系统的可观测性得到了改善,提高了导航精度。     

平台罗经自动测试系统（PLTS）的研究

平台罗经自动测试系统用于ＰＬ－Ⅰ型平台罗经的性能测试和故障诊断,本文介绍该系统的结构、性能、特点及软硬件组成。     

高超声速飞行器组合导航系统研究

为提高高超声速飞行器的导航精度,在SINS/GPS位置、速度组合导航模型基础上增加了GPS姿态信息,推导了姿态算法中姿态角误差与平台误差角的关系。通过理论分析说明了其可消除数学模型误差,提高系统的姿态精度,并以此建立了SINS/GPS组合导航系统姿态、位置、速度观测方程。通过仿真验证了该算法的有效性,结果表明SINS/GPS姿态、位置、速度组合导航可以有效提高高超声速飞行器导航定位精度。     

基于小波变换的外测设备动态精度评估方法

为了解决传统的变量差分法或最小二乘拟合残差方法评估外测设备动态精度引入模型误差问题,提出了基于小波变换的外测设备动态精度评估方法.对残差序列的小波基函数选择及系统误差和随机误差分离技术进行了理论分析,并应用某设备的残差序列数据实验验证,取得了基于小波变换和变量差分方法的残差信号系统误差与随机误差以及设备精度指标.结果表明:基于小波变换评估外测设备动态精度无模型误差,计算的设备精度指标符合设备测量特性,基于变量差分的评估方法将模型误差引入到设备综合误差上,导致设备误差变大,影响精度评定的准确性.通过对比分析,更加证明了基于小波变换的外测设备动态精度评估方法的科学、准确.     

高动态GPS模拟器通道时延校正研究

高动态GPS卫星信号模拟器可以根据GPS接收机的动态环境,精确产生接收机收到的GPS卫星信号。GPS卫星信号模拟器有多种技术要求,其中,通道的时延一致性的测量和修正是研制模拟器所必须解决的一项关键技术。本文给出了测量模拟器通道硬件时延的一种新的方法,同时,为进一步提高测量精度,测试接收机采用了载波相位平滑伪距的方法。试验结果证明了所提方法的有效性。     

某型飞机大气数据系统设计

大气数据系统是重要的机载电子设备,其性能、精度直接关系到飞机的飞行安全.在介绍某型号飞机大气数据系统的软硬件体系结构的基础上,从三个方面深入研究了提高大气数据系统精度的途径:大气数据计算模型;基于BP神经网络的压力测量温度误差补偿方法;一种计算型静压源误差补偿方法.其大气数据系统系统性能稳定,结构紧凑,速度快,精度高,软硬件升级简单.试验证明其大气数据系统能很好满足某型号飞机的使用要求.     

GPS姿态测量系统对惯性导航系统误差修正能力分析

针对惯性导航系统(INS)存在积累误差的缺陷,运用GPS姿态测量辅助修正方法对INS误差进行补偿来进一步提高INS的定位精度.通过对INS系统可观测性进行分析,得出增加不同种类的外部导航信息观测量将有效提高INS误差修正能力的结论.研究了船用INS与GPS姿态测量系统组合的组合导航系统,并对GPS姿态测量系统信息对惯性导航系统的误差修正能力进行了仿真.仿真结果证实上述方法可有效提高INS的定位精度.     

作战指挥系统软件动态定义和动态重组设计

对作战指挥系统软件的功能模块进行分析,引入软件构件开发的思想,采用COM/DCOM构件技术,在现有软件系统中增加远程管理构件,通过客户端程序对远程服务器管理构件的访问,动态管理远程机器上运行的作战指挥系统软件功能模块,使得作战指挥系统软件的各个功能模块能够稳定运行,使分布式作战指挥系统软件具有动态定义、动态重组、动态管理等功能,大大提高了作战指挥系统软件的可靠性和可交互性,使作战指挥系统软件达到了互连、互通、互操作性的目的.     

Approximate dynamic programming methods for an inventory allocation problem under uncertainty

We propose two approximate dynamic programming methods to optimize the distribution operations of a company manufacturing a certain product at multiple production plants and shipping it to different customer locations for sale. We begin by formulating the problem as a dynamic program. Our first approximate dynamic programming method uses a linear approximation of the value function and computes the parameters of this approximation by using the linear programming representation of the dynamic program. Our second method relaxes the constraints that link the decisions for different production plants. Consequently, the dynamic program decomposes by the production plants. Computational experiments show that the proposed methods are computationally attractive, and in particular, the second method performs significantly better than standard benchmarks. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Optimal empty vehicle redistribution for hub‐and‐spoke transportation systems

This article considers the empty vehicle redistribution problem in a hub‐and‐spoke transportation system, with random demands and stochastic transportation times. An event‐driven model is formulated, which yields the implicit optimal control policy. Based on the analytical results for two‐depot systems, a dynamic decomposition procedure is presented which produces a near‐optimal policy with linear computational complexity in terms of the number of spokes. The resulting policy has the same asymptotic behavior as that of the optimal policy. It is found that the threshold‐type control policy is not usually optimal in such systems. The results are illustrated through small‐scale numerical examples. Through simulation the robustness of the dynamic decomposition policy is tested using a variety of scenarios: more spokes, more vehicles, different combinations of distribution types for the empty vehicle travel times and loaded vehicle arrivals. This shows that the dynamic decomposition policy is significantly better than a heuristics policy in all scenarios and appears to be robust to the assumptions of the distribution types. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于DIFHA算子的动态直觉模糊多属性群决策方法

动态决策问题是现实中的一类常见问题。在提出动态直觉模糊混合平均(D IFHA)算子的基础之上,提供一种动态直觉模糊多属性群决策方法。该方法能同时考虑决策过程的阶段性和属性值位置对决策结果的影响,并较好地处理决策过程中的定性指标。分析和算例证实该方法的可行性和实用性。     

Dynamic pricing and matching in ride-hailing platforms

Ride-hailing platforms such as Uber, Lyft, and DiDi have achieved explosive growth and reshaped urban transportation. The theory and technologies behind these platforms have become one of the most active research topics in the fields of economics, operations research, computer science, and transportation engineering. In particular, advanced matching and dynamic pricing (DP) algorithms—the two key levers in ride-hailing—have received tremendous attention from the research community and are continuously being designed and implemented at industrial scales by ride-hailing platforms. We provide a review of matching and DP techniques in ride-hailing, and show that they are critical for providing an experience with low waiting time for both riders and drivers. Then we link the two levers together by studying a pool-matching mechanism called dynamic waiting (DW) that varies rider waiting and walking before dispatch, which is inspired by a recent carpooling product Express Pool from Uber. We show using data from Uber that by jointly optimizing DP and DW, price variability can be mitigated, while increasing capacity utilization, trip throughput, and welfare. We also highlight several key practical challenges and directions of future research from a practitioner's perspective.     

动态拓扑图的卫星网络可视化方法

针对高度动态变化的卫星网络,提出一种基于动态拓扑图的可视化方法。动态拓扑图可视化的难点在于如何保持动态可视化过程中的稳定性,从而使用户容易地感知到网络中所发生的拓扑变化。根据卫星网络的动态变化特点,构建连续的动态拓扑图模型;设计一种保持布局稳定性的策略,并基于力引导思想提出一种动态拓扑图布局算法;以Iridium系统为典型实例,验证本文的可视化方法的合理性和可行性。实验表明,该方法能够以清晰的可视化图像支持用户对卫星网络动态拓扑的感知和理解。     

大口径机枪结构动力学建模方法研究

总结了我国近年来关于大口径机枪结构动力学建模方法研究的主要成果,分析了目前建模方法上存在的某些问题以及对武器装备研制的影响,进一步介绍了边界条件的确定、模型正确性判别和载荷识别等方面的新技术。     

Optimal path finding in direction,location, and time dependent environments

This article examines optimal path finding problems where cost function and constraints are direction, location, and time dependent. Recent advancements in sensor and data‐processing technology facilitate the collection of detailed real‐time information about the environment surrounding a ground vehicle, an airplane, or a naval vessel. We present a navigation model that makes use of such information. We relax a number of assumptions from existing literature on path‐finding problems and create an accurate, yet tractable, model suitable for implementation for a large class of problems. We present a dynamic programming model which integrates our earlier results for direction‐dependent, time and space homogeneous environment, and consequently, improves its accuracy, efficiency, and run‐time. The proposed path finding model also addresses limited information about the surrounding environment, control‐feasibility of the considered paths, such as sharpest feasible turns a vehicle can make, and computational demands of a time‐dependent environment. To demonstrate the applicability and performance of our path‐finding algorithm, computational experiments for a short‐range ship routing in dynamic wave‐field problem are presented. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

A sequential dynamic pricing model and its applications

Consider a sequential dynamic pricing model where a seller sells a given stock to a random number of customers. Arriving one at a time, each customer will purchase one item if the product price is lower than her personal reservation price. The seller's objective is to post a potentially different price for each customer in order to maximize the expected total revenue. We formulate the seller's problem as a stochastic dynamic programming model, and develop an algorithm to compute the optimal policy. We then apply the results from this sequential dynamic pricing model to the case where customers arrive according to a continuous‐time point process. In particular, we derive tight bounds for the optimal expected revenue, and develop an asymptotically optimal heuristic policy. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.