Search

In designing a parallel hybrid electric vehicle, it is essential to select the optimal capacity of power sources and the optimal gear ratio of the torque coupler. The capacity of the power sources and the gear ratio of the torque coupler should be optimized simultaneously. However, since this process is excessively time-consuming, previous studies have selected the gear ratio of the torque coupler and then selected the capacity of power source. However, this approach cannot guarantee global optimization. In this paper, a feasible region is defined to satisfy the required performance of vehicle such as maximum speed, hill-climbing. and feasible points are selected inside the feasible region. In the conventional technique, the global optimal solution is obtained by simulating all feasible points. In the optimization technique, optimal points are simulated within the feasible region using several optimal search algorithms, such as the golden section search algorithm and the hillclimbing search algorithm. And using these algorithms, the number of simulations is reduced and the capacity of the power source and the gear ratio of the torque coupler are optimized simultaneously. Finally, the validity of the component sizing results is verified by comparing the global optimal solution obtained by applying the conventional technique with the solution obtained by applying the proposed optimization technique. [ABSTRACT FROM AUTHOR]

This article presents a multi-domain fast multipole hybrid boundary node method for composite materials in 3D elasticity. The hybrid boundary node method (hybrid BNM) is a meshless method which only requires nodes constructed on the surface of a domain. The method is applied to 3D simulation of composite materials by a multi-domain solver and accelerated by the fast multipole method (FMM) in this paper. The preconditioned GMRES is employed to solve the final system equation and precondition techniques are discussed. The matrix-vector multiplication in each iteration is divided into smaller scale ones at the sub-domain level and then accelerated by FMM within individual sub-domains. The computed matrix-vector products at the sub-domain level are then combined according to the continuity conditions on the interfaces. The algorithm is implemented on a computer code written in C + +. Numerical results show that the technique is accurate and efficient. [ABSTRACT FROM AUTHOR]

This paper presents a C2 Pythagorean hodograph (PH) spline curve constructed by the non-uniform rational B-spline (NURBS) curve for high-speed contouring control. With the knot vector, weights, and control points given, the C2 PH spline curve is defined to be a “good” interpolant for Hermit data obtained from a NURBS curve of degree 3 specified by the same control polygon, weights, and the knot vector. To this end, the first- and second-order derivatives are evaluated at the nodal points on the NURBS curve. These boundary conditions are imposed on the PH segments of degree 9 to preserve continuity between the connecting segments. The S-curve motion planning architecture with variable feed rate for a planar NURBS-based C2 PH spline curve is also developed in this paper. In particular, C1 cubic feed acceleration/deceleration is imposed on the first and last PH segments. Several NURBS-based C2 PH spline curve-following tasks were conducted to verify the effectiveness of the proposed interpolation algorithm. Experimental results show that the proposed interpolator is not only feasible for machining the complicated parametric curves represented in the NURBS-based C2 PH spline form but also yields satisfactory contouring performance under variable feed rate control. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to present accelerations of the Mann and CQ algorithms. We first apply the Picard algorithm to the smooth convex minimization problem and point out that the Picard algorithm is the steepest descent method for solving the minimization problem. Next, we provide the accelerated Picard algorithm by using the ideas of conjugate gradient methods that accelerate the steepest descent method. Then, based on the accelerated Picard algorithm, we present accelerations of the Mann and CQ algorithms. Under certain assumptions, we show that the new algorithms converge to a fixed point of a nonexpansive mapping. Finally, we show the efficiency of the accelerated Mann algorithm by numerically comparing with the Mann algorithm. A numerical example is provided to illustrate that the acceleration of the CQ algorithm is ineffective. [ABSTRACT FROM AUTHOR]

