Sciweavers

AIPS
2009
14 years 24 days ago
Navigation Planning in Probabilistic Roadmaps with Uncertainty
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
Michael Kneebone, Richard Dearden
AIPS
2009
14 years 24 days ago
An Optimal Temporally Expressive Planner: Initial Results and Application to P2P Network Optimization
Temporally expressive planning, an important class of temporal planning, has attracted much attention lately. Temporally expressive planning is difficult; few existing planners ca...
Ruoyun Huang, Yixin Chen, Weixiong Zhang
AIPS
2009
14 years 24 days ago
Suboptimal and Anytime Heuristic Search on Multi-Core Machines
In order to scale with modern processors, planning algorithms must become multi-threaded. In this paper, we present parallel shared-memory algorithms for two problems that underli...
Ethan Burns, Seth Lemons, Wheeler Ruml, Rong Zhou
AIPS
2009
14 years 24 days ago
Thinking Ahead in Real-Time Search
Dana S. Nau, Ugur Kuter, Emre Sefer
AIPS
2009
14 years 24 days ago
An Automatically Configurable Portfolio-based Planner with Macro-actions: PbP
While several powerful domain-independent planners have recently been developed, no one of these clearly outperforms all the others in every known benchmark domain. We present PbP...
Alfonso Gerevini, Alessandro Saetti, Mauro Vallati
AIPS
2009
14 years 24 days ago
Inference and Decomposition in Planning Using Causal Consistent Chains
Current state-of-the-art planners solve problems, easy and hard alike, by search, expanding hundreds or thousands of nodes. Yet, given the ability of people to solve easy problems...
Nir Lipovetzky, Hector Geffner
AIPS
2009
14 years 24 days ago
Just-In-Time Scheduling with Constraint Programming
This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programmin...
Jean-Noël Monette, Yves Deville, Pascal Van H...
AIPS
2009
14 years 24 days ago
Exploiting N-Gram Analysis to Predict Operator Sequences
N-gram analysis provides a means of probabilistically predicting the next item in a sequence. Due originally to Shannon, it has proven an effective technique for word prediction i...
Christian J. Muise, Sheila A. McIlraith, Jorge A. ...
AIPS
2009
14 years 24 days ago
Structural-Pattern Databases
abstraction heuristics, notably pattern-database and merge-and-shrink heuristics, are employed by some state-ofthe-art optimal heuristic-search planners. The major limitation of t...
Michael Katz, Carmel Domshlak