Path Planning Research Articles

Investigation on the Optimization Strategy of DWA Algorithm for Path Planning of the USVs with the Consideration of Environmental Factors

Unmanned surface vessels (USVs) are generally subjected to wind force, wave and undercurrent action. Some unidentified objects such as underwater obstacles and submerged reefs should be monitored and evaded with converged communication, autonomous control and network system so as to achieve autonomous and automatic avoidance of danger and real-time control of flight path. Next, based on performing interference mechanics analysis on the USVs under the disturbance of wind force and wave on water surface, the relationship parameters between the bow angle, the deviation angle, safety evaluation function and the external force were obtained, and the comprehensive information of water surface environment was evaluated in combination with the dynamic window approach (DWA) algorithm. Further, the related model was established for simulation by using the simulation software MATLAB, and both reliability and stability of the modified DWA algorithm were designed and examined. Accordingly, the modified DWA algorithm can enhance the safety of the USVs in autonomous path planning and achieve rapid obstacle avoidance and autonomous path planning of the USVs. Our simulation revealed that the modified DWA algorithm can safely and rapidly correct the bow angle and the deviation angle, optimize the path trajectory and reduce the risk of roll-over of the USVs under sudden external force.

Global Path Optimal Planning Method for Autonomous Vehicles Based on Image Feature Extraction

In order to solve the problem of autonomous vehicles driving safely on the road while searching for optimal paths to avoid traffic congestion and obstruction, this paper establishes an optimal path planning model based on image feature extraction. The model consists of four parts: the selection of key turning points, interpolation between turning points, definition of the evaluation function, and global optimal path search. First, based on the map information provided by the network, an image feature detection algorithm was proposed, and the key turning points of the map route were selected and stored in an open table. Then, based on mechanical analysis theory, the cubic interpolation between two key turning points of the optimal path was defined. This allows the car to drive along a continuous curve with a certain arc radius, enabling it to drive smoothly, effectively avoid obstacles, and ensure safety. Then, an evaluation function is defined as needed, and different evaluation functions are specified for different road sections to avoid excessive local deviations in planning and to reduce the impact of known obstacles on the path. Finally, the cost of the search path is calculated based on the evaluation function. According to the principle of minimum cost, a globally optimal heuristic search algorithm is proposed to find the globally optimal path. Experimental results show that the proposed global optimal path planning algorithm has excellent performance, with an average accuracy of 96.71% and a search speed of 2.78 ms. The model not only provides accurate path planning and fast path selection capabilities but also has strong robustness against interference.

A review of navigation techniques for telepresence robots

Nowadays the need for digital travel has increased more than ever. This is due to the need for social distancing for medical reasons, economy of travelling, and avoidance of risks involved in physical travelling or for convenience. The telepresence robot therefore serves as a surrogate for the pilot user. Telepresence robots are very resourceful and versatile. Their applications include education; medicine; business; research and ambient assisted living. A major consideration for the effective functioning of telepresence robots is the navigation scheme employed which is central to its overall reliability. Depending on the use to which the robot is to be put, several authors have considered various navigation schemes used to effectively control and navigate in workspace consisting of obstacles and/or order robots. This work aims to review the navigation technique that has been employed by researchers for telepresence robots with a view to identifying the strengths and weaknesses of the various navigation techniques and subsequently coming up with a relatively novel system of navigation that attemts to mitigate the various weaknesses of the previous methodologies for telepresence robot navigation. It has been observed that the general path planning and navigation for the usual autonomous robot is also applicable to the telepresence robot but bearing in mind that the robot is being piloted by humans and it is only when in a condition where it would be cumbersome for the humans that autonomous control system takes over. At such times path planning and navigation using AI methods have proved to be of importance. The path planning algorithms have been shown to be categorized into two viz: global path planning algorithms which are used for known environments and local path planning algorithms for unknown or partially known environments. The algorithms for local path planning are majorly reactive in attribute and are more relevant to telepresence robots. In any particular application, an appropriate blend of a number of these algorithms is employed to achieve desired navigation objectives. Furthermore, in this work, we propose the combination of a line follower robot with an obstacle avoidance algorithm for situations where the expected robot paths are foreknown.

