一种基于路况预测信息的最小时间路径算法

动态路径规划是实现车辆动态导航的核心技术之一,首先构建了时间依赖动态路网模型,介绍了动态路径导航的实现策略,提出了一种基于道路短时预测信息的最小时间路径规划算法,实验仿真结果表明,该算法能够提供实时、高效、预测性强的规划路径,满足城市交通中用户的需求。     

基于蚁群算法的通信光缆线路优化规划研究

通信光缆线路在进行规划时,包含多个目标,因此,优化规划的复杂性非常高,属于非线性组合优化问题,蚂蚁算法是一种通用启发式的算法,是近年来出现的新型算法,对于组合优化问题能够比较好的求解.在本文中,首先阐述了蚁群算法的优点,接着在蚁群算法的基础上对通信光缆线路优化规划进行研究,目的在于提升通信光缆线路建设的科学性及经济性.     

动态扰动下低轨预警卫星系统任务规划问题分析

论文探索分析了动态扰动下低轨预警卫星系统任务规划问题,讨论了低轨预警系统任务规划中的动态扰动因素,并对其进行定量化描述;提出了低轨预警系统动态任务规划模式,在此基础上研究探讨了系统动态规划中重规划周期的确定方法;建立了动态扰动下低轨预警系统任务规划模型,并将资源扰动下动态规划模型转化为新任务插入下基于二级优化目标的动态规划模型,设计了求解动态规划模型的启发式方法,并进行了实例验证,为动态规划问题研究提供借鉴意义.     

基于周期的低轨预警系统任务动态重规划策略

根据预警系统资源的特点和导弹跟踪任务的实时性和不确定性,天基低轨预警系统任务规划具有动态性的特点。为解决低轨系统动态任务规划问题,提出了低轨预警系统动态任务规划模式,分析了周期重规划调度策略,探讨了系统动态重规划中重规划周期的确定方法,并对其中的弹道预测误差椭球和双星定位精度两个关键问题进行了建模,为动态问题建模求解提供基础。     

智能规划框架下的复杂线路连通检测方法

复杂电气设备在投入使用前必须对线路的连通情况进行检测,传统的方法是依据接线表进行对照检测,操作中存在大量冗余过程,而且人为标记冗余线路易出现漏检现象.提出一种新的线路连通检测方法,应用智能规划理论中的图规划算法,在接线表的基础上生成了专用检线表,在保证线路连通可靠性的同时,去除了冗余信息,提高了工作效率.通过对某航天测绘相机四种线路连通进行测试,去除的冗余线路分别占线路总数的35%、38%、48%和49%,并无漏检发生.     

具有QoS保障的组合服务管理框架

在可信服务中间件架构的基础上设计了一种具有QoS保障的组合服务管理框架,在此框架下提出了QoS规划算法和服务选择算法.利用上层的重协商机制和下层的组合服务调度机制为服务提供双层的QoS保障,以最大化的满足用户的QoS需求.最后通过实验证明了框架和算法的有效性.     

基于本体的网格服务动态组合算法研究

网格服务组合能够实现服务的增值功能。在研究了基于工作流和基于AI规划的网格服务组合的基础上,提出了基于本体的网格服务动态组合算法。描述了动态服务组合框架,对服务组合模型进行了分析。结合服务选择中基于关键字和语义的方法,给出了基于关键字的语义选择算法。根据服务之间的关系,提出了基于最短路径的网格服务组合算法。实验结果表明,该算法是可行和有效的,有较高的执行效率。     

智慧路网监测在高速公路信息化中的应用

文中深入探讨了智慧路网监测在高速公路信息化中的应用，首先对智慧路网监测技术进行了概述，分析了高速公路智慧路网监测在路况监测、交通流量分析、事故检测上的相关应用，分析了智慧路网监测对高速公路信息化的积极影响。其次，探讨了智慧路网监测应用中存在的挑战及解决措施，强调了智慧路网监测在高速公路信息化中的作用，并呼吁进一步合作以推动领域发展，希望为更智能、更安全、更高效的交通系统构建贡献新的思路和方法。     

面向智能导览的个性化线路规划研究

