Toolpath interpolation and smoothing for computer numerical control machining of freeform surfaces : a review

Driven by the ever increasing demand in function integration, more and more next generation high value-added products, such as head-up displays, solar concentrators and intra-ocular-lens, etc., are designed to possess freeform (i.e., non-rotational symmetric) surfaces. The toolpath, composed of high density of short linear and circular segments, is generally used in computer numerical control (CNC) systems to machine those products. However, the discontinuity between toolpath segments leads to high-frequency fluctuation of feedrate and acceleration, which will decrease the machining efficiency and product surface finish. Driven by the ever-increasing need for high-speed high-precision machining of those products, many novel toolpath interpolation and smoothing approaches have been proposed in both academia and industry, aiming to alleviate the issues caused by the conventional toolpath representation and interpolation methods. This paper provides a comprehensive review of the state-of-the-art toolpath interpolation and smoothing approaches with systematic classifications. The advantages and disadvantages of these approaches are discussed. Possible future research directions are also offered

A global search algorithm for phase transition pathways in computer-aided nano-design

One of the most important design issues for phase change materials is to engineer the phase transition process. The challenge of accurately predicting a phase transition is estimating the true value of transition rate, which is determined by the saddle point with the minimum energy barrier between stable states on the potential energy surface (PES). In this thesis, a new algorithm for searching the minimum energy path (MEP) is presented. The new algorithm is able to locate both the saddle point and local minima simultaneously. Therefore no prior knowledge of the precise positions for the reactant and product on the PES is needed. Unlike existing pathway search methods, the algorithm is able to search multiple transition paths on the PES simultaneously, which gives us a more comprehensive view of the energy landscape than searching individual ones. In this method, a Bézier curve is used to represent each transition path. During the searching process, the reactant and product states are located by minimizing the two end control points of the curve, while the shape of the transition pathway is refined by moving the intermediate control points of the curve in the conjugate directions. A curve subdivision scheme is developed so that multiple transitions paths can be located. The algorithm is demonstrated by examples of LEPS potential, LEPS plus harmonic oscillator potential, and PESs defined by Rastrigin function and Schwefel function.M.S

A Partially Randomized Approach to Trajectory Planning and Optimization for Mobile Robots with Flat Dynamics

