Search results

This paper aims to focus on solving the path optimization problem by modifying the probabilistic roadmap (PRM) technique as it suffers from the selection of the optimal number of nodes and deploy in free space for reliable trajectory planning.

Traditional PRM is modified by developing a decision-making strategy for the selection of optimal nodes w.r.t. the complexity of the environment and deploying the optimal number of nodes outside the closed segment. Subsequently, the generated trajectory is made smoother by implementing the modified Bezier curve technique, which selects an optimal number of control points near the sharp turns for the reliable convergence of the trajectory that reduces the sum of the robot’s turning angles.

The proposed technique is compared with state-of-the-art techniques that show the reduction of computational load by 12.46%, the number of sharp turns by 100%, the number of collisions by 100% and increase the velocity parameter by 19.91%.

The proposed adaptive technique provides a better solution for autonomous navigation of unmanned ground vehicles, transportation, warehouse applications, etc.

This study aims to propose and numerically assess different ways of discretising a very weak formulation of the Poisson problem.

We use integration by parts twice to shift smoothness requirements to the test functions, thereby allowing low-regularity data and solutions.

Various conforming discretisations are presented and tested, with numerical results indicating good accuracy and stability in different types of problems.

This is one of the first articles to propose and test concrete discretisations for very weak variational formulations in primal form. The numerical results, which include a problem based on real MRI data, indicate the potential of very weak finite element methods for tackling problems with low regularity.

Hexahedral meshing is one of the most important steps in performing an accurate simulation using the finite element analysis (FEA). However, the current hexahedral meshing method in the industry is a nonautomatic and inefficient method, i.e. manually decomposing the model into suitable blocks and obtaining the hexahedral mesh from these blocks by mapping or sweeping algorithms. The purpose of this paper is to propose an almost automatic decomposition algorithm based on the 3D frame field and model features to replace the traditional time-consuming and laborious manual decomposition method.

The proposed algorithm is based on the 3D frame field and features, where features are used to construct feature-cutting surfaces and the 3D frame field is used to construct singular-cutting surfaces. The feature-cutting surfaces constructed from concave features first reduce the complexity of the model and decompose it into some coarse blocks. Then, an improved 3D frame field algorithm is performed on these coarse blocks to extract the singular structure and construct singular-cutting surfaces to further decompose the coarse blocks. In most modeling examples, the proposed algorithm uses both types of cutting surfaces to decompose models fully automatically. In a few examples with special requirements for hexahedral meshes, the algorithm requires manual input of some user-defined cutting surfaces and constructs different singular-cutting surfaces to ensure the effectiveness of the decomposition.

Benefiting from the feature decomposition and the 3D frame field algorithm, the output blocks of the proposed algorithm have no inner singular structure and are suitable for the mapping or sweeping algorithm. The introduction of internal constraints makes 3D frame field generation more robust in this paper, and it can automatically correct some invalid 3–5 singular structures. In a few examples with special requirements, the proposed algorithm successfully generates valid blocks even though the singular structure of the model is modified by user-defined cutting surfaces.

The proposed algorithm takes the advantage of feature decomposition and the 3D frame field to generate suitable blocks for a mapping or sweeping algorithm, which saves a lot of simulation time and requires less experience. The user-defined cutting surfaces enable the creation of special hexahedral meshes, which was difficult with previous algorithms. An improved 3D frame field generation method is proposed to correct some invalid singular structures and improve the robustness of the previous methods.

The authors propose to estimate a varying coefficient panel data model with different smoothing variables and fixed effects using a two-step approach. The pilot step estimates the varying coefficients by a series method. We then use the pilot estimates to perform a one-step backfitting through local linear kernel smoothing, which is shown to be oracle efficient in the sense of being asymptotically equivalent to the estimate knowing the other components of the varying coefficients. In both steps, the authors remove the fixed effects through properly constructed weights. The authors obtain the asymptotic properties of both the pilot and efficient estimators. The Monte Carlo simulations show that the proposed estimator performs well. The authors illustrate their applicability by estimating a varying coefficient production frontier using a panel data, without assuming distributions of the efficiency and error terms.

The purpose of this review is to comprehensively consider the material properties and processing of additive titanium alloy and provide a new perspective for the robotic grinding and polishing of additive titanium alloy blades to ensure the surface integrity and machining accuracy of the blades.

At present, robot grinding and polishing are mainstream processing methods in blade automatic processing. This review systematically summarizes the processing characteristics and processing methods of additive manufacturing (AM) titanium alloy blades. On the one hand, the unique manufacturing process and thermal effect of AM have created the unique processing characteristics of additive titanium alloy blades. On the other hand, the robot grinding and polishing process needs to incorporate the material removal model into the traditional processing flow according to the processing characteristics of the additive titanium alloy.

Robot belt grinding can solve the processing problem of additive titanium alloy blades. The complex surface of the blade generates a robot grinding trajectory through trajectory planning. The trajectory planning of the robot profoundly affects the machining accuracy and surface quality of the blade. Subsequent research is needed to solve the problems of high machining accuracy of blade profiles, complex surface material removal models and uneven distribution of blade machining allowance. In the process parameters of the robot, the grinding parameters, trajectory planning and error compensation affect the surface quality of the blade through the material removal method, grinding force and grinding temperature. The machining accuracy of the blade surface is affected by robot vibration and stiffness.

This review systematically summarizes the processing characteristics and processing methods of aviation titanium alloy blades manufactured by AM. Combined with the material properties of additive titanium alloy, it provides a new idea for robot grinding and polishing of aviation titanium alloy blades manufactured by AM.

