Browse Research
Home 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...

View Full Research
Jonathan Morag, Noy Gabay, Daniel Koyfman, Roni Stern
Should Multi-Agent Path Finding Algorithms Coordinate Target Arrival Times?
Robotics

Multi-Agent Path Finding (MAPF) deals with finding conflict-free paths for a set of agents from an initial configuration to a given target configurati...

Review:

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

View Full Research
Zhihui Xie, Xu Liu, Shuai Li
Multi-armed Bandit Algorithms for the Boolean Satisfiability Problem: A Survey
Informatics

This paper provides a survey of recent literature on the use of multi-armed bandit algorithms to solve the Boolean satisfiability problem (SAT), a wel...

Review:

This survey paper addresses a highly relevant and impactful topic: the application of multi-armed bandit (MAB) algorithms to the Boolean Satisfiabilit...

View Full Research
Jiaqi Tan, Yudong Luo, Jiaoyang Li, Hang Ma
Reevaluation of Large Neighborhood Search for MAPF: Findings and Opportunities
Informatics

Multi-Agent Path Finding (MAPF) aims to arrange collision-free goal-reaching paths for a group of agents. Anytime MAPF solvers based on large neighbor...

Review:

This paper presents a timely and critical reevaluation of Large Neighborhood Search (LNS) approaches for Multi-Agent Path Finding (MAPF). The authors...

View Full Research