MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  The traditional AI planning problem can be phrased in the following non-traditional way:

Download:
pdf | ps
by Toby Donaldson, Robin Cohen, Nl G
http://logos.uwaterloo.ca/~tjdonald/cai98.ps
Add To MetaCart

Abstract:

Abstract Traditional AI planning systems have focussed on batch planning, where an entire plan for achieving a goal is generated. An alternative approach is to select only the next action, a technique that has been used in situated planners, and, more recently, has been effectively applied to traditional AI planning domains. In this paper, we present an action selection framework sensitive to resource limits and based on constraint optimization. While the framework we present is very general, we are concerned with dynamic, time-pressured domains requiring reasoning under uncertainty. In such domains, batch planning is usually inappropriate or impossible to apply. We experimentally compare a number of local search algorithms, and give a detailed example of how action selection can be used to control the dialog of a course advising system, which allows for more flexible behaviour than in typical advice-giving systems.

Citations

629 Foundations of Constraint Satisfaction – Tsang - 1993
248 An Effective Heuristic Algorithm for the Traveling Salesman Problem – Lin, Kernighan - 1973
234 An Introduction to Least Commitment Planning – Weld - 1994
209 Situated Agents Can Have Goals – Maes - 1990
135 The Traveling Salesman: Computational Solutions for TSP Applications – Reinelt - 1994
122 A robust and fast action selection mechanism for planning – Bonet, Loerincs, et al. - 1997
114 Complexity Results for Planning – Bylander - 1991
50 Planning by Rewriting: Efficiently Generating High-Quality Plans – Ambite, Knoblock - 1997
30 From plan critiquing to clarification dialogue for cooperative response generation – Beek, Cohen, et al. - 1993
11 Anytime algorithms for constraint satisfaction and SAT problems – Wallace, Freuder - 1995
4 Turn-taking in discourse and its application to intelligent agents – Donaldson, Cohen - 1996
2 Constraint-based discourse agents – Donaldson, Cohen - 1997