Search Results (266)

Barrel tools are increasingly used in high-precision machining of free-form surfaces. However, limited studies evaluate their performance specifically on spherical geometries, where tool–surface contact characteristics differ significantly. Understanding how tool geometry and process parameters influence surface quality and cutting forces in such cases remains underexplored. This study evaluates how barrel cutter radius and varying machining parameters affect cutting forces and surface roughness when milling internal and external spherical surfaces. Machining tests were conducted on structural steel 1.1191 using two barrel cutters with different curvature radii (85 mm and 250 mm) on a 5-axis CNC machine. Feed per tooth and radial depth of cut were systematically varied. Cutting forces were measured using a dynamometer, and surface roughness was assessed using the Rz parameter, which is more sensitive to peak deviations than Ra. Novelty lies in isolating spherical surface shapes (internal vs. external) under identical path trajectories and systematically correlating tool geometry to force and surface metrics. The larger curvature tool (250 mm) consistently generated up to twice the cutting force of the smaller radius tool under equivalent conditions. External surfaces showed higher Rz values than internal ones due to less favorable contact geometry. Radial depth of the cut had a linear influence on force magnitude, while feed rate had a limited effect except at higher depths. Smaller-radius barrel tools and internal geometries are preferable for minimizing cutting forces and achieving better surface quality when machining spherical components. The aim of this paper is to determine the actual force load and surface quality when using specific cutting conditions for internal and external spherical machined surfaces. Full article

Accurate path tracking is crucial for greenhouse robots operating in complex environments. However, traditional curve tracking algorithms suffer from low tracking accuracy and large tracking errors. This study aim to develop a high precision greenhouse autonomous following robot, use ANSYS Workbench 19.2 to perform stress and deformation analysis on the robot, then propose a path tracking method based on Linear Quadratic Regulator (LQR) to optimize the pure tracking to ensure high precision curved path tracking for curved tracking, finally perform a comparative simulation analysis in MATLAB R2024a. The structural analysis shows that the maximum equivalent stress is 196 MPa and the maximum deformation is 1.73 mm under a load of 600 kg, which are within the yield limit of 45 steel. Simulation results demonstrate that at a speed of 2 m/s, the conventional Pure Pursuit algorithm incurs a maximum lateral error of 0.3418 m and a heading error of 0.2669 rad under high curvature conditions. By contrast, the LQR–Pure Pursuit algorithm reduces the peak lateral error to 0.0904 m and confines the heading error to approximately 0.0217 rad. Experimental validation yielded an RMSE of 0.018 m for lateral error and 0.016 m for heading error. These findings confirm that the designed robot can sustain its payload under most operating scenarios and that the proposed tracking strategy effectively suppresses deviations and improves path-following accuracy. Full article

This paper proposes a speed-adaptive autonomous driving path-tracking framework based on the soft actor–critic (SAC) and pure pursuit (PP) methods, named the SACPP controller. The framework first analyzes the obstacles around the vehicle and plans an obstacle-free reference path with the minimum curvature using the hybrid A* algorithm. Next, based on the generated reference path, the current state of the vehicle, and the vehicle motor energy efficiency diagram, the optimal speed is calculated in real time, and the vehicle dynamics preview point at the future moment—specifically, the look-ahead distance—is predicted. This process relies on the learning of the SAC network structure. Finally, PP is used to generate the front wheel angle control value by combining the current speed and the predicted preview point. In the second layer, we carefully designed the evaluation function in the tracking process based on the uncertainties and performance requirements that may occur during vehicle driving. This design ensures that the autonomous vehicle can not only quickly and accurately track the path, but also effectively avoid surrounding obstacles, while keeping the motor running in the high-efficiency range, thereby reducing energy loss. In addition, since the entire framework uses a lightweight network structure and a geometry-based method to generate the front wheel angle, the computational load is significantly reduced, and computing resources are saved. The actual running results on the i7 CPU show that the control cycle of the control framework exceeds 100 Hz. Full article

