Obstacle Avoidance and Multitarget Tracking of a Super Redundant Modular Manipulator Based on Bezier Curve and Particle Swarm Optimization

A super redundant serpentine manipulator has slender structure and multiple degrees of freedom.It can travel through narrow spaces and move in complex spaces.This manipulator is composed of many modules that can form different lengths of robot arms for different application sites.The increase in degrees of freedom causes the inverse kinematics of redundant manipulator to be typical and immensely increases the calculation load in the joint space.This paper presents an integrated optimization method to solve the path planning for obstacle avoidance and discrete trajectory tracking of a super redundant manipulator.In this integrated optimization,path planning is established on a Bezier curve,and particle swarm optimization is adopted to adjust the control points of the Bezier curve with the kinematic constraints of manipulator.A feasible obstacle avoidance path is obtained along with a discrete trajectory tracking by using a follow-the-leader strategy.The relative distance between each two discrete path points is limited to reduce the fitting error of the connecting rigid links to the smooth curve.Simulation results show that this integrated optimization method can rapidly search for the appropriate trajectory to guide the manipulator in obtaining the target while achieving obstacle avoidance and meeting joint constraints.The proposed algorithm is suitable for 3D space obstacle avoidance and multitarget path tracking.

A transition method based on Bezier curve for trajectory planning in cartesian space

In order to smooth the trajectory of a robot and reduce dwell time,a transition curve is introduced between two adjacent curves in three-dimensional space.G2 continuity is guaranteed to transit smoothly.To minimize the amount of calculation,cubic and quartic Bezier curves are both analyzed.Furthermore,the contour curve is characterized by a transition parameter which defines the distance to the corner of the deviation.How to define the transition points for different curves is presented.A general move command interface is defined for receiving the curve limitations and transition parameters.Then,how to calculate the control points of the cubic and quartic Bezier curves is analyzed and given.Different situations are discussed separately,including transition between two lines,transition between a line and a circle,and transition between two circles.Finally,the experiments are carried out on a six degree of freedom(DOF) industrial robot to validate the proposed method.Results of single transition and multiple transitions are presented.The trajectories in the joint space are also analyzed.The results indicate that the method achieves G2 continuity within the transition constraint and has good efficiency and adaptability.

Graphics Evolutionary Computations in Higher Order Parametric Bezier Curves

This work demonstrates in practical terms the evolutionary concepts and computational applications of Parametric Curves.Specific cases were drawn from higher order parametric Bezier curves of degrees 2 and above.Bezier curves find real life applications in diverse areas of Engineering and Computer Science,such as computer graphics,robotics,animations,virtual reality,among others.Some of the evolutionary issues explored in this work are in the areas of parametric equations derivations,proof of related theorems,first and second order calculus related computations,among others.A Practical case is demonstrated using a graphical design,physical hand sketching,and programmatic implementation of two opposite-faced handless cups,all evolved using quadratic Bezier curves.The actual drawing was realized using web graphics canvas programming based on HTML 5 and JavaScript.This work will no doubt find relevance in computational researches in the areas of graphics,web programming,automated theorem proofs,robotic motions,among others.

Shape Control and Modification of Rational Bezier Curve and Surface

A Bezier interpolation approach is proposed which uses local generation of endpoint slopes and forces the curve and the surface to pass through an arbitrarily specified point to control and modify the shape of curve and surface, making the result satisfactory.

Development of Cubic Bezier Curve and Curve-Plane Intersection Method for Parametric Submarine Hull Form Design to Optimize Hull Resistance Using CFD

优化分析和计算液体动力学(CFD ) 同时被使用了，在哪个一个参量的模型在发现最佳的答案起一个重要作用。然而，与不规则的曲线为复杂形状创造一个参量的模型是困难的，例如一种海底的壳形式。在这研究，立方的 Bezier 曲线和曲线飞机交叉方法被用来产生考虑三个输入参数的一种参量的海底的壳形式的一个稳固的模型：鼻子半径，尾巴半径，和长度高度壳比率(L/H ) 。应用程序接口(API ) 脚本也被用来在 ANSYS 设计 modeler 写代码。结果证明海底的形状能与输入参数的某变化被产生。一个例子被给那显示出建议方法怎么能成功地被用于一个壳抵抗优化盒子。中间的海底的类型的参量的设计被选择被修改。首先，预先，原来的海底的模型用 CFD 被分析。然后，使用反应表面图，某候选人有一个最小的壳抵抗系数的最佳的图案被获得。进一步，在目标驱动的优化(GDO ) 的优化方法被实现与最小的壳抵抗系数发现海底的壳形式(C t ) 。最小的 C t 被获得。在在起始的潜水艇和最佳潜水艇之间的 C t 价值的计算差别在 0.26% 附近，与起始的潜水艇和是的最佳潜水艇的 C t 0.001 508 26 和 0.001 504 29 分别地。结果证明最佳潜水艇壳形式显示出更高的鼻子半径(r n ) 和更高的 L/H 起始的潜水艇比那些塑造，当时尾巴的半径(r t ) 比起始的形状的小。

