Sciweavers

Share
AIPS
2006
9 years 5 months ago
Bringing Users and Planning Technology Together. Experiences in SIADEX
This work describes the solutions adopted to the problems tackled during the development of SIADEX, an intelligent planning and scheduling application where users play a central r...
Juan Fernández-Olivares, Luis A. Castillo, ...
AIPS
2006
9 years 5 months ago
Fast Probabilistic Planning through Weighted Model Counting
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
Carmel Domshlak, Jörg Hoffmann
AIPS
2006
9 years 5 months ago
Evaluating Mixed-Initiative Systems: An Experimental Approach
Mixed-Initiative approaches to Planning and Scheduling are being applied in different real world domains. While several recent successful examples of such tools encourage a wider ...
Gabriella Cortellessa, Amedeo Cesta
AIPS
2006
9 years 5 months ago
Goal Achievement in Partially Known, Partially Observable Domains
We present a decision making algorithm for agents that act in partially observable domains which they do not know fully. Making intelligent choices in such domains is very difficu...
Allen Chang, Eyal Amir
AIPS
2006
9 years 5 months ago
RRT-Plan: A Randomized Algorithm for STRIPS Planning
Daniel Burfoot, Joelle Pineau, Gregory Dudek
AIPS
2006
9 years 5 months ago
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
AIPS
2006
9 years 5 months ago
Bounded Branching and Modalities in Non-Deterministic Planning
We study the consequences on complexity that arise when bounds on the number of branch points on the solutions for non-deterministic planning problems are imposed as well as when ...
Blai Bonet
AIPS
2006
9 years 5 months ago
Automated Web Service Composition by On-the-Fly Belief Space Search
Composition of stateful web services expressed in BPEL4WS can be recasted as a problem of planning in asynchronous domains. In (PTB05), this is pursued by encoding the asynchronou...
Piergiorgio Bertoli, Marco Pistore, Paolo Traverso
AIPS
2006
9 years 5 months ago
Towards Strong Cyclic Planning under Partial Observability
Strong Cyclic Planning aims at generating iterative plans that only allow loops so far as there is a chance to reach the goal. The problem is already significantly complex for ful...
Piergiorgio Bertoli, Alessandro Cimatti, Marco Pis...
books