Explore the vast range of titles available.

To make unmanned surface vehicles that are better applied to the field of environmental monitoring in inland rivers, reservoirs, or coasts, we propose a global path-planning algorithm based on the improved A-star algorithm. The path search is carried out using the raster method for environment modeling and the 8-neighborhood search method: a bidirectional search strategy and an evaluation function improvement method are used to reduce the total number of traversing nodes; the planned path is smoothed to remove the inflection points and solve the path folding problem. The simulation results reveal that the improved A-star algorithm is more efficient in path planning, with fewer inflection points and traversing nodes, and the smoothed paths are more to meet the actual navigation demands of unmanned surface vehicles than the conventional A-star algorithm.

A traditional A-Star (A*) algorithm generates an optimal path by minimizing the path cost. For a vessel, factors of path length, obstacle collision risk, traffic separation rule and manoeuvrability restriction should be all taken into account for path planning. Meanwhile, the water current also plays an important role in voyaging and berthing for vessels. In consideration of these defects of the traditional A-Star algorithm when it is used for vessel path planning, an improved A-Star algorithm has been proposed. To be specific, the risk models of obstacles (bridge pier, moored or anchored ship, port, shore, etc.) considering currents, traffic separation, berthing, manoeuvrability restriction have been built firstly. Then, the normal path generation and the berthing path generation with the proposed improved A-Star algorithm have been represented, respectively. Moreover, the problem of combining the normal path and the berthing path has been also solved. To verify the effectiveness of the proposed A-Star path planning methods, four cases have been studied in simulation and real scenarios. The results of experiments show that the proposed A-Star path planning methods can deal with the problems denoted in this article well, and realize the trade-off between the path length and the navigation safety.

The operational areas for unmanned aerial vehicles (UAVs) used in power line inspection are highly complex; thus, the best path planning under known obstacles is of significant research value for UAVs. This paper establishes a three-dimensional spatial environment based on the gridding and filling of two-dimensional maps, simulates a variety of obstacles, and proposes a new optimization algorithm based on the A-STAR algorithm, considering the unique dynamics and control characteristics of quadcopter UAVs. By utilizing a novel heuristic evaluation function and uniformly applied quadratic B-spline curve smoothing, the planned path is optimized to better suit UAV inspection scenarios. Compared to the traditional A-STAR algorithm, this method offers improved real-time performance and global optimal solution-solving capabilities and is capable of planning safer and more realistic flight paths based on the operational characteristics of quadcopter UAVs in mountainous environments for power line inspection.

To overcome the limitation of poor processing times for long-distance off-road path planning, an improved A-Star algorithm based on terrain data is proposed in this study. The improved A-Star algorithm for long-distance off-road path planning tasks was developed to identify a feasible path between the start and destination based on a terrain data map generated using a digital elevation model. This study optimised the algorithm in two aspects: data structure, retrieval strategy. First, a hybrid data structure of the minimum heap and 2D array greatly reduces the time complexity of the algorithm. Second, an optimised search strategy was designed that does not check whether the destination is reached in the initial stage of searching for the global optimal path, thus improving execution efficiency. To evaluate the efficiency of the proposed algorithm, three different off-road path planning tasks were examined for short-, medium-, and long-distance path planning tasks. Each group of tasks corresponded to three different off-road vehicles, and nine groups of experiments were conducted. The experimental results show that the processing efficiency of the proposed algorithm is significantly better than that of the conventional A-Star algorithm. Compared with the conventional A-Star algorithm, the path planning efficiency of the improved A-Star algorithm was accelerated by at least 4.6 times, and the maximum acceleration reached was 550 times for long-distance off-road path planning. The simulation results show that the efficiency of long-distance off-road path planning was greatly improved by using the improved algorithm.

A fusion pathfinding algorithm based on the optimized A-star algorithm, the artificial potential field method and the least squares method is proposed to meet the performance requirements of path smoothing, response speed and computation time for the path planning of home cleaning robots. The fusion algorithm improves the operation rules of the traditional A-star algorithm, enabling global path planning to be completed quickly. At the same time, the operating rules of the artificial potential field method are changed according to the path points found by the optimal A-star algorithm, thus greatly avoiding the dilemma of being trapped in local optima. Finally, the least squares method is applied to fit the complete path to obtain a smooth path trajectory. Experiments show that the fusion algorithm significantly improves pathfinding efficiency and produces smoother and more continuous paths. Through simulation comparison experiments, the optimized A-star algorithm reduced path-planning time by 60% compared to the traditional A-star algorithm and 65.2% compared to the bidirectional A-star algorithm path-planning time. The fusion algorithm reduced the path-planning time by 65.2% compared to the ant colony algorithm and 83.64% compared to the RRT algorithm path-planning time.

