A path planning algorithm based on Bezier curves for underwater vehicles

An on-line path planning algorithm based on Bezier curves is presented for underwater vehicles. Aiming at the special requirements of underwater vehicles and 3D enviromnent, the algorithm consists of two steps ： the generation of spatial path and the processing of some constraints. A path for underwater vehicles is planned, which satisfies the velocity constraint and the centripetal acceleration constraint of underwater vehicles. The proposed path planning method can be used for the vehicle＇ s locomotion and navigation control.

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.

Improving the Transmission Security of Vein Images Using a Bezier Curve and Long Short-Term Memory

The act of transmitting photos via the Internet has become a routine and significant activity.Enhancing the security measures to safeguard these images from counterfeiting and modifications is a critical domain that can still be further enhanced.This study presents a system that employs a range of approaches and algorithms to ensure the security of transmitted venous images.The main goal of this work is to create a very effective system for compressing individual biometrics in order to improve the overall accuracy and security of digital photographs by means of image compression.This paper introduces a content-based image authentication mechanism that is suitable for usage across an untrusted network and resistant to data loss during transmission.By employing scale attributes and a key-dependent parametric Long Short-Term Memory(LSTM),it is feasible to improve the resilience of digital signatures against image deterioration and strengthen their security against malicious actions.Furthermore,the successful implementation of transmitting biometric data in a compressed format over a wireless network has been accomplished.For applications involving the transmission and sharing of images across a network.The suggested technique utilizes the scalability of a structural digital signature to attain a satisfactory equilibrium between security and picture transfer.An effective adaptive compression strategy was created to lengthen the overall lifetime of the network by sharing the processing of responsibilities.This scheme ensures a large reduction in computational and energy requirements while minimizing image quality loss.This approach employs multi-scale characteristics to improve the resistance of signatures against image deterioration.The proposed system attained a Gaussian noise value of 98%and a rotation accuracy surpassing 99%.

VERIFYING THE IMPLICITIZATION FOR MULAE FORDEGREE n RATIONAL BEZIER CURVES

This is a continuation of short communication([1]). In [1] a verification of the implicitization equation for degree two rational Bezier curves is presented which does not require the use of resultants. This paper presents these verifications in the general cases, i.e., for degree n rational Bezier curves. Thus some interesting interplay between the structure of the n x n implicitization matrix and the de Casteljau algorithm is revealed.

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 reduction for polynomial Bezier curves to the algorithms of constrained multi-degree reduction for rational Bezier curves. The idea is introducing two criteria, variance criterion and ratio criterion, for reparameterization of rational Bezier curves, which are used to make uniform the weights of the rational Bezier 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.

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 B6zier curves with G^1-continuity. The L2 and I2 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. Applications of degree reduction of Bezier curves with their parameterizations close to arc-length parameterizations are also discussed.

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.

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.

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.

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.

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.

Paths of algebraic hyperbolic curves

Cubic algebraic hyperbolic （AH） Bezier curves and AH spline curves are defined with a positive parameter a in the space spanned by {1, t, sinht, cosht}. Modifying the value of a yields a family ofAH Bezier 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 Bezier and AH spline curves） when a changes. We describe the geometric effects of the paths and give a method to specify a curve passing through a given point.

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

Optimization analysis and computational fluid dynamics （CFDs） have been applied simultaneously, in which a parametric model plays an important role in finding the optimal solution. However, it is difficult to create a parametric model for a complex shape with irregular curves, such as a submarine hull form. In this study, the cubic Bezier curve and curve-plane intersection method are used to generate a solid model of a parametric submarine hull form taking three input parameters into account： nose radius, tail radius, and length-height hull ratio （L/H）. Application program interface （API） scripting is also used to write code in the ANSYS DesignModeler. The results show that the submarine shape can be generated with some variation of the input parameters. An example is given that shows how the proposed method can be applied successfully to a hull resistance optimization case. The parametric design of the middle submarine type was chosen to be modified. First, the original submarine model was analyzed, in advance, using CFD. Then, using the response surface graph, some candidate optimal designs with a minimum hull resistance coefficient were obtained. Further, the optimization method in goal-driven optimization （GDO） was implemented to find the submarine hull form with the minimum hull resistance coefficient （Ct）. The minimum C, was obtained. The calculated difference in （7, values between the initial submarine and the optimum submarine is around 0.26%, with the C, of the initial submarine and the optimum submarine being 0.001 508 26 and 0.001 504 29, respectively. The results show that the optimum submarine hull form shows a higher nose radius （rn） and higher L/H than those of the initial submarine shape, while the radius of the tail （r1） is smaller than that of the initial shape.

