搜索资源列表
1012071014
- DDA算法,中点算法,Bresenham算法生成直线,进行区域填充-DDA algorithm, the midpoint algorithm, Bresenham algorithm to generate a straight line, the area filling
robot
- 取各障碍物顶点连线的中点为路径点,相互连接各路径点,将机器人移动的起点和终点限制在各路径点上,利用Dijkstra算法来求网络图的最短路径,找到从起点P1到终点Pn的最短路径,由于上述算法使用了连接线中点的条件,不是整个规划空间的最优路径,然后利用遗传算法对找到的最短路径各个路径点Pi (i=1,2,…n)调整,让各路径点在相应障碍物端点连线上滑动,利用Pi= Pi1+ti×(Pi2-Pi1)(ti∈[0,1] i=1,2,…n)即可确定相应的Pi,即为新的路径点,连接此路径点为最优路径。-Ta
duncan-2
- 利用ABAQUS中的用户材料子程序UMAT开发的三维邓肯-张模型,应力积分算法采用的是中点增量法。-Using ABAQUS user material subroutine UMAT in the development of three-dimensional Duncan- the stress integration algorithm is used in the mid-point incremental method.
Ordinary-Differential-Problems
- 用Euler法、中点格式、预报-校正格式、经典四级四阶R-K格式算法求解一阶常微分方程初值问题的数值解。-By Euler method, the midpoint format, forecast- correction format, the classic format of four fourth-order RK algorithm for a numerical solution of ordinary differential equations in order to solve