搜索资源列表
potentialfield
- 人工势力场法对自主移动机器人进行路径规划，规划的结果还不错啊-Artificial force field method for autonomous mobile robot path planning, planning is not the result Cuoa
GPS_path_tracker
- GPS路径跟踪记录器扩展(通过Web服务在SQL2005中存储路径)-GPS Path tracker recoder
Rayleigh
- NLOS multi-path channel model-Rayleigh fading implemented by matlab
235123531
- 内容为一doc文档，主要实现了地铁站公交系统的自动售票以及管理功能，涉及到了最短路径的求法，以及sql方面的检索技术。-Content of a doc document, the main bus station realized the automatic ticketing system, and management functions related to the shortest path seeking method, as well as the sql in search te
max_flow
- 介绍最大流算法的ppt，The Ford-Fulkerson Augmenting Path Algorithm，The Capacity Scaling Algorithm，The Goldberg-Tarjan Preflow Push Algorithm，-Introduction maximum flow algorithm ppt, The Ford-Fulkerson Augmenting Path Algorithm, The Capacity Scaling Algorithm,
AntVCprograms
- 蚁群算法VC源代码，很完善的程序，适用于机器人路径规划。-VC source code for ant colony algorithm, it is well-established procedures for robot path planning.
ImprovementAndImplementation_of_theShortestPath.ra
- 最短路径的改进与实现.rar Improvement and Implementation of the shortest path-Improvement and Implementation of the shortest path. Rar
RockAndRoll
- Simplified version of a system that finds the fastest or shortest trip along a network of roads, is an instance of the single-source, positive-weighted, shortest-path problem. In other words, from one particular vertex (a “single source”), we’ll be f
pathfinder2
- find path planning for robot in 2D
MANIK
- MANIK is a 32 bit RISC Microprocessor. The salient features of the processor are listed below. Features Hardware Features • Data Path Width 32 bits, with Four stage pipeline. • Mixed 16/32 bit instructions for code density ̶
RTL
- 用VHDL实现求两个数的最大公因数。数据路径和控制路径。-Seeking to use VHDL to achieve the greatest common factor of two numbers. Data path and control path.
robotpathplanning
- Pioneer3机器人的路径规划程序。包括所有源代码。实现机器人在已知地图环境中的路径规划，包括全局的路径规划和局部的修正的路劲规划。是研究路径规划和动态避障绝好的例子。运行方式：先在服务端执行justPathPlanningGuiServer，然后执行MobileEyes查看规划结果。-Pioneer3 robot path planning process. Including all the source code. Known map of a robot path planning e
tsp
- In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) such that the sum of the weights of its constituent edges is minimized. An example is finding the quickest way to get from one location to ano
Dijkstra-path
- 在已存在的一些最短路径算法测试总结的基础上，根据GIS中网络计算的实际情况，从网络结构的拓扑表示以及Dijkstra算法中快速搜索技术的实现实现方法。-Already exist in some of the shortest path algorithm test summary based on the GIS, the actual situation of network computing, from the topology of the network structure, as
wtsf.tgz
- N皇后问题回溯算法.c 货郎担分枝限界图形演示.c 矩阵乘法动态规划.c 万年历 动态计算网络最长最短路线.c 货郎担限界算法.c 骑士遍历 网络最短路径Dijkstra算法.c-N queens problem backtracking algorithm. C TSP branch and bound graphical presentation. C matrix multiplication, dynamic programming. C calendar dynamic compu
criticalpath
- Critical Path Method for Project Time Estimation. Implemented in MATLAB.
monte_carlo_CPM
- Monte-Carlo simulation for Critical Path Method, implemented in MATLAB. Uses criticalpath.m library, available for download as well. Function: calculate project length and standard deviation.
ant
- 蚁群算法最短路径通用Matlab程序。蚁群算法动态寻路算法。-Ant colony algorithm for the shortest path generic Matlab program. Ant colony algorithm for dynamic pathfinding algorithm.
Shortest_Djk
- 最短路这个说明倒不是说明函数的功能，只是声明一下函数中出现的问题。 shortest()函数没有问题，在secshortest中我希望只得到一条次短路（或几条roadcost()值相同的次短路），结果却出来好几条，我仔细检查了一下程序，应该没有什么问题。 因此在使用时，要得到次短路，只能用roadcost()函数分别求一下各条路的权重和，找到最小的。 有些奇怪 -short path
Maximum_flow
- 用C++实现的3种最大流算法。CS（Capacity-Scaling Algorithm）、SAP（Shortest Augmenting Path Algorithm）、ISAP（Improved Shortest Augmenting Path Algorithm）。-C++ implementation with three kinds of maximum flow algorithms. CS (Capacity-Scaling Algorithm), SAP (Shortest Au