This paper presents a new and improved version of particle swarm optimization algorithm (PSO) combining the global best and local best model, termed GLBest-PSO. The GLBest-PSO incorporates global–local best inertia weight (GLBest IW) with global–local best acceleration coefficient (GLBest Ac). The velocity equation of the GLBest-PSO is also simplified. The ability of the GLBest-PSO is tested with a set of bench mark problems and the results are compared with those obtained through conventional PSO (cPSO), which uses time varying inertia weight (TVIW) and acceleration coefficient (TVAC). Fine tuning variants such as mutation, cross-over and RMS variants are also included with both cPSO and GLBest-PSO to improve the performance. The simulation results clearly elucidate the advantage of the fine tuning variants, which sharpen the convergence and tune to the best solution for both cPSO and GLBest-PSO. To compare and verify the validity and effectiveness of the GLBest-PSO, a number of statistical analyses are carried out. It is also observed that the convergence speed of GLBest-PSO is considerably higher than cPSO. All the results clearly demonstrate the superiority of the GLBest-PSO. [ABSTRACT FROM AUTHOR]

This paper presents a real-time control algorithm based on Taylor’s expansion for implementing variable feed rate non-uniform rational B-spline (NURBS) curve interpolators using a digital signal processor for precision CNC machining. To efficiently compute the NURBS curve and its derivatives in real-time, an effective method is proposed. The variable feed rate NURBS curve interpolator can be used to realise the ACC/DEC before feed rate interpolation in which the ACC/DEC (acceleration/deceleration) planning on the feed rate command executes before the interpolation takes place, so that the path command errors caused by conventional ACC/DEC planning using the post feed rate interpolation can be effectively eliminated. To demonstrate the performance of the proposed algorithm, an X-Y table driven by two servomotors is controlled to track command paths represented by multiple blocks of NURBS curves. Experimental results verify the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

The parameter analysis method of conceptual design is studied in this paper with the help of C-K theory. Each of the fundamental design activities-idea generation, implementation of the idea as hardware and evaluation-is explained and defined as a specific sequence of C-K operators. A case study of designing airborne decelerators is used to demonstrate the modeling of the parameter analysis process in C-K terms. The theory is used to explain how recovery from an initial fixation took place, leading to a breakthrough in the design process. It is shown that the innovative power of parameter analysis is based on C-space 'de-partitioning' and that the efficient strategy exhibited by parameter analysis can be interpreted as steepest-first, controlled by an evaluation function of the design path. This logic is explained as generalization of branch-and-bound algorithms by a learning-based, dynamically evolving evaluation function and exploration of a state space that keeps changing during the actual process of designing. [ABSTRACT FROM AUTHOR]

This paper describes the development of the braking assistance system based on a “G-Vectoring” concept. The present work focuses in particular on “Preview G-Vectoring Control” (PGVC), which is based on the “G-Vectoring Control” (GVC) scheme. In GVC, the longitudinal-acceleration control algorithm is based on the actual lateral jerk. PGVC decelerates a vehicle before it enters a curve, and is based on a new longitudinal-acceleration control algorithm which uses predicted and actual lateral jerk. Using the predicted lateral jerk makes it possible to decelerate the vehicle prior to curve entry. This deceleration can emulate a driver’s deceleration as the vehicle approaches a curve entry. PGVC is based on such deceleration algorithms and enables automatic deceleration similar to the action of a driver. It is thus possible to significantly improve the driver’s feeling when this system is activated. Driving tests with this new control system on snowy-winding course confirmed that the automatic brake control quality improved considerably compared to manual driver control considering both lap time and ride quality. These results indicate that PGVC can be a useful braking assistance system not only to improve the driver’s handling performance but also to reduce the brake-task during driving on winding roads. [ABSTRACT FROM AUTHOR]

Speed control is a very important factor to machining quality. In order to get high dynamic performance at the time of the machining speed changing, many kinds of algorithm for the acceleration/deceleration control have been proposed. The techniques which employ polynomial functions or digital convolution to generate velocity profile have been widely used and achieved good performance in motion control system. However, the control cycle of all these methods is one interpolation interval at least, and the velocity jump between two adjacent interpolation intervals during the acceleration/deceleration stage cannot be avoided. In this paper, a hardware fine acceleration/deceleration algorithm inside a single interpolation cycle is proposed to make the velocity change smoothly all the time even inside the interpolation interval. Based on this approach, an acceleration/deceleration fine interpolation circuit is designed with Verilog hardware description language and implemented in field programmable gate array. At last, the algorithm is applied in a three-axes motion controller and achieves a better machining performance than the one without this algorithm. [ABSTRACT FROM AUTHOR]

