异构资源类型下多无人机任务分配

针对多无人机在执行侦察、打击任务的过程中携带任务资源的异构性,以及任务对于异构资源的要求,设计了一种改进的基于共识的捆绑算法(consensus-based bundle algorithm, CBBA)。考虑任务价值、任务执行时间窗以及航程代价等条件建立了多无人机对地目标侦察、打击任务分配模型。利用K-medoids聚类分析方法对多无人机进行基于距离和携带资源平衡的聚类,以解决多无人机对于异构资源类型的要求。对打击任务进行子任务生成,并利用改进后的CBBA求解所建立的任务分配模型,通过对比仿真实验验证了算法的可行性和有效性。     

A branch and bound algorithm for the minimum storage‐time sequencing problem

The minimum storage‐time sequencing problem generalizes many well‐known problems in combinatorial optimization, such as the directed linear arrangement and the problem of minimizing the weighted sum of completion times, subject to precedence constraints on a single processor. In this paper we propose a new lower bound, based on a Lagrangian relaxation, which can be computed very efficiently. To improve upon this lower bound, we employ a bundle optimization algorithm. We also show that the best bound obtainable by this approach equals the one obtainable from the linear relaxation computed on a formulation whose first Chvàtal closure equals the convex hull of all the integer solutions of the problem. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 313–331, 2001     

基于因子分解和光束法平差从航空序列图像恢复三维结构

从航空序列图像恢复目标三维结构是航空摄影测量的基本问题。针对现有算法中精度与计算量的矛盾,提出一种基于因子分解与光束法平差的新算法。作为因子分解与光束法平差的桥梁,提出基于"R T"模式共线方程的概念,详细推导了其线性化公式。仿真实验和真实图像实验表明,新算法精度高、稳定性好,可应用于航空测绘、虚拟现实、军事侦察等工程实践。     

基于卫星编队序列图像的摄影测量

在现代卫星摄影测量中,由多颗小卫星组成的卫星编队具有比单颗卫星更优越的性能,能提供更高的空间分辨率和时间分辨率。卫星编队拍摄的序列图像可组成多轨道区域网,通过区域网光束法平差解算就可以获得目标点坐标。介绍了几种适于卫星摄影测量的卫星编队,讨论了影响卫星摄影测量精度的几个因素,给出了仿真实验结果,所得结论可为发展基于卫星编队的摄影测量提供参考。     

Some implications of pricing bundles

In this article, we consider a problem in which two suppliers can sell their respective products both individually and together as a bundle, and study the impact of bundle pricing. Four pricing models (centralized, decentralized, coop–comp, and comp–coop) are analyzed with regard to the competition formats and sequences. As one would expect, the firms are always better off when pricing decisions are centralized. However, rather surprisingly, we find that firms may be worse off if the bundle prices are set in a cooperative way; we provide analytical characterization of those instances. Numerical studies show that these insights also hold for some nonlinear demand. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Two-agent scheduling with linear resource-dependent processing times

This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms.