research
∙
05/10/2023
SMART: Self-Morphing Anytime Replanning Tree
The paper presents an algorithm, called Self- Morphing Anytime Replannin...
share
research
∙
09/10/2021
SMARRT: Self-Repairing Motion-Reactive Anytime RRT for Dynamic Environments
This paper addresses the fast replanning problem in dynamic environments...
research
∙
08/03/2021
CPPNet: A Coverage Path Planning Network
This paper presents a deep-learning based CPP algorithm, called Coverage...
research
∙
08/03/2021
A Non-uniform Sampling Approach for Fast and Efficient Path Planning
In this paper, we develop a non-uniform sampling approach for fast and e...
research
∙
04/22/2021
MRRT: Multiple Rapidly-Exploring Random Trees for Fast Online Replanning in Dynamic Environments
This paper presents a novel algorithm, called MRRT, which uses multiple ...
research
∙
10/19/2020
CT-CPP: 3D Coverage Path Planning for Unknown Terrain Reconstruction using Coverage Trees
This letter addresses the 3D coverage path planning (CPP) problem for te...
research
∙
08/29/2020
T^⋆-Lite: A Fast Time-Risk Optimal Motion Planning Algorithm for Multi-Speed Autonomous Vehicles
In this paper, we develop a new algorithm, called T^⋆-Lite, that enables...
research
∙
08/29/2020