Planning algorithms

Introduction

Automated planning (Automated planning) is a discipline of artificial intelligence that aims to produce plans (that is, a schedule), typically for the execution of a robot or other agent. Planning programs that incorporate these algorithms are called planners.

A planner typically considers 3 inputs:

• - a description of the initial state of the world.

• - a description of the objective to be achieved.

• - a set of possible actions.

Generally, each action specifies preconditions that must be met as a requirement for that action, as well as postconditions, which constitute the effect on the current state of the world.

Examples of planning problems could be determining the trajectory of a robot in a space with obstacles, or the towers of Hanoi problem.

• - Planning by Hierarchical Task Network (HTN).

• - Graphplan: automatic planning algorithm.

Planning algorithms

Introduction

A planner typically considers 3 inputs:

• - a description of the initial state of the world.

• - a description of the objective to be achieved.

• - a set of possible actions.

Generally, each action specifies preconditions that must be met as a requirement for that action, as well as postconditions, which constitute the effect on the current state of the world.

Examples of planning problems could be determining the trajectory of a robot in a space with obstacles, or the towers of Hanoi problem.

• - Planning by Hierarchical Task Network (HTN).

• - Graphplan: automatic planning algorithm.

Navegación

Planning algorithms

Introduction

Planning algorithms

Introduction