-
rcf_bjc
说明： 北京邮电大学通信原理升余弦滚降系统的源程序(Beijing University of Posts and Communication Theory Cosine system source code)
- 2010-04-22 11:01:44下载
- 积分：1
-
SOLP
说明： 社会保障行业研究,方法论研究,仅供参考.(Social Security industry research, methodological research is for reference only)
- 2010-05-03 10:42:11下载
- 积分：1
-
wigb
用来绘制地震波形曲线，在石油地震勘探以及其他地震研究领域都很实用。(Plot seismic data using wiggles in seismic exploration researchment.)
- 2013-09-25 20:33:18下载
- 积分：1
-
chap3_2s
说明： 此程序为模糊PID控制程序，自适应模糊PID控制器以误差e和误差变化率e 作为输入，可以满足不同时刻的e和e 对PID参数自整定的要求。利用模糊控制规则在线对PID参数进行修改，便构成了自适应模糊PID控制器。
(procedure for fuzzy PID control procedures, adaptive fuzzy PID controller error e and e error rate of change as input to meet the different moments of e and e PID tuning parameters from the request. Fuzzy-control rules on PID parameters changed, they constitute the adaptive fuzzy PID controller.)
- 2005-11-13 21:47:55下载
- 积分：1
-
PatternRecognition
1.Fisher分类算法
2.感知器算法
3.最小二乘算法
4.快速近邻算法
5.K-近邻法
6.剪辑近邻法和压缩近邻法
7.二叉决策树算法(1.Fisher Classification Algorithm 2. Perceptron algorithm 3. Least-squares algorithm 4. Fast nearest neighbor 5.K-neighbor method 6. Clips neighbor neighbor method and compression method 7. Binary Decision Tree Algorithm)
- 2008-06-28 20:32:38下载
- 积分：1
-
Newton
牛顿迭代法求无约束一维极值问题的速度相当快，而且还有一个好处就是能高度逼近最优值。(Newton iteration method for one-dimensional unconstrained extremum problem very fast, but there is a benefit that can be highly close to the optimal value.)
- 2013-09-08 15:10:32下载
- 积分：1
-
KMeans
K-means算法的实现,通过对没有标记的原始数据进行kmeans聚类得到的分类。(K-means algorithm to achieve)
- 2014-12-13 14:39:29下载
- 积分：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
-
TimeCalculator
时间计算器，输出时间的年月日，及两个事件的差值(Time Calculator)
- 2009-04-29 12:57:13下载
- 积分：1
-
16_QAM
16QAM 升余弦 高频载波 AWGN信道 最佳接收(Raised cosine frequency carrier 16QAM AWGN channel for best reception)
- 2010-07-02 16:45:43下载
- 积分：1
