Path planning is a core technology for mobile robots. However, existing state-of-the-art methods suffer from issues such as excessive path redundancy, too many turning points, and poor environmental adaptability. To address these challenges, this paper proposes a novel global and local fusion path-planning algorithm. For global path planning, we reduce path redundancy and excessive turning points by designing a new heuristic function and constructing an improved path generation method. For local path planning, we propose an environment-aware dynamic parameter adjustment strategy, incorporating deviation and avoidance dynamic obstacle evaluation factors, thus addressing issues of local optima and timely avoidance of dynamic obstacles. Finally, we fuse those global and local path-planning improvements to form our fusion path-planning algorithm, which can enhance the robot's adaptability to complex scenarios while reducing path redundancy and turning points. Simulation experiments demonstrate that the improved fusion path-planning algorithm not only effectively addresses existing issues but also operates with higher efficiency.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.3390/s24247950 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
An Improved Global and Local Fusion Path-Planning Algorithm for Mobile Robots.
Sensors (Basel)
December 2024
School of Electrical and Information Engineering, Jingjiang College, Jiangsu University, Zhenjiang 212013, China.
Path planning is a core technology for mobile robots. However, existing state-of-the-art methods suffer from issues such as excessive path redundancy, too many turning points, and poor environmental adaptability. To address these challenges, this paper proposes a novel global and local fusion path-planning algorithm.
View Article and Find Full Text PDFEscape Path Planning for Unmanned Surface Vehicle Based on Blind Navigation Rapidly Exploring Random Tree* Fusion Algorithm.
Sensors (Basel)
November 2024
School of Automation, Beijing Information Science and Technology University, Beijing 100192, China.
To address the design and application requirements for USVs (Unmanned Surface Vehicles) to autonomously escape from constrained environments using a minimal number of sensors, we propose a path planning algorithm based on the RRT* (Rapidly Exploring Random Tree*) method, referred to as BN-RRT* (Blind Navigation Rapidly Exploring Random Tree*). This algorithm utilizes the positioning information provided by the GPS onboard the USV and combines collision detection data from collision sensors to navigate out of the trapped space. To mitigate the inherent randomness of the RRT* algorithm, we integrate the Artificial Potential Field (APF) method to enhance directional guidance during the sampling process.
View Article and Find Full Text PDF[A multi-constraint optimal puncture path planning algorithm for percutaneous interventional radiofrequency thermal fusion of the L5/S1 segments].
Nan Fang Yi Ke Da Xue Xue Bao
September 2024
School of Biomedical Engineering, Southern Medical University, Guangzhou 510515, China.
Objective: To minimize variations in treatment outcomes of L5/S1 percutaneous intervertebral radiofrequency thermocoagulation (PIRFT) arising from physician proficiency and achieve precise quantitative risk assessment of the puncture paths.
Methods: We used a self-developed deep neural network DWT-UNet for automatic segmentation of the magnetic resonance (MR) images of the L5/S1 segments into 7 key structures: L5, S1, Ilium, Disc, N5, Dura mater, and Skin, based on which a needle insertion path planning environment was modeled. Six hard constraints and 6 soft constraints were proposed based on clinical criteria for needle insertion, and the physician's experience was quantified into weights using the analytic hierarchy process and incorporated into the risk function for needle insertion paths to enhance individual case adaptability.
Hybrid Multi-Objective Chameleon Optimization Algorithm Based on Multi-Strategy Fusion and Its Applications.
Biomimetics (Basel)
September 2024
School of Intelligent Manufacturing and Electronic Engineering, Wenzhou University of Technology, Wenzhou 325035, China.
Aiming at the problems of chameleon swarm algorithm (CSA), such as slow convergence speed, poor robustness, and ease of falling into the local optimum, a multi-strategy improved chameleon optimization algorithm (ICSA) is herein proposed. Firstly, logistic mapping was introduced to initialize the chameleon population to improve the diversity of the initial population. Secondly, in the prey-search stage, the sub-population spiral search strategy was introduced to improve the global search ability and optimization accuracy of the algorithm.
View Article and Find Full Text PDFMulti-strategy fusion improved Northern Goshawk optimizer is used for engineering problems and UAV path planning.
Sci Rep
October 2024
School of Information and Artificial Intelligence, Anhui Business College, Anhui, 241002, China.
Addressing the imbalance between exploration and exploitation, slow convergence, local optima Traps, and low convergence precision in the Northern Goshawk Optimizer (NGO): Introducing a Multi-Strategy Integrated Northern Goshawk Optimizer (MINGO). In response to challenges faced by the Northern Goshawk Optimizer (NGO), including issues like the imbalance between exploration and exploitation, slow convergence, susceptibility to local optima, and low convergence precision, this paper introduces an enhanced variant known as the Multi-Strategy Integrated Northern Goshawk Optimizer (MINGO). The algorithm tackles the balance between exploration and exploitation by improving exploration strategies and development approaches.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!