As a key technique in CNC machining, nonuniform rational B-spline (NURBS) interpolator has been proposed to overcome the drawbacks caused by linear and circular interpolator, such as large data size, velocity discontinuity, shocks or variations in mechanical systems, and low machining efficiency. To improve machining quality and efficiency, an adaptive off-line interpolator was developed for NURBS curves in this paper. Both the chord accuracy and the acceleration/deceleration capability of machine tool are considered in the algorithm. There are four modules in the algorithm, adaptive feed rate adjustment, acceleration/deceleration disposal, feed rate modification, and S-type velocity generation. The acceleration/deceleration around the sharp corners is carefully calculated by those modules. A case study was provided to evaluate the feasibility of the interpolator. [ABSTRACT FROM AUTHOR]

The proximal point algorithm is classical and popular in the community of optimization. In practice, inexact proximal point algorithms which solve the involved proximal subproblems approximately subject to certain inexact criteria are truly implementable. In this paper, we first propose an inexact proximal point algorithm with a new inexact criterion for solving convex minimization, and show its O(1/ k) iteration-complexity. Then we show that this inexact proximal point algorithm is eligible for being accelerated by some influential acceleration schemes proposed by Nesterov. Accordingly, an accelerated inexact proximal point algorithm with an iteration-complexity of O(1/ k) is proposed. [ABSTRACT FROM AUTHOR]

Modern motion control adopts acceleration/deceleration before interpolation (ADBI) motion planning to eliminate path command errors. However, the individual velocity profiles might not be continuous at the junction of the blocks. Acceleration/deceleration after interpolation (ADAI) method may provide an alternative for solving the discontinuous problems, but it causes path command errors. In this paper, an integrated acceleration/deceleration interpolation (IAD) scheme which integrates the ADBI and ADAI modules is proposed. The ADBI provides a look-ahead function which plans the feedrate profiles based on chord errors, command errors, curvatures, and acceleration limits. Within the look-ahead function, the command error equation is utilized to determine the feedrate at the junction of adjacent blocks. Then the ADBI performs non-uniform rational B-spline (NURBS) interpolation using the planned feedrate profile and outputs the position points to the ADAI module. The ADAI module processes the points by a digital convolution technique such that the continuity of the block junction velocity is ensured. Finally, the IAD is applied to the multi-block NURBS interpolation to validate its effectiveness. Simulations and experiments are conducted to demonstrate the IAD scheme. It is shown that the IAD scheme can reduce the acceleration significantly at the junctions of the blocks under the given tolerance of the command error. Furthermore, the proposed algorithm can improve tracking and contour accuracies as compared to the hybrid multi-blocks look-ahead approach. [ABSTRACT FROM AUTHOR]

Continuous micro-line segments having micron magnitude are also used to approach complicated trajectories in computer numerical control (CNC) machining. Traditional linear interpolation processes micro-line segments separately. The rather small lengths of the segments result in low machining efficiency, and the frequent acceleration and deceleration also reduce the lifetime of the motor. To solve the problems, in this paper, we present an interpolation algorithm that is based on the look-ahead function. The look-ahead-based feedrate planning is elaborated from the aspects of trajectory feedrate description, feedrate preplanning, and feedrate planning. With the function of feedrate planning, CNC systems can predict the variation of the curvature of the coming trajectory so that adaptively determining whether accelerates interpolation feedrate to enhance machining efficiency or decelerates the feedrate to guarantee the machining precision. In addition, the trajectory interpolation for micro-line segment trajectories is analyzed as well, which realizes the generalization of the coordinates for each interpolation step. The implementation of the proposed algorithm in our CNC system is also studied. Finally, two machining experiments are provided to verify the accuracy and efficiency of the proposed interpolation algorithm. [ABSTRACT FROM AUTHOR]

Parameter interpolation is more capable of modern computer numerical control (CNC) than traditional linear/circular interpolation with higher speed and higher precision. Most of non-uniform rational B-spline (NURBS) interpolation algorithms were developed based on the chord error and machines capability, where interpolation points are calculated beforehand to overcome acceleration/deceleration (acc/dec) and jerk problem, which needs large memory. In this paper, a NURBS interpolator based on feedrate section is proposed. Instead of a single interpolation point, this interpolator aims to feedrate section, which makes it possible to run on a digital signal processor or field programmable gate array (FPGA) whose memory is limited. Experiment on FPGA showed the performance of interpolation. A mould experiment verifies the feasibility of application. [ABSTRACT FROM AUTHOR]