Motion planning problems are characterized by huge search spaces and complex obstacle structures with no concise mathematical expression. The fixed-wing airplane application considered in this thesis adds differential constraints and point-wise bounds, i. e. an infinite number of equality and inequality constraints. An optimal trajectory planning approach is presented, based on the randomized Rapidly-exploring Random Trees framework (RRT*). The local planner relies on differential flatness of the equations of motion to obtain tree branch candidates that automatically satisfy the differential constraints. Flat output trajectories, in this case equivalent to the airplane's flight path, are designed using Bézier curves. Segment feasibility in terms of point-wise inequality constraints is tested by an indicator integral, which is evaluated alongside the segment cost functional. Although the RRT* guarantees optimality in the limit of infinite planning time, it is argued by intuition and experimentation that convergence is not approached at a practically useful rate. Therefore, the randomized planner is augmented by a deterministic variational optimization technique. To this end, the optimal planning task is formulated as a semi-infinite optimization problem, using the intermediate result of the RRT(*) as an initial guess. The proposed optimization algorithm follows the feasible flavor of the primal-dual interior point paradigm. Discretization of functional (infinite) constraints is deferred to the linear subproblems, where it is realized implicitly by numeric quadrature. An inherent numerical ill-conditioning of the method is circumvented by a reduction-like approach, which tracks active constraint locations by introducing new problem variables. Obstacle avoidance is achieved by extending the line search procedure and dynamically adding obstacle-awareness constraints to the problem formulation. Experimental evaluation confirms that the hybrid approach is practically feasible and does indeed outperform RRT*'s built-in optimization mechanism, but the computational burden is still significant.Bewegungsplanungsaufgaben sind typischerweise gekennzeichnet durch umfangreiche Suchräume, deren vollständige Exploration nicht praktikabel ist, sowie durch unstrukturierte Hindernisse, für die nur selten eine geschlossene mathematische Beschreibung existiert. Bei der in dieser Arbeit betrachteten Anwendung auf Flächenflugzeuge kommen differentielle Randbedingungen und beschränkte Systemgrößen erschwerend hinzu. Der vorgestellte Ansatz zur optimalen Trajektorienplanung basiert auf dem Rapidly-exploring Random Trees-Algorithmus (RRT*), welcher die Suchraumkomplexität durch Randomisierung beherrschbar macht. Der spezifische Beitrag ist eine Realisierung des lokalen Planers zur Generierung der Äste des Suchbaums. Dieser erfordert ein flaches Bewegungsmodell, sodass differentielle Randbedingungen automatisch erfüllt sind. Die Trajektorien des flachen Ausgangs, welche im betrachteten Beispiel der Flugbahn entsprechen, werden mittels Bézier-Kurven entworfen. Die Einhaltung der Ungleichungsnebenbedingungen wird durch ein Indikator-Integral überprüft, welches sich mit wenig Zusatzaufwand parallel zum Kostenfunktional berechnen lässt. Zwar konvergiert der RRT*-Algorithmus (im probabilistischen Sinne) zu einer optimalen Lösung, jedoch ist die Konvergenzrate aus praktischer Sicht unbrauchbar langsam. Es ist daher naheliegend, den Planer durch ein gradientenbasiertes lokales Optimierungsverfahren mit besseren Konvergenzeigenschaften zu unterstützen. Hierzu wird die aktuelle Zwischenlösung des Planers als Initialschätzung für ein kompatibles semi-infinites Optimierungsproblem verwendet. Der vorgeschlagene Optimierungsalgorithmus erweitert das verbreitete innere-Punkte-Konzept (primal dual interior point method) auf semi-infinite Probleme. Eine explizite Diskretisierung der funktionalen Ungleichungsnebenbedingungen ist nicht erforderlich, denn diese erfolgt implizit durch eine numerische Integralauswertung im Rahmen der linearen Teilprobleme. Da die Methode an Stellen aktiver Nebenbedingungen nicht wohldefiniert ist, kommt zusätzlich eine Variante des Reduktions-Ansatzes zum Einsatz, bei welcher der Vektor der Optimierungsvariablen um die (endliche) Menge der aktiven Indizes erweitert wird. Weiterhin wurde eine Kollisionsvermeidung integriert, die in den Teilschritt der Liniensuche eingreift und die Problemformulierung dynamisch um Randbedingungen zur lokalen Berücksichtigung von Hindernissen erweitert. Experimentelle Untersuchungen bestätigen, dass die Ergebnisse des hybriden Ansatzes aus RRT(*) und numerischem Optimierungsverfahren der klassischen RRT*-basierten Trajektorienoptimierung überlegen sind. Der erforderliche Rechenaufwand ist zwar beträchtlich, aber unter realistischen Bedingungen praktisch beherrschbar

IgA-BEM for 3D Helmholtz problems using conforming and non-conforming multi-patch discretizations and B-spline tailored numerical integration

An Isogeometric Boundary Element Method (IgA-BEM) is considered for the numerical solution of Helmholtz problems on 3D bounded or unbounded domains, admitting a smooth multi-patch representation of their finite boundary surface. The discretization spaces are formed by C0 inter-patch continuous functional spaces whose restriction to a patch simplifies to the span of tensor product B-splines composed with the given patch NURBS parameterization. Both conforming and non-conforming spaces are allowed, so that local refinement is possible at the patch level. For regular and singular integration, the proposed model utilizes a numerical procedure defined on the support of each trial B-spline function, which makes possible a function-by-function implementation of the matrix assembly phase. Spline quasi-interpolation is the common ingredient of all the considered quadrature rules; in the singular case it is combined with a B-spline recursion over the spline degree and with a singularity extraction technique, extended to the multi-patch setting for the first time. A threshold selection strategy is proposed to automatically distinguish between nearly singular and regular integrals. The non-conforming C0 joints between spline spaces on different patches are implemented as linear constraints based on knot removal conditions, and do not require a hierarchical master-slave relation between neighbouring patches. Numerical examples on relevant benchmarks show that the expected convergence orders are achieved with uniform discretization and a small number of uniformly spaced quadrature nodes