搜索资源列表
1
- 移动adhoc网络协议的特点，dsr与aodv协议仿真与分析，基于多路径adhoc路由协议稳定性分析，数学模型，mdsr协议仿真-Mobile adhoc network protocol characteristics, dsr aodv agreement with the simulation and analysis of adhoc routing protocol based on multi-path stability analysis, mathematical model,
Soccerrobotbasedontheshortestpathplanningattacks.r
- 基于时间最短的足球机器人进攻路径规划，：足球机器人 进攻 路径 Bezier 曲线 比赛环境-Soccer robot based on the shortest path planning attacks,: soccer robot attack path Bezier curve game environment
D
- 有关于DIJKSTRA遗传算法的机器人路径规划演示程序。-DIJKSTRA genetic algorithm on the robot path planning demonstration program.
FINd~path
- VB利用算法~寻找不重复路径 -VB does not repeat the use of algorithms to find the path ~ VB ~ using algorithms to find the path of non-repetition
path
- 最短路径 算法 源码- path
PathPlan
- path planning for robot
123455
- 基于dsr多路径路由比较，文章中介绍了3种dsr多路径路由算法，adhoc网络-Multi-path routing based on dsr comparison, the article describes three kinds of dsr multi-path routing algorithm, adhoc networks
Optimized-Cell-Planning
- In this paper, an optimized cell planning for path loss reduction has been proposed.
planning
- matlab环境下建立威胁模型，规划路径，回避威胁-path plan
Shortest-path-algorithm
- Dijkstra的算法的c++小程序演示解决的最短路径的问题,希望对大家有用-Dijkstra' s Algorithm in c++ small program demonstrates the shortest path to solve the problem, we want to be useful
aa
- 基于遗传算法的机器人路径规划MATLAB源码，很好用-Based on genetic algorithms for robot path planning MATLAB source code, useful
bili
- 导弹飞行过程中采用比例导引法，本程序对飞行轨迹就行模拟计算。-Missile flight in the proportional guidance law, the procedures of the flight path on-line simulation.
An_Improveme_of_LEACH_Routing_Protocol_Based_on_T
- Abstract—LEACH is a hierarchy routing protocol for WSN (wireless sensor networks), which is superior to direct communication protocol, minimum-transmission-energy protocol and static clustering protocol. owever, LEACH itself has some defects. In this
path
- 离散数学 图论章节里面求解两点直接走路的最短路径-Discrete Mathematics Graph Theory to solve two chapters of which the shortest direct walking path
matlab_programming_classic_shortest_path_algorithm
- matlab程序设计最短路径经典算法matlab programming classic shortest path algorithm-matlab programming classic shortest path algorithm matlab programming classic shortest path algorithm
Path_loss_prevision
- 基于羽田孜模型的预知的路径损耗 基于爱德华兹和德金模型的路径损失预知 基于帕森斯与伊布拉因模型的路径损耗预知-Tsutomu Hata model based on predictable path loss payments based on Edwards and the German model to predict the path loss model based on Parsons and Ibraim predict the path loss
Astar
- a star method for finding path planning of a moving object
Advanced_Setpoints
- a star method for finding path planning
vc.code.full.path.information
- vc编程实现解析文件全路径信息代码vc programming code parsing file full path information -vc programming code parsing file full path information
zuiduanlusuanf
- Dijkstra最短路算法 flod算法：求任意两点之间的最短路.可以把矩阵直接带进去求解。-Dijkstra shortest path algorithm flod algorithm: seeking the shortest path between any two points. Can be brought directly into the matrix to solve.