This paper describes novel implementations of the KLT feature tracking and SIFT feature extraction algorithms that run on the graphics processing unit (GPU) and is suitable for video analysis in real-time vision systems. While significant acceleration over standard CPU implementations is obtained by exploiting parallelism provided by modern programmable graphics hardware, the CPU is freed up to run other computations in parallel. Our GPU-based KLT implementation tracks about a thousand features in real-time at 30 Hz on 1,024 × 768 resolution video which is a 20 times improvement over the CPU. The GPU-based SIFT implementation extracts about 800 features from 640 × 480 video at 10 Hz which is approximately 10 times faster than an optimized CPU implementation. [ABSTRACT FROM AUTHOR]

general neural network based methodology that has the potential to replace the computationally-intensive site-specific seismic analysis of structures is proposed in this paper. The basic framework of the methodology consists of a feed forward back propagation neural network algorithm with one hidden layer to represent the seismic potential of a region and soil amplification effects. The methodology is implemented and verified with parameters corresponding to Delhi city in India. For this purpose, strong ground motions are generated at bedrock level for a chosen site in Delhi due to earthquakes considered to originate from the central seismic gap of the Himalayan belt using necessary geological as well as geotechnical data. Surface level ground motions and corresponding site-specific response spectra are obtained by using a one-dimensional equivalent linear wave propagation model. Spectral acceleration values are considered as a target parameter to verify the performance of the methodology. Numerical studies carried out to validate the proposed methodology show that the errors in predicted spectral acceleration values are within acceptable limits for design purposes. The methodology is general in the sense that it can be applied to other seismically vulnerable regions and also can be updated by including more parameters depending on the state-of-the-art in the subject. [ABSTRACT FROM AUTHOR]

Abstract  Suppose we are given a schedule of train movements over a rail network into which a new train is to be included. The origin and the destination are specified for the new train; it is required that a schedule (including the path) be determined for it so as to minimize the time taken without affecting the schedules for the old trains. In the standard formulations of this single train pathing problem, the time taken by the train to traverse any block (track segment guarded by a signal) in the network is deemed to be a fixed number, independent of how the train arrived onto that block. In other words, the standard formulations of train pathing do not accurately model the acceleration/deceleration restrictions on trains. In this paper we give an algorithm to solve the single train pathing problem, while taking into account the maximum allowed acceleration and deceleration as well as explicitly modeling signals. For trains having ‘large’ maximum acceleration and deceleration, our algorithm runs in polynomial time. On the other hand, if the train to be pathed is capable of only very small acceleration so that it must take a long time to reach full speed, our algorithm takes exponential time. However, we prove that the pathing problem is NP-complete for small acceleration values, thus justifying the time required by our algorithm. Our algorithm can be used as a subroutine in a heuristic for multiple train pathing. If all trains have large (but possibly different) accelerations this algorithm will run in polynomial time. [ABSTRACT FROM AUTHOR]

Parametric interpolation has many advantages over the traditional linear or circular interpolation in computer numerical control (CNC) machining. The existing work in this regard is reported to have achieved constant feedrate, confined chord error and limited acceleration/deceleration in one interpolator. However, the excessive jerk still exists due to abrupt change in acceleration profile, which will cause shock to the machine as well as deteriorate the surface accuracy. In this paper, an adaptive interpolation scheme incorporating machine’s dynamics capability consideration is proposed and illustrated in details. In the proposed algorithm, the commanded feedrate is maintained at most of the time and adaptively reduced in large curvature areas to meet the demand of the machining accuracy requirement, while at the same time, the acceleration and jerk values are limited within the machine’s capabilities during the whole interpolation process. It ensures a high machining accuracy, eliminates the phenomenon of overshoot/undershoot and reduces mechanical shock to the machine tools. The real-time performance of this interpolator is also measured to demonstrate its practical application. Two non-uniform rational B-spline (NURBS) curve interpolation experiments are provided to verify the feasibility and advantages of the proposed scheme. [ABSTRACT FROM AUTHOR]

