2,316 research outputs found
Smooth path planning with Pythagorean-hodoghraph spline curves geometric design and motion control
This thesis addresses two significative problems regarding autonomous systems, namely path and trajectory planning. Path planning deals with finding a suitable path from a start to a goal position by exploiting a given representation of the environment. Trajectory planning schemes govern the motion along the path by generating appropriate reference (path) points.
We propose a two-step approach for the construction of planar smooth collision-free navigation paths. Obstacle avoidance techniques that rely on classical data structures are initially considered for the identification of piecewise linear paths that do not intersect with the obstacles of a given scenario.
In the second step of the scheme we rely on spline interpolation algorithms with tension parameters to provide a smooth planar control strategy. In particular, we consider Pythagorean\u2013hodograph (PH) curves, since they provide an exact computation of fundamental geometric quantities. The vertices of the previously produced piecewise linear paths are interpolated by using a G1 or G2 interpolation scheme with tension based on PH splines. In both cases, a strategy based on the asymptotic analysis of the interpolation scheme is developed in order to get an automatic selection of the tension parameters.
To completely describe the motion along the path we present a configurable trajectory planning strategy for the offline definition of time-dependent C2 piece-wise quintic feedrates. When PH spline curves are considered, the corresponding accurate and efficient CNC interpolator algorithms can be exploited
Smooth path planning with Pythagorean-hodoghraph spline curves geometric design and motion control
This thesis addresses two significative problems regarding autonomous systems, namely path and trajectory planning. Path planning deals with finding a suitable path from a start to a goal position by exploiting a given representation of the environment. Trajectory planning schemes govern the motion along the path by generating appropriate reference (path) points.
We propose a two-step approach for the construction of planar smooth collision-free navigation paths. Obstacle avoidance techniques that rely on classical data structures are initially considered for the identification of piecewise linear paths that do not intersect with the obstacles of a given scenario.
In the second step of the scheme we rely on spline interpolation algorithms with tension parameters to provide a smooth planar control strategy. In particular, we consider Pythagorean–hodograph (PH) curves, since they provide an exact computation of fundamental geometric quantities. The vertices of the previously produced piecewise linear paths are interpolated by using a G1 or G2 interpolation scheme with tension based on PH splines. In both cases, a strategy based on the asymptotic analysis of the interpolation scheme is developed in order to get an automatic selection of the tension parameters.
To completely describe the motion along the path we present a configurable trajectory planning strategy for the offline definition of time-dependent C2 piece-wise quintic feedrates. When PH spline curves are considered, the corresponding accurate and efficient CNC interpolator algorithms can be exploited
Recommended from our members
TVL<sub>1</sub>shape approximation from scattered 3D data
With the emergence in 3D sensors such as laser scanners and 3D reconstruction from cameras, large 3D point clouds can now be sampled from physical objects within a scene. The raw 3D samples delivered by these sensors however, contain only a limited degree of information about the environment the objects exist in, which means that further geometrical high-level modelling is essential. In addition, issues like sparse data measurements, noise, missing samples due to occlusion, and the inherently huge datasets involved in such representations makes this task extremely challenging. This paper addresses these issues by presenting a new 3D shape modelling framework for samples acquired from 3D sensor. Motivated by the success of nonlinear kernel-based approximation techniques in the statistics domain, existing methods using radial basis functions are applied to 3D object shape approximation. The task is framed as an optimization problem and is extended using non-smooth L1 total variation regularization. Appropriate convex energy functionals are constructed and solved by applying the Alternating Direction Method of Multipliers approach, which is then extended using Gauss-Seidel iterations. This significantly lowers the computational complexity involved in generating 3D shape from 3D samples, while both numerical and qualitative analysis confirms the superior shape modelling performance of this new framework compared with existing 3D shape reconstruction techniques
TVL<sub>1</sub> Planarity Regularization for 3D Shape Approximation
The modern emergence of automation in many industries has given impetus to extensive research into mobile robotics. Novel perception technologies now enable cars to drive autonomously, tractors to till a field automatically and underwater robots to construct pipelines. An essential requirement to facilitate both perception and autonomous navigation is the analysis of the 3D environment using sensors like laser scanners or stereo cameras. 3D sensors generate a very large number of 3D data points when sampling object shapes within an environment, but crucially do not provide any intrinsic information about the environment which the robots operate within.
This work focuses on the fundamental task of 3D shape reconstruction and modelling from 3D point clouds. The novelty lies in the representation of surfaces by algebraic functions having limited support, which enables the extraction of smooth consistent implicit shapes from noisy samples with a heterogeneous density. The minimization of total variation of second differential degree makes it possible to enforce planar surfaces which often occur in man-made environments. Applying the new technique means that less accurate, low-cost 3D sensors can be employed without sacrificing the 3D shape reconstruction accuracy
Recommended from our members
A Knowledge Integration Framework for 3D Shape Reconstruction
The modern emergence of automation in many industries has given impetus to extensive research into mobile robotics. Novel perception technologies now enable cars to drive autonomously, tractors to till a field automatically and underwater robots to construct pipelines. An essential requirement to facilitate both perception and autonomous navigation is the analysis of the 3D environment using sensors like laser scanners or stereo cameras. 3D sensors generate a very large number of 3D data points in sampling object shapes within an environment, but crucially do not provide any intrinsic information about the environment in which the robots operate with. This means unstructured 3D samples must be processed by application-specific models to enable a robot, for instance, to detect and identify objects and infer the scene geometry for path-planning more efficiently than by using raw 3D data. This thesis specifically focuses on the fundamental task of 3D shape reconstruction and modelling by presenting a new knowledge integration framework for unstructured 3D samples. The novelty lies in the representation of surfaces by algebraic functions with limited support, which enables the extraction of smooth consistent shapes from noisy samples with a heterogeneous density. Moreover, many surfaces in urban environments can reasonably be assumed to be planar, and the framework exploits this knowledge to enable effective noise suppression without loss of detail. This is achieved by using a convex optimization technique which has linear computational complexity. Thus is much more efficient than existing solutions. The new framework has been validated by critical experimental analysis and evaluation and has been shown to increase the accuracy of the reconstructed shape significantly compared to state-of-the-art methods. Applying this new knowledge integration framework means that less accurate, low-cost 3D sensors can be employed without sacrificing the high demands that 3D perception must achieve. This links well into the area of robotic inspection, as for example regarding small drones that use inaccurate and lightweight image sensors
Tangent-ball techniques for shape processing
Shape processing defines a set of theoretical and algorithmic tools for creating, measuring and modifying digital representations of shapes. Such tools are of paramount importance to many disciplines of computer graphics, including modeling, animation, visualization, and image processing. Many applications of shape processing can be found in the entertainment and medical industries.
In an attempt to improve upon many previous shape processing techniques, the present thesis explores the theoretical and algorithmic aspects of a difference measure, which involves fitting a ball (disk in 2D and sphere in 3D) so that it has at least one tangential contact with each shape and the ball interior is disjoint from both shapes.
We propose a set of ball-based operators and discuss their properties, implementations, and applications. We divide the group of ball-based operations into unary and binary as follows:
Unary operators include:
* Identifying details (sharp, salient features, constrictions)
* Smoothing shapes by removing such details, replacing them by fillets and roundings
* Segmentation (recognition, abstract modelization via centerline and radius variation) of tubular structures
Binary operators include:
* Measuring the local discrepancy between two shapes
* Computing the average of two shapes
* Computing point-to-point correspondence between two shapes
* Computing circular trajectories between corresponding points that meet both shapes at right angles
* Using these trajectories to support smooth morphing (inbetweening)
* Using a curve morph to construct surfaces that interpolate between contours on consecutive slices
The technical contributions of this thesis focus on the implementation of these tangent-ball operators and their usefulness in applications of shape processing. We show specific applications in the areas of animation and computer-aided medical diagnosis. These algorithms are simple to implement, mathematically elegant, and fast to execute.Ph.D.Committee Chair: Jarek Rossignac; Committee Member: Greg Slabaugh; Committee Member: Greg Turk; Committee Member: Karen Liu; Committee Member: Maryann Simmon
Data-driven quasi-interpolant spline surfaces for point cloud approximation
In this paper we investigate a local surface approximation, the Weighted
Quasi Interpolant Spline Approximation (wQISA), specifically designed for large
and noisy point clouds. We briefly describe the properties of the wQISA
representation and introduce a novel data-driven implementation, which combines
prediction capability and complexity efficiency. We provide an extended
comparative analysis with other continuous approximations on real data,
including different types of surfaces and levels of noise, such as 3D models,
terrain data and digital environmental data
- …