Articles | Sciaria - Science Aria

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

Dawson Tomasz, Richard Valenzano

Augmenting Exploration with Locally Greedy Probes

Informatics

Enhancing Greedy Best First Search (GBFS) with stochastic exploration will often greatly improve search performance. In this work, we show that one wa...

Review:

This paper presents a compelling analysis of how stochastic exploration enhances Greedy Best First Search (GBFS), identifying that exploration often a...

View Full Research

Takumi Shimoda, Alex Fukunaga

Decoupling Generation and Evaluation for Parallel Greedy Best-First Search

Informatics

In order to understand and control the search behavior of parallel search, recent work has proposed a class of constrained parallel greedy best-first...

Review:

This paper tackles a pertinent challenge in the domain of parallel search, specifically concerning constrained parallel greedy best-first search algor...

View Full Research

Runzhe Liang, Rishi Veerapaneni, Daniel Harabor, Jiaoyang Li, Maxim Likhachev

Real-Time LaCAM for Real-Time MAPF

Robotics

The vast majority of Multi-Agent Path Finding (MAPF) methods with completeness guarantees require planning full-horizon paths. However, planning full-...

Review:

This paper addresses a significant challenge in Multi-Agent Path Finding (MAPF): the practical limitations of full-horizon planning in real-world, tim...

Review:

This work introduces a novel approach to optimize algorithms for the Euclidean Shortest Path Problem, specifically targeting those that navigate preco...