Path smoothing is an important part of UAV (Unmanned Aerial Vehicle) path planning, because the smoothness of the planned path is related to the flight safety and stability of UAVs. In existing smooth UAV path planning methods, different characteristics of a path curve are not considered comprehensively, and the optimization functions established based on the arc length or curvature of the path curve are complex, resulting in low efficiency and quality of path smoothing. To balance the arc length and smoothness of UAV paths, this paper proposes to use energy-minimizing Bézier curves based on composite energy for smooth UAV path planning. In order to simplify the calculation, a kind of approximate stretching energy and bending energy are used to control the arc length and smoothness, respectively, of the path, by which the optimal path can be directly obtained by solving a linear system. Experimental validation in multiple scenarios demonstrates the methodology’s effectiveness and real-time computational viability, where the planned paths by this method have the characteristics of curvature continuity, good smoothness, and short arc length. What is more, in many cases, compared to path smoothing methods based solely on bending energy optimization, the proposed method can generate paths with a smaller maximum curvature, which is more conducive to the safe and stable flight of UAVs. Furthermore, the design of collision-free smooth path for UAVs based on the piecewise energy-minimizing Bézier curve is studied. The new method is simple and efficient, which can help to improve UAV path planning efficiency and thus improve UAV reaction speed and obstacle avoidance ability. Full article

Path planning for picking safflowers is a key component in ensuring the efficient operation of robotic safflower-picking systems. However, existing single-arm picking devices have become a bottleneck due to their limited operating range, and a breakthrough in multi-arm cooperative picking is urgently needed. To address the issue of inadequate adaptability in current path planning strategies for dual-arm systems, this paper proposes a novel path planning method for dual-arm picking (LTSACO). The technique centers on a dynamic-weight heuristic strategy and achieves optimization through the following steps: first, the K-means clustering algorithm divides the target area; second, the heuristic mechanism of the Ant Colony Optimization (ACO) algorithm is improved by dynamically adjusting the weight factor of the state transition probability, thereby enhancing the diversity of path selection; third, a 2-OPT local search strategy eliminates path crossings through neighborhood search; finally, a cubic Bézier curve heuristically smooths and optimizes the picking trajectory, ensuring the continuity of the trajectory’s curvature. Experimental results show that the length of the parallelogram trajectory, after smoothing with the Bézier curve, is reduced by 20.52% compared to the gantry trajectory. In terms of average picking time, the LTSACO algorithm reduces the time by 2.00%, 2.60%, and 5.60% compared to DCACO, IACO, and the traditional ACO algorithm, respectively. In conclusion, the LTSACO algorithm demonstrates high efficiency and strong robustness, providing an effective optimization solution for multi-arm cooperative picking and significantly contributing to the advancement of multi-arm robotic picking systems. Full article

Driver models, which provide mathematical or computational representations of human driving behavior, are crucial for intelligent driving systems by enabling stable and repeatable operations. However, existing models typically employ fixed weighting parameters to simulate preview delay, failing to reflect individual driver differences and real-time dynamic behaviors. This paper proposes a Brain-Memory Driver Model (BMDM) that emulates human brain memory mechanisms to dynamically adjust preview weights by integrating global path curvature, real-time vehicle speed, and steering torque. This emulation involves a three-stage process: capturing data in an Instantaneous Memory (IM) region, filtering data via a forgetting mechanism in a Short-Time Memory (STM) region to reduce scale, and retaining data based on correlation strength in a Long-Time Memory (LTM) region for persistent mining. By deploying a trained behavioral memory database, the model dynamically calibrates preview weights based on the driver’s state and real-time curvature variations under different road conditions. This enables the model to more accurately simulate authentic preview characteristics and improves its adaptability. Simulation results from an automated steering case study demonstrate that the improved model exhibits control performance closer to the real driving process, reproducing authentic steering behavior within the human–vehicle–road closed-loop system from an intelligent biomimetic perspective. Full article

