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 paper aims to automatically obtain the implant parameter from the CBCT images to improve the outcome of implant planning.

This paper proposes automatic simulated dental implant positioning on CBCT images, which can significantly improve the efficiency of implant planning. The authors introduce the fusion point calculation method for the missing tooth's long axis and root axis based on the dental arch line used to obtain the optimal fusion position. In addition, the authors proposed a semi-interactive visualization method of implant parameters that be automatically simulated by the authors' method. If the plan does not meet the doctor's requirements, the final implant plan can be fine-tuned to achieve the optimal effect.

A series of experimental results show that the method proposed in this paper greatly improves the feasibility and accuracy of the implant planning scheme, and the visualization method of planting parameters improves the planning efficiency and the friendliness of system use.

The proposed method can be applied to dental implant planning software to improve the communication efficiency between doctors, patients and technicians.

Single-shot multi-category clothing recognition and retrieval play a crucial role in online searching and offline settlement scenarios. Existing clothing recognition methods based on RGBD clothing images often suffer from high-dimensional feature representations, leading to compromised performance and efficiency.

To address this issue, this paper proposes a novel method called Manifold Embedded Discriminative Feature Selection (MEDFS) to select global and local features, thereby reducing the dimensionality of the feature representation and improving performance. Specifically, by combining three global features and three local features, a low-dimensional embedding is constructed to capture the correlations between features and categories. The MEDFS method designs an optimization framework utilizing manifold mapping and sparse regularization to achieve feature selection. The optimization objective is solved using an alternating iterative strategy, ensuring convergence.

Empirical studies conducted on a publicly available RGBD clothing image dataset demonstrate that the proposed MEDFS method achieves highly competitive clothing classification performance while maintaining efficiency in clothing recognition and retrieval.

This paper introduces a novel approach for multi-category clothing recognition and retrieval, incorporating the selection of global and local features. The proposed method holds potential for practical applications in real-world clothing scenarios.

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 article offered two meshfree algorithms, namely the local radial basis functions-finite difference (LRBF-FD) approximation and local radial basis functions-differential quadrature method (LRBF-DQM) to simulate the multidimensional hyperbolic wave models and work is an extension of Jiwari (2015).

In the evolvement of the first algorithm, the time derivative is discretized by the forward FD scheme and the Crank-Nicolson scheme is used for the rest of the terms. After that, the LRBF-FD approximation is used for spatial discretization and quasi-linearization process for linearization of the problem. Finally, the obtained linear system is solved by the LU decomposition method. In the development of the second algorithm, semi-discretization in space is done via LRBF-DQM and then an explicit RK4 is used for fully discretization in time.

For simulation purposes, some 1D and 2D wave models are pondered to instigate the chastity and competence of the developed algorithms.

The developed algorithms are novel for the multidimensional hyperbolic wave models. Also, the stability analysis of the second algorithm is a new work for these types of model.

This study aims to modify a nature-based numerical method named the invasive weed optimization (IWO) method for mobile robot path planning in various complex environments.

The existing IWO method is quick in converging to a feasible solution but in a complex environment; it takes more time as well as computational resources. So, in this paper, the computational part of this artificial intelligence technique is modified with the help of recently developed evolution algorithms like particle swarm optimization, genetic algorithm, etc. Some conditional logic statements were used while doing sensor-based mapping for exploring complex paths. Implementation of sensor-based exploration, mathematical IWO method and prioritizing them for better efficiency made this modified IWO method take complex dynamic decisions.

The proposed modified IWO is better for dynamic obstacle avoidance and navigating a long complex map. The deviation of results in simulation and experiments is less than 5.5%, which validates a good agreement between simulation and real-time testing platforms.

As per a deep literature review, it has found that the proposed approach has not been implemented on the Khepera-III robot for smooth motion planning. Here a dynamic obstacle mapping feature is implemented. A method to selectively distribute seeds instead of a random normal distribution is also implemented in this work. The modified version of IWO is coded in MATLAB and simulated through V-Rep simulation software. The integration of sensors was done through logical conditioning. The simulation results are validated using real-time experiments.