梯格形自适应控制

本文讨论并解决了具有d步时延的多变量系统的梯格形自适应控制问题。为此,把自适应控制下的闭环系统嵌入到ARMA模型中,采用梯格算法进行预报。为了考虑d步时延控制系统,采用简捷方法推导了d步梯格预报公式,并给出了控制量的确定方法。采用梯格形自适应控制可方便地调节模型的阶次,从而可以克服对象阶次不准引起的自适应控制失效的问题。     

大型空间结构姿态动力学和控制

本文提出了一个带大型太阳帆板的飞船和一个带液体贮箱的飞船对接而成的大型空间结构,采用有限元法和模态综合法建立系统的姿态动力学方程,并进一步设计了一个鲁棒的模型参考自适应控制系统,且对此系统进行了数字仿真。     

战略导弹制导系统精度评估方法及应用研究

本文论述了战略导弹制导系统精度评估方法,并分析了影响制导精度的各种因素;在定性分析的基础上,建立了制导系统的误差模型,并将此模型归纳为线性回归模型;最后,对目前所采用的误差分离方法进行了分析和比较,并将模型参考自适应思想与岭估计方法相结合,形成了模型参考自适应广义岭估计方法,为解决制导系统误差分离问题提供了一条有效途径。     

一种基于范围表示B树的大容量IPv6路由查表算法

IPv6具有巨大的地址空间,未来要面对的将会是海量IPv6路由表,而且128位的IPv6地址比IPv4需要更多的访存数。算法针对IPv6路由查找问题中的这两个难点,提出利用B树高度较低的优良性质,将前缀转化为范围表保存在B树中,并在结点内部利用分段范围比较树算法来减少访存次数和空间耗费。理论分析和实验表明,该算法能够以很好的性能支持IPv6海量路由表的查找。     

高速路由与交换技术现状及发展趋势

多个方向的可扩展特性是新一代互联网的重要特点,这对高性能路由器的性能、规模、功能和服务等能力提出了更高的要求,高速路由与交换技术是承载这种可扩展特性的关键技术。从网络处理器设计、路由查找技术以及高速交换技术三个方面总结了高速路由与交换技术的研究和发展现状,并展望了未来的发展趋势。     

Quantifying optimal mesh and ring design costs

During the last decade telecommunication operators have been deploying WDM (Wavelength Division Multiplexing) technology to satisfy the exponential growth in global communication. While facilitating the advanced information society of today, this has also led to a higher dependency on the networks, and furthermore the high capacity utilization of optical fibers means that a single link failure will influence many users and enterprises. For these reasons, protection of network connections has become a major competitive parameter for the operators. Currently, the most popular protection method is ring protection, due to its simplicity, requiring only basic management functionality and operating with local restoration control. While many optical rings have been deployed, little work has been published on exactly what the cost of ring networks are, compared to general mesh networks. In this article we perform a quantitative comparison between ring protection and mesh protection, using real world network data and realistic prices for network components. Extending classic LP flow models to take rings and node costs into account, and using a link‐path based mesh network LP model, we are able to perform a total cost comparison of the two architectures, and of manual ring network design. The results suggest that the price of mesh network components must be reduced significantly to be competitive with ring based networks, and also that manual network design does not necessarily lead to the most cost‐efficient designs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

基于核函数的自适应聚类背景提取

随着目标的检测与跟踪的广泛应用,移动物体分割问题成为研究热点,而解决这类问题的关键需为对图像背景的更新和提取。通过对目前已有的背景提取方法的研究,提出了一种新的基于核函数的背景提取方法:进行预处理,制定删选法则来自适应获取所需处理的视频序列;定义核函数来衡量模式间相似性,对2类聚类中心进行初始化;利用最小距离准则来灰度归并,采取实时的自适应阈值选择;最后通过比较满足条件的像素总数,获取所需背景。实验证明,该方法有效。     

星上路由查找设计与算法实现

针对星上路由器的路由查找功能展开研究。通过分析比较多种路由查找算法,利用软硬件协同设计的思想,给出了星上路由查找的设计与适合硬件查找的Trie树实现。给出了算法实现程序,通过实例分析了算法的优点。结果表明设计可以满足宽带卫星通信系统业务的需求。     

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     

Averaging frameworks for simulation optimization with applications to simulated annealing

We present two frameworks for designing random search methods for discrete simulation optimization. One of our frameworks is very broad (in that it includes many random search methods), whereas the other one considers a special class of random search methods called point‐based methods, that move iteratively between points within the feasible region. Our frameworks involve averaging, in that all decisions that require estimates of the objective function values at various feasible solutions are based on the averages of all observations collected at these solutions so far. Also, the methods are adaptive in that they can use information gathered in previous iterations to decide how simulation effort is expended in the current iteration. We show that the methods within our frameworks are almost surely globally convergent under mild conditions. Thus, the generality of our frameworks and associated convergence guarantees makes the frameworks useful to algorithm developers wishing to design efficient and rigorous procedures for simulation optimization. We also present two variants of the simulated annealing (SA) algorithm and provide their convergence analysis as example application of our point‐based framework. Finally, we provide numerical results that demonstrate the empirical effectiveness of averaging and adaptivity in the context of SA. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012