登录
首页 » matlab » gray-dynamic-model-GM-(1-1)

gray-dynamic-model-GM-(1-1)

于 2013-03-25 发布 文件大小:1KB
0 285
下载积分: 1 下载次数: 7

代码说明:

  灰度动态模型GM(1,1)的建立,供大家参考(Establishment of gray dynamic model GM (1,1))

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • ssdaMatch
    采用ssda基本算法在一幅图像中找到与模板图像相匹配的坐标位置(Used ssda method to found a coordinate position that the template image matched in a large image )
    2010-08-04 15:58:37下载
    积分:1
  • useofmatlab
    MATLAB应用的100个基础的小程序,希望对初学者有所帮助。(100 use of matlab)
    2009-11-29 11:09:33下载
    积分:1
  • viterbi_trellis_generator
    viterbi trellis generator
    2010-01-20 00:23:53下载
    积分:1
  • m_seq1
    选择13级移位寄存器的初始数据,用移位加反馈的方法生成级数为3~13的m序列(The selection of the initial data of 13 level shift register, series is generated by shift plus feedback method for 3 ~ 13 m sequence )
    2013-10-10 00:11:36下载
    积分:1
  • fdistance
    已知两点经纬度,计算两点之间距离。 利用大地坐标!(The known longitude and latitude calculate the distance )
    2012-01-12 16:29:55下载
    积分:1
  • UnitCommitment-Lagrange
    使用拉格朗日松弛最小化方法处理简单的机组组合问题(UC)算例程序,源自电力系统运行与控制一书(Lagrangian relaxation minimization method is used to deal with simple unit combination problem (UC) example program, starts the power system operation and control)
    2020-11-16 01:29:41下载
    积分:1
  • Matlab11111
    包括了高教出版社出版的数学建模教材里部分习题的答案(including the Higher Education Publishing House of mathematical modeling teaching materials part of the answer Exercises)
    2005-05-24 12:49:42下载
    积分:1
  • Mobile-Radio-Channels-Modeling-in-MATLAB
    Some tips related to wireless channels
    2013-08-07 17:27: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
  • Kalman_3
    说明:  卡尔曼滤波在船舶GPS导航定位系统中的应用(Application of Kalman filter in ship GPS navigation and positioning system)
    2021-01-18 13:21:59下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载