-
cliffs.algebra.2--0764563718
Linear Algebra - Math book
- 2010-06-09 09:15:41下载
- 积分:1
-
binary-file
this file can help to read and write and even graphic changes for videos and images.
- 2011-02-12 19:47:05下载
- 积分:1
-
slot_phase
求取电机分数槽槽号分相,是用MATLAB计算的程序(the fraction slot to phase)
- 2012-04-06 10:45:36下载
- 积分:1
-
dtcydl
这是一个低通抽样定理,例题中包括了低通信号的波形,抽样速率为4Hz的抽样信号,抽样序列恢复出原始信号(This is a low-pass sampling theorem, examples included in the lowpass signal waveform, the sampling rate is 4Hz sampling signal to recover the original signal sample sequence)
- 2013-09-19 08:57:27下载
- 积分:1
-
Matlab
1-32是:图形应用篇
33-66是:界面设计篇
67-84是:图形处理篇
85-100是:数值分析篇
(1-32 are: application of articles 33-66 are graphic: interface design articles 67-84 is: is the graphics chapter 85-100: Numerical Analysis Section)
- 2010-05-26 19:59:20下载
- 积分:1
-
ACO-for-path-planning
蚁群算法路径规划matlab代码,可以正常运行(Ant colony algorithm for path planning of the matlab code, and can run normally)
- 2015-04-07 19:09:44下载
- 积分:1
-
granger_cause
说明: 用于检验两个时间序列是否具有格兰杰因果关系(Used to test whether two time series have Granger causality)
- 2019-03-01 17:04:42下载
- 积分:1
-
dsss
coding for direct spread spectrum
- 2009-03-19 21:18:35下载
- 积分:1
-
popov1
基于popov超稳定性的模型参考自适应控制matlab仿真(popov)
- 2021-02-23 01:49:41下载
- 积分:1
-
GAforPathPlaning
采用栅格对机器人的工作空间进行划分,再利用优化算法对机器人路径优化,是采用智能算法求最优路径的一个经典问题。目前,采用蚁群算法在栅格地图上进行路径优化取得比较好的效果,而利用遗传算法在栅格地图上进行路径优化在算法显得更加难以实现。
利用遗传算法处理栅格地图的机器人路径规划的难点主要包括:1保证路径不间断,2保证路径不穿过障碍。
用遗传算法解决优化问题时的步骤是固定的,就是种群初始化,选择,交叉,变异,适应度计算这样,那么下面我就说一下遗传算法求栅格地图中机器人路径规划在每个步骤的问题、难点以及解决办法。(It is a classical problem to divide the workspace of the robot by grids and optimize the path of the robot by using optimization algorithm. At present, the ant colony algorithm is used to optimize the path on the grid map, and the genetic algorithm is used to optimize the path on the grid map, which is more difficult to achieve.
The difficulties of using genetic algorithm to deal with the path planning of robot on raster map mainly include: 1. guaranteeing that the path is uninterrupted, 2. guaranteeing that the path does not cross obstacles.
The steps of genetic algorithm in solving optimization problems are fixed, that is, population initialization, selection, crossover, mutation, fitness calculation. Then I will talk about the problems, difficulties and solutions of genetic algorithm in each step of robot path planning in raster map.)
- 2019-05-02 14:56:19下载
- 积分:1