Scribd
Upload
69 views1 page

Automated Planning and Scheduling

Automated planning and scheduling is a branch of AI that determines action sequences for intelligent agents to execute. It involves discovering solutions in complex, unknown, multidimensional spaces. Typical planners take a description of the initial state, desired goal, and possible actions to produce a sequence leading from the initial to goal state. The difficulty depends on simplifying assumptions like deterministic time; popular techniques include state space search, plan space search, and translation to propositional satisfiability problems. If determinism is dropped for probabilistic uncertainty, the problem becomes policy generation for Markov decision processes or partially observable Markov decision processes.

Uploaded by

jakal_target
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
69 views1 page

Automated Planning and Scheduling

Automated planning and scheduling is a branch of AI that determines action sequences for intelligent agents to execute. It involves discovering solutions in complex, unknown, multidimensional spaces. Typical planners take a description of the initial state, desired goal, and possible actions to produce a sequence leading from the initial to goal state. The difficulty depends on simplifying assumptions like deterministic time; popular techniques include state space search, plan space search, and translation to propositional satisfiability problems. If determinism is dropped for probabilistic uncertainty, the problem becomes policy generation for Markov decision processes or partially observable Markov decision processes.

Uploaded by

jakal_target
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Automated planning and scheduling

Automated planning and scheduling is a branch of artificial intelligence that concerns the
realization of strategies or action sequences, typically for execution by intelligent agents,
autonomous robots and unmanned vehicles. Unlike classical control and classification problems,
the solutions are complex, unknown and have to be discovered and optimized in
multidimensional space.

In known environments with available models planning can be done offline. Solutions can be
found and evaluated prior to execution. In dynamically unknown environments the strategy often
needs to be revised online. Models and policies need to be adapted. Solutions usually resort to
iterative trial and error processes commonly seen in artificial intelligence. These include
dynamic programming, reinforcement learning and combinatorial optimization.

A typical planner takes three inputs: a description of the initial state of the world, a
description of the desired goal, and a set of possible actions, all encoded in a formal language
such as STRIPS or PDDL. The planner produces a sequence of actions that lead from the initial
state to a state meeting the goal. An alternative language for describing planning problems is that
of hierarchical task networks, in which a set of tasks is given, and each task can be either realized
by a primitive action or decomposed in a set of other tasks.

The difficulty of planning is dependent on the simplifying assumptions employed, e.g. atomic
time, deterministic time, complete observability, etc. Classical planners make all these
assumptions and have been studied most fully. Some popular techniques include: forward
chaining and backward chaining state space search, possibly enhanced by the use of relationships
among conditions (see graphplan) or heuristics synthesized from the problem, search through
plan space, and translation to propositional satisfiability (satplan).

If the assumption of determinism is dropped and a probabilistic model of uncertainty is adopted,


then this leads to the problem of policy generation for a Markov decision process (MDP) or (in
the general case) partially observable Markov decision process (POMDP

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy