三自由度仿真

说明：  在 Carsim 中分别搭建好前车与后车的车辆纵向动力学 模型。雷达系统将探测到的后车信息和前车信息传递给行车 间距控制系统，此控制系统根据安全距离模型计算出后车车 辆期望加速度，此期望加速度经过 PID 控制器调节后，输入 给车辆动力学系统，车辆动力学系统基于此加速度输出期望 的制动压力和节气门开度，并将此值传给制动及节气门控制 系统，此系统输出相应的制动力及节气门开度给后车动力学 系统，进行制动及加速控制。(The vehicle longitudinal dynamics of the front car and the rear car were built respectively in Carsim Model.The radar system transmits the information of the vehicle behind and the vehicle in front to the vehicle Spacing control system, this control system according to the safe distance model to calculate the rear car Vehicle expected acceleration, the expected acceleration after PID controller adjustment, input Given to the vehicle dynamics system, the vehicle dynamics system is based on this acceleration output expectation Brake pressure and throttle opening, and pass this value to brake and throttle control System, which outputs the corresponding braking force and throttle opening to the rear car dynamics System for braking and acceleration control.)

说明：  abaqus 帮助文档中的蠕变本构模型，包括时效强化模型和应变强化模型，以及一个模型的inp文件(Creep constitutive model in abaqus help document, including time-based reinforcement model and strain reinforcement model, and inp file of a model)

umat基础知识教学，适合刚接触UMAT的新手做参考(UMAT basic knowledge teaching, suitable for beginners)

说明：  关于J2塑性流动理论的金属3的材料本构隐式子程序umat(Implicit Subprogram UMAT for Material Constitutive of Metal 3 in J2 Plastic Flow Theory)

说明：  六边形蜂窝自动建模插件，能在abaqus中自动建立蜂窝模型(Hexagonal honeycomb automatic modeling plug-in)

说明：  tarjan算法求解有向图中的简单环，非常好用(Tarjan algorithm is very useful for solving simple rings in directed graphs.)

清洁机器人内螺旋算法仿真matlab程序，采用内螺旋算法全覆盖算法(Internal helix algorithm simulation)

说明：  生成三维随机纤维的matlba程序，可以直接使用(The matlba program for generating 3D random fibers can be used directly)

说明：  完成对四旋翼飞行器的数学建模，并在matlab矩阵实验室中进行仿真，进一步设计飞行控制系统。(Complete the mathematical modeling of quadrotor aircraft, and simulate in MATLAB matrix laboratory.)

节点度是指和该节点相关联的边的条数，又称关联度。 特别地，对于有向图， 节点的入度 是指进入该节点的边的条数; 节点的出度是指从该节点出发的边的条数。(Node degree refers to the number of edges associated with the node, also known as the degree of association. In particular, for a directed graph, The ingress of a node is the number of edges entering the node; The out-degree of a node is the number of edges that start from that node.)