Path Planning for Mobile Robots Based on the Improved DAPF-QRRT* Strategy

The rapidly exploring random tree star (RRT*) algorithm is widely used to solve path planning problems. However, the RRT* algorithm and its variants fall short of achieving a balanced consideration of path quality and safety. To address this issue, an improved discretized artificial potential field-QRRT* (IDAPF-QRRT*) path planning strategy is introduced. Initially, the APF method is integrated into the Quick-RRT* (Q-RRT*) algorithm, utilizing the attraction of goal points and the repulsion of obstacles to optimize the tree expansion process, swiftly achieving superior initial solutions. Subsequently, a triangle inequality-based path reconnection mechanism is introduced to create and reconnect path points, optimize the path length, and accelerate the generation of sub-optimal paths. Finally, by refining the traditional APF method, a repulsive orthogonal vector field is obtained, achieving the orthogonalization between repulsive and attractive vector fields. This places key path points within the optimized vector field and adjusts their positions, thereby enhancing path safety. Compared to the Q-RRT* algorithm, the DPF-QRRT* algorithm achieves a 37.66% reduction in the time taken to achieve 1.05 times the optimal solution, and the IDAPF-QRRT* strategy nearly doubles generated path safety.

A Review of UAV Path-Planning Algorithms and Obstacle Avoidance Methods for Remote Sensing Applications

The rapid development of uncrewed aerial vehicles (UAVs) has significantly increased their usefulness in various fields, particularly in remote sensing. This paper provides a comprehensive review of UAV path planning, obstacle detection, and avoidance methods, with a focus on its utilisation in both single and multiple UAV platforms. The paper classifies the algorithms into two main categories: (1) global and local path-planning approaches in single UAVs; and (2) multi-UAV path-planning methods. It further analyses obstacle detection and avoidance methods, as well as their capacity to adapt, optimise, and compute efficiently in different operational environments. The outcomes highlight the advantages and limitations of each method, offering valuable information regarding their suitability for remote sensing applications, such as precision agriculture, urban mapping, and ecological surveillance. Additionally, this review also identifies limitations in the existing research, specifically in multi-UAV frameworks, and provides recommendations for future developments to improve the adaptability and effectiveness of UAV operations in dynamic and complex situations.

Integrated automatic parking path planning and trajectory tracking optimization method

Current automatic parking systems often separate path planning and trajectory tracking, increasing complexity and failing to meet the parking needs of autonomous cars. Consequently, this study presents an approach based on Multi-stage Nonlinear Model Predictive Control (MSNMPC) for integrated autonomous parking path planning and trajectory tracking optimization. The method represents the evolution of uncertainty parameters over time through a scenario tree, and the MSNMPC controller with a predictive horizon P defines P + 1 phases, each with specific cost and constraint functions that depend only on the vehicle state and control inputs of that phase to satisfy the constraints of all phases of the parking process. In addition, the method integrates path planning and tracking control into one optimization problem, which is solved online to achieve integrated parking control. Simulation confirms that, in comparison to MPC with RRT* hierarchical control, the integrated parking scheme of MSNMPC has less lateral error and offers superior flexibility and tracking performance. To verify the generality of the scheme, it was validated in the diagonal parking scenario and the vertical parking scenario, respectively. The results show that, compared to the control experiments, the parking elapsed time has been reduced by 10.76% and 9.02%, respectively, enhancing parking efficiency. In addition, the parking error has decreased by 30.77% and 38.46%, respectively, thus improving parking accuracy. Moreover, the minimum safe distance in the control scheme for addressing uncertainty factors is 0.7 m greater than that of the control experiments, meeting the driving requirements for driverless vehicles in parking scenarios.

VNS-BA*: An Improved Bidirectional A* Path Planning Algorithm Based on Variable Neighborhood Search.

