搜索资源列表
-
1下载：
图论中求最短路径问题的lingo实现代码，包含用0-1变量规划和用动态规划的源码。-Graph theory in order to achieve the shortest path problem of the lingo code, including 0-1 variables with the planning and dynamic planning source.
-
-
0下载：
通过几种不同方法的假设，解决机器人路径规划的最优问题。-Assumptions through several different methods to solve the optimization problem of robot path planning.
-
-
0下载：
实现简单路径规划问题，也可以说是旅行商问题，货郎担问题 -Simple path planning problem is the traveling salesman problem, traveling salesman problem
-
-
0下载：
基于蚁群算法的机器人的路径规划问题蚁群算法，一种与传统的数学规划原理截然不同的，模拟自然生态系统以求解复杂优化问题(如NPC(NP Complete)类问题，典型的有TSP(Traveling Saleman Problem)问题)的仿生优化算法，因其较强分布式计算机制、鲁棒性、易于与其他方法相结合等优点，使得蚁群算法具有较广泛应用领域，为那些最优化技术难以解决的组合优化问题提供了一类新的切实可行的解决方案。从最初的一维的静态优化问题扩展到多维的动态组合优化问题，包括车辆路径规划，工程设计，电力
-
-
0下载：
机器人的路径规划问题,用于求解最佳路径，从而应用于实践当中-Robot path planning problem for solving the optimal path, which applies to practice
-
-
0下载：
文件中是基于旅行商问题的M文件，实现了最优路径的规划与显示-Document is based on the traveling salesman problem M files, to achieve optimal path planning and display
-
-
1下载：
这是一个在VC++ MFC环境下编写的蚁群算法，以51个城市为例实现了旅行商问题的路径规划，每代求出的解以VC++可视化的界面动态显示出来。-This is a prepared environment in VC++ MFC ant colony algorithm to 51 cities traveling salesman problem as an example to achieve a path planning, each generation of the solution o
-
-
0下载：
人工蜂群算法解决优化问题，为求解函数和路径规划提供方法-The artificial swarm algorithm solves the optimization problem and provides a method for solving function and path planning
-
-
0下载：
Dijkstra算法，解决机器人的路径规划问题，使用的程序语言为matlab语言。(This is the Dijkstra algorithm. It can solve the robot path planning problem, and the result is good. The programming language used is the MATLAB language.)
-
-
0下载：
Path Planning using A star method(Using LabVIEW to deal with the path planning problem)
-
-
0下载：
快速扩展树算法，随机性问题较大，路径规划的一种方法，这个程序中描述的是地图的建立(Fast growing tree algorithm, a larger randomness problem, a path planning method, described in this program is the establishment of the map)
-
-
1下载：
采用佛洛依德算法原理，解决最小路径的规划问题的matlab实现(Using Freud algorithm principle, solve the problem of the minimum path planning matlab)
-
-
4下载：
读取数字地图文件，增加地图障碍，利用A*算法解决三维路径规划问题。(Read digital map files, increase map obstacles, and use A* algorithm to solve the problem of three-dimensional path planning.)
-