基于Bezier曲线优化的茶园拖拉机避障稳定控制方法

针对茶园拖拉机(tractor in tea plantation,TTP)在作业时进行避障转弯极易发生侧翻、倾覆等安全问题,提出一种基于Bezier曲线优化的避障稳定路径控制方法.首先,从作业场景和运行稳定性两个方面进行运动学分析,系统分析了TTP安全作业特点;然后,针对TTP设计了一种避障路径规划系统方案及Bezier曲线路径优化控制方法,该方法拟合出的路径具有路径光滑、曲率连续、初末位置曲率相同等优点;最后,在CarSim仿真平台搭建TTP模型和坡道避障作业的环境模型,验证并分析横摆角速度、质心侧偏角两项重要的操稳性参数.结果表明:TTP在Bezier曲线拟合的避障路径控制方法下当运行速度小于转向极限速度时,运行稳定性良好,当转向速度超过极限速度的65.1%,其横摆角速度和质心侧偏角的超调量变化率分别达到了50.3%和78.6%;同时在该避障控制方法下,随着坡度的增加,即使速度保证在极限速度以下,TTP稳定性也会进一步恶化;在极限坡度角范围内,坡度角增大10°,其横摆角速度和质心侧偏角的超调量变化率平均达到了32.8%和14.5%.

Judging or setting weight steady-state of rational Bézier curves and surfaces

Many works have investigated the problem of reparameterizing rational B^zier curves or surfaces via MSbius transformation to adjust their parametric distribution as well as weights, such that the maximal ratio of weights becomes smallerthat some algebraic and computational properties of the curves or surfaces can be improved in a way. However, it is an indication of veracity and optimization of the reparameterization to do prior to judge whether the maximal ratio of weights reaches minimum, and verify the new weights after MSbius transfor- mation. What＇s more the users of computer aided design softwares may require some guidelines for designing rational B6zier curves or surfaces with the smallest ratio of weights. In this paper we present the necessary and sufficient conditions that the maximal ratio of weights of the curves or surfaces reaches minimum and also describe it by using weights succinctly and straightway. The weights being satisfied these conditions are called being in the stable state. Applying such conditions, any giving rational B6zier curve or surface can automatically be adjusted to come into the stable state by CAD system, that is, the curve or surface possesses its optimal para- metric distribution. Finally, we give some numerical examples for demonstrating our results in important applications of judging the stable state of weights of the curves or surfaces and designing rational B6zier surfaces with compact derivative bounds.

Constrained multi-degree reduction of rational Bézier curves using reparameterization

Applying homogeneous coordinates, we extend a newly appeared algorithm of best constrained multi-degree reduc- tion for polynomial Bézier curves to the algorithms of constrained multi-degree reduction for rational Bézier curves. The idea is introducing two criteria, variance criterion and ratio criterion, for reparameterization of rational Bézier curves, which are used to make uniform the weights of the rational Bézier curves as accordant as possible, and then do multi-degree reduction for each component in homogeneous coordinates. Compared with the two traditional algorithms of "cancelling the best linear common divisor" and "shifted Chebyshev polynomial", the two new algorithms presented here using reparameterization have advantages of simplicity and fast computing, being able to preserve high degrees continuity at the end points of the curves, do multi-degree reduction at one time, and have good approximating effect.

Degree elevation from Bzier curve to C-Bzier curve with corner cutting form

The existing results of curve degree elevation mainly focus on the degree of algebraic polynomials. The paper considers the elevation of degree of the trigonometric polynomial, from a Bezier curve on the algebraic polynomial space, to a C-Bezier curve on the algebraic and trigonometric polynomial space. The matrix of degree elevation is obtained by an operator presentation and a derivation pyramid. It possesses not a recursive presentation but a direct expression. The degree elevation process can also be represented as a corner cutting form.

Direction monotonicity for a rational Bézier curve

