Sciweavers

6957 search results - page 18 / 1392
» Planning before plans
Sort
View
IJCAI
1989
13 years 9 months ago
Using and Refining Simplifications: Explanation-Based Learning of Plans in Intractable Domains
This paper describes an explanation-based approach lo learning plans despite a computationally intractable domain theory. In this approach, the system learns an initial plan using...
Steve A. Chien
AIPS
2009
13 years 9 months ago
Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning
Planning systems for real-world applications need the ability to handle concurrency and numeric fluents. Nevertheless, the predominant approach to cope with concurrency followed b...
Patrick Eyerich, Robert Mattmüller, Gabriele ...
JAIR
2008
99views more  JAIR 2008»
13 years 8 months ago
The Complexity of Planning Problems With Simple Causal Graphs
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
Omer Giménez, Anders Jonsson
IPOM
2009
Springer
14 years 2 months ago
A Network Optimization Model for Multi-layer IP/MPLS over OTN/DWDM Networks
The operational model for large Internet service providers is moving to a multi-layer architecture consisting of IP/MPLS coupled with OTN/DWDM. While there has been significant wo...
Iyad Katib, Deep Medhi
AAAI
2000
13 years 9 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