Sciweavers

49 search results - page 6 / 10
» Forward-Chaining Partial-Order Planning
Sort
View
LOGCOM
2011
12 years 10 months ago
Introducing Preferences in Planning as Satisfiability
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
Enrico Giunchiglia, Marco Maratea
AI
2011
Springer
13 years 2 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
ATAL
2007
Springer
13 years 11 months ago
Planning and defeasible reasoning
We present an argumentation-based formalism that an agent could use for constructing plans. We will analyze the interaction of arguments and actions when they are combined to cons...
Diego R. García, Alejandro Javier Garc&iacu...
AAAI
2004
13 years 8 months ago
Interleaving Temporal Planning and Execution in Robotics Domains
Many autonomous systems such as mobile robots, UAVs or spacecraft, have limited resource capacities and move in dynamic environments. Performing on-board mission planning and exec...
Solange Lemai, Félix Ingrand
AI
2000
Springer
13 years 11 months ago
Learning Rewrite Rules versus Search Control Rules to Improve Plan Quality
Domain independent planners can produce better-quality plans through the use of domain-speci c knowledge, typically encoded as search control rules. The planning-by-rewriting appro...
Muhammad Afzal Upal, Renee Elio