A Geometric Proof of the Convexity Preserving Property of NURBS Curves

NURBS curves are convexity preserving, i.e. once the control polygon is convex, the associated NURBS curve will also be convex. In this paper this property is proved geometrically.

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.

Research on AGV task path planning based on improved A^(*) algorithm

Background Automatic guided vehicles(AGVs)have developed rapidly in recent years and have been used in several fields,including intelligent transportation,cargo assembly,military testing,and others.A key issue in these applications is path planning.Global path planning results based on known environmental information are used as the ideal path for AGVs combined with local path planning to achieve safe and rapid arrival at the destination.Using the global planning method,the ideal path should meet the requirements of as few turns as possible,a short planning time,and continuous path curvature.Methods We propose a global path-planning method based on an improved A^(*)algorithm.The robustness of the algorithm was verified by simulation experiments in typical multiobstacle and indoor scenarios.To improve the efficiency of the path-finding time,we increase the heuristic information weight of the target location and avoid invalid cost calculations of the obstacle areas in the dynamic programming process.Subsequently,the optimality of the number of turns in the path is ensured based on the turning node backtracking optimization method.Because the final global path needs to satisfy the AGV kinematic constraints and curvature continuity condition,we adopt a curve smoothing scheme and select the optimal result that meets the constraints.Conclusions Simulation results show that the improved algorithm proposed in this study outperforms the traditional method and can help AGVs improve the efficiency of task execution by planning a path with low complexity and smoothness.Additionally,this scheme provides a new solution for global path planning of unmanned vehicles.

A Real-time Look-ahead Trajectory Planning Methodology for Multi Small Line Segments Path

When a robot is required to machine a complex curved workpiece with high precision and speed,the tool path is typically dispersed into a series of points and transmitted to the robot.The conventional trajectory planning method requires frequent starts and stops at each dispersed point to complete the task.This method not only reduces precision but also causes damage to the motors and robot.A real-time look-ahead algorithm is proposed in this paper to improve precision and minimize damage.The proposed algorithm includes a path-smoothing algorithm,a trajectory planning method,and a bidirectional scanning module.The path-smoothing method inserts a quintic Bezier curve between small adjacent line segments to achieve G^(2)continuity at the junctions.The trajectory planning method utilizes a quartic polynomial and a double-quartic polynomial that can achieve a constant velocity at the velocity limitation.The bidirectional scanning module calculates the velocity at each trajectory planning segment point,simplifying calculation complexity and can be run in real time.The feasibility of the proposed algorithm is verified through simulations and experiments,which can be run in real time.In addition,high machining precision can be achieved by adjusting the relevant parameters.

Approximate Degree Reduction of Bezier Curves

Degree reduction of parametric curves and surfaces is an important process in data communication between CAD systems. The degenerate condition of Bezier curves and the constrained optimization method are used to develop a new degree reduction method for Bezier curves. An error analysis of the degree reduction is also given. The degree reduction scheme is combined with a subdivision algorithm to generate lower degree approximations which are within some preset error tolerance of the prescribed Bezier curve. Geometric continuity between adjacent curve segments is also considered in the subdivision/degree reduction process.

Energy Expenditure of Trotting Gait Under Different Gait Parameters

Robots driven by batteries are clean, quiet, and can work indoors or in space. However, the battery endurance is a great problem. A new gait parameter design energy saving strategy to extend the working hours of the quadruped robot is proposed. A dynamic model of the robot is established to estimate and analyze the energy expenditures during trotting. Given a trotting speed, opti- mal stride frequency and stride length can minimize the energy expenditure. However, the relationship between the speed and the optimal gait parameters is nonlinear, which is difficult for practical application. Therefore, a simplified gait parameter design method for energy saving is pro- posed. A critical trotting speed of the quadruped robot is found and can be used to decide the gait parameters. When the robot is travelling lower than this speed, it is better to keep a constant stride length and change the cycle period. When the robot is travelling higher than this speed, it is better to keep a constant cycle period and change the stride length. Simulations and experiments on the quadruped robot show that by using the proposed gait parameter design approach, the energy expenditure can be reduced by about 54% compared with the 100 mm stride length under 500 mm/s speed. In general, an energy expenditure model based on the gait parameter of the quadruped robot is built and the trotting gait parameters design approach for energy saving is proposed.