Sciweavers

AIPS
2006
13 years 9 months ago
An Empirical Study of Multi-Point Constructive Search for Constraint-Based Scheduling
Multi-point constructive search (MPCS) performs a series of resource-limited backtracking searches where each search begins either from an empty solution (as in randomized restart...
J. Christopher Beck
AIPS
2006
13 years 9 months ago
Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach
Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double precedence graph where direct precedence relations are kep...
Roman Barták, Ondrej Cepek
AIPS
2006
13 years 9 months ago
Run-Time Monitoring of the Execution of Plans for Web Service Composition
While a lot of work has been done on the problem of the automated generation of plans that compose web services, the problem of monitoring their execution has still to be investig...
Fabio Barbon, Paolo Traverso, Marco Pistore, Miche...
AIPS
2006
13 years 9 months ago
Planning with Temporally Extended Goals Using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planni...
Jorge A. Baier, Sheila A. McIlraith
AIPS
2006
13 years 9 months ago
Safe LTL Assumption-Based Planning
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
Alexandre Albore, Piergiorgio Bertoli
AIPS
2006
13 years 9 months ago
Planning for PDDL3 - An OCSP Based Approach
Recent research in AI Planning is focused on improving the quality of the generated plans. PDDL3 incorporates hard and soft constraints on goals and the plan trajectory. Plan traj...
Bharat Ranjan Kavuluri, Naresh Babu Saladi, Deepak...
AIPS
2006
13 years 9 months ago
Automated Planning Using Quantum Computation
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
Sanjeev Naguleswaran, Langford B. White, I. Fuss
AIPS
2006
13 years 9 months ago
Learning Heuristic Functions from Relaxed Plans
Sung Wook Yoon, Alan Fern, Robert Givan
AIPS
2006
13 years 9 months ago
On the Use of UML.P for Modeling a Real Application as a Planning Problem
There is a great interest in the planning community to apply all developments already achieved in the area to real applications. Such scenario makes the community focus on Knowled...
Tiago Stegun Vaquero, Flavio Tonidandel, Leliane N...