The assembly simulation in tolerance analysis is one of the most important steps for the tolerance design of mechanical products. However, most assembly simulation methods are based on the rigid body assumption, and those assembly simulation methods considering deformation have a poor efficiency. This paper aims to propose a novel efficient and precise tolerance analysis method based on stable contact to improve the efficiency and reliability of assembly deformation simulation.

The proposed method comprehensively considers the initial rigid assembly state, the assembly deformation and the stability examination of assembly simulation to improve the reliability of tolerance analysis results. The assembly deformation of mating surfaces was first calculated based on the boundary element method with optimal initial assembly state, then the stability of assembly simulation results was assessed by the density-based spatial clustering of applications with noise algorithm to improve the reliability of tolerance analysis. Finally, combining the small displacement torsor theory, the tolerance scheme was statistically analyzed based on sufficient samples.

A case study of a guide rail model demonstrated the efficiency and effectiveness of the proposed method.

The present study only considered the form error when generating the skin model shape, and the waviness and the roughness of the matching surface were not considered.

To the best of the authors’ knowledge, the proposed method is original in the assembly simulation considering stable contact, which can effectively ensure the reliability of the assembly simulation while taking into account the computational efficiency.

This paper aims to present a set of processes for obtaining the global spraying trajectory of a cold spraying robot on a complex surface.

The complex workpiece surfaces in the project are first divided by triangular meshing. Then, the geodesic curve method is applied for local path planning. Finally, the subsurface trajectory combination optimization problem is modeled as a GTSP problem and solved by the ant colony algorithm, where the evaluation scores and the uniform design method are used to determine the optimal parameter combination of the algorithm. A global optimized spraying trajectory is thus obtained.

The simulation results show that the proposed processes can achieve the shortest global spraying trajectory. Moreover, the cold spraying experiment on the IRB4600 six-joint robot verifies that the spraying trajectory obtained by the processes can ensure a uniform coating thickness.

The proposed processes address the issue of different parameter combinations, leading to different results when using the ant colony algorithm. The two methods for obtaining the optimal parameter combinations can solve this problem quickly and effectively, and guarantee that the processes obtain the optimal global spraying trajectory.

This paper aims to propose a robust method for non-rigid point set registration, using the Gaussian mixture model and accommodating non-rigid transformations. The posterior probabilities of the mixture model are determined through the proposed integrated feature divergence.

The method involves an alternating two-step framework, comprising correspondence estimation and subsequent transformation updating. For correspondence estimation, integrated feature divergences including both global and local features, are coupled with deterministic annealing to address the non-convexity problem of registration. For transformation updating, the expectation-maximization iteration scheme is introduced to iteratively refine correspondence and transformation estimation until convergence.

The experiments confirm that the proposed registration approach exhibits remarkable robustness on deformation, noise, outliers and occlusion for both 2D and 3D point clouds. Furthermore, the proposed method outperforms existing analogous algorithms in terms of time complexity. Application of stabilizing and securing intermodal containers loaded on ships is performed. The results demonstrate that the proposed registration framework exhibits excellent adaptability for real-scan point clouds, and achieves comparatively superior alignments in a shorter time.

The integrated feature divergence, involving both global and local information of points, is proven to be an effective indicator for measuring the reliability of point correspondences. This inclusion prevents premature convergence, resulting in more robust registration results for our proposed method. Simultaneously, the total operating time is reduced due to a lower number of iterations.

A semiparametric stochastic frontier model is proposed for panel data, incorporating several flexible features. First, a constant elasticity of substitution (CES) production frontier is considered without log-transformation to prevent induced non-negligible estimation bias. Second, the model flexibility is improved via semiparameterization, where the technology is an unknown function of a set of environment variables. The technology function accounts for latent heterogeneity across individual units, which can be freely correlated with inputs, environment variables, and/or inefficiency determinants. Furthermore, the technology function incorporates a single-index structure to circumvent the curse of dimensionality. Third, distributional assumptions are eschewed on both stochastic noise and inefficiency for model identification. Instead, only the conditional mean of the inefficiency is assumed, which depends on related determinants with a wide range of choice, via a positive parametric function. As a result, technical efficiency is constructed without relying on an assumed distribution on composite error. The model provides flexible structures on both the production frontier and inefficiency, thereby alleviating the risk of model misspecification in production and efficiency analysis. The estimator involves a series based nonlinear least squares estimation for the unknown parameters and a kernel based local estimation for the technology function. Promising finite-sample performance is demonstrated through simulations, and the model is applied to investigate productive efficiency among OECD countries from 1970–2019.

Many existing trajectory optimization algorithms use parameters like maximum velocity or acceleration to formulate constraints. Due to the ignoring of the quadrotor actual tracking capability, the generated trajectories may not be suitable for tracking control. The purpose of this paper is to design an online adjustment algorithm to improve the overall quadrotor trajectory tracking performance.

The authors propose a reference trajectory resampling layer (RTRL) to dynamically adjust the reference signals according to the current tracking status and future tracking risks. First, the authors design a risk-aware tracking monitor that uses the Frenét tracking errors and the curvature and torsion of the reference trajectory to evaluate tracking risks. Then, the authors propose an online adjusting algorithm by using the time scaling method.

The proposed RTRL is shown to be effective in improving the quadrotor trajectory tracking accuracy by both simulation and experiment results.

Infeasible reference trajectories may cause serious accidents for autonomous quadrotors. The results of this paper can improve the safety of autonomous quadrotor in application.