Sciweavers

102 search results - page 9 / 21
» Search and Inference in AI Planning
Sort
View
FLAIRS
2007
13 years 10 months ago
Case-Based Recommendation of Node Ordering in Planning
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
Tomás de la Rosa, Angel García Olaya...
AIPS
2000
13 years 9 months ago
Probabilistic Hybrid Action Models for Predicting Concurrent Percept-Driven Robot Behavior
This paper develops Probabilistic Hybrid Action Models (PHAMs), a realistic causal model for predicting the behavior generated by modern concurrent percept-driven robot plans. PHA...
Michael Beetz, Henrik Grosskreutz
GECCO
2010
Springer
168views Optimization» more  GECCO 2010»
14 years 17 days ago
On the generality of parameter tuning in evolutionary planning
Divide-and-Evolve (DaE) is an original “memeticization” of Evolutionary Computation and Artificial Intelligence Planning. However, like any Evolutionary Algorithm, DaE has se...
Jacques Bibai, Pierre Savéant, Marc Schoena...
SARA
2009
Springer
14 years 2 months ago
Common Subexpressions in Constraint Models of Planning Problems
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
Andrea Rendl, Ian Miguel, Ian P. Gent, Peter Grego...
ICTAI
1999
IEEE
14 years 2 days ago
Search Strategies for Hybrid Search Spaces
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
Carla P. Gomes, Bart Selman