Sciweavers

1897 search results - page 13 / 380
» Conditional Linear Planning
Sort
View
IJCAI
1989
13 years 10 months ago
Towards a Theory of Conflict Detection and Resolution in Nonlinear Plans
This paper deals with a well known problem in AI planning: detecting and resolving conflicts in nonlinear plans. We sketch a theory of restricted conflict detection and resolution...
Joachim Hertzberg, Alexander Horz
TABLEAUX
2005
Springer
14 years 2 months ago
Pdk: The System and Its Language
This paper presents the planning system Pdk (Planning with Domain Knowledge), based on the translation of planning problems into Linear Time Logic theories, in such a way that fin...
Marta Cialdea Mayer, Carla Limongelli, Andrea Orla...
AIPS
2010
13 years 11 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
AIPS
2008
13 years 11 months ago
Fast Planning for Dynamic Preferences
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
Brian Ziebart, Anind K. Dey, J. Andrew Bagnell
AUSAI
2006
Springer
14 years 14 days ago
A Flexible Framework for SharedPlans
Abstract. SharedPlans is an agent teamwork model that provides a formalization of the conditions under which a group of agents has a collaborative plan. This paper describes a gene...
Minh Hoai Nguyen, Wayne Wobcke