Sparkle: Toward Accessible Meta-Algorithmics for Improving the State of the Art in Solving Challenging Problems
Many fields of computational science advance through improvements in the algorithms used
for solving key problems. These advancements are often facilitated by benchmarks and …
for solving key problems. These advancements are often facilitated by benchmarks and …
Polynomial-time in PDDL input size: Making the delete relaxation feasible for lifted planning
Polynomial-time heuristic functions for planning are commonplace since 20 years. But
polynomial-time in which input? Almost all existing approaches are based on a grounded …
polynomial-time in which input? Almost all existing approaches are based on a grounded …
Expressing and exploiting the common subgoal structure of classical planning domains using sketches: Extended version
Width-based planning methods deal with conjunctive goals by decomposing problems into
subproblems of low width. Algorithms like SIW thus fail when the goal is not easily …
subproblems of low width. Algorithms like SIW thus fail when the goal is not easily …
[HTML][HTML] How we designed winning algorithms for abstract argumentation and which insight we attained
In this paper we illustrate the design choices that led to the development of ArgSemSAT, the
winner of the preferred semantics track at the 2017 International Competition on …
winner of the preferred semantics track at the 2017 International Competition on …
In Defence of good old-fashioned artificial intelligence approaches in intelligent transportation systems
In recent years, Artificial Intelligence (AI) has been increasingly used in traffic management
and control, particularly in the smart city context. However, the vast majority of recent AI …
and control, particularly in the smart city context. However, the vast majority of recent AI …
Expressing and Exploiting Subgoal Structure in Classical Planning Using Sketches
Width-based planning methods deal with conjunctive goals by decomposing problems into
subproblems of low width. Algorithms like SIW thus fail when the goal is not easily …
subproblems of low width. Algorithms like SIW thus fail when the goal is not easily …
An LP-based approach for goal recognition as planning
LRA Santos, F Meneguzzi, RF Pereira… - Proceedings of the AAAI …, 2021 - ojs.aaai.org
Goal recognition aims to recognize the set of candidate goals that are compatible with the
observed behavior of an agent. In this paper, we develop a method based on the operator …
observed behavior of an agent. In this paper, we develop a method based on the operator …
Effective real-time urban traffic routing: An automated planning approach
One of the pivotal challenges presented to urban road traffic controllers is the effective
utilisation of transport infrastructure, as a result of growing urbanisation, the finite network …
utilisation of transport infrastructure, as a result of growing urbanisation, the finite network …
Enhancing temporal planning by sequential macro-actions
Temporal planning is an extension of classical planning involving concurrent execution of
actions and alignment with temporal constraints. Unfortunately, the performance of temporal …
actions and alignment with temporal constraints. Unfortunately, the performance of temporal …
On the robustness of domain-independent planning engines: the impact of poorly-engineered knowledge
Recent advances in automated planning are leading towards the use of planning engines in
a wide range of real-world applications. As the exploitation of planning techniques in …
a wide range of real-world applications. As the exploitation of planning techniques in …