1 code implementation • 25 Jul 2023 • Javier Segovia-Aguas, Jonathan Ferrer-Mestres, Sergio Jiménez
The combinatorial search is guided with functions that asses the complexity of the candidate programs, as well as their fitness to the given input set of examples.
no code implementations • 21 Jun 2017 • Jonathan Ferrer-Mestres, Guillem Francès, Hector Geffner
In this work, we show that it is possible to compile task and motion planning problems into classical AI planning problems; i. e., planning problems over finite and discrete state spaces with a known initial state, deterministic actions, and goal states to be reached.