个性化游览线路的规划是智能导览的核心问题之一,景区及景点信息的形式化表示是个性化游览线路自动规划的基础。针对导览线路的自动规划问题,提出一种基于无向图及H-RVT表的、带用户偏好表示的导览线路生成方法。在问题约束及影响因素分析的基础上,首先给出了景区及景点的有向图表示,进而提出基于最大相对价值表的景点信息表示方法,最后给出一种综合考虑起点与终点选择、景点选择和游览时间控制的个性化游览线路自动规划方法。该方法解决了景区、景点及路线生成的形式化表示问题,为路线规划的实现提供了理论支撑。     

基于波峰/波谷动态规划基音标注

提出了一种基于波峰/波谷动态规划的基音标注算法.首先,我们根据区域和转移概率,运用动态规划确定最佳的基音标注,以实现基于波峰或波谷动态规划的基音标注;然后,我们设定一个代价函数来决定采取波峰动态规划的标注还是波谷动态规划的标注.同时,我们通过不同的实验,来显示该文提出的方法的可行性.     

Capacity dimensioning and routing for hybrid satellite and terrestrial systems

Satellite network architecture plays an important role in the success of a satellite business. For future commercial broadband data satellite networks integrated with the terrestrial network, satellite network topology, link capacity, and routing have major impacts on the cost of the network and the amount of revenue the network can generate. To find the most cost-effective satellite network topology, we propose a unified mathematical framework using a two-stage stochastic programming formulation. The solution to the stochastic programming formulation gives optimal link capacities and an optimal routing strategy for different network topologies, taking into account uncertainties in long-term aggregate traffic statistic estimation. Using a simple satellite network example, we show the feasible topology regions for three different satellite topologies and show that, for some parameter values, the hybrid topology is more cost effective than nonhybrid topologies. In the limit of high traffic rejection cost, stochastic dimensioning reduces to static dimensioning. We study worst case static dimensioning for a general geosynchronous earth orbit satellite network and show the feasible topology regions, as well as effective cost comparisons for different topologies. We conclude with a discussion on network cost and architectural flexibility relating to satellite network design.     

基于动态规划法的无线Mesh网络QoS路由算法和性能评价

该文针对时延敏感的多媒体业务吞吐率和传输可靠性的考虑,在无线Mesh网络中,引入动态规划和跨层设计方法设计QoS路由算法。在假设的网络模型上,提出了一个新的基于MAC层信息的综合凸规划路由准则,以及基于此实现的路由算法CPRMQS,详细给出了利用动态规划法解决路由优化问题的算法流程和样例分析。最后通过仿真验证了该算法的可行性,并给出了基于DSR扩展协议的性能评价,其中包括吞吐率和延时等性能。     

面向TCP/IP网络编程实验平台的设计

为了更有效地开展网络编程实验,设计了一个面向TCP/IP的网络编程实验平台,通过对网络编程中的标准函数进行封装,采用模块化的设计思路,降低了网络编程实验的开展难度。对网络编程实验平台的组成及功能实现进行了详细阐述,重点研究了网络编程实验平台中的标准函数开发接口,给出了网络编程的应用过程。平台设计合理,通用性强,通过简化网络编程中的程序代码,使得实验者能够集中精力从事特定的功能代码开发,更有效地辅助用户进行网络编程的实验,具有良好的应用价值。     

多目标动态规划的神经网络方法

本文提出了求解多目标动态规划的神经网络方法,证明了该网络是Ｌｙａｐｕｎｏｖ稳定的,且在适当的条件下收敛于多目标动态规划的（局部）非劣解,最后,文中给出了算例及其模拟结果。     

间断连接无线互联网络中路由问题的动态规划方法

在间断连接无线互联网络中，由于自然干扰或人为因素影响，节点之间无线链路通常在时间上具有间断特性，这就为间断连接无线互联网络的选路问题提出了新的挑战。丈章在链路统计特性的基础上，重点分析了运用动态规划方法求解该问题的基本思路。并且给出了该方法的基本方程，从理论上分析了该方法的正确性和有效性。     

一种新的集成自愈技术及其算法

