Articles | Sciaria - Science Aria

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...

View Full Research

Daniel Koch, Stefan Funke

Guiding the Search for the Euclidean Shortest Path Problem

Informatics

We consider the problem of reducing the search space of algorithms which solve the Euclidean Shortest Path Problem by traversing a precomputed navigat...

Review:

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

View Full Research

Matej Husár, Jiří Švancara, Roman Barták

On Path Selection for Reduction-Based Solving of Multi-Agent Pathfinding Using Graph Pruning

Informatics

Multi-agent pathfinding is the task of navigating a set of mobile agents in a shared environment such that they avoid collisions. Finding an optimal s...

Review:

This paper addresses a fundamental challenge in Multi-Agent Pathfinding (MAPF): the limitations of reduction-based algorithms when applied to larger p...

View Full Research

Hasan Ferit Eniser, Songtuan Lin, Nicola Müller, Anastasia Isychev, Valentin Wüstholz, Isabel Valera, Jörg Hoffmann, Maria Christakis

Using Action-Policy Testing in RL to Reduce the Number of Bugs

Informatics

Reinforcement learning is becoming ever more prominent in solving combinatorial search problems, in particular ones where states are images. Prior wor...

Review:

This paper presents a novel approach to improving the robustness of Reinforcement Learning policies by integrating action-policy testing directly into...

View Full Research

Shizhe Zhao, Yancheng Wu, Zhongqiang Ren

Bi-Objective Search for the Traveling Salesman Problem with Time Windows and Vacant Penalties

Informatics

This paper investigates a Traveling Salesman Problem with Time Windows and Vacant Penalties (TSP-TW-VP), which plans a path to service a set of machin...

Review:

The paper "Bi-Objective Search for the Traveling Salesman Problem with Time Windows and Vacant Penalties" investigates a significant extension to the...

Review:

The paper "Real-time Cost-algebraic Heuristic Search" addresses a critical challenge in the field of real-time planning: the difficulty in proving the...