Satellite constellation design for forest fire monitoring via a stochastic programing approach

There is significant value in the data collected by satellites during and after a natural disaster. The current operating paradigm in practice is for satellites to passively collect data when they happen to fly over a disaster location. Conversely, this article considers the alternative approach of actively maneuvering satellites to fly directly overhead of the disaster site on a routine basis. Toward this end, we seek to compute a satellite constellation design that minimizes the expected maneuver costs for monitoring an unknown forest fire. In this article, we present a 2‐stage stochastic programing model for this problem as well as a accelerated L‐shaped decomposition approach. A comparison between our approach and the current operating paradigm indicates that our solution provides longer duration data collections and a greater number of data collections. Analysis also shows that our proposed solution is robust over a wide array of scenarios.     

基于威胁联网环境的一种无人机航迹重规划方法

威胁联网环境中,无人机需要对运动威胁进行规避以安全到达终点。通过建立无人机和威胁的运动模型,并对每一时刻无人机和运动威胁的相对位置进行实时分析;提出了一种基于可飞性分析的航迹重规划方法;最后对该方法进行仿真实验。仿真结果表明,该方法增强了无人机对运动威胁的规避能力。     

基于威胁路径的报警关联分析方法

大量的误报大大降低了现有网络入侵检测系统的实用性,利用报警日志之间的逻辑关系是降低误报率的方法之一。提出了威胁路径的概念,在此基础上提出了基于因果关系的关联分析方法。利用网络的背景信息,发掘报警日志记录之间的逻辑关系,进一步提高报警的准确性,降低误报率。经实验验证,该方法可有效降低网络入侵检测系统误报率,并可用于辅助分析网络入侵过程。     

Workload distribution of discrete‐time parallel queues with two servers

We study discrete‐time, parallel queues with two identical servers. Customers arrive randomly at the system and join the queue with the shortest workload that is defined as the total service time required for the server to complete all the customers in the queue. The arrivals are assumed to follow a geometric distribution and the service times are assumed to have a general distribution. It is a no‐jockeying queue. The two‐dimensional state space is truncated into a banded array. The resulting modified queue is studied using the method of probability generating function (pgf) The workload distribution in steady state is obtained in form of pgf. A special case where the service time is a deterministic constant is further investigated. Numerical examples are illustrated. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 440–454, 2000     

具有节点失效的网络可靠度的信息交互算法

提出了一种用于计算具有节点失效的网络可靠度的新计算方法。该算法依据不交化代数及协同计算的思想,采用节点信息义互的方法直接获得网络的不交化最小路集。算法简便易行,具有分布计算的特点,为大型网络系统的可靠性度计算提供了一种新的途径。     

Discrete equal‐capacity p‐median problem

This paper examines the discrete equal‐capacity p‐median problem that seeks to locate p new facilities (medians) on a network, each having a given uniform capacity, in order to minimize the sum of distribution costs while satisfying the demand on the network. Such problems arise, for example, in local access and transport area telecommunication network design problems where any number of a set of p facility units can be constructed at the specified candidate sites (hence, the net capacity is an integer multiple of a given unit capacity). We develop various valid inequalities, a separation routine for generating cutting planes that are specific members of such inequalities, as well as an enhanced reformulation that constructs a partial convex hull representation that subsumes an entire class of valid inequalities via its linear programming relaxation. We also propose suitable heuristic schemes for this problem, based on sequentially rounding the continuous relaxation solutions obtained for the various equivalent formulations of the problem. Extensive computational results are provided to demonstrate the effectiveness of the proposed valid inequalities, enhanced formulations, and heuristic schemes. The results indicate that the proposed schemes for tightening the underlying relaxations play a significant role in enhancing the performance of both exact and heuristic solution methods for this class of problems. © 2000 John & Sons, Inc. Naval Research Logistics 47: 166–183, 2000.     

基于路径跟踪的平流层飞艇柔性编队控制

建立平流层飞艇驻空阶段动力学模型,在定高飞行前提下,采用小扰动方法对动力学方程进行线性化处理。提出采用路径跟踪的平流层飞艇柔性领航-跟随编队控制方法,领航者和跟随者通过速度控制与航向控制,分别跟踪保持特定距离的参考路径,实现编队的柔性控制。以采用直线路径跟踪和采用圆路径跟踪的三平流层飞艇编队控制为例,对提出的柔性编队控制方法进行仿真验证。仿真结果表明:提出的路径跟踪方法控制精度高,提出的柔性编队控制方法可以实现编队稳定运行,避免编队成员碰撞现象的发生。     

Optimal motion planning in rapid‐fire combat situations with attacker uncertainty

This article provides a modeling framework for quantifying cost and optimizing motion plans in combat situations with rapid weapon fire, multiple agents, and attacker uncertainty characterized by uncertain parameters. Recent developments in numerical optimal control enable the efficient computation of numerical solutions for optimization problems with multiple agents, nonlinear dynamics, and a broad class of objectives. This facilitates the application of more realistic, equipment‐based combat models, which track both more realistic models, which track both agent motion and dynamic equipment capabilities. We present such a framework, along with a described algorithm for finding numerical solutions, and a numerical example.     

翼伞系统线目标归航方法

针对运载火箭助推器或子级无控坠落地面落点散布较大的情况,提出一种翼伞系统的线目标归航方法。建立了矩形边界下的归航计算模型,对点目标归航和线目标归航两种方法进行了收缩区域分析;对翼伞归航能力、落区散布边界特征对归航性能的影响进行对比分析,得到了相应的归航策略,并提出在较大散布区域下设置多个着陆区域的工程解决方案;建立动力学和操纵控制模型,对线目标归航过程进行了仿真。结果表明,所提方法对工程有一定的参考价值。     

Capacity expansion under a service‐level constraint for uncertain demand with lead times

For a service provider facing stochastic demand growth, expansion lead times and economies of scale complicate the expansion timing and sizing decisions. We formulate a model to minimize the infinite horizon expected discounted expansion cost under a service‐level constraint. The service level is defined as the proportion of demand over an expansion cycle that is satisfied by available capacity. For demand that follows a geometric Brownian motion process, we impose a stationary policy under which expansions are triggered by a fixed ratio of demand to the capacity position, i.e., the capacity that will be available when any current expansion project is completed, and each expansion increases capacity by the same proportion. The risk of capacity shortage during a cycle is estimated analytically using the value of an up‐and‐out partial barrier call option. A cutting plane procedure identifies the optimal values of the two expansion policy parameters simultaneously. Numerical instances illustrate that if demand grows slowly with low volatility and the expansion lead times are short, then it is optimal to delay the start of expansion beyond when demand exceeds the capacity position. Delays in initiating expansions are coupled with larger expansion sizes. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009