智能车辆最短路径算法的研究与实现

最短路径算法是智能车辆路径规划问题的核心内容。从道路网络拓扑结构的自动构建以及Dijkstra算法中快速搜索技术的实现入手,综合考虑核心算法和数据存储结构两个方面,提出了直线优化Dijkstra算法。该算法能够有效降低时间复杂性,提高系统的效率。     

Multiple UAVs path planning algorithms: a comparative study

Unmanned aerial vehicles (UAVs) are used in team for detecting targets and keeping them in its sensor range. There are various algorithms available for searching and monitoring targets. The complexity of the search algorithm increases if the number of nodes is increased. This paper focuses on multi UAVs path planning and Path Finding algorithms. Number of Path Finding and Search algorithms was applied to various environments, and their performance compared. The number of searches and also the computation time increases as the number of nodes increases. The various algorithms studied are Dijkstra’s algorithm, Bellman Ford’s algorithm, Floyd-Warshall’s algorithm and the AStar algorithm. These search algorithms were compared. The results show that the AStar algorithm performed better than the other search algorithms. These path finding algorithms were compared so that a path for communication can be established and monitored.     

基于无连接传输模式的选路算法

文中借鉴通信中面向无连接传输模式的思路,构建了一个求解最佳路径的虚拟网络,使信息在虚拟网络中交互,自动探索最佳路径。并详细描述了虚拟网络的结构,给出了通信网和公交网两个求解实例。最后,通过计算复杂度分析,用文中所述算法与通用的Dijkstra算法进行比较,验证算法的计算速度。     

基于GIS的Dijkstra算法在运输系统的应用

在市场竞争中,如何利用有限的资源,通过合理的安排和调度,尽可能降低成本是一个十分重要的问题。文中通过分析地理信息系统GIS（Geographic Information System）,在此基础上应用最短距离算法——Dijkstra算法求解最优路径,用JVAV语言编程实现,并将这一部分作为新型车辆运输调度系统——智能运输系统的一个底层子模块。系统开发基于Oracle及GIS系统软件,全面支持物流企业多种运输模式的运行要求,客户可以方便地通过车载终端或者手机访问系统所运行的服务器。     

Dijkstra算法的一个改进

本文得到了一种Dijkstra算法的改进算法，如果最短路问题具有n个点和m条边，那么改进算法把问题的计算复杂性从原来的O(nlogn m)降低为O(nlogn M)(M≤m)。     

基于物联网的智能物流配送系统设计与实现

针对物流配送的特点,利用GIS、GPS、传感器技术和无线网络通信技术,提出了基于物联网的智能物流配送的系统框架.根据嵌入式设备的存储能力和计算能力有限的特点,动态划分地图区域的思想和矢量栅格存储结构,并对优化的Dijkstra算法及物流配送数据管理功能进行了探讨,减少了内存存储空间,提高查询速度和系统的整体效率.     

飞行器三维突防航迹快速生成方法

介绍了一种飞行器低空突防三维航迹规划方法.通过分析敌防空区域地形方差,判断其地形特征,决定最佳离地高度,从而构建了飞行器安全飞行曲面.利用Dijkstra算法,在安全飞行曲面之上,进行二维航迹节点的搜索,达到三维航迹规划的目标.搜索空间维数的缩小,存储节点数目的删减,都加快了航迹生成的速度.威胁概率模型的建立,航迹代价函数的构造,权重比值的分配,使得规划出的航迹具有一定的威胁/地形回避和地形跟随效果.最后给出了算例和仿真结果.     

高速公路网中的Dijkstra最短路径优化算法

当高速公路网中出现交通事件时,其拓扑结构发生了变化,需要搜索新的最短路径并告知司机。由于信息发布具有较高的实时性,最短路径的搜索效率对高速公路信息服务的效率有重要影响。论文采用Dijkstra算法搜索高速公路网中的最短路径,并结合高速公路网的特点,用链结构将表示各收费站的点连接起来,简化了高速公路网的拓扑结构,从而大幅减少Dijkstra算法中的节点数。对算法的复杂度分析表明,这种方法大幅减少了路径搜索的复杂度,从而缩短了计算时间,提高了最短路径搜索效率。     

Routing algorithm design of satellite network architecture based on SDN and ICN

In view of the problems of low routing efficiency, complex control process, and difficult network management in big data environment in the traditional integrated space‐terrestrial network, in the paper, we propose a satellite network architecture called software‐defined information centric satellite networking (SDICSN) based on software‐defined networking (SDN) and information‐centric networking (ICN), and we design a virtual node matrix routing algorithm (VNMR) under the SDICSN architecture. The SDICSN architecture realizes the flexibility of network management and business deployment through the features of the separation of forwarding and controlling by the SDN architecture and improves the response speed of requests in the network by the centric of “content” as the ICN idea. According to the periodicity and predictability of the satellite network, the VNMR algorithm obtains the routing matrix through the relative orientation of the source and destination nodes, thus reducing the spatial complexity of the input matrix of the Dijkstra algorithm and then reducing the time complexity of the routing algorithm. For forwarding information base (FIB), the mechanism of combination of event driven and polling can be quickly updated in real time. Finally, the advantages of the SDICSN architecture in routing efficiency, request delay, and request aggregation are verified by simulation.     

Attack path prediction method based on causal knowledge net

The existing attack path prediction methods can not accurately reflect the variation of the following attack path caused by the capability of the attacker.Accordingly an attack path prediction method based on causal knowledge net was presented.The proposed method detected the current attack actions by mapping the alarm sets to the causal knowledge net.By analyzing the attack actions,the capability grade of the attacker was inferred,according to which adjust the probability knowledge distribution dynamically.With the improved Dijkstra algorithm,the most possible attack path was computed.The experiments results indicate that the proposed method is suitable for a real network confrontation environment.Besides,the method can enhance the accuracy of attack path prediction.