Potential Search (PS) is an algorithm that is designed to solve bounded cost search
problems. In this paper, we modify PS to work within the framework of bounded suboptimal …

We consider optimal and suboptimal algorithms for the Euclidean Shortest Path Problem
(ESPP) in two dimensions. For optimal path planning, Our approach leverages ideas from …

Abstract Electric Vehicles (EVs) have grown in recent years as they have become a
promising alternative to traditional fossil fuel-driven vehicles. As a result, new routing …

In the Multi-Agent Meeting problem (MAM), the task is to find a meeting location for multiple
agents, as well as a path for each agent to that location. In this paper, we introduce MM*, a …

Assessing physical protection system efficiency is mostly done manually by security experts
due to the complexity of the assessment process and lack of tools. Computer aided …

Symbolic search has proven to be a competitive approach to cost-optimal planning, as it
compactly represents sets of states by symbolic data structures. While heuristics for symbolic …

Recently there has been renewed interest in bidirectional heuristic search. New algorithms,
eg, MM, MMe, and NBS, have been introduced which seem much closer to refuting the …

Abstract In the Multi-Agent Meeting problem (MAM), the task is to find the optimal meeting
location for multiple agents, as well as a path for each agent to that location. Among all …

In this work, a novel decision assistant system for urban transportation, called Route
Scheme Assistant (RSA), is proposed to address two crucial issues that few former …

This paper studies external memory bidirectional search. That is, how bidirectional search
algorithms can run using external memory such as hard drives or solid state drives. While …