搜索资源列表
ddt
- 算法设计于分析中的多段图问题，用VC编写应用动态规划的算法设计方法，利用最优性原理以及所获得的递推关系式求取最优决策序列，通过多段图的定义，找到由源点s到汇点t的最小成本路径，进而可以灵活解决可以用多段图描述的许多实际问题.-algorithm design in the analysis of many of the map, prepared with VC dynamic programming algorithm design, the optimum principle as well
lujin
- 最短路径问题（用无向图表示n个城市之间的交通网络建设规划，顶点表示城市，边上的权表示该线路的造价，试设计一个方案，使得这个交通网的总造价最小。）-The shortest path problem (with undirected graph n cities that transport links between the construction plan, vertex, said city, said the right edge of the construction cost of
robot
- 移动机器人全覆盖路径规划优化方法。从全局优化的角度出发，提出一种基于区域分割的环境建模方法-Full coverage of mobile robot path planning optimization method. From the global optimization point of view, presents a region-based segmentation of environmental modeling
lu-jing-guihua
- 这是对未知路径的动态规划探讨的文档，主要包括： A*算法的基本理论 A*算法的理论 A*算法的实现-This is the unknown path dynamic planning of documents, including: The basic theory of A* algorithm The A* algorithm theory The A* algorithm to achieve
the-long-line
- 实验名称：用动态规划法求解最长路径问题 设计动态规划算法求解最长路径问题（见下面附录部分），要求程序能根据给定的图作为输入，输出最长路径的长度及一条最长的路径。-Experiment name: the dynamic programming method for solving the longest path problem design dynamic programming algorithm for the longest path problem (see the append
algorithm
- 关于常用的几种算法介绍1、单源最短路径；2、递归与分治；3、贪心算法；4、动态规划；5、回溯法；6、分支限界法-On several commonly used algorithm introduced a single-source shortest path 2, recursion and divide and conquer 3, the greedy algorithm 4, dynamic programming 5, backtracking 6, branch and
jingqu
- 主程序应用菜单选项包含：创建景区景点分布图，输出景区景点分布图，输出导游线路图，判断导游线路图有无回路，两个景点间的最短路径和最短距离，停车场车辆进出记录信息，输出道路修建规划图。-Application main menu options include: Create a profile scenic spots, scenic spots output profile output line guide map, determine whether the loop tour route
plinnang
- RRT是应用广泛的机器人路径规划方法,可处理路径规划中的不同问题-RRT is a widely used method of robot path planning, path planning are processed in a different problem,,
走方格路径
- 走方格路径，通过编程实现最短步数达到终点。(I am a lover of computer!)