Search - GA path

Search - GA path - List

[Other resource] GA(C+) DL : 1: 遗传算法的机器人路径规划的源代码。用C++来实现的-GA robot path planning source. C to achieve the
Update : 2008-10-13 Size : 15.6kb Publisher : 宋磊
[AI-NN-PR] GA_TSP DL : 0: 程序用法：共有12个地图文件，大、中、小各4个对于小地图，程序默认的种群大小60，最大世代数500，基本上都可以求出全局最优解；对于中地图，需要使用者调整参数，当种群大小设为120，最大世代数设为2000，基本上都可以求出全局最优解；对于大地图，参数可以进一步增大，但能否求出全局最优解，本人无法保证路径的演化在程序界面上可以随时得到反映，便于观察和分析一次路径求解完毕后，在程序所在的文件夹下，会生成GaLog.txt文件，记录了每个世代基因的演化情况，将复选框“输出染色体”打勾，可以在输出文件中得到每代每个基因的详细序列，但文件大小会急剧增大，一般在分析算法时才选用主要参考资料：《遗传算法——理论、应用及软件实现》——西交出版社.王小平等《遗传算法及其应用》——科学出版社.陈国良等 -procedures usage : a total of 12 maps, large, medium and small for the four small map the default size of the population 60, the largest number of 500 generations, can basically get the global optimum solution; for the map, which requires the user to adjust parameters, when the population size as a 120, the largest number of generations Set in 2000, basically we can solve the global optimum solution; for a map, parameters can be further increased. However, whether sought global optimal solution, I can not guarantee that the path of evolution on the interface procedures can always be reflected, to facilitate observation and analysis of a solution path after the procedure where the folder, GaLog.txt will generate documents, records of each generation evolution of the gene, to check box "
Update : 2025-02-17 Size : 113kb Publisher : 戴朝华
[AI-NN-PR] GA(C+) DL : 0: 遗传算法的机器人路径规划的源代码。用C++来实现的-GA robot path planning source. C to achieve the
Update : 2025-02-17 Size : 464kb Publisher : 宋磊
[AI-NN-PR] TravelingSalesmanProblemwithGeneticAlgorithm DL : 0: this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included 2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value -this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter, value
Update : 2025-02-17 Size : 4kb Publisher : 宏姬
[AI-NN-PR] GAPathfinder DL : 0: 使用遗传算法的走迷宫程序。适合新手学习GA使用-use of genetic algorithms Maze procedure. Suitable for novice learning to use GA
Update : 2025-02-17 Size : 24kb Publisher : DL
[GUI Develop] MazeGame_VC++ DL : 0: 一个简单的迷宫小游戏运用迷宫算法实现迷宫小游戏，功能有设置迷宫大小、新建迷宫、显示走过路径、迷宫图的保存和打开、游戏的自动玩等功能。-a simple maze game using small maze algorithm maze of small game, functional install maze size, new maze, showing traversed path, the preservation of the maze map and opened the game playing and other automatic functions.
Update : 2025-02-17 Size : 137kb Publisher : 陈锦标
[matlab] TravelingSalesmanProblemGeneticAlgorithm DL : 0: Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Update : 2025-02-17 Size : 3kb Publisher : 阳关
[matlab] GA_term_project DL : 0: ga 派車路徑排班，執行有詳細步驟點選說明-ga派车path scheduling, implementation steps detailed description click on
Update : 2025-02-17 Size : 26kb Publisher : 陳進
[AI-NN-PR] tsp DL : 0: ga算法解tsp问题.动态TSP就是城市坐标在随着时间变化,我们的目标则要在最短的时间窗内寻找出最优的城市遍历路径,这是个双最优问题. 这是我对动态TSP算法的理解,使用改进的反序-杂交算法-ga algorithm problems tsp. dynamic TSP is that the town change over time in the coordinates, we aim to have in the shortest possible time window to find out the optimal path to traverse the city, this is a dual-optimal problem. This is my understanding of the dynamic TSP algorithm understanding, the use of improved anti-sequence- Hybrid Algorithm
Update : 2025-02-17 Size : 4kb Publisher : 李丽
[matlab] GA DL : 0: 这个一个遗传算法的实例，可以解决机器人轨迹规划的问题-This example of a genetic algorithm, can solve the problem of robot path planning
Update : 2025-02-17 Size : 40kb Publisher : kevin
[Console] GA DL : 0: 本程序运用了遗传算法，解决了以数组为数据结构的最优路径选择问题。-This procedure using genetic algorithm, to solve the array data structure for the selection of the optimal path.
Update : 2025-02-17 Size : 3kb Publisher : 怀义
[Graph program] GA DL : 0: This Program finds the traveler salesman path with genetic algorithm(all pair connected), its not a best answer. (you can increase the number of generation to improve it).
Update : 2025-02-17 Size : 1kb Publisher : saeed
[Mathimatics-Numerical algorithms] GA-path DL : 0: delphi环境下开发的基于遗传算法的求解TSP问题-delphi development environment based on genetic algorithms for solving TSP problems
Update : 2025-02-17 Size : 1.12mb Publisher : 樊福剑
[Data structs] GA DL : 0: 遗传算法解决最短路径用C++来实现其功能基于遗传算法的最短路径问题-Genetic algorithms to solve shortest path with C++ to achieve their function based on genetic algorithm shortest path problem
Update : 2025-02-17 Size : 2kb Publisher : 李志忠
[Books] Using_Genetic_Algorithms_for_Robot_Motion_Planning DL : 0: 实用GA算法进行，机器人运功规划，算法很经典，美国人写的-We present an ongoing research work on robot motion plan- ning using genetic algorithms. Our goal is to use this technique to build fast motion planners for robot with six or more degree of freedom. After a short review of the existing methods, we will introduce the genetic al- gorithms by showing how they can be used to solve the invers kinematic problem. In the second part of the paper, we show that the path planning problem can be expressed as an optimization problem and thus solved with a genetic algorithm. We illustrate the approach by building a path planner for a planar arm with two degree of freedom, then we demon- strate the validity of the method by planning paths for an holonomic mobile robot. Finally we describe an implementation of the selected ge- netic algorithm on a massively parallel machine and show that fast plan- ning response is made possible by using this appro
Update : 2025-02-17 Size : 399kb Publisher : xiaofang
[Windows Develop] GA DL : 0: 使用遗传算法进行路径规划。。。。。。。。(Genetic algorithm is used for path planning)
Update : 2025-02-17 Size : 181kb Publisher : shaoyy
[matlab] GA DL : 0: 智能算法，求解线性规划，整数规划，最短路等优化算法，得到的解优化结果较好(Intelligent algorithm, solving linear programming, integer programming, shortest path optimization algorithm, the solution optimization results are better)
Update : 2025-02-17 Size : 8kb Publisher : yst1
[Mathimatics-Numerical algorithms] A Solution to TSP with GA DL : 0: 利用遗传算法解决最短路径问题（商旅问题）(Using genetic algorithm to solve the shortest path problem (business travel problem))
Update : 2025-02-17 Size : 4kb Publisher : crazy_snail
[] GA DL : 0: 遗传算法用于路径规划，用于3D路径规划。(Genetic algorithms are used for path planning for 3D path planning.)
Update : 2025-02-17 Size : 12kb Publisher : 吴亦七
[matlab] pathPlanning4m-master DL : 2: 通过matlab建立环境障碍物模型，通过遗传算法规划一条无碰撞路径，完成路径规划！(The environmental obstacle model is established by matlab, and a collision-free path is planned by genetic algorithm to complete the path planning.)
Update : 2025-02-17 Size : 9kb Publisher : dhr236521

« 12 3 »