Search Results for author:
Found 4 papers, 0 papers with code
MRRT: Multiple Rapidly-Exploring Random Trees for Fast Online Replanning in Dynamic Environments
Specifically, the edge pruning procedure checks the collision status through the tree and only removes the invalid edges while maintaining the tree structure of already-explored regions.
CT-CPP: Coverage Path Planning for 3D Terrain Reconstruction Using Dynamic Coverage Trees
This letter addresses the 3D coverage path planning (CPP) problem for terrain reconstruction of unknown obstacle rich environments.
$ε^*$+: An Online Coverage Path Planning Algorithm for Energy-constrained Autonomous Vehicles
This paper presents a novel algorithm, called $\epsilon^*$+, for online coverage path planning of unknown environments using energy-constrained autonomous vehicles.
T$^{\star}$-Lite: A Fast Time-Risk Optimal Motion Planning Algorithm for Multi-Speed Autonomous Vehicles
In this paper, we develop a new algorithm, called T$^{\star}$-Lite, that enables fast time-risk optimal motion planning for variable-speed autonomous vehicles.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
