登录
首页 » matlab » cinematica

cinematica

于 2012-01-20 发布 文件大小:9KB
0 113
下载积分: 1 下载次数: 4

代码说明:

  human robot simulation in matlab kinematic

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

发表评论

0 个回复

  • euler.zip
    说明:  euler格式前进、后退和改进的格式,并在一个程序中(euler)
    2010-04-16 16:52:21下载
    积分:1
  • xiebiyizhi
    基于matlab的电力系统谐波抑制研究。对一座110kv变电站进行建模,并对谐波进行分析。介绍了利用无功补偿进行谐波抑制的措施。(Matlab-based Power System Harmonic Suppression. On a 110kv substation modeling, and harmonic analysis. Introduced the use of reactive compensation for harmonic suppression measures.)
    2010-05-12 18:00:29下载
    积分:1
  • matlb-manualPmath-symbols
    matab basic need for programming , math symbols documents
    2011-12-15 04:01:06下载
    积分:1
  • 扩展卡尔曼滤波算法锂离子电池SOC估计中有较广泛的应用 EKF
    说明:  扩展卡尔曼滤波算法锂离子电池SOC估计中有较广泛的应用,其精度高,鲁棒性好,算法简单(The extended Kalman filtering algorithm has a wide range of applications in SOC estimation of lithium-ion batteries, with high accuracy, good robustness, and simple algorithm)
    2020-04-08 10:06:34下载
    积分:1
  • Signals_With_MATLAB
    Signal & Systems WITH MATLAB e-book good for signal & system engineering course
    2010-06-24 12:54:32下载
    积分:1
  • MATLAB
    说明:  包含多章MATLAB典型程序与应用,对初学者很有帮助(Chapter contains more than the typical process and application of MATLAB, very helpful for beginners)
    2009-08-15 23:07:49下载
    积分:1
  • anneal
    a code for simulated annealing algorithm
    2013-01-03 19:14:42下载
    积分:1
  • MatlabMoments
    seismic moment calculation
    2013-09-22 02:44:18下载
    积分:1
  • mapso
    matlab与mas系统的结合 设计了多智能体的合作与竞争机制 效果还不错(The combination with the mas matlab system designed multi-agent cooperation and competition results were pretty good)
    2011-10-14 21:53:24下载
    积分:1
  • 最大二分配法
    如果G的边集E(G)中有个子集M,满足M中的任何两条边 都不邻接,则M就是图G的一个匹配。包含边数最多的匹配 称为最大匹配,最大匹配所包含的边数称为最大匹配数。当 G是二分图时,问题就比较特殊了,这就是我们要解决 的问题——最大二分匹配。(If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.)
    2021-01-20 10:38:41下载
    积分:1
  • 696518资源总数
  • 104384会员总数
  • 26今日下载