Informatics Journals | Jurnal Online Page 21

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

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

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

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

Review:

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