


	Bas his Homepage \| Projects \| PathPlanner		(none) hits in May 2012

PathPlanner

Description

PathPlanner is an efficient generic implemention of the A* search algorithm on a discrete configuration space. The search plans the optimal path backwards from goal to start position. The search space is implemented by a hash table and therefore has no boundries.

An example is included in the package for a fast learning curve, see documentation.

Requirements

Unix-like OS with 'gcc' compiler and 'make' utility.
STL hash_set datastructure (commonly available).
See included README for install instructions.

Download

Download as source package PathPlanner.tar.gz
Download the latest svn revision with 'svn checkout svn://wormer.science.uva.nl/scratch/bterwijn/svn/PathPlanner'.

Documentation

For documentation see the doxygen documentation.

License

GNU GENERAL PUBLIC LICENSE, see the 'COPING' file in the source package for details.