Automated planning and scheduling: Difference between revisions

Revision as of 04:50, 13 August 2023

Revision as of 17:33, 28 September 2023

Line 11:

{{More citations needed|section

| name = More citations needed section

| find = {{#if:{{{find|}}}|{{{find|}}}|none}}

|date=February 2021| talk = {{{talk|}}}

| small = {{{small|}}}

}}

Line 55 ⟶ 54:

{{More citations needed|section

| name = More citations needed section

| find = {{#if:{{{find|}}}|{{{find|}}}|none}}

|date=February 2021| talk = {{{talk|}}}

| small = {{{small|}}}

}}

Line 66 ⟶ 64:

{{More citations needed|section

| name = More citations needed section

| find = {{#if:{{{find|}}}|{{{find|}}}|none}}

|date=February 2021| talk = {{{talk|}}}

| small = {{{small|}}}

}}

The most commonly used languages for representing planning domains and specific planning problems, such as [[Stanford Research Institute Problem Solver|STRIPS]] and [[Planning Domain Definition Language|PDDL]] for Classical Planning, are based on state variables. Each possible state of the world is an assignment of values to the state variables, and actions determine how the values of the state variables change when that action is taken. Since a set of state variables induce a state space that has a size that is exponential in the set, planning, similarly to many other computational problems, suffers from the [[curse of dimensionality]] and the [[combinatorial explosion]].