The positioning accuracy and positioning time of CNC systems have recently been the main performance criteria for industrial applications. The acceleration/deceleration modes, especially the deceleration modes, have an important effect on them. In this paper, firstly, some problems of the conventional linear deceleration algorithm are analyzed. Then an improved linear acceleration/deceleration algorithm is introduced. In this algorithm, the deceleration point is predicted exactly, and then the deceleration point error is compensated for at higher feedrates. Furthermore, a higher resultant maximum acceleration than that in the conventional scheme is selected to shorten the acceleration/deceleration time. Compared with the conventional linear acceleration and deceleration algorithm, the system performance has been significantly improved. Finally, the performance is confirmed by several simulations and experiments. [ABSTRACT FROM AUTHOR]

This paper presents an efficient inverse warping algorithm for generating novel views from multiple reference images taken from different viewpoints. The method proceeds in three steps: preprocess for edge-pixel extraction, inverse warping from the primary image, and hole filling from remaining reference images. In using advantages of epipolar-line features and the depth discontinuity in the reference images, the inverse warping can be efficiently applied in segments, accelerating the rendering process substantially. Two acceleration techniques are proposed at the last stage for hole filling. By using the algorithm proposed, we may navigate a virtual environment at an interactive rate. [ABSTRACT FROM AUTHOR]

In this study we developed an autonomous braking algorithm to satisfy both safety and ride comfort of a vehicle. The proposed algorithm is composed of two-step braking strategies depending on the value of time-to-collision. The first step is a partial braking strategy to provide not only deceleration but also good ride comfort in a normal braking situation, and the second step is a full braking strategy to avoid forward collisions in an emergency braking situation. Further, the partial braking is divided into a recovery and a release zones. The former is to apply braking pressures for the safe deceleration, whereas the latter is to release the braking pressure smoothly for good ride comfort. To determine the partial braking pressures, the nonlinear characteristics of the tire friction is considered and the linear momentum of a preceding vehicle is calculated based on the extrapolation of its motion. Computer simulations using CarSim were executed combined with MATLAB/Simulink to implement the driving situations, and finally we obtained successful performances satisfying ride comfort as well as safety of the vehicle. [ABSTRACT FROM AUTHOR]

A two-step explicit acceleration integration method (EAIM2) and a three-step explicit acceleration integration method (EAIM3), which are entirely explicit time integration algorithms, are proposed based on acceleration time history. The computation efforts and costs can be observably reduced on account of avoiding matrix inversion and iteration processes in nonlinear systems. Four nonlinear systems are employed to analyze the EAIM2, the EAIM3, the HHT- α method, the Newmark explicit method and the generally used Newmark method for comparison purposes. The results show that the highest orders of accuracy of the EAIM2 and the EAIM3 are all of second order. The stability of the proposed methods can remain in a critical state in undamped systems. The puny energy ratio and the periodic energy growth and decay manifest that the proposed methods are endowed with favorable nonlinear stability. The amplitude attenuation of the proposed methods is zero. The proposed methods and the CDM possess the same period elongation. The period error of the proposed methods is smaller than that of the Newmark method in the stability interval. The EAIM2 and the EAIM3 possess the lowest computation efforts at the same accuracy level in the above-mentioned integration methods. [ABSTRACT FROM AUTHOR]

The round-off error, which is caused by cycle sampling of the interpolation period, affects the interpolation accuracy and motion smoothness of computer numerical control (CNC) machining. To consider the round-off error while restricting the motion parameters within their specified ranges, a time-rounding-up-based feedrate scheduling method is proposed. Firstly, the characteristics of S-shaped acceleration/deceleration (ACC/DEC) algorithm are analyzed by setting the jerk of each section as a variable. The expressions of jerk are derived and some important properties are discovered. According to these properties, it is possible to limit all the motion parameters in their given ranges through increasing the interpolation time and adjusting other motion parameters. Secondly, a new time-rounding-up scheme is designed to guarantee that the total interpolation time of each curve segment is an integer multiple of interpolation period. Then, based on the rounded time, the adjustment principles of the displacement and maximum feedrate are proposed to satisfy the various constraints. Its feasibility is also analyzed. Finally, based on the time-rounding-up scheme and the parameter adjustment principles, a series of feedrate scheduling methods are designed for different situations. For most situations, a non-standard S-shaped ACC/DEC profile can be generated with no round-off error and all the motion parameters can be restricted within their given ranges. A series of simulations and practical experiments are conducted to verify the good performance and applicability of the proposed method. [ABSTRACT FROM AUTHOR]

