-
EXMPL_6
基于升余弦滚降系统的多径传播的总体时域特性及其眼图(The overall spread of multi-path time-domain characteristics and eye diagram)
- 2009-05-25 21:02:07下载
- 积分:1
-
IIR
IIR滤波器设计,分离出250hz,500hz,1000hz单频(IIR filter design, isolated 250hz, 500hz, 1000hz single frequency)
- 2010-12-27 20:09:32下载
- 积分:1
-
fd
说明: 风力发电中的最小模型,从风机,到电池存储一个完整的模型,最终输出直流电压,可经过逆变模块并网。(Wind power in the smallest model, the fans, to the battery to store a complete model, the final output DC voltage, through the inverter module and network.)
- 2015-03-24 11:37:58下载
- 积分:1
-
3sigma
该程序采用3 sigma原则剔除粗差,简单易操作。(The MATLAB code use for eliminate gross errors by 3 sigma, and it is easy to run.)
- 2020-12-06 13:09:21下载
- 积分:1
-
蒙特卡洛
蒙特卡洛方法的基本思想和蒙特卡洛方法的应用(The matlab codes of monte carlo method)
- 2021-04-20 22:08:50下载
- 积分:1
-
soble-filter
可以直接使用的代码,是关于图像过滤的代码,同时可以进行soble过滤和平均过滤(The code can be used directly, image filtering code can be soble filter and average filter)
- 2013-04-18 00:10:08下载
- 积分:1
-
dogandman
一个用Mathmatica编写的动画演示程序(with an animation prepared by the Mathmatica Demonstration Program)
- 2006-10-29 13:38:33下载
- 积分:1
-
DF-delay-selection
DF加中继基于门限的中继选择,适合基础者学习。(DF plus relay threshold-based relay selection, suitable foundation to learn.)
- 2020-06-29 04:00:01下载
- 积分: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
-
bm3d_src
MATLAB CODE FOR SEGEMNT
- 2013-09-13 18:45:22下载
- 积分:1