搜索资源列表
ant
- 在matlab环境中用蚁群算法寻优潜水器的三维路径,效果很好-In the matlab environment, using ant colony optimization algorithm for three-dimensional underwater vehicle path, good results
ACOTSP[1].V1.0
- 路径规划 路径规划的实例,主要运用蚁群算法,算法简洁明了,不懂的可联系本人-Examples of path planning, the main use of ant colony algorithm, the algorithm of concise, do not know I can contact
yiqun
- 蚁群算法是一种用来在图中寻找优化路径的机率型技术,该算法具有许多优良的性质,具有一种新的模拟进化优化方法的有效性和应用价值, 是一种求解组合最优化问题的新型通用启发式方法,可以解决一维静态优化问题甚至多维动态组合优化问题。 -Ant colony algorithm is a method used to find optimal path in the graph of the probability-based technology, the algorithm has many goo
rengongzhineng2
- 人工智能方面的论文,设计机器人路径规划,包括蚁群算法,中心点算法-Papers on artificial intelligence, design robot path planning, including the ant colony algorithm, the center algorithm and so on .....
ACS
- 用蚁群算法来解决,TSP(履行商人)最短路径问题。-TSP
matlabyiqunsuanfa
- 蚁群算法是一种用来在图中寻找优化路径的机率型算法。是一种求解组合最优化问题的新型通用启发式方法,该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型,基于故障过电流的配电网故障定位变为一种非线性全局寻优问题。-Ant colony algorithm is a method used to find optimal path in the graph the probability-based algorithm. Is a combination of opt
Antcolonyalgorithmpathplanning
- 用于蚁群算法,环境是matlab,是关于路径优化-Ant colony algorithm path planning
ant
- 基于蚁群算法的代码实现 可以找到从任意一点出发的 最短路径-The ant alogrithm-based source code you can find the shortest way wherever you start
java
- 实现蚁群算法解决TSP问题,打印寻找到的最短路径以及其长度,随附数据-Implementation problems ant colony algorithm to solve TSP, print to find the shortest path and its length
yiqunsuanfa
- 该文件是蚁群算法程序,能更有效地解决路径问题,希望可以给广大朋友起到一定的作用。-The program file is the ant colony algorithm can more effectively address the routing problem, hope to play a role in the general friend.
MATLABGAMATLAB
- 遗传算法,蚁群算法,实现最短路径问题-GENETIC
AntColonyAlgorithmforSolvingQoSRoutingProblem
- 在状态转移规则的基础上,局部更新规则和全局更新的蚁群算法的规则,我们提出一个IM证明蚂蚁的最低成本的服务质量蚁群算法(QoS)的路径用于解决网络路由问题与延迟以及背包约束中进行模拟。约52.33%蚂蚁找到成功的QoS路由。并收敛到最佳。-based on the state transition rule,the local updating rule and the global updating rule of ant colony algorithm ,we propose an im p
java_tsp
- 用Java 编写的蚁群算法解决TSP问题的路径规划,取得了很好的效果-Java written by ant colony algorithm to solve TSP problem of path planning, and achieved good results
Imprning
- 基于改进蚁群算法的机器人路径规划Improved Ant Colony Algorithm Based Robot Path Planning-Improved Ant Colony Algorithm Based Robot Path Planning
ACS1
- 稍加修改的基本蚁群算法,可用于求解交通路径规划中的距离最短路径的求解。-Slightly modified the basic ant colony algorithm can be used to solve the traffic path planning to solve the shortest path distance.
ACS2
- 改进的蚁群算法,用于求解基于交通密度的最短路径规划问题。-Improved ant colony algorithm for solving the shortest path based on traffic density planning.
pathplann-algorithm
- 基于改进的蚁群算法的机器人路径规划及壁障 能找寻最有路径-Improved ant colony algorithm based on robot path planning and barrier to finding the best path
YIQun
- Matlab实现蚁群寻找最短路径的TSP问题,有图像描述。-Matlab to find the shortest path to achieve ant TSP problem, there is the image descr iption.
ant-MATLAB-code
- 与蚁群算法相关的MATLAB源码,主要解决路径规划、最大值、TSP问题-Associated with the ant colony algorithm MATLAB source code, mainly to solve the TSP problem, the maximum robot path planning
ACASP3
- 基于蚁群算法的动态最优路径规划-Dynamic optimal path