Intelligent vehicle greatly benefits traffic safety, efficiency and driving comfortable. With the development of intelligent driving technology and its application, it is becoming increasingly important to do effective and comprehensive tests before putting on the market. Comprehensively considering the cost of test, an automatic generation method of test scenarios is proposed to ensure both coverage and effectiveness. Based on the analyzed key infuence factors of an intelligent driving system, the analytic hierarchy process (AHP) is used to determine their importance and accordingly an complex index is defined, based on which an improved test case generation algorithm based on the pairwise independent combinatorial testing tool (PICT) is proposed to ensuring both combinational coverage and complexity of test cases. Finally, the test scenario is generated by clustering these discrete test cases considering similarity and complexity. The high complex test cases are preferred to be combined together and conducted preferentially to increase the test efficiency. The effectiveness of this method is validated by applying it on a lane departure warning system (LDW). [ABSTRACT FROM AUTHOR]

We propose a novel stochastic method, namely the stochastic accelerated mirror-prox (SAMP) method, for solving a class of monotone stochastic variational inequalities (SVI). The main idea of the proposed algorithm is to incorporate a multi-step acceleration scheme into the stochastic mirror-prox method. The developed SAMP method computes weak solutions with the optimal iteration complexity for SVIs. In particular, if the operator in SVI consists of the stochastic gradient of a smooth function, the iteration complexity of the SAMP method can be accelerated in terms of their dependence on the Lipschitz constant of the smooth function. For SVIs with bounded feasible sets, the bound of the iteration complexity of the SAMP method depends on the diameter of the feasible set. For unbounded SVIs, we adopt the modified gap function introduced by Monteiro and Svaiter for solving monotone inclusion, and show that the iteration complexity of the SAMP method depends on the distance from the initial point to the set of strong solutions. It is worth noting that our study also significantly improves a few existing complexity results for solving deterministic variational inequality problems. We demonstrate the advantages of the SAMP method over some existing algorithms through our preliminary numerical experiments. [ABSTRACT FROM AUTHOR]

Abstract—A theoretically derived technique for acceleration of the original non-local means image denoising algorithm based on calculation of recursive patch similarity weights is proposed. A significant amount of computation in the non-local means scheme is dedicated to estimation of the patch similarity between pixel neighborhoods. The proposed recursive weights calculation scheme adopts the classic recursive mean calculation scheme for a multidimensional shift-vector in order to lower the computational complexity of the original non-local means method, thus speeding up this algorithm more than tenfold. Note that the output of the proposed algorithm is exactly the same as that of the original non-local means method. Hence this algorithm belongs to the class of true fast algorithms, unlike methods approaching to a certain degree the resul of the original algorithm. [ABSTRACT FROM AUTHOR]

An autonomous braking system is designed using the prediction of the stopping distance. The stopping distance needs to be determined by considering several factors such as the desired deceleration and the speed of the hydraulic brake actuator. In particular, the actuator speed is very critical because it affects the shape of the deceleration response and it determines the accuracy of the predicted stopping distance. The autonomous braking control algorithm is designed based on the predicted stopping distance. The proposed autonomous braking system has been validated in autonomous vehicle tests and demonstrates that the subject vehicle can avoid the collision effectively. [ABSTRACT FROM AUTHOR]

