17 search results - page 3 / 4 » Heuristics for Planning with Action Costs Revisited |
AI
2011
Springer
13 years 11 days ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
PRICAI
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automate...
AIPS
2004
13 years 6 months ago
2004
Military operations planning involves concurrent actions, resource assignment, and conflicting costs. Individual tasks sometimes fail with a known probability, promoting a decisio...
ICDE
2012
IEEE
11 years 7 months ago
2012
IEEE
Abstract—This paper revisits the classical problem of multiquery optimization in the context of RDF/SPARQL. We show that the techniques developed for relational and semi-structur...
AIPS
2008
13 years 7 months ago
2008
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...