RSRT: RAPIDLY EXPLORING SORTED RANDOM TREE - Online Adapting RRT to Reduce Computational Solving Time while Motion Planning in Wide Configuration Spaces

Nicolas Jouandeau

2007

Abstract

We present a new algorithm, named RSRT, for Rapidly-exploring Random Trees (RRT) based on inherent relations analysis between RRT components. RRT algorithms are designed to consider interactions between these inherent components. We explain properties of known variations and we present some future once which are required to deal with dynamic strategies. We present experimental results for a wide set of path planning problems involving a free flying object in a static environment. The results show that our RSRT algorithm (where RSRT stands for Rapidly-exploring Sorted Random Trees) is faster than existing ones. This results can also stand as a starting point of a motion planning benchmark instances which would make easier further comparative studies of path planning algorithms.

Paper Citation

in Harvard Style

Jouandeau N. (2007). RSRT: RAPIDLY EXPLORING SORTED RANDOM TREE - Online Adapting RRT to Reduce Computational Solving Time while Motion Planning in Wide Configuration Spaces . In Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-972-8865-82-5, pages 100-107. DOI: 10.5220/0001622001000107

in Bibtex Style

@conference{icinco07,
author={Nicolas Jouandeau},
title={RSRT: RAPIDLY EXPLORING SORTED RANDOM TREE - Online Adapting RRT to Reduce Computational Solving Time while Motion Planning in Wide Configuration Spaces},
booktitle={Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2007},
pages={100-107},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001622001000107},
isbn={978-972-8865-82-5},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - RSRT: RAPIDLY EXPLORING SORTED RANDOM TREE - Online Adapting RRT to Reduce Computational Solving Time while Motion Planning in Wide Configuration Spaces
SN - 978-972-8865-82-5
AU - Jouandeau N.
PY - 2007
SP - 100
EP - 107
DO - 10.5220/0001622001000107