登录
首页 » c++ » Robocup 2D Server 源码

Robocup 2D Server 源码

于 2023-09-01 发布 文件大小:756.09 kB
0 119
下载积分: 2 下载次数: 1

代码说明:

RoboCup 2D模拟仿真比赛的server端源码 感兴趣的朋友可以关注一下,后续会继续上传Client端以及底层动作源码,互相学习

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

发表评论

0 个回复

  • LMIbudengshi
    该文章讲解了线性矩阵不等式的求解方法,针对不同的线性矩阵不等式,给出了相关算法和程序(The article explained the linear matrix inequalities solving method, for different linear matrix inequalities, given the relevant algorithms and procedures)
    2013-08-19 20:47:04下载
    积分:1
  • Aircraft_DMP_dsc
    使用mpu6050的dmp获得的欧拉角和四元数(Dmp obtained using mpu6050 of Euler angles and quaternion)
    2013-08-20 15:15:24下载
    积分:1
  • CXML
    对XML文档解析库tinyxml的再次封装,更加方便xml文档的解析与修改。(Library for parsing XML documents tinyxml the package again, more convenient xml document parsing and modification.)
    2013-09-17 14:15:31下载
    积分:1
  • STC12C5A60S2
    STC12C5A60S2双串口通信例程,含注释。(STC12C5A60S2 Two serial communication routines, including the Notes.)
    2014-01-13 14:29:56下载
    积分:1
  • 曲面重建
    说明:  pcl点云重建,贪婪三角化,可显示结果,保存obj模型(Greedy triangulation of PCL point cloud reconstruction)
    2020-05-16 18:05:57下载
    积分:1
  • chapter-2
    数据结构表的基本操作,包括线性表和链表,已经一些例子(linklist )
    2014-06-05 22:42:43下载
    积分:1
  • STACK
    用C语言编写的堆栈接口,适用于各种环境,提供接口: STACK *initStack(int MaxRoom) void destroyStack(STACK **spp) void resetStack(STACK *sp) Boolean isStackEmpty(STACK stack) Boolean isStackFull(STACK stack) Boolean push(STACK *sp, USER_TYPE data) Boolean pop(STACK *sp, USER_TYPE *data) Boolean readTop(STACK stack, USER_TYPE *data) (C language implementation of the stack)
    2013-07-22 10:59:32下载
    积分:1
  • tms320c6748_volice_card
    通过dsp的usb2.0与pc相连,然后pc把要放音和要录音的文件通过usb2.0实时传到dsp,dsp根据算法来控制8个录放音通道中的那个通道放音和录音(By the dsp usb2.0 connected with pc and pc to want to play and want to record files transmitted in real time via usb2.0 dsp, dsp according to the algorithm to control eight channels of sound recording that channel playback and recording)
    2015-09-23 14:17:52下载
    积分:1
  • youxiangtu
    编写C程序,随机给出n*n的邻接矩阵,并打印输出邻接矩阵,以及有向图的边的个数,每个顶点的度,并判断该图中是否存在Euler回路: (1)如果为n阶,则随机产生一个n*n的邻接矩阵; (2)输出邻接矩阵,边的个数,每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点,一个是数据结构中的有向图的邻接矩阵的创建,还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)
    2008-06-14 02:33:57下载
    积分:1
  • DCC_V_33-master
    基于FPGA的自适应滤波实现,,,,,,,,,,,(Implementation of adaptive filtering based on FPGA)
    2020-06-17 21:00:07下载
    积分:1
  • 696518资源总数
  • 106182会员总数
  • 24今日下载