Articles | Sciaria - Science Aria

In bounded-suboptimal heuristic search, the aim is to find a solution path within a given bound as quickly as possible, which is crucial when computat...

Review:

The proposed algorithm, Dynamic Suboptimality Weighted A* (DSWA*), addresses a critical challenge in bounded-suboptimal heuristic search: the static n...

View Full Research

Kareem Eissa, Rayal Prasad, Ankur Kapoor

Multi-Agent Path Finding for Schedule Constrained Automation (Extended Abstract)

Robotics

In modern automation settings, jobs are processed across machines with interdependencies and are subject to limited equipment availability. When trans...

Review:

The paper "Multi-Agent Path Finding for Schedule Constrained Automation" introduces MAPF-SC, an extension of Multi-Agent Path Finding (MAPF) designed...

View Full Research

Lukáš Chrpa, Mauro Vallati

Critical Section Macros - New Results (Extended Abstract)

Informatics

This extended abstract presents new empirical results of recently introduced Critical Section Macro-operators (CSMs) whose design is inspired by using...

Review:

This extended abstract presents timely new empirical results concerning Critical Section Macro-operators (CSMs), a concept inspired by the use of lock...

View Full Research

Sandra Castellanos-Paez, Francesco Percassi, Mauro Vallati

Exploring the Trade-off Between Flexible and Deployable Models for PDDL+ Urban Traffic Control (Extended Abstract)

Informatics

The problem of traffic signal optimisation has been successfully tackled using the PDDL+ planning formalism, which also provides an ideal ground for s...

Review:

This extended abstract presents a timely and relevant exploration into the core dilemma faced when applying advanced AI planning techniques, specifica...

View Full Research

Valerio Borelli, Alfonso Emilio Gerevini, Enrico Scala, Ivan Serina

Learning Heuristic Functions with Graph Neural Networks for Numeric Planning (Extended Abstract)

Informatics

In this paper, we investigate the application of heuristics based on Graph Neural Networks (GNNs) to lifted numeric planning problems, an area that ha...

Review:

This extended abstract presents a timely investigation into the application of Graph Neural Networks (GNNs) for learning heuristic functions in the co...

View Full Research

Luigi Bonassi, Francesco Percassi, Enrico Scala

BLAST: Bit-Blasting Numbers for Classical Planning (Extended Abstract)

Informatics

It is well known that numeric planning can be made decidable if the domain of all numeric state variables is finite. This bounded formulation can be p...

Review:

This extended abstract, titled "BLAST: Bit-Blasting Numbers for Classical Planning," tackles a crucial gap between theoretical tractability and practi...

View Full Research

Saeid Amiri, Danial Dervovic, Parisa Zehtabi, Michael Cashmore

Surrogate-Assisted Monte-Carlo Tree Search in Facility Location and Beyond (Extended Abstract)

Operations

Combinatorial problems abound in industry. A persistent issue encountered using search-based solutions is that evaluating particular nodes may be expe...

Review:

This extended abstract presents a compelling approach to tackling computationally expensive combinatorial optimization problems, specifically focusing...

View Full Research

Shahaf Shperberg, Lior Siag, Nathan Sturtevant, Ariel Felner

Position Paper: On the Impact of Direction-Selection in BAE*

Informatics

BAE*, and the independently developed DIBBS, are state-of-the-art bidirectional heuristic search algorithms that exploit heuristic consistency to effi...

Review:

This position paper tackles a critical efficiency concern within state-of-the-art bidirectional heuristic search algorithms, particularly BAE* and DIB...

View Full Research

André Schidler, Stefan Szeider

Extracting Problem Structure with LLMs for Optimized SAT Local Search

Informatics

Encoding combinatorial problems in terms of propositional satisfiability (SAT) enables utilization of highly efficient SAT solvers for combinatorial s...

Review:

This position paper introduces a compelling and novel approach to enhance SAT local search through the specialized application of Large Language Model...

Review:

This position paper critically examines a fundamental inefficiency in current approaches to Lifelong Multi-Agent Path Finding (LMAPF), specifically th...