Geometric feasibility (GF) of components is the precondition for assembly/disassembly sequence planning (ASP/DSP), and interference matrix is an important assembly relation model for GF discrimination. Extended interference matrix (EIM) is proposed to determine GF in the slanting directions, whose descriptive directions are extended to axes of a local coordinate system in each component. Turning interference matrix (TIM) is proposed to analyze the GF of the component that must be assembled with a multidirectional path, with the structure compact enough to describe the interference information from a turning point. The methods for acquiring EIM and TIM rapidly and automatically are proposed, including the stepping precise detection, the rough detection, and the accelerated detection based on bounding box. The measures for restraining static hard interference automatically are studied. An algorithm for discriminating GF comprehensively based on EIM and TIM is then presented. An ASP system 'AutoAssem' is developed, with two instances illustrating the effectiveness of each interference detection method. EIM and TIM are testified to enrich the variety and variability of assembly directions, which provide great universality to the GF determination of large-scale assemblies, together with an effective foundation to ASP/DSP algorithms. [ABSTRACT FROM AUTHOR]

This work features an analysis for the acceleration technique DIIS that is standardly used in most of the important quantum chemistry codes, e.g. in DFT and Hartree-Fock calculations and in the Coupled Cluster method. Taking up results from Harrison (J Comput Chem 25:328, ), we show that for the general nonlinear case, DIIS corresponds to a projected quasi-Newton/secant method. For linear systems, we establish connections to the well-known GMRES solver and transfer according (positive as well as negative) convergence results to DIIS. In particular, we discuss the circumstances under which DIIS exhibits superlinear convergence behaviour. For the general nonlinear case, we then use these results to show that a DIIS step can be interpreted as step of a quasi-Newton method in which the Jacobian used in the Newton step is approximated by finite differences and in which the according linear system is solved by a GMRES procedure, and give according convergence estimates. [ABSTRACT FROM AUTHOR]

In order to evaluate the feasibility of multi-point, non-contact, acceleration measurement, a high-speed, precision videogrammetry system has been assembled from commercially-available components and software. Consisting of three synchronized 640 × 480 pixel monochrome progressive scan CCD cameras each operated at 200 frames per second, this system has the capability to provide surface-wide position-versus-time data that are filtered and twice-differentiated to yield the desired acceleration tracking at multiple points on a moving body. The oscillating motion of targets mounted on the shaft of a modal shaker were tracked, and the accelerations calculated using the videogrammetry data were compared directly to conventional accelerometer measurements taken concurrently. Although differentiation is an inherently noisy operation, the results indicate that simple mathematical filters based on the well-known Savitzky and Golay algorithms, implemented using spreadsheet software, remove a significant component of the noise, resulting in videogrammetry-based acceleration measurements that are comparable to those obtained using the accelerometers. [ABSTRACT FROM AUTHOR]

We present a set of formulas describing classical radiation of a rank-s tensor field from an accelerated pointlike source in a flat space-time of an arbitrary even dimension d. These formulas allow straightforwardly and algorithmically evaluating the total intensity and radiated momentum for any s and d by hand or using a computer. The practical application of the obtained results is limited for s > 1 because the energy-momentum tensor for the pointlike source is not conserved. This usually means that contributions to the radiation from tensions of the forces causing the acceleration of the radiation source cannot be neglected. [ABSTRACT FROM AUTHOR]

A methodology is proposed to generate minimum-time optimal velocity profiles for a vehicle with prescribed acceleration limits along a specified path. The necessary optimality conditions are explicitly derived, allowing the construction of the optimal solution semianalytically. A receding horizon implementation is also proposed for the on-line implementation of the velocity optimizer. Robustness of the receding horizon algorithm is guaranteed by the use of an adaptive scheme that determines the planning and execution horizons. Application to a real-life scenario with a comparison between the infinite and finite receding horizon schemes provides a validation of the proposed methodology. [ABSTRACT FROM AUTHOR]

A parametric interpolator for the trajectory planning of non-uniform rational basis spline (NURBS) curves is proposed in this study. The input constraints include the chord error, speed limit, acceleration limit and jerk limit. Since there is no unique representation to relate these constraints, appropriate models are developed to determine several feedrates in terms of different kinematic conditions, the minimum one of which is selected as the desired feedrate. A look-ahead stage is developed to plan a series of segment points from the curves, where a segment point represents the change in the acceleration across zero. The segment points, which enable the appropriate design of kinematic profiles, are used in real-time sampling for determining the sampling points. Several examples are presented to demonstrate the feasibility of the proposed algorithm. [ABSTRACT FROM AUTHOR]