登录
首页 » matlab » SurveyorToolbox_v4.2

SurveyorToolbox_v4.2

于 2011-05-08 发布 文件大小:11KB
0 259
下载积分: 1 下载次数: 6

代码说明:

  在matlab环境下控制srv-1机器人,解压后java文件夹放入matlab的bin中,其余放入toolbox(matlab srv-1 under control of the robot)

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

发表评论

0 个回复

  • hw1_result
    Cooperative relaying with Decode and Forward scheme code rate = 1/4 C.C for single-relay case
    2010-01-18 05:52:40下载
    积分:1
  • RMatlab
    To call R from within Matlab, you will need to have R compiled as a shared library. This needs to be done when compiling R from source (or via one of the binary distributions that have support for this.) Download the R source from cran.r-project.org.
    2014-08-08 16:47:25下载
    积分:1
  • rs54
    matlab rough set 粗糙集代码 matlab实现(this is a rar for rough set using matlab )
    2012-09-12 15:17:40下载
    积分:1
  • gplab.manual.3.ps
    this is a matlab source file
    2012-03-31 00:45:27下载
    积分:1
  • median_block
    中值滤波MATLAB算法,是一种很好的滤波器,实用‘方便(MATLAB median filtering algorithm is a good filter, practical ' convenience)
    2010-05-19 12:31:29下载
    积分:1
  • pso_implement
    For PSO implimentation.
    2012-04-06 18:25:57下载
    积分:1
  • dct_omp
    说明:  压缩感知中基于DCT基的OMP算法,用正交匹配追踪重构出原始信号(DCT-based compressed sensing based OMP algorithm, orthogonal matching pursuit reconstruct the original signal)
    2011-04-06 20:39:28下载
    积分:1
  • OFDM
    OFDM信道估计程序 是基于导频的OFDM信号信道估计的matlab程序(OFDM channel estimation procedures is estimated based pilot OFDM signal channel matlab program)
    2012-10-03 17:47:23下载
    积分:1
  • nnet-0.1.7
    Octave Neural Network rewritten to be compatible with Matlab.
    2009-09-08 20:45:51下载
    积分:1
  • dijikstra
    For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
    2012-04-12 21:01:48下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载