5 research outputs found

    Speed Computation for Industrial Robot Motion by Accurate Positioning

    Get PDF
    In this paper we define a new method for speed (velocity) computation, named mixt profile. The mixt profile of speed variation assures an accurate positioning at the end of motion (movement), in a well determinate time lapse. The method is linked with computation of location (position) matrix, about an industrial robot. Mixt profile of speed may be applied about motion on linear or circular trajectories. The paper continues the explanation from [6] regarding this method

    Continuous collision detection for ellipsoids

    Get PDF
    We present an accurate and efficient algorithm for continuous collision detection between two moving ellipsoids. We start with a highly optimized implementation of interference testing between two stationary ellipsoids based on an algebraic condition described in terms of the signs of roots of the characteristic equation of two ellipsoids. Then we derive a time-dependent characteristic equation for two moving ellipsoids, which enables us to develop a real-time algorithm for computing the time intervals in which two moving ellipsoids collide. The effectiveness of our approach is demonstrated with several practical examples. Ā© 2006 IEEE.published_or_final_versio

    Error bounded approximate reparametrization of NURBS curves

    Get PDF
    Journal ArticleThis paper reports research on solutions to the following reparametrization problem: approximate c(r(t)) by a NURBS where c is a NURBS curve and r may, or may not, be a NURBS function. There are many practical applications of this problem including establishing and exploring correspondence in geometry, creating related speed profiles along motion curves for animation, specifying speeds along tool paths, and identifying geometrically equivalent, or nearly equivalent, curve mappings. A framework for the approximation problem is described using two related algorithmic schemes. One constrains the shape of the approximation to be identical to the original curve c. The other relaxes this constraint. New algorithms for important cases of curve reparametrization are developed from within this framework. They produce results with bounded error and address approximate arc length parametrizations of curves, approximate inverses of NURBS functions, and reparametrizations that establish user specified tolerances as bounds on the Frechet distance between parametric curves

    Cartesian spline interpolation for industrial robots

    No full text
    corecore