Optimal Trajectory Generation for a Robotic Worm via Parameterization by B-Spline Curves
Authors
Abstract:
In this paper we intend to generate some set of optimal trajectories according to the number of control points has been applied for parameterizing those using B-spline curves. The trajectories are used to generate an optimal locomotion gait in a crawling worm-like robot. Due to gait design considerations it is desired to minimize the required torques in a cycle of gait. Similar to caterpillars, progress in our crawling robot is achieved by propagating a trapezoidal wave from tail to head in the vertical plane. According to this model, the optimization problem has been solved via parameterization of joint trajectories, and consequently cost function, using cubic B-spline curves versus variant numbers of control points (CPs) needed in building those. Indeed, it is tried to find the best number of the CPs, of which the cost function obtains a minimum dynamical effort. To this end, the Genetic Algorithm is employed to find the minimal cost value once a nominated number of CPs is considered. Furthermore, since a complete period of this locomotion gait is composed of separated stages called sub-motions, thus the optimal trajectories for each sub-motion is examined independently. The results show choosing the number of CPs between 8 to 12 points constructs the optimized trajectories that reduce the dynamical effort of crawl in comparison with ones are reported by previous researches.
similar resources
optimal trajectory generation for a robotic worm via parameterization by b-spline curves
in this paper we intend to generate some set of optimal trajectories according to the number of control points has been applied for parameterizing those using b-spline curves. the trajectories are used to generate an optimal locomotion gait in a crawling worm-like robot. due to gait design considerations it is desired to minimize the required torques in a cycle of gait. similar to caterpillars,...
full textA direct method to solve optimal knots of B-spline curves: An application for non-uniform B-spline curves fitting
B-spline functions are widely used in many industrial applications such as computer graphic representations, computer aided design, computer aided manufacturing, computer numerical control, etc. Recently, there exist some demands, e.g. in reverse engineering (RE) area, to employ B-spline curves for non-trivial cases that include curves with discontinuous points, cusps or turning points from the...
full textArc Length Parameterization of Spline Curves
It is often desirable to evaluate parametric spline curves at points based on their arc-length instead of the curveÕs original parameter. Techniques are presented here for computing a reparameterization curve allowing approximate arc-length evaluation. This reparameterization curve is also expressed as a spline, allowing rapid evaluation as a function of arc-length. Using composition methods de...
full textAn Evolution-Based Approach for Approximate Parameterization of Implicitly Defined Curves by Polynomial Parametric Spline Curves
We propose a novel approach for the approximate parameterization of an implicitly defined curve in the plane by polynomial parametric spline curves. The method generates the parameterization of the curve (which may consist of several open and closed branches) without using any a priori information about its topology. If needed the topology of the approximate parameterization can be certified ag...
full textNUAT B-spline curves
This paper presents a new kind of splines, called non-uniform algebraic-trigonometric B-splines (NUAT B-splines), generated over the space spanned by {1, t, . . . , tk−3, cos t, sin t} in which k is an arbitrary integer larger than or equal to 3. We show that the NUAT B-splines share most properties of the usual polynomial B-splines. The subdivision formulae of this new kind of curves are given...
full textB-Spline Curves
However, we cannot easily control the curve locally. That is, any change to an individual control point will cause changes in the curve along its full length. In addition, we cannot create a local cusp in the curve, that is, we cannot create a sharp corner unless we create it at the beginning or end of a curve where it joins another curve. Finally, it is not possible to keep the degree of the B...
full textMy Resources
Journal title
volume 4 issue 13
pages 21- 35
publication date 2015-06-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023