Zobrazeno 1 - 10
of 176
pro vyhledávání: '"Geffner, Hector"'
Goal instructions for autonomous AI agents cannot assume that objects have unique names. Instead, objects in goals must be referred to by providing suitable descriptions. However, this raises problems in both classical planning and generalized planni
Externí odkaz:
http://arxiv.org/abs/2409.20259
State symmetries play an important role in planning and generalized planning. In the first case, state symmetries can be used to reduce the size of the search; in the second, to reduce the size of the training set. In the case of general planning, ho
Externí odkaz:
http://arxiv.org/abs/2409.15892
Autor:
Hofmann, Till, Geffner, Hector
General policies represent reactive strategies for solving large families of planning problems like the infinite collection of solvable instances from a given domain. Methods for learning such policies from a collection of small training instances ha
Externí odkaz:
http://arxiv.org/abs/2404.02499
Recently, a simple but powerful language for expressing and learning general policies and problem decompositions (sketches) has been introduced in terms of rules defined over a set of Boolean and numerical features. In this work, we consider three ex
Externí odkaz:
http://arxiv.org/abs/2403.16824
The challenge in combined task and motion planning (TAMP) is the effective integration of a search over a combinatorial space, usually carried out by a task planner, and a search over a continuous configuration space, carried out by a motion planner.
Externí odkaz:
http://arxiv.org/abs/2403.16277
GNN-based approaches for learning general policies across planning domains are limited by the expressive power of $C_2$, namely; first-order logic with two variables and counting. This limitation can be overcomed by transitioning to $k$-GNNs, for $k=
Externí odkaz:
http://arxiv.org/abs/2403.11734
Autor:
Bonet, Blai, Geffner, Hector
It has been observed that many classical planning domains with atomic goals can be solved by means of a simple polynomial exploration procedure, called IW, that runs in time exponential in the problem width, which in these cases is bounded and small.
Externí odkaz:
http://arxiv.org/abs/2311.05490