Severity: Warning
Message: file_get_contents(https://...@gmail.com&api_key=61f08fa0b96a73de8c900d749fcb997acc09&a=1): Failed to open stream: HTTP request failed! HTTP/1.1 429 Too Many Requests
Filename: helpers/my_audit_helper.php
Line Number: 197
Backtrace:
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 197
Function: file_get_contents
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 271
Function: simplexml_load_file_from_url
File: /var/www/html/application/helpers/my_audit_helper.php
Line: 3165
Function: getPubMedXML
File: /var/www/html/application/controllers/Detail.php
Line: 597
Function: pubMedSearch_Global
File: /var/www/html/application/controllers/Detail.php
Line: 511
Function: pubMedGetRelatedKeyword
File: /var/www/html/index.php
Line: 317
Function: require_once
98%
921
2 minutes
20
To address the limitations of the original algorithm, several optimization techniques are proposed. This article presents an original RRT*-Connect algorithm for the planning of obstacle avoidance paths on robotic arms. These strategies include implementing a target biasing algorithm, using elliptic space sampling to enhance the sampling process, the revision of the cost function to better guide path planning, and implementing an artificial potential field and gradient descent strategy to design adaptive step sizes. Furthermore, the use of segmented Bézier curves facilitates the generation of a more fluid trajectory when constructing the final path. The effectiveness of these augmentation strategies is corroborated by both simulations and experimental verification on a robotic arm. The simulations showed a 19.39% reduction in average run time and a 5% reduction in average path length compared to the existing RRT*-Connect algorithm. Therefore, The enhanced algorithm meets the requirement for optimal obstacle avoidance path planning by consistently finding the shortest path while avoiding obstacles.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC11754615 | PMC |
http://dx.doi.org/10.1038/s41598-025-87113-5 | DOI Listing |