The A* algorithm is an effective method for path planning; however, it has certain drawbacks, such as a high number of turns, low planning efficiency, and redundant searches. To address these issues, this paper proposes an improved bidirectional A* global path planning algorithm based on a variable neighborhood search strategy, named VNS-BA*. The new algorithm first employs an 8-11-13 neighborhood search method for node expansion. Then, the bidirectional search strategy is optimized by using the current nodes of the opposite path and the global target point, enabling the two paths to meet in the middle of the map. Finally, redundant turns are removed from the path, and cubic spline interpolation is applied to achieve local smoothing at the turns. The effectiveness of the improved algorithm was validated on different maps and compared with A* and its three derived improved versions. The simulation results indicate that VNS-BA* shows significant improvements in terms of the number of path turns, turn angles, and planning efficiency.

Modeling and Experimental Validation of a Cable-Driven Robot for 3D Printing Construction

Abstract Cable-driven robots are characterized by a large workspace, high speed and load-to-weight ratio, providing a new technology approach for large-scale autonomous 3D construction of lunar surface shelters. A novel deployable cable-driven construction 3D printer (CDCP) is developed in this study. Guiding pulleys and cable sagging are considered and modeled to improve the accuracy of the system. A fuzzy adaptive differential evolution PID (FDEPID) control is proposed to reduce end-effector motion errors in Cartesian space and thus improve printing quality and stability. Concentric and zigzag infill strategies are compared to optimize printing efficiency and infill effectiveness in path planning. Finally, experiments are carried out to validate the proposed FDEPID control and path planning strategies which demonstrate the great potential of the developed cable-driven printer in the construction of lunar architecture.

Kinematic Constrained RRT Algorithm with Post Waypoint Shift for the Shortest Path Planning of Wheeled Mobile Robots.

This paper presents a rapidly exploring random tree (RRT) algorithm with an effective post waypoint shift, which is suitable for the path planning of a wheeled mobile robot under kinematic constraints. In the growth of the exploring tree, the nearest node that satisfies the kinematic constraints is selected as the parent node. Once the distance between the new node and the target is within a certain threshold, the tree growth stops and a target connection based on minimum turning radius arc is proposed to generate an initial complete random path. The most significant difference from traditional RRT-based methods is that the proposed method optimizes the path based on Dubins curves through a post waypoint shift after a random path is generated, rather than through parent node selection and rewiring during the exploring tree growth. Then, it is proved that the method can obtain an optimal path in terms of the shortest length. The optimized path has good convergence and almost does not depend on the state of the initial random path. The comparative test results show that the proposed method has significant advantages over traditional RRT-based methods in terms of the sampling point number, the tree node number, and the path node number. Subsequently, an efficient method is further proposed to avoid unknown obstacles, which utilizes the original path information and thus effectively improves the new path planning efficiency. Simulations and real-world tests are carried out to demonstrate the effectiveness of this method.

Research on unmanned vehicle trajectory planning problem based on genetic algorithm

In this study, a method based on Genetic Algorithm and optimal control for path planning of an unmanned vehicle is proposed. This work discretizes the optimal control problem into a nonlinear programming problem and resolves it to enhance the initial answer. All physical quantities are incorporated as variables into the problem-solving process and limited by an objective function to derive the optimum trajectory.

Path Planning in Payment Channel Networks with Multi-Party Channels

Payment Channel Networks (PCNs) provide a means to improve the scaling of cryptocurrency payments by allowing peers to make payments between themselves in an efficient manner. To make a payment between two peers, the task of path planning must first be performed to determine a path in the PCN connecting the peers in question before the payment in question is performed using this path. To date, existing research has focused on the problem of performing path planning in PCNs that contain two-party channels. It has been hypothesised that the scaling of PCNs could be further improved by considering the inclusion of multi-party channels that contain more than two peers. However, the problem of performing path planning in PCNs that contain multi-party channels has not yet been considered. In this article, we address this gap in the research literature and propose a novel path planning method for PCNs containing multi-party channels. This method involves modelling the PCN with multi-party channels as a hypergraph, a type of graph where edges can contain two or more vertices, and using this model to solve the path planning problem in question. We prove that the proposed method is correct and computationally efficient. Furthermore, assuming path planning is performed using this method, we also present theoretical and experimental analyses that demonstrate the scaling benefits of using multi-party channels.