The monotonicity of a rational Bezier curve, usually related to an explicit function, is determined by the used coordinate system. However, the shape of the curve is independent of the coordinate system. To meet the affine invariant property, a kind of generalized mono- tonicity, called direction monotonicity, is introduced for rational Bezier curves. The direction monotonicity is applied to both planar and space curves and to both Cartesian and affine co- ordinate systems, and it includes the traditional monotonicity as a subcase. By means of it, proper affine coordinate systems may be chosen to make some rational Bezier curves monotonic. Direction monotonic interpolation may be realized for some of the traditionally nonmonotonic data as well.

Algorithms and Identities for(q, h)-Bernstein Polynomials and(q, h)-Bézier Curves–A Non-Blossoming Approach

We establish several fundamental identities, including recurrence relations, degree elevation formulas, partition of unity and Marsden identity, for quantum Bernstein bases and quantum Bezier curves. We also develop two term recurrence relations for quantum Bernstein bases and recursive evaluation algorithms for quantum Bezier curves. Our proofs use standard mathematical induction and other elementary techniques.

Re-parameterization of Bézier Curves by Square Approximation with Endpoint Constraints

In order to get an approximation with better effect of pararneterization of Bezier curves, we proposed a method for arc-length parameterization and the corresponding algorithms by square approximation for the discrete even de-parameterization of the curves. This method is simple and easy to implement, and the property of the approximation has no change compared with the original curve. A quantitative criterion for estimating the effect of parameterization is also built to quantitatively characterize the parameterization effect of the algorithms. As a result, the nearly arc-length parameterized curve has a smaller relative deviation using either the algorithm with point constraint at endpoints or the algorithm with point constraint plus the first derivative constraint at endpoints. Experiments show that after re-parameterization with our algorithms, the relative deviation will have at least a 20% reduction.

A Geometric Proof of the Convexity Preserving Property of NURBS Curves

NURBS 曲线是保存的凸状，即一旦控制多角形是凸的，联系 NURBS 曲线将也是凸的。在这份报纸，这个性质几何上被证明。

Paths of algebraic hyperbolic curves

Cubic algebraic hyperbolic (AH) Bézier curves and AH spline curves are defined with a positive parameter α in the space spanned by {1, t, sinht, cosht}. Modifying the value of α yields a family of AH Bézier or spline curves with the family parameter α. For a fixed point on the original curve, it will move on a defined curve called "path of AH curve" (AH Bézier and AH spline curves) when α changes. We describe the geometric effects of the paths and give a method to specify a curve passing through a given point.

A quadratic programming method for optimal degree reduction of Bézier curves with G^1-continuity

This paper presents a quadratic programming method for optimal multi-degree reduction of Bézier curves with G1-continuity. The L2 and l2 measures of distances between the two curves are used as the objective functions. The two additional parameters, available from the coincidence of the oriented tangents, are constrained to be positive so as to satisfy the solvability condition. Finally, degree reduction is changed to solve a quadratic problem of two parameters with linear constraints. Applica- tions of degree reduction of Bézier curves with their parameterizations close to arc-length parameterizations are also discussed.

Bezier曲线与A-Star算法融合的火星探测器路径规划

使用移动探测器探索火星表面是各大航天国家探索火星的主流方式。为了得到探测器的安全路径,提出一种基于改进A^(*)算法的火星探测器路径规划算法。通过改进路径信息算法中的权重因子,优化传统算法的目标函数,可省略大量无价值的搜索路径,缩短搜索的时间,提高搜索效率。相比于传统的路径规划该算法能缩短53.94%的时间;引入拐角优化算法,在路径长度基本一致的情况下,减少了全局路径中拐弯的次数;满足探测器高效稳定的运行需求,拐角优化后,转弯次数相能减少16.77%。通过四阶贝塞尔曲线对路径进行平滑处理,有效避免出现拐角尖峰,确保探测器在火星表面的平稳行进。

带形状参数的五次Bezier曲线的光滑拼接

针对复杂曲线的造型研究了带形状参数的五次Bezier曲线的光滑拼接问题。利用基函数性质和曲线性质,得到了曲线间的G^(1)、G^(2)、C^(1)、C^(2)光滑拼接定理。通过计算实例验证了曲线间拼接条件的有效性。

APPROXIMATE MERGING OF BE ZIER CURVES

In this paper, a simple method for merging of Bezier curves is presented by using constrained optimization method. The use of the “discrete” coefficient norm in L2 sense greatly simplifies the merging process. Furthermore, continuity at the endpoint of curves are considered in the merging process.