Package edu.uky.ai.planning

package edu.uky.ai.planning
Contains objects for representing planning problems, planning algorithms, and plans.
  • Class
    Description
    BackwardPlan
    A totally ordered plan which is built from end (last step) to beginning.
    Domain
    A planning domain is a reusable set of action templates called Operators that describes all the ways the state of the world can change.
    ForwardPlan
    A totally ordered plan which is built from beginning (first step) to end last step).
    Heuristic<E>
    A heuristic is a function which estimates how much work remains to be done to convert a partial solution to a problem into a complete solution.
    Main
    The entry point for the planning application.
    Operator
    An operator is an action template that describes one way to change the world in terms of its precondition (what must be true before the action can be taken) and effect (what becomes true after the action is taken).
    Plan
    A plan is a sequence of step for achieving a goal.
    Planner<S extends Search>
    A planner is an algorithm which solves a planning problem by finding a plan.
    Problem
    A planning problem exists in some Domain and defines the initial state of the world and a goal to be achieved.
    Result
    A result contains information about how and why a search succeeded or failed.
    Search
    A search is the process of exploring some space while looking for solutions to a problem.
    Settings
    Project settings
    Step
    A step is a single ground action in a plan which changes the world's state.
    Utilities
    A assortment of useful methods.