A generic model of motor‐carrier fuel optimization

Fuel optimizers are decision models (software products) that are increasingly recognized as effective fuel management tools by U.S. truckload carriers. Using the latest price data of every truck stop, these models calculate the optimal fueling schedule for each route that indicates: (i) which truck stop(s) to use, and (ii) how much fuel to buy at the chosen truck stop(s) to minimize the refueling cost. In the current form, however, these models minimize only the fuel cost, and ignore or underestimate other costs that are affected by the models' decision variables. On the basis of the interviews with carrier managers, truck drivers, and fuel‐optimizer vendors, this article proposes a comprehensive model of motor‐carrier fuel optimization that considers all of the costs that are affected by the model's decision variables. Simulation results imply that the proposed model not only attains lower vehicle operating costs than the commercial fuel optimizers, but also gives solutions that are more desirable from the drivers' viewpoint. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于垂直线列阵的深海被动目标定深误差

首先研究了在深海环境下,采用三阵元垂直线列阵水声探测系统进行被动目标定深的基本原理。然后分别从随机误差、阵元配置偏差和相干多途水声信道干扰的角度,对被动目标定深的误差源进行了理论分析,并推导了相关公式。通过仿真实验,总结出各误差源对被动目标定深精度影响的规律,为进一步开展被动目标定深研究、提高被动目标定深精度奠定了基础。     

A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

基于循环子空间理论的线性系统测试矩阵优化

研究了线性定常系统在循环指数大于1(即其约当标准形不同的约当块有重根)的情况下测试矩阵的优化方法.以循环子空间相关定理的证明为基础,根据根向量链的相关特性,得到了测试向量的线性和与系统观测性的直接关系,给出了在保证系统可观测性的同时,使得测试代价最小的测试矩阵优化方法.算例表明,提出的方法简单直观,对配置测试向量具有良好的工程价值.     

Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.     

垂直线列阵无源定位精度分析

提出了一种基于垂直线阵的系统,给出了定位模型,并简要介绍了其定位原理.利用由时延引入的距离、高低角和观测得到的方位角信息,建立了三维坐标系下的状态方程和观测方程.通过理论分析和仿真计算,讨论了声速测量误差、时延估计误差和阵元位置误差对系统定位精度的影响,给出了时延估计误差的克拉美-罗下界.综合时延估计、基线横纵扰动、三类误差的影响,在一定条件下,对目标距离估计的相对误差可控制在20%以内.     

光顺样条函数的再生核表示与计算

光顺样条是散乱数据拟合的理想函数,是噪声数据最优平滑的重要工具。因此,光顺样条的数学表示和计算的研究具有重要的意义。本文在一般的线性微分算子和线性泛函的情况下讨论光顺样条函数的构造和计算,通过构造一个适当的再生核Hilbert空间,使得所讨论的微分算子光顺样条成为该空间中的最小范数问题,再利用投影理论建立了光顺样条函数的再生核表示方法,并得到了插值偏差表达式。作为特例,还给出了奇次多项式光顺样条函数新的简洁的计算方法。     

一类线性规划模型的求解方法

应用矩阵理论知识得到了一类特殊的线性规划模型的相关定理,给出了一种简便求解方法,讨论了求解方法的推广问题.     

基于图像信息的多特征空间坦克姿态估计

坦克作为地面战场的主要目标,分析其姿态至关重要。根据坦克姿态估计的需要,在可见光条件下采集了坦克车体纵轴与瞄准镜光轴不同夹角的图像作为训练集。利用主成分分析法选取了目标的主要特征向量,每个训练子集用3个特征向量表示,利用少量的特征向量建立目标的8个特征空间,降低了空间的维数。设计判别准则将待识别目标向量与重构向量之间的余弦值进行比较,即确定目标所在的空间位置,完成了目标姿态的识别。实验结果表明,利用建立目标多特征空间的方法识别目标空间位置是有效的。     

模糊时滞系统控制器依赖于状态时滞的H∞控制

针对一类非线性时滞系统，研究了该系统基于T—S模糊模型的H∞控制器设计问题。采用线性矩阵不等式LMI的方法，设计一个依赖于状态时滞的模糊控制器，得到了系统存在模糊控制器的充分条件，此充分条件等价于一类线性矩阵不等式的可解性，最后通过仿真说明了控制器的有效性。