The development of Advanced Driver Assistance Systems (ADASs) has reached a stage where, in addition to the traditional challenges of path planning and control, there is an increasing focus on the behavior of these systems. Assistance functions shall be personalized to deliver a full user experience. Therefore, driver modeling is a key area of research for next-generation ADASs. One of the most common tasks in everyday driving is lane keeping. Drivers are assisted by lane-keeping systems to keep their vehicle in the center of the lane. However, human drivers often deviate from the center line. It has been shown that the driver’s choice to deviate from the center line can be modeled by a linear combination of preview curvature information. This model is called the Linear Driver Model. In this paper, we fit the LDM parameters to real driving data. The drivers are then clustered based on the individual parameters. It is shown that clusters are not only formed by the numerical similarity of the driver parameters, but the drivers in a cluster actually have similar behavior in terms of path selection. Finally, an Extended Kalman Filter (EKF) is proposed to learn the model parameters at run-time. Any new driver can be classified into one of the driver type groups. This information can be used to modify the behavior of the lane-keeping system to mimic human driving, resulting in a more personalized driving experience. Full article

For the local oscillation phenomenon of the APF algorithm in the face of static U-shaped obstacles, the path cusp phenomenon caused by the vehicle corner and path curvature constraints is not taken into account, as well as the low path safety caused by ignoring the vehicle volume constraints. Therefore, an APF-Dijkstra path planning fusion algorithm based on steering model and volume constraints is proposed to improve it. First, perform an expansion treatment on the obstacles in the map, optimize the search direction of the Dijkstra algorithm and its planned global path, ensuring that the distance between the path and the expanded grid is no less than 1 m, and use the path points as temporary target points for the APF algorithm. Secondly, a Gaussian function is introduced to optimize the potential energy function of the APF algorithm, and the U-shaped obstacle is ellipticized, and a virtual target point is used to provide the gravitational force. Again, the three-point arc method based on the steering model is used to determine the location of the predicted points and to smooth the paths in real time while constraining the steering angle. Finally, a 4.5 m × 2.5 m vehicle rectangle is used instead of the traditional mass points to make the algorithm volumetrically constrained. Meanwhile, a model for detecting vehicle collisions is established to cover the rectangle boundary with 14 envelope circles, and the combined force of the computed mass points is transformed into the combined force of the computed envelope circles to further improve path safety. The algorithm is validated by simulation experiments, and the results show that the fusion algorithm can avoid static U-shaped obstacles and dynamic obstacles well; the curvature change rate of the obstacle avoidance path is 0.248, 0.162, and 0.169, and the curvature standard deviation is 0.16, which verifies the smoothness of the fusion algorithm. Meanwhile, the distances between the obstacles and the center of the rear axle of the vehicle are all higher than 1.60 m, which verifies the safety of the fusion algorithm. Full article

The advancement of mobile robot technology has made path planning a necessary condition for autonomous navigation, but traditional algorithms have issues with efficiency and reliability in dynamic and unstructured environments. This study proposes a Dynamic Hybrid A* (DHA*)–Adaptive Dynamic Window Approach (ADA-DWA) fusion algorithm for efficient and reliable path planning in dynamic unstructured environments. This paper improves the A* algorithm by introducing a dynamic hybrid heuristic function, optimizing the selection of key nodes, and enhancing the neighborhood search strategy, and collaboratively optimizes the search efficiency and path smoothness through curvature optimization. On this basis, the local planning layer introduces a self-adjusting weight-adaptive system in the DWA framework to dynamically optimize the speed, sampling distribution, and trajectory evaluation metrics, achieving a balance between obstacle avoidance and environmental adaptability. The proposed fusion algorithm’s comprehensive advantages over traditional methods in key operational indicators, including path optimality, computational efficiency, and obstacle avoidance capability, have been widely verified through numerical simulations and physical platforms. This method successfully resolves the inherent trade-off between efficiency and reliability in complex robot navigation scenarios, providing enhanced operational robustness for practical applications ranging from industrial logistics to field robots. Full article

