Campus Event Calendar
Event Entry
What and Who
Blocks World Tamed: Ten thousand blocks in under a second
John Slaney
Australian National University
Logik-Seminar
AG 1, AG 2, AG 3, INET, AG 4, AG 5, D6, RG1, SWS
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Tuesday, 18 March 97
16:15
60 Minutes
46.1 - MPII
019
Saarbrücken
Abstract
Blocks World (BW) has been a standard example of a planning domain
for almost thirty years, and it is still commonly used to illustrate
the capabilities both of formalisms and of planners. We believe that
AI planning still has much to learn by studying these artificial
domains, even though such research is currently unfashionable.
for almost thirty years, and it is still commonly used to illustrate
the capabilities both of formalisms and of planners. We believe that
AI planning still has much to learn by studying these artificial
domains, even though such research is currently unfashionable.
BW planning, in the sense of finding some plan or other, is trivial,
and it was shown in 1991 that finding optimal (shortest) plans is NP
hard. Various polynomial time algorithms for approximating optimal
BW planning exist, and there have been attempts to implement these
domain-specific methods in more general planning frameworks. Here we
discuss both theoretical and experimental results concerning optimal
and near-optimal BW planning.
Contact
Uwe Waldmann
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
joint work with Sylvie Thiebaux, INRIA-Rennes, France