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.
Preview
Unable to display preview. Download preview PDF.
References
José Ambite and Craig Knoblock. Planning by rewriting: Efficiently generating high-quality plans. In Proceedings of AAAI-97, pages 706–713, 1997.
Blai Bonet, Gábor Loerincs, and Héctor Geffner. A robust and fast action selection mechanism for planning. In Proceedings of AAAI-97, pages 714–719, 1997.
Toby Donaldson and Robin Cohen. Turn-taking in discourse and its application to intelligent agents. In AAAI-96 Workshop on Agent Modeling, pages 17–23, 1996. AAAI Technical Report WS-96-02.
Toby Donaldson and Robin Cohen. Constraint-based discourse agents. In AAAI-97 Workshop on Constraints and Agents, pages WS-97-05, 1997.
Pattie Maes. Situated agents can have goals. Journal for Robotics and Autonomous Systems, 6(1):49–70, 1990.
Edward Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
Peter van Beek, Robin Cohen, and Ken Schmidt. From plan critiquing to clarification dialogue for cooperative response generation. Computational Intelligence, 9(2):132–154, 1993.
Richard Wallace and Eugene Render. Anytime algorithms for constraint satisfaction and sat problems. In IJCAI-95 Workshop on Anytime Algorithms and Deliberation Scheduling, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Donaldson, T., Cohen, R. (1998). Selecting the next action with constraints. In: Mercer, R.E., Neufeld, E. (eds) Advances in Artificial Intelligence. Canadian AI 1998. Lecture Notes in Computer Science, vol 1418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64575-6_52
Download citation
DOI: https://doi.org/10.1007/3-540-64575-6_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64575-7
Online ISBN: 978-3-540-69349-9
eBook Packages: Springer Book Archive