-
simulink
simulink的简单应用和一些简单的simulink通信方面的仿真实例,还有一些简单的入门课件(simulink)
- 2009-06-02 15:14:45下载
- 积分：1
-
802.11b PHY Simulink Model
先将压缩包解压缩到一个新文件夹中，改变matlab当前执行目录，然后运行WiFi.mdl文件。 压缩包中包括6个文件：WiFi.mdl，WiFi_lib.mdl，WiFi_init.m，cck_codes.mat，ber_test.m，test_level_1.m。 模型使用标准：IEEE Std 802.11b-1999, 来源于: http://standards.ieee.org/reading/ieee/std/lanman/ ">
- 2005-05-27 13:58:27下载
- 积分：1
-
bilinear_zoom
bilinear zoom, subpixel technique for image processing
- 2014-08-21 07:16:37下载
- 积分：1
-
CollectionsofWaterMarkingAttack
关于各种数字水印攻击的MATLAB代码，可以用于仿真实验，调用方便简单(Digital watermarking attacks on a variety of MATLAB code that can be used for simulation experiments, to facilitate a simple call to)
- 2009-11-13 09:04:31下载
- 积分：1
-
date07.ps
TRES IMPORTANT SUR LES MOTEURS PAS 0 PAS LINEAIRES
- 2011-11-15 23:46:21下载
- 积分：1
-
kuozhankaermanlvboqi
卡尔曼滤波是一种高效率的递归滤波器(自回归滤波器), 它能够从一系列的不完全包含噪声的测量(英文:measurement)中，估计动态系统的状态。(Kalman filter is an efficient recursive filter (autoregressive filter), which can contain from a series of incomplete measurement of noise (in English: measurement) is estimated dynamic system state.)
- 2011-01-17 21:31:29下载
- 积分：1
-
IMU-trajectory
利用IMU的加速度和陀螺仪数据进行轨迹估计(Trajectory estimation using the IMU data)
- 2020-06-20 14:20:01下载
- 积分：1
-
kalman-filtering-algorithm
卡尔曼滤波的源代码，里面包括了权向量的计算以及MSE的偏差曲线(Kalman filtering of the source code, which includes the calculation of the weight vector and the MSE deviation curve)
- 2011-06-27 11:57:01下载
- 积分：1
-
modoqpsk
Offset quadrature phase-shift keying (OQPSK) is a variant of phase-shift keying modulation using 4 different values of the phase to transmit. It is sometimes called Staggered quadrature phase-shift keying (SQPSK).
- 2013-10-21 06:26:14下载
- 积分：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
