-
diancichang
中北大学电磁场电磁波课后题答案，很详细的(North University of electromagnetic waves after-school question answers, a very detailed)
- 2009-11-01 15:05:30下载
- 积分：1
-
Synchronize
说明： 由于使用了大量数目的子载波，这就使得多载波系统对多种同步误差都很敏
感。同步误差可分为两大类:载波相位
(due to the use of the large number of subcarriers, which makes multi-carrier systems for a variety of synchronization errors are very sensitive. Synchronization error can be divided into two categories : carrier phase)
- 2006-03-30 09:21:14下载
- 积分：1
-
CS_OMP
正交匹配追踪算法—基于压缩感知信号重构.(Orthogonal Matching Pursuit algorithm- based on compressed sensing signal reconstruction)
- 2014-12-24 08:53:35下载
- 积分：1
-
Floyd
Floyd算法,对研究通信网性能分析很有帮助(Floyd algorithm, the study of communication network performance analysis very helpful)
- 2008-05-31 01:02:30下载
- 积分：1
-
boxcount
说明： 用matlab程序编写，计算分形图像的计盒维数。(Programming using matlab to calculate the fractal box dimension image.)
- 2011-03-22 11:28:35下载
- 积分：1
-
IEEE_UWB_PDP
根据IEEE802.15.sg3a信道统计模型产生信道冲激响应，并计算信道的功率延迟剖面(Generates the channel impulse response for a multipath channel according to the statistical model proposed by the IEEE 802.15.SG3a. Evaluates the Power Delay Profile PDP .)
- 2020-09-01 17:38:09下载
- 积分：1
-
zero-forcing-equalization
迫零均衡算法的MATLAB实现,不可多得的好东西.(Zero-Forcing equalization algorithm in MATLAB realize, rare good things.)
- 2007-10-10 07:38:31下载
- 积分：1
-
Based-on-the-Matlab-knapsack-
基于Matlab的0_1背包问题的动态规划方法求解(Based on the Matlab 0_1 knapsack problem, dynamic programming method for solving)
- 2012-08-06 23:46:59下载
- 积分：1
-
cloude--Ha
极化分类中的cloude算法，程序没有问题哦，毕设用的程序(Cloude polarization classification algorithm, the program is no problem Oh, the complete set with the program)
- 2020-12-20 18:59:10下载
- 积分：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
