Common Lisp implementation of RRT (Rapidily exploring Random Tree), a fast probabilistic multidimentional path-plannning algorithm.
1CL-RRT - Common Lisp implementation of RRT (Rapidily exploring Random Tree)
RRT is a fast probabilistic multidimentional path-plannning algorithm introduced by S.M.LaValle (1). It now has a widespread use in robotics and now able to handle the real time systems such as automatic car driving AI. Also, it has various extentions and optimization methods (but not yet implemented here) such as:
- MP-RRT -- optimizing version of RRT
- RR-belief-tree -- RRT under uncertainity
- RRG -- use a graph structure instead of a tree
- RRT* -- optimizing version of RRT
- St-RRT -- temporal algorithm
The above image is a test result of a motion planner from the
start(red) to the end (blue). The path is avoiding the collision to
the randomly generated obstacles.
Note that the path is not optimized -- RRT gains speed sacrificing the
cost of the path.
The source is in
(1) S.M. LaValle and J.J. Kuffner. Randomized kinodynamic planning. The International Journal of Robotics Research, Vol. 20, No. 5, pp. 378–400, 2001.
finish-pis now keyword arguments. (2013March 1st)
- Supported R-tree based nearest neighbor search (2013 Dec 8th).
- It's computational order is smaller than the other trivialimplementations, but in practice it may be slow sometimes(especially for the small problems)
- improvements in the nearest search.
- with R-tree or kd-tree
This library is at least tested on implementations listed below:
- SBCL 1.1.2 on X86-64 Linux 3.2.0-39-generic (author's environment)
- Clozure Common Lisp Version 1.9-r15757 on X86-64 Linux 3.2.0-39-generic (author's environment)
Also, it depends on the following libraries:
- Jonathan Amsterdam's iterator/gatherer/accumulator facility
- Alexandria is a collection of portable public domain utilities.
- CL-ANNOT by Tomohiro Matsuyama
- Python-like Annotation Syntax for Common Lisp
- Quicklisp loadable. First open slime REPL.
(ql:quickload :cl-rrt)and the library will be installed along with allthe dependencies.
- Masataro Asai (email@example.com)
- Univ. Tokyo -> Grad. school of Tokyo University
2Concepts and API
The key concept in RRT is C-space and State-space.
C-space (configuration space) is a multidimentional space which represents the state of a robot. For example, a human arm has 6 degrees of freedom and its C-space also has at least 6 dimension. However, in this example the dimension of C-space can be up to 18 because it is allowed to have the differencial factor for each coordinate -- its velocity and the accelaration.
State-space is also a multidimentional space. It contains all the values in C-space and also the controls of the robot. A control is an output of the robot and it is different from the speed and the accelaration. For example, if you implement a car AI, the actual acceleration would not nessesarily match the output of the engine because there is a drift between the tire and the ground.
In each step of a search, RRT randomly choose a point in a State-space and create a node. It search for the nearest node in the existing tree to the new node (NNS:Nearest Neighbor Search), using the user-specified distance function, and the found node is connected with the new node. The search finishes when a certain criteria is met.
Each new point subdivides the Voronoi Cell in the State-space. Since the larger Volonoi Cell more likely contains the new node, the direction of the search is heavily biased to the less-searched space.
3Example and Tutorial
Not written yet. See
t/ for example, there is a testing code.
To run a test,
See ./references.org .
Copyright (c) 2013 Masataro Asai (firstname.lastname@example.org)
Licensed under the LLGPL License.