Informatics Journals | Jurnal Online Page 23

Planning under time pressure arises in many situations. Real-time heuristic search, in which an agent must compute its next action within a prespecifi...

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

View Full Research

Lior Siag, Ariel Felner, Shahaf Shperberg

Heuristics for Bounded-Suboptimal Search

Informatics

In heuristic search, it is well-established that different types of heuristics are suited for optimal heuristic search (OHS) and unbounded suboptimal...

Review:

This paper addresses a crucial gap in the field of heuristic search, specifically concerning bounded-suboptimal search (BSS). The authors rightly high...

View Full Research

Dominik Schreiber, Christoph Jabs, Jeremias Berg

From Scalable SAT to MaxSAT: Massively Parallel Solution Improving Search

Informatics

Maximum Satisfiability (MaxSAT) is an essential framework for combinatorial optimization at the core of automated reasoning. However, to date, no nota...

Review:

The paper "From Scalable SAT to MaxSAT: Massively Parallel Solution Improving Search" addresses a critical gap in automated reasoning and combinatoria...

View Full Research

Ankur Nath, Alan Kuhnle

Hierarchical DeepPruner: A Novel Framework for Search Space Reduction

Informatics

Combinatorial optimization (CO) problems on graphs arise in various applications across diverse domains. Many of these problems are NP-hard, and heuri...

Review:

This paper introduces Hierarchical DeepPruner, a novel framework designed to tackle the significant computational challenges posed by NP-hard Combinat...

View Full Research

Edward Lam, Peter J. Stuckey

Low-Level Search on Time Intervals in Branch-and-Cut-and-Price for Multi-Agent Path Finding

Informatics

Multi-agent path finding is the problem of navigating a set of agents from their starting locations to their target locations while avoiding collision...

Review:

This paper addresses the challenging problem of Multi-Agent Path Finding (MAPF), a crucial area in robotics and AI where multiple agents must navigate...

View Full Research

Daniel Koyfman, Dor Atzmon, Shahaf Shperberg, Ariel Felner

Minimizing Fuel in Multi-Agent Pathfinding

Informatics

The multi-agent pathfinding problem (MAPF) of finding conflict-free paths for multiple agents has attracted a large number of researchers in the past....

Review:

The paper "Minimizing Fuel in Multi-Agent Pathfinding" presents a compelling and timely contribution to the Multi-Agent Pathfinding (MAPF) domain by s...

View Full Research

Weimin Huang, Natalie M. Isenberg, Ján Drgoňa, Draguna L Vrabie, Bistra Dilkina

Efficient Primal Heuristics for Mixed Binary Quadratic Programs Using Suboptimal Rounding Guidance

Informatics

Mixed Binary Quadratic Programs (MBQPs) are a class of NP-hard problems that arise in a wide range of applications, including finance, machine learnin...

Review:

This paper addresses the challenging problem of solving Mixed Binary Quadratic Programs (MBQPs), which are known to be NP-hard and arise in diverse hi...

View Full Research

Yaron Halle, Ariel Felner, Sven Koenig, Oren Salzman

A Preprocessing Framework for Efficient Approximate Bi-Objective Shortest-Path Computation in the Presence of Correlated Objectives

Informatics

The bi-objective shortest-path (BOSP) problem seeks to find paths between start and target vertices of a graph while optimizing two conflicting object...

Review:

The paper presents a valuable contribution to the field of multi-objective optimization by addressing the bi-objective shortest-path (BOSP) problem, s...

View Full Research

Garrett M. Fereday, Eric A. Hansen

A Bucket-Based Priority Queue for Bounded-Suboptimal and Anytime A* Search

Informatics

We introduce a priority queue data structure, called a bucket heap, which generalizes the bucket queue commonly used to accelerate A* search for short...

Review:

The paper introduces a novel data structure, the "bucket heap," designed to significantly enhance the performance of A* search algorithms. Positioned...

Review:

This paper presents a significant advancement in the efficiency of Explicit Estimation Conflict-Based Search (EECBS), a leading algorithm for bounded-...