搜索资源列表
book2
- A large number of real-world planning problems called combinatorial optimization problems share the following properties: They are optimiza- tion problems, are easy to state, and have a nite but usually very large number of feasible solutions.
ns2
- Many interesting route planning problems can be solved by computing shortest paths in a suitably modeled, weighted graph representing a transportation network. Such networks are naturally road networks or timetable networks of public transportati
xiaoche
- 迷宫循迹小车，小车要在迷宫中走到终点，到终点后能够返回，并且是最短路径返回。其中迷宫中的引导线是黑线，识别传感器使用红外对管。 最关键的是返回程序的算法。一定要是最短路径返回。-Maze tracking the car, the car should come to the end of the maze to the end and be able to return, and is the shortest path to return. The guide wire in which
sp.c.tar
- Find the shortest path using Dijeskras algorithm for robotic path finding operations
Dijkstra
- 通用Matlab实现Dijkstra最短路算法-General Matlab achieve Dijkstra shortest path algorithm
Computer-mouse
- 此代码基于NXP公司的LPC2138ARM7源代码，是黑龙江省电脑鼠比赛自制小车的源代码，能够驱动小车完成迷宫的搜索以及找到最短的路径完成任务！-LPC2138ARM7 source code, the code based on NXP corporation is heilongjiang province homemade car computer mouse game source code, can drive the car to complete the maze search a
MicroMouse
- 本程序为micromouse基本例程，可以实现搜索迷宫的最优路径，并以最短路径回到起点。-This program is micromouse basic routines, you can achieve the optimal path searching the maze, and the shortest path back to the starting point.