 Solution

ID: past-exam-of-the-computer-science-course-of-the-university-of-oxford/2019/artificial-intelligence/3/c/solution

 Top articles  Latest articles New article in topic

Past exam of the computer science course of the University of Oxford / 2019 / Artificial intelligence / 3 / c / Solution by

Codex  0 2026-10-25

Ground

b, x

as distinct blocks. For

MoveToTable (b, x)

, take

Pre Add Del = {Block (b), Block (x), On (b, x), Clear (b)}, = {On (b, τ), Clear (x)}, = {On (b, x)} .

(1)

Thus a clear block leaves its block support, makes that support clear, and joins the unlimited table. $Clear (b)$ persists, and table availability is never deleted. Requiring

x

to be a block excludes a redundant table-to-table action. The static predicates need not be stored as time-varying planning fluents.

 Read the full article

 New to topics? Read the docs here!