Sciweavers

971 search results - page 1 / 195
» Planning with Reduced Operator Sets
Sort
View
AIPS
2000
13 years 8 months ago
Planning with Reduced Operator Sets
Classical propositional STRIPSplanning is nothing but the searchfor a path in the state-transition graph induced by the operators in the planning problem. Whatmakes the problem ha...
Patrik Haslum, Peter Jonsson
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
14 years 8 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
AIPS
2009
13 years 8 months ago
Preferred Operators and Deferred Evaluation in Satisficing Planning
Heuristic forward search is the dominant approach to satisficing planning to date. Most successful planning systems, however, go beyond plain heuristic search by employing various...
Silvia Richter, Malte Helmert
PUK
2000
13 years 8 months ago
Knowledge-Based Control of Decision Theoretic Planning - Adaptive Planning Model Selection
This paper proposes a new planning architecture for agents operating in uncertain and dynamic environments. Decisiontheoretic planning has been recognized as a useful tool for rea...
Jun Miura, Yoshiaki Shirai
AIPS
2007
13 years 9 months ago
A Fast Incremental Algorithm for Maintaining Dispatchability of Partially Controllable Plans
Autonomous systems operating in real-world environments must be able to plan, schedule, and execute missions while robustly adapting to uncertainty and disturbances. Previous work...
Julie A. Shah, John Stedl, Brian C. Williams, Paul...