A Novel Method of Path Planning for an Intelligent Agent Based on an Improved RRT* Called KDB-RRT*
Wenqing Wei, Kun Wei, Jianhui Zhang, Yabin Gao · 2025
Read A Novel Method of Path Planning for an Intelligent Agent Based on an Improved RRT* Called KDB-RRT* by Wenqing Wei, Kun Wei, Jianhui Zhang, Yabin Gao (2025) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/pmc-12736911.txt.
Description
Wenqing Wei and co-authors improved in 2025 a classic random-tree path planner for smart agents. The base method grows a tree of random steps toward the goal, but it converges slowly and leaves jagged, redundant paths. Their version searches from both ends and adds three layers of polish.
Fast tree indexing speeds node lookup, guided sampling leans toward the goal, and a pruning plus smoothing stage yields curves an agent can actually follow. Layered collision checks guard the route. The result is quicker, cleaner paths through cluttered spaces, with fewer wasted turns along the way.
Catalog record
| CREATOR | Wenqing Wei, Kun Wei, Jianhui Zhang, Yabin Gao |
|---|---|
| YEAR | 2025 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 77 KB |
| VERSION | 1.0 |
| LICENSE | CC BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |