Search - paths problem

Search - paths problem - 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-19 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-19 Size : 193kb User : lh
[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-19 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-19 Size : 2.13mb User : 李建伏
[AI-NN-PR] GA-TSP DL : 0: 用遗传算法求解TSP问题。假设有一个旅行商人要拜访N个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。TSP问题是一个NPC问题。-Genetic algorithm for TSP. Suppose you have a travel business to visit N cities, he must choose which path to go, limiting the path is to visit each city only once, and the last to return to the original departure city. Select the destination path is to get the path from the minimum value among all paths. TSP problem is an NPC problem.
Date : 2025-12-19 Size : 3kb User : 胡玥
[AI-NN-PR] ant-colony-algorithm DL : 0: 针对车辆的越野路径规划问题,设计了以最少行驶时间为目标的多策略蚁群算法.首先,分析了地形坡度和地表属性对于车辆路径规划的综合影响,通过叠加坡度与粗糙度约束建立了禁忌表其次,一方面引入了自适应调整策略以提高路径搜索的有效性,另一方面设计了双向搜索策略以增加蚂蚁之间的协作能力和成功路径的搜索机率另外,还提出了子路径多段交叉策略以提高算法的全局搜索能力和收敛速度,在详细叙述改进算法的步骤之后,优化了算法的部分参数取值最后,就基本算法和改进算法的性能指标、收敛代数和仿真结果进行了比较与分析.实验结果表明,改进算法能够快速有效地实现越野路径规划,较之基本算法有一定的优越性.-According to the vehicle CROSS—country path planning problem，a multi—strategy ant colony algorithm with the minimum traveling time as the goal was designed．First of all，the synthesis influence of the terrain slope and surface properties was analyzed for vehicle path planning and the table Tabu constructed by stacking constraints of slope and roughness．Secondly，on the one hand，the adaptive adj ustment strategy is imported to improve the effectiveness of the searching paths．On the other hand，the bidirectional search strategy was designed in order to increase ants’collaboration and the probability of the searching successful paths．In addition，the sub—paths multi—segment crossover strategy was also proposed to improve the global searching capability and accelerate the convergence speed．The improved algorithm in detail steps was described，and the value of some parameters are optimized．Finally，the performance indicators，convergence algebra and simulation results between the basic algorit
Date : 2025-12-19 Size : 1.38mb User :