All Classes and Interfaces
Class
Description
describes the desired existence of an activity within the solution plan
the builder can construct goals piecemeal via a series of method calls
the criteria used to identify activity instances in scheduling goals
the template is a partial specification of an activity instance that
can be used to identify candidate activity instances in the plan.
a fluent builder class for constructing consistent template queries
using the builder is intended to read like a predicate logic clause
each different term added to the builder via method calls become part of
a logical conjection, ie matching activities must meet all of the
specified criteria
existing terms can be replaced by calling the same method again, ie
matching activities must only meet the last-specified term
the builder checks for consistency among all specified terms at least by
the final build() call
describes the desired existence of an activity matching a given template/preset
the builder can construct goals piecemeal via a series of method calls
general re-usable description of a modeled system behavior
wraps up information regarding how the execution of a specific kind of
system behavior would be invoked and how it would unfold, including
any parameters that can be used to control the execution
the details in the descriptions may be provided by the system modeler or
may be learned from observing previous executions
describes the desired coexistence of an activity with another
the builder can construct goals piecemeal via a series of method calls
describes how a goal is satisfied by shared activity instances
describes the desired coexistence of an activity with another
the builder can construct goals piecemeal via a series of method calls
Class representing a conjunction of goal as a goal
describes an issue in a plan that can be improved
conflicts arise from various planning goals being dissatisfied with the
current contents of the plan: eg not enough activities, resources out of
bounds, disallowed transitions, etc
each derived conflict type contains the additional context that may be
useful in addressing the problem and improving the plan
REVIEW: should not-fully-satisfied preferences be conflicts?
Solves f(x) = y for x in [xLow, xHigh] with confidence interval [yLow, yHigh] around y such that we stop when
value y is in [y-yLow, y+yHigh].
description of how well a plan satisfies its goals
different schedulers may evaluate the same plan in different ways
the evaluation includes any scoring metrics that the scheduler calculated
as well as useful metadata, eg which goals were satisfied by which activity instances
description of the satisfaction of a single goal in isolation
Filters elements in a sequence of windows
Several flavors :
- keeps first element
- keep last element
- keep an element at a given position (-1 is the last element, -2 is the element before the last etc)
filter in intervals if constraint expression @expr is ever violated during it
A latching filter is a filter applying a different filter on the first element of a sequence and another filter on
the
remaining element of the sequence
Filter keeping windows with a duration inferior or equal to a defined minimum duration
Filter keeping windows with a duration superior or equal to a defined minimum duration
Filter windows that have at least another window preceding ending within a delay
Filter windows that have at least another window preceding ending within a delay
Filter windows that have at least another window preceding ending within a delay
Filter in windows that have another window preceding separated at least by delay
this filter turns any filter into a filter with resets
Interface defining methods that must be implemented by global constraints such as mutex or cardinality
Also provides a directory for creating these constraints
describes some criteria that is desired in the solution plans
the builder can construct goals piecemeal via a series of specifier calls
the builder's piecemal specifier method calls all modify the builder and
return it so that such calls may be chained directly.
describes an issue in a plan whereby a desired activity instance is absent
such conflicts are typically addressed by scheduling additional activities
describes an issue in a plan caused by a specific activity instance missing
such conflicts are typically addressed by scheduling the specific instance
describes plan problem due to lack of a matching instance for a template
such conflicts are typically addressed by scheduling additional activities
using the corresponding creation template
demarks a value that is never null (method return, argument, field, etc)
alas, there is not yet a java-wide standard.
demarks a potentially null value (method return, argument, field, etc)
alas, there is not yet a java-wide standard.
temporal markers relative to time windows
a solution to a planning problem including a schedule of activities
may only be a partial solution to the whole planning problem, ie some
goals may be left unsatisfied
an in-memory solution to a planning problem including a schedule of activities
may only be a partial solution to the whole planning problem, ie some
goals may be left unsatisfied
prototype scheduling algorithm that schedules activities for a plan
this prototype is a single-shot priority-ordered greedy scheduler
(note that there are many other possible scheduling algorithms!)
description of a planning problem to be solved
describes the desired existence of a set of externally generated activities
procedural goals use some outside code to determine what activity instances
should exist in the plan
the builder can construct goals piecemeal via a series of method calls
represents an inclusive interval of partially ordered values
the semantics of a range include both of its endpoints, as well as any
value that compares greater than or equal to the minimum and less than or
equal to the maximum
ranges may have the same minimum and maximum value, in which case it admits
only values that compare equal to those bounds
describes the desired recurrence of an activity every time period
the builder can construct goals piecemeal via a series of method calls
Defines an activity that should be scheduled relative to a span.
Policy for saving simulation checkpoints in a cache.
Contains all known information about an activity, representing BOTH directive-only information
and instance-only information.
interface to a scheduling algorithm that produces schedules for input plans
depending on the kind of solver and its configuration, the algorithm may
produce one or many different solutions to the same planning problem: eg by
iteratively improving on a solution, by providing different high level
options, etc
Describes the desired relation between activities and a set of Spans computed from simulation results.
Small helper class for logging an exception's stack trace.
Class allowing to define state query expression for instantiation of parameters
Representation of a simple temporal network (Dechter, Meiri, and Pearl, 1991).
A task network is a set of tasks and temporal constraints between these tasks.
Adapter for TaskNetwork for use with Interval and Duration
temporal markers relative to time windows
class allowing to define dynamic expressions of timepoints, relative to time anchors
A time range expression combines timewindows from states, activity expressions, state expressions, and other time
range expressions and allows to apply a sequence of filters and transforms to be used in goals
represents an particular single instant on a given timeline
a filter selects a subset of windows
this filter turns any filter into a filter with resets
In the case of the temporal context changing (i.e.