An Improved HBA Method for Path Planning of Substation Inspection Robots

Aiming at the problems of honey badger algorithm (HBA) in the path planning of substation inspection robot, such as long path length, time-consuming search and high obstacle risk rate, an improved HBA algorithm called IHBA is proposed. Firstly, the honey badger population is initialized by reverse learning mechanism to increase its diversity. Secondly, the adaptive weight factor is used to improve the density factor of the HBA, which effectively balances the exploration capacity in different stages and improves the optimization accuracy of the population. Finally, the elite mutation strategy is used to strengthen the honey badgers’ location, which can guide the population to produce offspring in the food source area with better adaptability. To verify the improved effect of the algorithm and its path planning performance, the path planning experiments are designed, which indicate that compared with the BOA, IACO, GFA and classic HBA, the proposed IHBA in this paper has shorter path, higher search efficiency and lower obstacle risk rate, which can not only help the substation inspection robot plan the optimal path globally, but also increase the smoothness of the planned path.

Research on Complete Coverage Path Planning of Agricultural Robots Based on Markov Chain Improved Genetic Algorithm

Due to the limitations of low coverage, high repetition rate, and slow convergence speed of the basic genetic algorithm (GA) in robot complete coverage path planning, the state transition matrix of the Markov chain is introduced to guide individual mutation based on the genetic mutation path planning algorithm, which can improve the quality of population individuals, enhancing the search ability and convergence speed of the genetic algorithm. The proposed improved genetic algorithm is used for complete coverage path planning simulation analysis in different work areas. The analysis results show that compared to traditional genetic algorithms, the improved genetic algorithm proposed in this paper reduces the average path length by 21.8%, the average number of turns by 6 times, the repetition rate by 83.8%, and the coverage rate by 7.76% in 6 different work areas. The results prove that the proposed improved genetic algorithm is applicable in complete coverage path planning. To verify whether the Markov chain genetic algorithm (MCGA) proposed is suitable for agricultural robot path tracking and operation, it was used to plan the path of an actual land parcel. An automatic navigation robot can track the planned path, which can verify the feasibility of the MCGA proposed.

Distributed intelligence in industrial and automotive cyber-physical systems: a review.

Cyber-physical systems (CPSs) are evolving from individual systems to collectives of systems that collaborate to achieve highly complex goals, realizing a cyber-physical system of systems (CPSoSs) approach. They are heterogeneous systems comprising various autonomous CPSs, each with unique performance capabilities, priorities, and pursued goals. In practice, there are significant challenges in the applicability and usability of CPSoSs that need to be addressed. The decentralization of CPSoSs assigns tasks to individual CPSs within the system of systems. All CPSs should harmonically pursue system-based achievements and collaborate to make system-of-system-based decisions and implement the CPSoS functionality. The automotive domain is transitioning to the system of systems approach, aiming to provide a series of emergent functionalities like traffic management, collaborative car fleet management, or large-scale automotive adaptation to the physical environment, thus providing significant environmental benefits and achieving significant societal impact. Similarly, large infrastructure domains are evolving into global, highly integrated cyber-physical systems of systems, covering all parts of the value chain. This survey provides a comprehensive review of current best practices in connected cyber-physical systems and investigates a dual-layer architecture entailing perception and behavioral components. The presented perception layer entails object detection, cooperative scene analysis, cooperative localization and path planning, and human-centric perception. The behavioral layer focuses on human-in-the-loop (HITL)-centric decision making and control, where the output of the perception layer assists the human operator in making decisions while monitoring the operator's state. Finally, an extended overview of digital twin (DT) paradigms is provided so as to simulate, realize, and optimize large-scale CPSoS ecosystems.

Improved A-STAR Algorithm for Power Line Inspection UAV Path Planning

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.

