搜索资源列表
61801303pathline
- 粒子群算法求解机器人路径规划的MATLAB算法(MATLAB algorithm for particle swarm optimization for robot path planning)
D和A算法
- 简单的路径规划问题中的Dijkstra和A*算法(Dijkstra and A* algorithms for simple path planning problems)
dijkstra1
- 用于路径规划，程序初始需要读入Kinect相机拍摄的深度图像(For path planning, the program initially needs to read the depth image taken by the Kinect camera)
dijkstra algorithm with GUI
- 改进版的迪杰斯特拉算法，主要用于路径规划，效果良好(Improved version of the Dijkstra algorithm, mainly for path planning, the effect is good)
floyd
- Floyd算法又称为插点法，是一种利用动态规划的思想寻找给定的加权图中多源点之间最短路径的算法，与Dijkstra算法类似。(Shortest path algorithm)
蚁群算法
- 路径规划是水下潜器智能控制的关键技术之一，其任务是在已知障碍物的环境中按照某一 最优指标寻找一条从起始点到目标点的无碰路径。使用蚁群算法对水下潜器三维空间路径规划问 题进行了研究，以 ACS 算法为基础设计了路径优化搜索算法，详细讨论了信息素表示方法、路径 点选取原则、启发式函数设计和信息素更新规则，给出了算法的具体流程，仿真实验结果表明， 该算法能够方便有效的实现三维空间中的路径规划。(Path planning is one of the key technologies of unde
蚁群算法程序(matlab)
- 基于蚁群算法的物流配送问题：研究如何规划各车辆的路径及任务分配，使得在不违反时间窗的前提下，总走行成本（距离）最少。(Logistics distribution problem)
模拟退火
- 使用模拟退火算法实现无人机航迹规划，附录全部程序与数据(Using simulated annealing algorithm to realize UAV path planning, appendix all procedures and data)
13_粒子群
- 航迹规划是无人机执行侦察和作战任务中的关键技术，规划算法的性能直接影响着航迹规划的质量。针对航迹规划最优性和实时性问题，提出一种惯性权值" 阶梯式" 调整策略与跳出局部最优解策略相结合的改进粒子群无人机航迹规划算法。(Route planning is the key technology for UAV to perform reconnaissance and combat tasks, and the performance of planning algorithm
route planning
- 本文阐述了全局路径规划问题的无人飞行器作为约束在三维环境下的优化问题，提出了一种微分进化算法生成一个最优的可行路径。(This paper formulates the global route planning problem for the unmanned aerial vehicles (UAVs) asa constrained optimization problem in the three-dimensional environment and proposes an impro
yiqunerweilujing
- 《Matlab智能算法30个案例分析》基于蚁群算法的二维路径规划算法(Two dimensional path planning algorithm based on ant colony algorithm)
yiqunsanweilujing
- 《Matlab智能算法30个案例分析》基于蚁群算法的三维路径规划算法(Three dimensional path planning algorithm based on ant colony algorithm)
改进蚁群
- 将蚁群算法应用于三维路径规划问题上，算法编程完整，注释详细，是初学者宝贵的学习材料。(The ant colony algorithm is applied to the three-dimensional path planning problem, the algorithm programming is complete, detailed notes, is a valuable learning material for beginners.)
GA
- 遗传算法用于路径规划，用于3D路径规划。(Genetic algorithms are used for path planning for 3D path planning.)
RRT-maze
- rrt*算法的实现，可以实现路径的规划与修剪(The implementation of rrt* algorithm can realize path planning and pruning)
floyd
- Floyd算法又称为插点法，是一种利用动态规划的思想寻找给定的加权图中多源点之间最短路径的算法，与Dijkstra算法类似(Floyd algorithm, also called plug point method, is an algorithm based on the idea of dynamic programming to find the shortest path between multiple source points in a weighted graph, simil
基于蚁群算法的三维路径规划算法
- Ant Colony Optimization11
基于蚁群算法的二维路径规划算法
- 而一个种群则由经过基因（gene）编码的一定数目的个体(individual)组成。每个个体实际上是染色体(chromosome)带有特征的实体。染色体作为遗传物质的主要载体，即多个基因的集合，其内部表现（即基因型）是某种基因组合，它决定了个体的形状的外部表现，如黑头发的特征是由染色体中控制这一特征的某种基因组合决定的。(A population consists of a certain number of individuals encoded by a gene. Each individ
目标函数程序
- 人工势场法路径规划程序，文件中为文章中目标函数编程参考文件。(The path planning program of the artificial potential field method, in which the reference file is programmed for the target function in the article.)
Astar
- A*算法是一种静态路网中求解最短路径最有效直接的搜索方法，也是许多其他问题的常用启发式算法，他考虑了全局的信息，可以在一些情况下蜕化为迪杰斯特拉算法以及扫描时算法，本程序文件是利用A*算法进行一个航路规划(A * algorithm is a static road network to solve the shortest path is the most effective and direct search method, is also a lot of other problems c