Automated planning and scheduling: Difference between revisions

Revision as of 22:21, 19 October 2020

Revision as of 02:09, 29 October 2020

Line 10:

The difficulty of planning is dependent on the simplifying assumptions employed. Several classes of planning problems can be identified depending on the properties the problems have in several dimensions.

* Are the actions [[deterministic]] or nondeterministicnon-deterministic? For nondeterministic actions, are the associated probabilities available?

* Are the [[state variable]]s discrete or continuous? If they are discrete, do they have only a finite number of possible values?

* Can the current state be observed unambiguously? There can be full observability and partial observability.