← Back to article

Equation 2 · From Scripted Bots to Autonomous Agents: A History of AI Agent Architecture

What does this equation mean?

aa

Read the formula alongside the article passage below. Each part has a deeper page with its role in the equation, the supporting passage and nearby citations.

This mathematical expression combines the displayed quantities; its precise role follows from the surrounding article text. Read the equation part by part below; each part has a contextual explanation and a link to its mathematical background.

Read it piece by piece

aa

Symbol a

a is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.

Understand this part →

How to interpret it

Read this expression with the definitions, units, and assumptions supplied by the article.

What the article says around this equation

The planner underneath Shakey was STRIPS — the Stanford Research Institute Problem Solver — described by Fikes and Nilsson in a 1971 paper in the journal Artificial Intelligence . STRIPS represented the world as a set of predicate-logic statements, represented each available action as an operator with a precondition list, a delete list, and an add list, and used a resolution theorem prover guided by means-ends analysis to search for a sequence of operators connecting the current state to a goal state [ 2 ] . Formally, for a state s represented as a set of ground predicates and an operator a with precondition set pre(a)\mathrm{pre}(a) , delete set del(a)\mathrm{del}(a) , and add set add(a)\mathrm{add}(a) , the…
Read the full surrounding passage
The planner underneath Shakey was STRIPS — the Stanford Research Institute Problem Solver — described by Fikes and Nilsson in a 1971 paper in the journal Artificial Intelligence . STRIPS represented the world as a set of predicate-logic statements, represented each available action as an operator with a precondition list, a delete list, and an add list, and used a resolution theorem prover guided by means-ends analysis to search for a sequence of operators connecting the current state to a goal state [ 2 ] . Formally, for a state s represented as a set of ground predicates and an operator a with precondition set pre(a)\mathrm{pre}(a) , delete set del(a)\mathrm{del}(a) , and add set add(a)\mathrm{add}(a) , the operator is applicable when its preconditions hold, and produces a new state by

Read the equation in its article →

Sources cited in the surrounding passage

These citations give research context. Read each source to check which claims it supports.

Return to From Scripted Bots to Autonomous Agents: A History of AI Agent Architecture

Browse the mathematical compendium →