Abstract:
We present a replanning algorithm for repairing Rapidly-exploring Random Trees when changes are made to the configuration space. Instead of abandoning the current RRT, our algorithm efficiently removes just the newly-invalid parts and maintains the rest. It then grows the resulting tree until a new solution is found. We use this algorithm to create a probabilistic analog to the widely-used D* family of deterministic algorithms, and demonstrate its effectiveness in a multirobot planning domain.
copied = false, 2000);
">
@conference{Ferguson-2006-9443,
author = {David Ferguson And Nidhi Kalra And Anthony (Tony) Stentz},
title = {Replanning with RRTs},
booktitle = {Proceedings of (ICRA) International Conference on Robotics and Automation},
year = {2006},
month = {May},
pages = {1243 - 1248},
}
author = {David Ferguson And Nidhi Kalra And Anthony (Tony) Stentz},
title = {Replanning with RRTs},
booktitle = {Proceedings of (ICRA) International Conference on Robotics and Automation},
year = {2006},
month = {May},
pages = {1243 - 1248},
}