AIPS
2010
13 years 10 months ago
2010
Evolutionary trees of species can be reconstructed by pairwise comparison of their entire genomes. Such a comparison can be quantified by determining the number of events that ch...
AIPS
2010
13 years 11 months ago
2010
We introduce the Scanalyzer planning domain, a domain for classical planning which models the problem of automatic greenhouse logistic management. At its mathematical core, the Sc...
AIPS
2010
13 years 11 months ago
2010
We present a planning domain that encodes the problem of generating natural language sentences. This domain has a number of features that provoke fairly unusual behavior in planne...
AIPS
2010
13 years 11 months ago
2010
Greedy search is commonly used in an attempt to generate solutions quickly at the expense of completeness and optimality. In this work, we consider learning sets of weighted actio...
AIPS
2010
13 years 11 months ago
2010
In this paper, we develop a heuristic, progression based conformant planner, called CNF, which represents belief states by a special type of CNF formulae, called CNF-states. We de...
AIPS
2010
13 years 11 months ago
2010
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of researchers returning to the partial-order planning approach...
AIPS
2010
13 years 11 months ago
2010
tractions Met Landmarks C. Domshlak M. Katz S. Lefler Technion - Israel Institute of Technology
AIPS
2010
13 years 11 months ago
2010
When using a planner-based agent architecture, many things can go wrong. First and foremost, an agent might fail to execute one of the planned actions for some reasons. Even more ...
AIPS
2010
14 years 19 days ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
AIPS
2010
14 years 1 months ago
2010
