Sciweavers

50 search results - page 4 / 10
» Heuristics and Symmetries in Classical Planning
Sort
View
AIPS
2011
13 years 2 months ago
Effective Heuristics and Belief Tracking for Planning with Incomplete Information
Conformant planning can be formulated as a path-finding problem in belief space where the two main challenges are the heuristics to guide the search, and the representation and u...
Alexandre Albore, Miquel Ramírez, Hector Ge...
ECAI
2008
Springer
14 years 4 days ago
Heuristics for Planning with Action Costs Revisited
We introduce a simple variation of the additive heuristic used in the HSP planner that combines the benefits of the original additive heuristic, namely its mathematical formulation...
Emil Keyder, Hector Geffner
CAEPIA
2007
Springer
14 years 4 months ago
Heuristics for Planning with Action Costs
We introduce a non-admissible heuristic for planning with action costs, called the set-additive heuristic, that combines the benefits of the additive heuristic used in the HSP pla...
Emil Keyder, Hector Geffner
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
14 years 2 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
AAAI
2000
13 years 11 months ago
Extracting Effective and Admissible State Space Heuristics from the Planning Graph
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
XuanLong Nguyen, Subbarao Kambhampati