The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
CRIKEY is a planner that separates out the scheduling from the classical parts of temporal planning. This can be seen as a relaxation of the temporal information during the classic...
ics for abstraction Chiara Ghidini1 and Fausto Giunchiglia2 Abstract. The goal of this paper is to propose a model-theoretic formalization of abstraction, where abstraction is mode...
Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutio...
Abstract. We present some techniques for handling planning problems with numerical expressions that can be specified using the standard planning language PDDL. These techniques ar...
The planning domain language PDDL2.1, used in the 3rd International Planning Competition, has sparked off some controversy in the planning community as researchers consider its exp...
Controlling the sensing of an environment by an agent has been accepted as necessary for effective operation within most practical domains. Usually, however, agents operate in par...
We present the agent programming language GTGolog, which integrates explicit agent programming in Golog with gametheoretic multi-agent planning in Markov games. It is a generalizat...
Abstract. Learning in complex contexts often requires pure induction to be supported by various kinds of meta-information. Providing such information is a critical, difficult and ...
Stefano Ferilli, Floriana Esposito, Teresa Maria A...
ive Task Planning through Multiple Abstraction: Application to Assistant Robotics Cipriano Galindo and Javier Gonzalez and Juan-Antonio Fernandez-Madrigal1
Cipriano Galindo, Javier Gonzalez, Juan-Antonio Fe...