All Packages

Package Summary

Package	Description
edu.uky.cs.nil.sabre	Fundamental elements for defining planning problems and plans.
edu.uky.cs.nil.sabre.comp	Tools for compiling planning problems into a representation that enables more efficient knowledge representation and planning.
edu.uky.cs.nil.sabre.etree	Data structures for efficiently determining which events have preconditions which are satisfied in a given state.
edu.uky.cs.nil.sabre.graph	Data structures for representing the state-space of a planning problem as a finite graph of state nodes linked by temporal and epistemic edges.
edu.uky.cs.nil.sabre.hg	Data structures similar to plan graphs that can be used to explore the structure of and estimate important properties of a problem.
edu.uky.cs.nil.sabre.io	Tools for reading and writing planning problems, plans, and their components.
edu.uky.cs.nil.sabre.logic	Logical expressions and logical operations.
edu.uky.cs.nil.sabre.prog	A planner that performs forward (progression) search} through the space of states.
edu.uky.cs.nil.sabre.ptree	Models a forward search through the space of states as a tree, meaning no overhead is spent detecting or reusing duplicate states.
edu.uky.cs.nil.sabre.search	The parent objects for planners, searches, and the results of searches.
edu.uky.cs.nil.sabre.util	Special-purpose data structures.