Automatic instance generation for classical planning
The benchmarks from previous International Planning Competitions (IPCs) are the de-facto
standard for evaluating planning algorithms. The IPC set is both a collection of planning …
standard for evaluating planning algorithms. The IPC set is both a collection of planning …
Integrating symmetry into differentiable planning with steerable convolutions
We study how group symmetry helps improve data efficiency and generalization for end-to-
end differentiable planning algorithms when symmetry appears in decision-making tasks …
end differentiable planning algorithms when symmetry appears in decision-making tasks …
[PDF][PDF] The powerlifted planning system in the IPC 2023
In this planner abstract, we introduce the version of the Powerlifted (Corrêa et al. 2020)
planning system used in the IPC 2023. Powerlifted is a lifted planner that works directly on …
planning system used in the IPC 2023. Powerlifted is a lifted planner that works directly on …
Strengthening potential heuristics with mutexes and disambiguations
Potential heuristics assign a numerical value (potential) to each fact and compute the
heuristic value for a given state as the sum of these potentials. A mutex is an invariant stating …
heuristic value for a given state as the sum of these potentials. A mutex is an invariant stating …
Endomorphisms of lifted planning problems
Classical planning tasks are usually modelled in the PDDL which is a schematic language
based on first-order logic. Nevertheless, most of the current planners turn this first-order …
based on first-order logic. Nevertheless, most of the current planners turn this first-order …
Equivariant Action Sampling for Reinforcement Learning and Planning
Reinforcement learning (RL) algorithms for continuous control tasks require accurate
sampling-based action selection. Many tasks, such as robotic manipulation, contain inherent …
sampling-based action selection. Many tasks, such as robotic manipulation, contain inherent …
Automated synthesis of social laws in strips
Agents operating in a multi-agent environment must consider not just their actions, but also
those of the other agents in the system. Artificial social systems are a well-known means for …
those of the other agents in the system. Artificial social systems are a well-known means for …
Computational complexity of computing symmetries in finite-domain planning
A Shleyfman, P Jonsson - Journal of Artificial Intelligence Research, 2021 - jair.org
Symmetry-based pruning is a powerful method for reducing the search effort in finitedomain
planning. This method is based on exploiting an automorphism group connected to the …
planning. This method is based on exploiting an automorphism group connected to the …
[PDF][PDF] HUZAR: Predicting Useful Actions with Graph Neural Networks
PR Gzubicki, BP Lachowicz… - … Competition (IPC-10) …, 2023 - ipc2023-learning.github.io
HUZAR: Predicting Useful Actions with Graph Neural Networks Page 1 HUZAR: Predicting
Useful Actions with Graph Neural Networks Piotr Rafał Gzubicki, Bartosz Piotr Lachowicz, Alvaro …
Useful Actions with Graph Neural Networks Piotr Rafał Gzubicki, Bartosz Piotr Lachowicz, Alvaro …
Task Scoping: Generating Task-Specific Simplifications of Open-Scope Planning Problems
A general-purpose agent must learn an open-scope world model: one rich enough to tackle
any of the wide range of tasks it may be asked to solve over its operational lifetime. This …
any of the wide range of tasks it may be asked to solve over its operational lifetime. This …