Sciweavers

565 search results - page 69 / 113
» Heuristics for Planning with SAT
Sort
View
ICRA
2005
IEEE
118views Robotics» more  ICRA 2005»
14 years 1 months ago
Learning-Assisted Multi-Step Planning
— Probabilistic sampling-based motion planners are unable to detect when no feasible path exists. A common heuristic is to declare a query infeasible if a path is not found in a ...
Kris K. Hauser, Timothy Bretl, Jean-Claude Latombe
AAAI
2004
13 years 9 months ago
Forward-Chaining Planning in Nondeterministic Domains
In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work i...
Ugur Kuter, Dana S. Nau
SSD
2005
Springer
188views Database» more  SSD 2005»
14 years 1 months ago
Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results
Abstract. Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to pr...
Qingsong Lu, Betsy George, Shashi Shekhar
JAIR
2010
131views more  JAIR 2010»
13 years 6 months ago
Automatic Induction of Bellman-Error Features for Probabilistic Planning
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
Jia-Hong Wu, Robert Givan
FMCAD
2000
Springer
13 years 11 months ago
SAT-Based Image Computation with Application in Reachability Analysis
Image computation nds wide application in VLSI CAD, such as state reachability analysis in formal veri cation and synthesis, combinational veri cation, combinational and sequential...
Aarti Gupta, Zijiang Yang, Pranav Ashar, Anubhav G...