Sciweavers

810 search results - page 16 / 162
» Solving Time-Dependent Planning Problems
Sort
View
IJCAI
2003
13 years 10 months ago
Generalizing GraphPlan by Formulating Planning as a CSP
We examine the approach of encoding planning problems as CSPs more closely. First we present a simple CSP encoding for planning problems and then a set of transformations that can...
Adriana Lopez, Fahiem Bacchus
AAAI
2000
13 years 10 months ago
Towards Feasible Approach to Plan Checking under Probabilistic Uncertainty: Interval Methods
The main problem of planning is to find a sequence of actions that an agent must perform to achieve a given objective. An important part of planning is checking whether a given pl...
Raul Trejo, Vladik Kreinovich, Chitta Baral
JOT
2006
82views more  JOT 2006»
13 years 9 months ago
Planning before plans
A plan is a blueprint for solving a problem. It summarizes the decisions that have been made during the planning of that solution. In this month's issue of Strategic Software...
John D. McGregor
KR
1998
Springer
14 years 1 months ago
A Planning Algorithm not based on Directional Search
The initiative in STRIPS planning has recently been taken by work on propositional satisfiability. Best current planners, like Graphplan, and earlier planners originating in the p...
Jussi Rintanen
AIPS
2006
13 years 10 months ago
Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...
Jörg Hoffmann, Carla P. Gomes, Bart Selman