搜索资源列表
蚁群算法
- 小小的蚂蚁总是能够找到食物,他们具有什么样的智能呢?设想,如果我们要为蚂蚁设计一个人工智能的程序,那么这个程序要多么复杂呢?首先,你要让蚂蚁能够避开障碍物,就必须根据适当的地形给它编进指令让他们能够巧妙的避开障碍物,其次,要让蚂蚁找到食物,就需要让他们遍历空间上的所有点;再次,如果要让蚂蚁找到最短的路径,那么需要计算所有可能的路径并且比较它们的大小,而且更重要的是,你要小心翼翼的编程,因为程序的错误也许会让你前功尽弃。这是多么不可思议的程序!太复杂了,恐怕没人能够完成这样繁琐冗余的程序。
基于粒子群最短路径的研究与应用
- 基于粒子群最短路径的研究与应用,使得问题更加容易解决-The shortest path based on particle swarm research and application,Makes the problem easier to solve
rengongzhineng2
- 人工智能方面的论文,设计机器人路径规划,包括蚁群算法,中心点算法-Papers on artificial intelligence, design robot path planning, including the ant colony algorithm, the center algorithm and so on .....
matlab
- 蚁群优化,寻找最短路径,也可用于机器人规划-Ant colony optimization to find the shortest path can also be used for robot planning
yiqunsuanfa
- 这是蚁群算法,自己写的,希望能用,用来计算最有路径的-Ant Colony Algorithm
matlab-ants-produre
- matlab 蚁群算法,用于计算遍历所有节点的最优路径,学生弄的,大家莫喷-matlab ant colony algorithm for calculating the optimal path to traverse all nodes, the students get, Mo spray. . .
CSharp-solve-TSP
- c#解决蚁群算法实例源代码,实现一定范围内最短路径的优化。-c# solve the ant colony algorithm source code examples, shortest path optimization within a certain range.
Matlab-program-of-ant-colony
- 这是一个用蚁群算法解决最短路径问题的通用matlab程序,供大家参考使用-This is an ant algorithm to solve the shortest path problem common matlab program, for reference use
vehicleroutingproblemwithtimeWindows
- Vehicle Routing Problem with Time Windows, VRPTW)基于带时间窗的车辆路径问题的蚁群算法_叶仲泉 -Vehicle Routing Problem with Time Windows, VRPTW)Based on the vehicle routing problem with time Windows _ Ye Zhongquan ant colony algorithm
mayisuanfa
- 蚁群算法(ant colony optimization, ACO),又称蚂蚁算法,是一种用来在图中寻找优化路径的机率型算法。它由Marco Dorigo于1992年在他的博士论文中提出,其灵感来源于蚂蚁在寻找食物过程中发现路径的行为-Ant colony algorithm (ant colony optimization, ACO), also known as ant algorithm, is a probabilistic algorithm used to find optimal
Ant-colony-algorithm
- 主要用蚁群算法用matlab实现,解决城市之间最短路径问题-Ant colony algorithm to achieve the TSP
pso-path-planning
- 文件是关于粒子群算法求解路径规划的问题,其中包括栅格障碍物环境的建立,粒子群及其改进算法的仿真程序。-Document on particle swarm algorithm path planning issues, including the establishment, PSO obstacle grid environment and improved algorithm simulation program.
Multi-hop-Cooperative-MIMO
- 在GM-MIMO集群建立基于地理位置。GM-MIMO图论应用于找到一个最佳的转发路径。-In GM-MIMO cluster is established based on geographic location. GM-MIMO graph theory applied to find the best path forward.