Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
AIPS
2006
10 years 3 months ago
Optimal STRIPS Planning by Maximum Satisfiability and Accumulative Learning
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
Zhao Xing, Yixin Chen, Weixiong Zhang
FLAIRS
2008
10 years 4 months ago
Towards Getting Domain Knowledge: Plans Analysis through Investigation of Actions Dependencies
There are a lot of approaches for solving planning problems. Many of these approaches are based on `brute force` search methods and do not care about structures of plans previousl...
Lukás Chrpa, Roman Barták
AIPS
2008
10 years 4 months ago
In Search of the Tractability Boundary of Planning Problems
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
Omer Giménez, Anders Jonsson
AIPS
2008
10 years 4 months ago
Using Classical Planners to Solve Nondeterministic Planning Problems
Researchers have developed a huge number of algorithms to solve classical planning problems. We provide a way to use these algorithms, unmodified, to generate strong-cyclic soluti...
Ugur Kuter, Dana S. Nau, Elnatan Reisner, Robert P...
AIPS
2007
10 years 4 months ago
Planning with Respect to an Existing Schedule of Events
Decomposition has proved an effective strategy in planning, with one decomposition-based planner, SGPLAN, exhibiting strong performance in the last two IPCs. By decomposing planni...
Andrew Coles, Maria Fox, Derek Long, Amanda Smith
AIPS
2007
10 years 4 months ago
On the Hardness 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
KR
1991
Springer
10 years 5 months ago
Planning as Temporal Reasoning
This paper describes a reasoning system based on a temporal logic that can solve planning problems along the lines of traditional planning systems. Because it is cast as inference...
James F. Allen
ECAI
2006
Springer
10 years 5 months ago
Compact Representation of Sets of Binary Constraints
Abstract. We address the problem of representing big sets of binary constraints compactly. Binary constraints in the form of 2literal clauses are ubiquitous in propositional formul...
Jussi Rintanen
KR
1994
Springer
10 years 5 months ago
Risk-Sensitive Planning with Probabilistic Decision Graphs
Probabilistic AI planning methods that minimize expected execution cost have a neutral attitude towards risk. We demonstrate how one can transform planning problems for risk-sensi...
Sven Koenig, Reid G. Simmons
ECP
1997
Springer
130views Robotics» more  ECP 1997»
10 years 5 months ago
Encoding Planning Problems in Nonmonotonic Logic Programs
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
Yannis Dimopoulos, Bernhard Nebel, Jana Koehler
books