搜索资源列表
dynamicopt
- 本工程是通过运用动态规划方法寻找最优值与最优轨迹。-this program is used for searching the best value and an orbit by dynamic
LS-SVM
- 机器人避障路径规划，最优轨迹寻优，matlab仿真源码。-Obstacle avoidance path planning of robot, trajectory optimization, simulation matlab source
Astar-KO
- A *算法用于轨迹规划程序，启发式搜索算法，用于寻找最优路径(A * algorithm is used for trajectory planning program, heuristic search algorithm is used to find the optimal path)
GA
- 利用GA遗传算法进行动态路径规划，完成最优轨迹的生成，适合新手入门学习。(Using GA genetic algorithm for dynamic path planning, the completion of the optimal trajectory generation, suitable for beginners to learn.)
csape_test.m
- 基于时间最优的3R串联机械臂手轨迹规划及仿真(Trajectory Planning and Simulation of 3R Series Manipulator Based on Time Optimum)
Dy_ Win_ Approcach
- 动态窗口法（Dynamic window approach）是路径规划方法很重要的一种算法,主要是在速度空间中采样多组速度，并模拟机器人在这些速度下一定时间内的轨迹，在得到多组轨迹后，对这些轨迹进行评价，选出最优轨迹对应的速度来驱动机器人。(Dynamic window approach is an important algorithm for path planning. It mainly sampled multiple groups of velocities in the veloc
tether_optimal
- 在给定系统二阶模型、初值、终值、边界约束和路径约束、目标函数的情况下，该程序可利用hp-自使用伪谱法解算出系统从初值到终值的最优轨迹。(Given the second-order model, initial value, final value, boundary constraint and path constraint, and objective function of the system, the program can use hp-self pseudo-spectral m
二次最优轨迹规划
- 基于遗传算法的最优时间Ｂ样条轨迹，复现文章3.6节中的分析(The time-optimal B-spline trajectory based on genetic algorithm. This programme recurrences the analysis in section 3.6 of this paper)