Description: 最短路算法：基于遗传算法的一种最短路的MATLAB程序。-Shortest Path Algorithm: Genetic Algorithm Based on one of the most short-circuit the MATLAB program. Platform: |
Size: 1024 |
Author:崔宁 |
Hits:
Description: 实用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 Platform: |
Size: 408576 |
Author:xiaofang |
Hits:
Description: 1，已完成功能
（1）距离短时大部分情况下可以选择最短路径进行移动
（2）加入了精英选择优化算法
（3）无论地图大小一定可以得出路径
（4）点击障碍物可以得出路径
3,代码改进
将原来两大类（Widget，Geno）拆分成三个类（Widget，Handle，Geno），
Widget：显示界面等可视化元素，获取最短路径并显示移动，
Handle：优化路径，得出最短路径，以后会加入通信模块
Geno：计算得出一定数量的可达路径
4，算法描述
（1）遗传算法：
根据起始点的曼哈顿距离得出染色体的大约长度，最好比曼哈顿距离稍大。
在计算过程中如果没法得出可达路径（则适应性分数不等于1）会自动加大染色体长度。
-1, has completed the function
(1) short distance in most cases you can choose the shortest path to move
(2) joined the elite selection optimization algorithm
(3) regardless of the size of the map can be drawn a certain path
(4) Click on the path obstructions can be drawn
3, code improvements
The original two categories (Widget, Geno) split into three categories (Widget, Handle, Geno),
Widget: display interface and other visual elements, to obtain the shortest path and display the movement
Handle: optimal path, draw the shortest path, the communication module will be added later
Geno: up to a certain number of calculated path
4, the algorithm described
(1) genetic algorithm:
According to arrive at the starting point of the Manhattan distance about the length of the chromosome, preferably slightly larger than the Manhattan distance.
If in the calculation process can not come up the path (if not equal to 1 adaptability scores) will automatically increase the Platform: |
Size: 10240 |
Author:chan |
Hits:
Description: 基于遗传算法的解决两点之间最短路径问题（有向权值图最短路径问题）-Based on the shortest path between a genetic algorithm to solve the problem of two (shortest path problem to the weight chart) Platform: |
Size: 7168 |
Author:孙傲 |
Hits:
Description: 基于遗传算法的路径最优方法，来寻找最短的路径，使用matlab编写，注释详细-Optimal path method based on genetic algorithm, to find the shortest path, using matlab, annotation in detail Platform: |
Size: 3072 |
Author:JIM |
Hits:
Description: 遗传算法TSP，旅行商问题，1． 假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求所经过的路径路程尽量短。-Genetic algorithm TSP, Traveling Salesman Problem, 1. Suppose you have a traveling businessman to visit n cities, he must choose the path to go, a restricted path is visit each city only once, and the last to return to the original departure city. Select the destination path is the path requirements as short as possible. Platform: |
Size: 3072 |
Author:余家 |
Hits:
Search - genetic algorithm-short path