An analytical study of Euler angle and Rodrigues parameter representations of $\mathbb{SO}(3)$ towards describing subsets of ${\mathbb{SO}}(3)$ geometrically and establishing the relations between these

Abstract Descriptions of various subsets of $\mathbb{SO}(3)$ are encountered frequently in robotics, for example, in the context of specifying the orientation workspaces of manipulators. Often, the Cartesian concept of a cuboid is extended into the domain of Euler angles, notwithstanding the fact that the physical implications of this practice are not documented. Motivated by this lacuna in the existing literature, this article focuses on studying sets of rotations described by such cuboids by mapping them to the space of Rodrigues parameters, where a physically meaningful measure of distance from the origin is available and the spherical geometry is intrinsically pertinent. It is established that the planar faces of the said cuboid transform into hyperboloids of one sheet and hence, the cuboid itself maps into a solid of complicated non-convex shape. To quantify the extents of these solids, the largest spheres contained within them are computed analytically. It is expected that this study would help in the process of design and path planning of spatial robots, especially those of parallel architecture, due to a better and quantitative understanding of their orientation workspaces.

R3T*-MOSafeRL($$\lambda $$): path planning of mobile robots in unknown dynamic environments

R3T*-MOSafeRL($$\lambda $$): path planning of mobile robots in unknown dynamic environments

Integrated Navigation Method for Orchard-Dosing Robot Based on LiDAR/IMU/GNSS

To enhance the localization reliability and obstacle avoidance performance of the dosing robot in complex orchards, this study proposed an integrated navigation method using LiDAR, IMU, and GNSS. Firstly, the tightly coupled LIO-SAM algorithm was used to construct an orchard grid map for path planning and obstacle avoidance. Then, a global localization model based on RTK-GNSS was developed to achieve accurate and efficient initial localization of the robot’s coordinates and heading, and a Kalman filter was applied to integrate GNSS and IMU to improve robustness. Next, an improved A* algorithm was introduced to ensure the global operational path maintained a safe distance from obstacles, while the DWA algorithm handled dynamic obstacle avoidance. Field tests showed that the global localization model achieved an accuracy of 2.215 cm, with a standard deviation of 1 cm, demonstrating stable positioning performance. Moreover, the global path maintained an average safe distance of 50.75 cm from the obstacle map. And the robot exhibited a maximum absolute lateral deviation of 9.82 cm, with an average of 4.16 cm, while maintaining a safe distance of 1 m from dynamic obstacles. Overall, the robot demonstrated smooth and reliable autonomous navigation, successfully completing its tasks.

Error compensation and path planning for sheet metal bending process based on improved modeling algorithms

Error compensation and path planning for sheet metal bending process based on improved modeling algorithms

Flow Field Analysis and Development of a Prediction Model Based on Deep Learning

The velocity of ocean currents significantly affects the trajectory prediction of ocean drifters and the safe navigation of intelligent vessels. Currently, most ocean current predictions focus on time-based forecasts at specific fixed points. In this study, deep learning based on the flow field prediction model (CNNs–MHA–BiLSTMs) is proposed, which predicts the changes in ocean currents by learning from historical flow fields. Unlike conventional models that focus on single-point current velocity data, the CNNs–MHA–BiLSTMs model focuses on the ocean surface current information within a specific area. The CNNs–MHA–BiLSTMs model integrates multiple convolutional neural networks (CNNs) in parallel, multi-head attention (MHA), and bidirectional long short-term memory networks (BiLSTMs). The model demonstrated exceptional modelling capabilities in handling spatiotemporal features. The proposed model was validated by comparing its predictions with those predicted by the MIKE21 flow model of the ocean area within proximity to Dalian Port (which used a commercial numerical model), as well as those predicted by other deep learning algorithms. The results showed that the model offers significant advantages and efficiency in simulating and predicting ocean surface currents. Moreover, the accuracy of regional flow field prediction improved with an increase in the number of sampling points used for training. The proposed CNNs–MHA–BiLSTMs model can provide theoretical support for maritime search and rescue, the control or path planning of Unmanned Surface Vehicles (USVs), as well as protecting offshore structures in the future.