Articles | Sciaria - Science Aria

LSRP*: Scalable and Anytime Planning for Multi-Agent Path Finding with Asynchronous Actions (Extended Abstract)

Informatics

Multi-Agent Path Finding (MAPF) seeks collision-free paths for multiple agents from their respective starting locations to their respective goal locat...

Review:

This extended abstract introduces LSRP*, a novel approach to Multi-Agent Path Finding (MAPF) that specifically addresses the restrictive assumption of...

View Full Research

Yimin Tang, Xiao Xiong, Jingyi Xi, Jiaoyang Li, Erdem Bıyık, Sven Koenig

RAILGUN: A Unified Convolutional Policy for Multi-Agent Path Finding Across Different Environments and Tasks (Extended Abstract)

Robotics

Multi-Agent Path Finding (MAPF), which focuses on finding collision-free paths for multiple robots, is crucial for applications ranging from aerial sw...

Review:

This extended abstract introduces RAILGUN, a novel learning-based policy designed to address the Multi-Agent Path Finding (MAPF) problem. The authors...

View Full Research

Pavel Surynek, Vojtěch Bubník, Lukáš Matěna, Petr Kubiš

Object Packing and Scheduling for Sequential 3D Printing: A Linear Arithmetic Model and a CEGAR-Inspired Optimal Solver (Extended Abstract)

Operations

We address the problem of object arrangement and scheduling for sequential 3D printing. Unlike the standard 3D printing, where all objects are printed...

Review:

This extended abstract presents a compelling and novel approach to a critical problem in advanced manufacturing: object packing and scheduling for seq...

View Full Research

Václav Sobotka, Hana Rudová

Uncertainty in Real-World Vehicle Routing (Extended Abstract)

Informatics

In our paper, we aim to address common sources of uncertainty in real-world industrial vehicle routing problems. By extending traditional deterministi...

Review:

The paper, "Uncertainty in Real-World Vehicle Routing (Extended Abstract)," addresses a highly pertinent and challenging area in logistics and operati...

View Full Research

Tzur Shubi, Solomon Eyal Shimony, Ariel Felner, Shahaf Shperberg

Bidirectional Heuristic Search in Longest Path Problems (Extended Abstract)

Informatics

Bidirectional heuristic search has the potential to decrease search time in combinatorial search problems amenable to backward search. To date, bidire...

Review:

This extended abstract presents a highly significant contribution to the field of combinatorial search by pioneering the application of bidirectional...

View Full Research

Shahaf Shperberg, Natalie Morad, Lior Siag, Ariel Felner, Dor Atzmon

Bidirectional Bounded-Suboptimal Heuristic Search with Consistent Heuristics (Extended Abstract)

Informatics

Recent advancements in bidirectional heuristic search have yielded significant theoretical insights and novel algorithms. While most previous work has...

Review:

The paper, "Bidirectional Bounded-Suboptimal Heuristic Search with Consistent Heuristics (Extended Abstract)," addresses a critical and often underser...

View Full Research

Grigorios Mouratidis, Bernhard Nebel, Sven Koenig

You May Split but You Might Work It Out Later: First Steps Toward Merging Nodes in MAPF (Extended Abstract)

Informatics

CBS is a state-of-the-art MAPF algorithm whose performance has been enhanced over the years by the introduction of heuristics that focus the search an...

Review:

This extended abstract presents an intriguing and potentially impactful novel approach to enhance the efficiency of Conflict-Based Search (CBS) for Mu...

View Full Research

Anton Ipsen, Michael Cashmore, Parisa Zehtabi, Nicolas Marchesotti, Kirsty Fielding, Daniele Magazzeni, Manuela Veloso

Hierarchical Seating Allocation (Extended Abstract)

Operations

The Hierarchical Seating Allocation Problem (HSAP) is the problem to allocate an organizational hierarchy of teams to a set of seats on a floor plan....

Review:

This extended abstract introduces the Hierarchical Seating Allocation Problem (HSAP), a pertinent challenge for large organizations aiming to optimize...

View Full Research

Mohammadreza Hami, Nathan Sturtevant

Suboptimal Search with Dynamic Distribution of Suboptimality (Extended Abstract)

Informatics

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

Review:

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