TITLE: Planning with Loops

PRESENTER: Prof. Hector J. Levesque, http://www.cs.toronto.edu/~hector/, hector@cs.toronto.edu

AFFILIATION:University of Toronto, Canada, http://www.cs.toronto.edu/

DATE: Tuesday 22th February 2005

TIME: 12:00:00

PLACE: To be announced

ABSTRACT:

Unlike the case for sequential and conditional planning, much of the work on iterative planning (planning where loops may be needed) leans heavily on
theorem-proving. In this paper we do the following: propose a different
approach where generating plans is decoupled from verifying them; describe the implementation of an iterative planner based on the situation calculus;
present a few examples illustrating the sorts of plans that can be generated; show some of the strengths and weaknesses of the approach; and finally sketch the beginnings of a theory, where validation of plans is done offline.

BIOGRAPHY OF SPEAKER:

Host:

Maurice Pagnucco

Seminar Convenor:

JP Bekmann