FRIT: A Fast Real-Time Search Algorithm
FRIT is a fast real-time search algorithm which, unlike real-time
heuristic search algorithms, does not rely on heuristic learning. It
works very well in gridworld path-finding.
FRIT(BFS) from socs2013paper58 on Vimeo.
There are more videos
here.
Planning with Temporally Extended Preferences using Heuristic Search
Our planner, HPlan-P, is an extension of the
TLPLAN system that allows
planning for temporally extended preferences. It participated in the
2006 International Planning Competition, and won a
distinguished performance award. We expect to realease the source code for HPlan-P during 2007.
Planning with Temporally Extended Goals
Papers & code can be found in
this page.