Spherical robots have fully wrapped shells, which enables them to walk well on complex terrains, such as swamps, grasslands and deserts. At present, path planning algorithms for spherical robots mainly focus on finding the shortest path between the initial position and the target position. In this paper, an improved A* algorithm considering energy consumption is proposed for the path planning of spherical robots. The optimization objective of this algorithm is to minimize both the energy consumption and path length of a spherical robot. A heuristic function constructed with the energy consumption estimation model (ECEM) and the distance estimation model (DEM) is used to determine the path cost of the A* algorithm. ECEM and DCM are established based on the force analysis of the spherical robot and the improved Euclidean distance of the grid map, respectively. The effectiveness of the proposed algorithm is verified by simulation analysis based on a 3D grid map and a spherical robot moving with uniform velocity. The results show that compared with traditional path planning algorithms, the proposed algorithm can minimize the energy consumption and path length of the spherical robot as much as possible.

To address the problem of ignoring unpaved roads when planning off-road emergency rescue paths, an improved A* algorithm that incorporates road factors is developed to create an off-road emergency rescue path planning model in this study. To reduce the number of search nodes and improve the efficiency of path searches, the current node is classified according to the angle between the line connecting the node and the target point and the due east direction. Additionally, the search direction is determined in real time through an optimization method to improve the path search efficiency. To identify the path with the shortest travel time suitable for emergency rescue in wilderness scenarios, a heuristic function based on the fusion of road factors and a path planning model for off-road emergency rescue is developed, and the characteristics of existing roads are weighted in the process of path searching to bias the selection process toward unpaved roads with high accessibility. The experiments show that the improved A* algorithm significantly reduces the travel time of off-road vehicles and that path selection is enhanced compared to that with the traditional A* algorithm; moreover, the improved A* algorithm reduces the number of nodes by 16.784% and improves the search efficiency by 27.18% compared with the traditional 16-direction search method. The simulation results indicate that the improved algorithm reduces the travel time of off-road vehicles by 21.298% and improves the search efficiency by 93.901% compared to the traditional A* algorithm, thus greatly enhancing off-road path planning.

In response to the shortcomings of the traditional A-star algorithm, such as excessive node traversal, long search time, unsmooth path, close proximity to obstacles, and applicability only to static maps, a path planning method that integrates an adaptive A-star algorithm and an improved Dynamic Window Approach (DWA) is proposed. Firstly, an adaptive weight value is added to the heuristic function of the A-star algorithm, and the Douglas–Pucker thinning algorithm is introduced to eliminate redundant points. Secondly, a trajectory point estimation function is added to the evaluation function of the DWA algorithm, and the path is optimized for smoothness based on the B-spline curve method. Finally, the adaptive A-star algorithm and the improved DWA algorithm are integrated into the fusion algorithm of this article. The feasibility and effectiveness of the fusion algorithm are verified through obstacle avoidance experiments in both simulation and real environments.

Path planning and trajectory tracking are very meaningful for the field of autonomous driving, but currently path planning still has problems such as non-optimal paths and insufficiently accurate paths. This paper addresses the issue of path planning by proposing a improved A-star algorithm and locally zooming on the map technique to achieve precise path planning. Compared with the conventional method, this method reduces the time by 23% and the path length by 21% in the scenarios shown in the paper, respectively, and provides a reference for related research. Moreover, trajectory tracking was achieved using the improved LQR control. Compared with the conventional method, the improved LQR control algorithm reduces the average error by 80% in the scenario shown in the paper. Firstly, the A-star algorithm is enhanced by incorporating an unknown path cost estimation function, thereby improving the effect of its path planning in complex environments. Additionally, the method of locally zooming on the map is incorporated, effectively enhancing the accuracy and safety of path planning. Building upon the path planning, further improvements are made to the LQR control algorithm, enabling autonomous deceleration in complex sections, which facilitates better trajectory tracking and enhances the motion control performance of the robot during practical operations.

In this paper, a cellular robot for space trusses is structured so that it can perform tasks such as moving the truss and assembling the truss. There may be some spatial operating mechanisms on the space truss that cause obstacles to the robot’s movement, especially other mobile mechanical devices that are working, which are dynamic obstacles, so a suitable path planning for the robot is needed. In path planning, A-star algorithm has the advantages of efficient searching speed and good optimization effect, but it can’t deal with the path planning problem with dynamic obstacles, so this paper improves Lifelong Planning A-star (LPA-star) algorithm so that the improved algorithm satisfies the dynamic path planning task. Then a three-dimensional truss mathematical model is established, a dynamic obstacle environment is set up, the improved LPA-star algorithm is used for path planning, and the unimproved LPA-star algorithm and the improved A-star algorithm are used to compare with it. The simulation results show that in the environment set up in this paper, the optimal path length of the improved LPA-star algorithm is shortened by about 25% and the algorithm search time is shortened by about 55% compared with the improved A-star algorithm; while the unimproved LPA-star algorithm is unable to accomplish the dynamic path planning task. Therefore, the improved LPA-star algorithm can reduce the robot’s moving distance and time consumption.