Within computer-aided geometric design (CAGD), Said–Ball curves are primarily adopted in domains such as 3D object skeleton modeling, vascular structure repair, and path planning, owing to their flexible geometric properties. Techniques for curve degree reduction seek to reduce computational and storage demands while striving to maintain the essential geometric attributes of the original curve. This study presents a novel degree reduction model leveraging Euclidean distance and curvature data, markedly improving the preservation of geometric features throughout the reduction process. To enhance performance further, we propose a multi-strategy enhanced coati optimization algorithm (MSECOA). This algorithm utilizes a good point set combined with opposition-based learning to refine the initial population distribution, employs a fitness–distance equilibrium approach alongside a dynamic spiral search strategy to harmonize global exploration with local exploitation, and integrates an adaptive differential evolution mechanism to boost convergence rates and robustness. Experimental results demonstrate that the MSECOA outperforms nine highly cited agorithms in terms of convergence performance, solution accuracy, and stability. The algorithm exhibits superior behavior on the IEEE CEC2017 and CEC2022 benchmark functions and demonstrates strong practical utility across four engineering optimization problems with constraints. When applied to multi-degree reduction approximation of Said–Ball curves, the algorithm’s effectiveness is substantiated through four reduction cases, highlighting its superior precision and computational efficiency, thus providing a highly effective and accurate solution for complex curve degree reduction tasks. Full article

This paper addresses the limitations of the A* algorithm in underground roadway path planning, such as proximity to roadway boundaries, intersection with obstacle corners, trajectory smoothness, and timely obstacle avoidance (e.g., fallen rocks, miners, and moving equipment). To overcome these challenges, we propose an improved path planning algorithm integrating an enhanced A* method with an improved Dynamic Window Approach (DWA). First, a diagonal collision detection mechanism is implemented within the A* algorithm to effectively avoid crossing obstacle corners, thus enhancing path safety. Secondly, roadway width is incorporated into the heuristic function to guide paths toward the roadway center, improving stability and feasibility. Subsequently, based on multiple global path characteristics—including path length, average curvature, fluctuation degree, and direction change rate—an adaptive B-spline curve smoothing method generates smoother paths tailored to the robot’s kinematic requirements. Furthermore, the global path is segmented into local reference points for DWA, ensuring seamless integration of global and local path planning. To prevent local optimization traps during obstacle avoidance, a distance-based cost function is introduced into DWA’s evaluation criteria, maintaining alignment with the global path. Experimental results demonstrate that the proposed method significantly reduces node expansions by 43.79%, computation time by 16.28%, and path inflection points by 80.70%. The resultant path is smoother, centered within roadways, and capable of effectively avoiding dynamic and static obstacles, thereby ensuring the safety and efficiency of underground robotic transport operations. Full article

The safe removal of residual flammable contaminants from vertical mixer blades is a crucial challenge in aerospace propellant production. While robotic cleaning has become the preferred solution due to its precision and operational safety, the complex helical geometry of mixer blades presents significant challenges for robotic systems, primarily in three aspects: (1) dynamic sub-region division, requiring simultaneous consideration of functional zones and residue distribution, (2) ensuring path continuity across surfaces with varying curvature, and (3) balancing time–energy efficiency in discontinuous cleaning sequences. To address these challenges, this paper proposes a novel robotic cleaning path planning method for complex curved surfaces. Firstly, we introduce a blade surface segmentation approach based on the k-means++ clustering algorithm, along with a sub-surface patch boundary determination method using parameterized curves, to achieve precise surface partitioning. Subsequently, robot cleaning paths are planned for each sub-surface according to cleaning requirements and tool constraints. Finally, with total cleaning time as the optimization objective, a genetic algorithm is employed to optimize the path combination across sub-facets. Extensive experimental results validate the effectiveness of the proposed method in robotic cleaning path planning. Full article