本文首先提出了容量平衡优化（ＣＥＰ）、共享自愈环（ＳＳＲ）和分布式动态自愈网（ＤＳＨ）三者集成的自愈技术,提出了基于最短路由业务量阵（ＳＲＭＴ）的ＳＳＲ空闲容量分配算法,而对于ＤＳＨ,从端到端重选路由和网络资源利用率的观点看,基于通道恢复技术比基于链路恢复技术更有效,本文提出了基于通道恢复的集成自愈设计技术及其算法。数值结果表明：本文提出的集成自愈技术及其算法可有效地节约容量需求。     

Towards efficient dynamic surface gateway deployment for underwater network

In underwater acoustic sensor network, deploying multiple surface-level radio capable gateways is an efficient way to alleviate the burdens of high propagation delay and high error probability during transmission. However, the locations of gateways need to be carefully selected to maximize the benefit in a cost-effective way. In this paper, we present our formulation of the surface gateway deployment problem as an integer linear programming (ILP) and we solve the problem with heuristic approaches to provide a realtime solution for large scale deployment problems. By applying the proposed heuristic algorithms to a variety of deployment scenarios, we show that they are nearly optimal for practical cases, which opens the door for dynamic deployment. Therefore, we extend our solution to a dynamic case and propose a modified framework that integrates Aqua-sim, a NS2-based underwater wireless sensor network simulator. Our simulation result shows the benefits of dynamic gateway redeployment over static deployment.     

Energy efficient routing formation technique for hybrid ad hoc network using fusion of artificial intelligence techniques

Hybrid Ad‐hoc NETwork (HANET) is a fusion of both the static and dynamic topologies. Each node of this network consists of low capacity battery. Because of heterogeneous characteristic of the topology, network parameters are imprecise in nature. This, in effect, the performance and lifetime of the network degrade. To overcome these issues, this paper proposes an optimized energy efficient routing (OE2R) method. This method is inspired by artificial intelligence techniques such as multiobjective optimization, geometric programming, aspiration level, and tolerance limit. The fusion of such stated artificial intelligence techniques provide an effective tool to optimize multiple conflict objectives and estimate imprecise parameters of the network, simultaneously. The proposed technique OE2R is simulated using LINGO optimization software. To justify the effectiveness of the proposed technique, its performance is compared with some existing methods such as approximate linear programming technique for average cost bounds and linear programming‐based efficient message delivery approach in hybrid network in several passes of performance metrics. The simulation results show that the proposed OE2R method performs much better with the comparative methods and may be implemented as energy‐efficient routing for HANET.     

Optimal Routing for Wireless Mesh Networks With Dynamic Traffic Demand

Wireless mesh networks have attracted increasing attention and deployment as a high-performance and low-cost solution to last-mile broadband Internet access. Traffic routing plays a critical role in determining the performance of a wireless mesh network. To investigate the best routing solution, existing work proposes to formulate the mesh network routing problem as an optimization problem. In this problem formulation, traffic demand is usually implicitly assumed as static and known a priori. Contradictorily, recent studies of wireless network traces show that the traffic demand, even being aggregated at access points, is highly dynamic and hard to estimate. Thus, in order to apply the optimization-based routing solution into practice, one must take into account the dynamic and unpredictable nature of wireless traffic demand. This paper presents an integrated framework for wireless mesh network routing under dynamic traffic demand. This framework consists of two important components: traffic estimation and routing optimization. By studying the traces collected at wireless access points, we first present a traffic estimation method which predicts future traffic demand based on its historical data using time-series analysis. This method provides not only the mean value of the future traffic demand estimation but also its statistical distribution. We further investigate the optimal routing strategies for wireless mesh network which take these two forms of traffic demand estimations as inputs. The goal is to balance the traffic load so that minimum congestion will be incurred. This routing objective could be transformed into the throughput optimization problem where the throughput of aggregated flows is maximized subject to fairness constraints that are weighted by the traffic demands. Based on linear programming, we present two routing algorithms which consider the mean value and the statistical distribution of the predicted traffic demands, respectively. The trace-driven simulation study demonstrates that our integrated traffic estimation and routing optimization framework can effectively incorporate the traffic dynamics in mesh network routing.     

ADSL高速接入网规划与设计的研究

ADSL目前已发展到实用阶段，各电信运营企业正在积极规划接入网，本将介绍如何解决ADSL接入网设备在规划与设计中的几个难点问题，特别是对用户类别预测加以分析说明，为接入网规划与设计提供参考。