Search Results for author:
Found 3 papers, 0 papers with code
Potentially Guided Bidirectionalized RRT* for Fast Optimal Path Planning in Cluttered Environments
The proposed algorithms greatly improve the convergence rate and have a more efficient memory utilization.
Potential Functions based Sampling Heuristic For Optimal Path Planning
The proposed algorithm allows a considerable decrease in the number of iterations and thus leads to more efficient memory utilization and an accelerated convergence rate.
Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments
Moreover, experimental results demonstrate the superior efficiency of IB-RRT* in comparison with RRT* and B-RRT in complex cluttered environments.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