Objectives: The aim of this study is to investigate how Adaptive Torque Control motion influences the shaping efficiency of Neolix EDMax (Neolix SAS, Évron, France) and its ability to reach working length with or without a pre-existing glide path. Methods: A total of 90 endo training blocks with an S-shape curvature were divided into three groups based on the kinematics and preparation phase: the control group, where the Neolix EDMax (Neolix SAS, Évron, France) was used for shaping after a glide path was established; the no glide path group, where the Neolix EDMax (Neolix SAS, Évron, France) was used for shaping without a glide path; and the Adaptive Torque Control group, where the Neolix EDMax (Neolix SAS, Évron, France) was used for shaping without a glide path but in an Adaptive Torque Control motion. The time for shaping, the instrument passes, and the ability to reach working length were recorded and analyzed using a one-way Anova and Tukey’s HSD post hoc test. Results: Establishing a glide path helped the shaping file to reach working length faster and in fewer passes when compared with the no glide path group, but the Adaptive Torque Control group was able to perform even better than the control group despite not having a pre-established glide path. Conclusions: The Adaptive Torque Control motion on continuous rotation instruments does impact their performance. Combining the efficiency of continuous rotation and the safety of reciprocation, this type of motion had a significant effect on the ability to shape the simulated root canal even in the presence of a double curvature and without a pre-established glide path. Full article

The precise extractions of tree components such as wood (i.e., trunk and branches) and leaves are fundamental prerequisites for obtaining the key attributes of trees, which will provide significant benefits for ecological and physiological studies and forest applications. Terrestrial laser scanning technology offers an efficient means for acquiring three-dimensional information on tree attributes, and has marked potential for extracting the detailed tree attributes of tree components. However, previous studies on wood–leaf separation exhibited limitations in unsupervised adaptability and robustness to complex tree architectures, while demonstrating inadequate performance in fine branch detection. This study proposes a novel unsupervised model (NE-PC) that synergizes geometric features with graph-based path analysis to achieve accurate wood–leaf classification without training samples or empirical parameter tuning. First, the boundary-preserved supervoxel segmentation (BPSS) algorithm was adapted to generate supervoxels for calculating geometric features and representative points for constructing the undirected graph. Second, a node expansion (NE) approach was proposed, with nodes with similar curvature and verticality expanded into wood nodes to avoid the omission of trunk points in path frequency detection. Third, a path concatenation (PC) approach was developed, which involves detecting salient features of nodes along the same path to improve the detection of tiny branches that are often deficient during path retracing. Tested on multi-station TLS point clouds from trees with complex leaf–branch architectures, the NE-PC model achieved a 94.1% mean accuracy and a 86.7% kappa coefficient, outperforming renowned TLSeparation and LeWos (ΔOA = 2.0–29.7%, Δkappa = 6.2–53.5%). Moreover, the NE-PC model was verified in two other study areas (Plot B, Plot C), which exhibited more complex and divergent branch structure types. It achieved classification accuracies exceeding 90% (Plot B: 92.8 ± 2.3%; Plot C: 94.4 ± 0.7%) along with average kappa coefficients above 80% (Plot B: 81.3 ± 4.2%; Plot C: 81.8 ± 3.2%), demonstrating robust performance across various tree structural complexities. Full article

This paper presents an enhanced artificial lemming algorithm (EALA) for solving complex unmanned aircraft system (UAV) path planning problems in three-dimensional environments. Key improvements include chaotic initialization, adaptive perturbation, and hybrid mutation, enabling a better exploration–exploitation balance and local refinement. Validation on the IEEE CEC2017 and CEC2022 benchmark functions demonstrates the EALA’s superior performance, achieving faster convergence and better algorithm performance compared to the standard ALA and 10 other algorithms. When applied to UAV path planning in large- and medium-scale environments with realistic obstacle constraints, the EALA generates Pareto-optimal paths that minimize length, curvature, and computation time while guaranteeing collision avoidance. Benchmark tests and realistic simulations show that the EALA outperforms 10 algorithms. This method is particularly suited for mission-critical applications with strict safety and time constraints. Full article