Sussman anomaly
The Sussman anomaly is a problem in artificial intelligence, first described by Gerald Sussman, that illustrates a weakness of noninterleaved planning algorithms, which were prominent in the early 1970s. In the problem, three blocks (labeled A, B, and C) rest on a table. The agent must stack the blocks such that A is atop B, which in turn is atop C. However, it may only move one block at a time. The problem starts with B on the table, C atop A, and A on the table: However, noninterleaved planners typically separate the goal (stack A atop B atop C) into subgoals, such as:
Wikipage redirect
primaryTopic
Sussman anomaly
The Sussman anomaly is a problem in artificial intelligence, first described by Gerald Sussman, that illustrates a weakness of noninterleaved planning algorithms, which were prominent in the early 1970s. In the problem, three blocks (labeled A, B, and C) rest on a table. The agent must stack the blocks such that A is atop B, which in turn is atop C. However, it may only move one block at a time. The problem starts with B on the table, C atop A, and A on the table: However, noninterleaved planners typically separate the goal (stack A atop B atop C) into subgoals, such as:
has abstract
The Sussman anomaly is a probl ...... g why planning is non-trivial.
@en
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
887,232,214
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
The Sussman anomaly is a probl ...... top C) into subgoals, such as:
@en
label
Sussman anomaly
@en