no code implementations • 25 Mar 2024 • Blai Bonet, Dominik Drexler, Hector Geffner
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.
no code implementations • 18 Mar 2024 • Simon Ståhlberg, Blai Bonet, Hector Geffner
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.
no code implementations • 9 Nov 2023 • Blai Bonet, Hector Geffner
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.
no code implementations • 12 Jul 2022 • Blai Bonet, Hector Geffner
We show that this is possible provided that the dynamics is learned over a suitable domain-independent first-order causal language that makes room for objects and relations that are not assumed to be known.
no code implementations • 12 May 2022 • Simon Ståhlberg, Blai Bonet, Hector Geffner
We find for example that domains with general policies that require more expressive features can be solved with GNNs once the states are extended with suitable "derived atoms" encoding role compositions and transitive closures that do not fit into $C_{2}$.
no code implementations • 25 Apr 2022 • Andrés Occhipinti Liberman, Blai Bonet, Hector Geffner
In this work, we develop a new formulation for learning crisp first-order planning models that are grounded on parsed images, a step to combine the benefits of the two approaches.
no code implementations • 21 Sep 2021 • Simon Ståhlberg, Blai Bonet, Hector Geffner
As predicted by the theory, it is observed that general optimal policies are obtained in domains where general optimal value functions can be defined with $C_2$ features but not in those requiring more expressive $C_3$ features.
no code implementations • 23 May 2021 • Ivan D. Rodriguez, Blai Bonet, Javier Romero, Hector Geffner
For this, the learning problem is formulated as the search for a simplest first-order domain description D that along with information about instances I_i (number of objects and initial state) determine state space graphs G(P_i) that match the observed state graphs G_i where P_i = (D, I_i).
1 code implementation • 15 Mar 2021 • Ivan D. Rodriguez, Blai Bonet, Sebastian Sardina, Hector Geffner
The infinite trajectories that violate this condition are deemed as unfair, and the solutions are policies for which all the fair trajectories reach a goal state.
1 code implementation • 3 Jan 2021 • Guillem Francès, Blai Bonet, Hector Geffner
It has been recently shown that these policies can be computed in two steps: first, a suitable abstraction in the form of a qualitative numerical planning problem (QNP) is learned from sample plans, then the general policies are obtained from the learned QNP using a planner.
no code implementations • 15 Dec 2020 • Blai Bonet, Hector Geffner
We show that bounded width is a property of planning domains that admit optimal general policies in terms of features that are explicitly or implicitly represented in the domain encoding.
1 code implementation • 10 Dec 2019 • Blai Bonet, Hector Geffner
This leads to a generate-and-test algorithm for solving QNPs where solutions to a FOND problem are generated one by one and tested for termination.
no code implementations • 26 Sep 2019 • Florian Pommerening, Malte Helmert, Blai Bonet
Potential heuristics for state-space search are defined as weighted sums over simple state features.
no code implementations • 26 Sep 2019 • Blai Bonet, Giuseppe De Giacomo, Hector Geffner, Sasha Rubin
Moreover, for a broad class of problems that involve integer variables that can be increased or decreased, trajectory constraints can be compiled away, reducing generalized planning to fully observable non-deterministic planning.
no code implementations • 26 Sep 2019 • Blai Bonet, Hector Geffner
In the presence of non-admissible heuristics, A* and other best-first algorithms can be converted into anytime optimal algorithms over OR graphs, by simply continuing the search after the first solution is found.
no code implementations • 26 Sep 2019 • Blai Bonet, Hector Geffner
The problem of belief tracking in the presence of stochastic actions and observations is pervasive and yet computationally intractable.
no code implementations • 26 Sep 2019 • Blai Bonet, Hector Geffner
First, we introduce an alternative decomposition scheme and algorithm with the same time complexity but different completeness guarantees, whose space complexity is much smaller: exponential in the causal width of the problem that measures the number of state variables that are causally relevant to a given precondition, goal, or observable.
no code implementations • 12 Sep 2019 • Blai Bonet, Hector Geffner
Solvers such as classical planners are very flexible and can deal with a variety of problem instances and goals but require first-order symbolic models.
no code implementations • 28 May 2019 • Blai Bonet, Raquel Fuentetaja, Yolanda E-Martin, Daniel Borrajo
Recently it has been shown how to reduce the planning problem for generalized planning to the planning problem for a qualitative numerical problem; the latter being a reformulation that simultaneously captures all the instances in the collection.
no code implementations • 17 Nov 2018 • Blai Bonet, Guillem Francès, Hector Geffner
The actions in such plans, however, are not the actions in the instances themselves, which are not necessarily common to other instances, but abstract actions that are defined on a set of common features.
no code implementations • 30 Jan 2018 • Blai Bonet, Hector Geffner
This is achieved by projecting the actions over the features, resulting in a common set of abstract actions which can be tested for soundness and completeness, and which can be used for generating general policies such as "if the gripper is empty, pick the clear block above x and place it on the table" that achieve the goal clear(x) in any Blocksworld instance.
no code implementations • 10 Jan 2018 • Wilmer Bandres, Blai Bonet, Hector Geffner
By using the same visual inputs, the planning results can be compared with those of humans and learning methods.