登录
首页 » matlab » kalman121

kalman121

于 2007-01-16 发布 文件大小:2KB
0 239
下载积分: 1 下载次数: 163

代码说明:

  卡尔曼滤波算法在Matlab中的编程 仿真的为航迹跟踪的滤波过程(Kalman filtering algorithm in Matlab simulation programming for the track tracking filtering process)

文件列表:

initial_track.m
initial_track.mat

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

发表评论

0 个回复

  • findlocalminima
    局部极小点,用于局部极小点的程序,还有相应的论文,大家可以下载好好学习,看看老外的编程技巧(find local minimum)
    2012-04-24 22:55:39下载
    积分:1
  • chapter10
    matlab 中一些很用的代码,数值分析于应用。(matlab code, numerical analysis on the application.)
    2013-04-27 10:39:21下载
    积分:1
  • chanerguangxianjiguangqi
    掺铒光纤激光器动态模型数值化,采用掺铒光纤分段处理的方法,仿真光信号在环形腔内的传输(Erbium-doped fiber lasers numerical dynamic model using erbium-doped fiber section processing method, the simulation of the optical signal transmitted in the annular cavity)
    2020-11-06 17:09:49下载
    积分:1
  • MATLAB--the-finite-element-method
    MATLAB 教学用书,附有有限元法的例子教程,平面问题,框架例子(MATLAB teaching books, with examples of the finite element method tutorials, plane problems, frame examples)
    2014-11-05 12:58:30下载
    积分:1
  • PVpc
    本程序模拟日间24个时段光伏出力情况,根据三点估计法求出光伏出力和三点取值的权重(This procedure simulated photovoltaic output is 24 hours in the day, and the photovoltaic output based on three-point estimate method and the weight of three values)
    2016-06-21 18:50:38下载
    积分:1
  • dimreductionusingpca
    Dimensionality reduction
    2011-05-06 15:11:49下载
    积分:1
  • PLS_3
    利用matlab编程实现偏最小二乘算法,可完成辨识模型的参数(partial least square)
    2013-09-29 10:29:57下载
    积分:1
  • LQR-controller-on-genetic-
    基于遗传算法的LQR控制器优化设计,利用MATLAB实现。(LQR controller based on genetic algorithm optimization design, the use of MATLAB.)
    2013-07-17 14:25:47下载
    积分:1
  • yushu
    余数定理用于多基线相位干涉仪的解模糊中要求基线关系互质(Remainder theorem for the solution of multi-baseline interferometer fuzzy requirements baseline relations coprime)
    2013-01-16 20:37:01下载
    积分:1
  • M
    字典树的基本功能是用来查询某个单词(前缀)在所有单词中出现次数的一种数据结构,它的插入和查询复杂度都为O(len),Len为单词(前缀)长度,但是它的空间复杂度却非常高,如果字符集是26个字母,那每个节点的度就有26个,典型的以空间换时间结构。(The basic function of the dictionary tree data structure is used to query a number of times a word (prefix) appears in all the words, which insertion and query complexity are O (len), Len is a word (prefix) length, but its space complexity is very high, if the character set is 26 letters, and that the degree of each node will have 26, the typical structure of space for time.)
    2013-11-29 14:28:52下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载