Search - SHORTEST-PATHS

Search - SHORTEST-PATHS - List

[AI-NN-PR] 实验题 DL : 0: A*算法解决找路径的问题，对于特定的图形，按照距离最短的评估函数，来解决寻优问题-A* algorithm to find paths to solve the problems that specific graphics, in accordance with the shortest distance from the assessment function, to solve the optimization problem
Date : 2025-12-16 Size : 1.64mb User : zx
[AI-NN-PR] agent DL : 0: 通过智能agent间的协作，模拟解决吸尘器吸地板灰尘的问题，达到在最短时间内完成最好的洗尘效果。-Intelligent agent collaboration, simulation of a vacuum cleaner to solve the problem of dust suction floor to be completed in the shortest possible time effects of the best welcome home.
Date : 2025-12-16 Size : 193kb User : lh
[AI-NN-PR] UAStar DL : 0: 这是对A*寻路算法的一个封装.使用非常简单:1.指定寻路区域的大小(网格) 2.指定哪些节点是障碍物 3.给定出发节点点和目标节点, 寻路! 将返回最短路径. 另外, 还可以设定遇到障碍物时只能绕着障碍物的角走-This is a routing algorithm A* a package. The use of very simple: 1. Specified routing region size (grid) 2. Specify which node is the barrier 3. Given the starting point and the goal node node, routing ! will return the shortest path. In addition, obstacles encountered can be set only when the angle go around obstructions
Date : 2025-12-16 Size : 3kb User : youarehaha
[AI-NN-PR] KShortestPaths DL : 0: 在GRAPH中找出K條最短路徑,並且輸出到SP.txt檔中-In GRAPH find K shortest paths, and output to file SP.txt
Date : 2025-12-16 Size : 1.24mb User : 周昊宸
[AI-NN-PR] MINIMALpATH DL : 0: A shortest path tree, in graph theory, is a subgraph of a given (possibly weighted) graph constructed so that the distance between a selected root node and all other nodes is minimal. It is a tree because if there are two paths between the root node and some vertex v (i.e. a cycle), we can delete the last edge of the longer path without increasing the distance from the root node to any node in the subgraph. If every pair of nodes in the graph has a unique shortest path between them, then the shortest path tree is unique. This is because if a particular path from the root to some vertex is minimal, then any part of that path (from node u to node v) is a minimal path between these two nodes. In graphs with no negative distances, Dijkstra s algorithm computes the shortest path tree, from a given vertex. In graphs with possibly negative distances, the Bellman-Ford algorithm can be used instead.
Date : 2025-12-16 Size : 7kb User : darulor
[AI-NN-PR] DijkstraPprocedures DL : 0: 最短路径计算，有关双标号算法的具体程序设计-Calculating the Shortest Paths by Matrix Approach*
Date : 2025-12-16 Size : 1kb User : zhangzaike
[AI-NN-PR] Shortest-Path-Based-on-Delay-PCNN DL : 0: 　本文在脉冲耦合神经网络(PCNN2Pulse Coupled Neural Network) 的基础上,提出了时延脉冲耦合神经网络 (DPCNN2Delay PCNN) ,并将其成功地用于求解最短路径,同时给出了基于DPCNN 的最短路径求解算法. Caulfield 与 Kinser 提出了用PCNN 求解迷宫问题的方法,虽然他们的方法也可用于求解最短路径,但所需神经元的数量巨大,而本文的方法所需的神经元的数量远小于他们的方法. 同时,本文的方法充分利用了DPCNN 脉冲快速并行传播的特点,可迅速地求出最短路径,其所需的计算量仅正比于最短路径的长度,与路径图的复杂程度及路径图中的通路总数无关. 计算机仿真结果表明,采用本文的方法,用少量的神经元就可迅速地求出最短路径.-　This paper presents DPCNN(Delay Pulse Coupled Neural Network) based on PCNN and uses DPCNN to find the shortest path successfully.Meanwhile ,the algorithmof finding the shortest path based on DPCNN is described. Caulfield and Kinser in2 troduced the PCNN method to solve the maze problem and although their method also can be used to find the shortest path ,a large quantity of neurons are needed. However ,the approach proposed in this paper needed very fewer neurons than proposed by Caulfield and Kinser. In the meantime ,due to the pulse parallel transmission characteristic of DPCNN ,the approach proposed can find the short2 est path quickly. The computational complexity of our approach is only related to the length of the shortest path , and independent to the path graph complexity and the number of existing paths in the graph. The results of computer simulations show that by using the approach proposed in this paper ,we can use a small quantity of neurons to find the shortest p
Date : 2025-12-16 Size : 100kb User : wangxx
[AI-NN-PR] yen DL : 0: 一个非常经典的用于求解K条最短路径的算法，适用于求解无环情况-a very classic algorithm for k shortest paths problem with loopless
Date : 2025-12-16 Size : 2.13mb User : 李建伏
[AI-NN-PR] yiqunsuanfa DL : 0: 为什么小小的蚂蚁能够找到食物？他们具有智能么？设想，如果我们要为蚂蚁设计一个人工智能的程序，那么这个程序要多么复杂呢？首先，你要让蚂蚁能够避开障碍物，就必须根据适当的地形给它编进指令让他们能够巧妙的避开障碍物，其次，要让蚂蚁找到食物，就需要让他们遍历空间上的所有点；再次，如果要让蚂蚁找到最短的路径，那么需要计算所有可能的路径并且比较它们的大小，而且更重要的是，你要小心翼翼的编程，因为程序的错误也许会让你前功尽弃。这是多么不可思议的程序！太复杂了，恐怕没人能够完成这样繁琐冗余的程序。-Why tiny ants to find food? They have the intelligence it? Imagine if we want to design an artificial ant program, then this program how complicated you want it? First, you have to let the ants can avoid obstacles, we must give it compiled into the terrain under the appropriate instructions so that they can cleverly avoiding obstacles, and secondly, to make the ants find food, they need to get them to traverse space on all points again, if you want the ants to find the shortest path, then you need to calculate all possible paths and compare their size, but more importantly, you have to careful programming, because the wrong procedure may make you come to naught. This is such an incredible program! Too complicated, I am afraid that no one can accomplish this tedious redundancy program.
Date : 2025-12-16 Size : 9kb User : xiaojie
[AI-NN-PR] K-shortest-Path-tracking DL : 0: 参考《Multiple Object Tracker Using K-Shortest Paths》实现的代码，使用K最短路径实现多目标追踪功能。-Reference " Multiple Object Tracker Using K-Shortest Paths" to achieve code, use the shortest path K multi-target tracking capabilities.
Date : 2025-12-16 Size : 3.26mb User : 黄凯