登录
首页 » matlab » Self_cali

Self_cali

于 2013-11-17 发布 文件大小:1227KB
0 182
下载积分: 1 下载次数: 21

代码说明:

  本程序的功能是:实现惯性导航参数的自标定过程。(Realize the self-calibration process of inertial navigation)

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

发表评论

0 个回复

  • dsk02
    matlab在电子信息中的应用和实例中的源代码,很完整,对学习MATLAB的人会有很大帮助.(matlab in the application of electronic information and examples of source code, it is full of learning MATLAB person would be of considerable help.)
    2008-04-08 09:02:13下载
    积分:1
  • Lyapunov
    说明:  通过MATLAB计算各种混沌系统的Lyapunov的值,同时还可添加自己的程序计算Lyapunov的值(MATLAB calculated through a variety of chaotic systems the value of Lyapunov, but can also add your own procedures for calculating the value of Lyapunov)
    2009-08-19 19:47:23下载
    积分:1
  • nr3matlab
    Interface for Numerical recipes to Matlab
    2013-01-10 02:58:19下载
    积分:1
  • option_MonteCarlo
    百慕达期权的MonteCarlo模拟,MonteCarlo广泛应用于各种期权定价模拟等过程(Bermuda option MonteCarlo simulations, MonteCarlo widely used in option pricing simulation processes)
    2011-07-06 17:00:14下载
    积分:1
  • scatter_q11
    Scatter plot given x,y locations and SINR distribution with each service node. SINR distribution is color coded in the 2D scatter plot.
    2014-12-14 22:04:16下载
    积分:1
  • piuteng
    匹配追踪和正交匹配追踪,经典的灰度共生矩阵纹理计算方法,GSM中GMSK调制信号的产生。( Matching Pursuit and orthogonal matching pursuit, Classic GLCM texture calculation method, GSM is GMSK modulation signal generation.)
    2016-05-19 19:38:28下载
    积分:1
  • Load_Profile
    说明:  Investigating the Impact of Load Profile Attributes on Demand Response Exchange. Modeling of demand response (DR) seller bids in traditional approach/model includes a ustomer willingness factor assigned in a random/arbitrary manner.
    2019-01-30 00:23:21下载
    积分:1
  • kmanes2
    k means clustering algorithm new 2 cluster
    2013-11-04 05:00:43下载
    积分:1
  • 5
    说明:  利用Dijkstra算法来求网络图的最短路径,找到从起点P1到终点Pn的最短路径,由于上述算法使用了连接线中点的条件,不是整个规划空间的最优路径,然后利用遗传算法对找到的最短路径各个路径点Pi (i=1,2,…n)调整,让各路径点在相应障碍物端点连线上滑动(Use Dijkstra algorithm to find the shortest path network diagram to find the starting point P1 to the end of Pn from the shortest path algorithm is used as the midpoint of the condition of cable, not the entire optimal path planning of space, and then use genetic algorithm to find shortest path of each path points Pi (i = 1,2, ... n) adjusted to the path of obstacles in the corresponding endpoint connection point slide)
    2011-05-10 16:03:58下载
    积分:1
  • TrabalhoPDI01
    kmeans dataset iris.dat
    2013-05-27 04:52:16下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载