Many interesting search problems can be formulated as bi-objective search problems, that
is, search problems where two kinds of costs have to be minimized, for example, travel …

The Fifteen Puzzle problem is one of the most classical problems that has captivated
mathematics enthusiasts for centuries. This is mainly because of the huge size of the state …

In this paper, we develop theoretical foundations for bidirectional bounded-suboptimal
search (BiBSS) based on recent advancements in optimal bidirectional search. In addition …

This paper focuses on the mobile robot path planning problem of optimizing the
performance metrics of bidirectional A* algorithm in randomized two-dimensional map …

Planning a collision-free path efficiently among obstacles is crucial in robotics. Conventional
one-shot unidirectional path planning algorithms work well in the static environment, but …

Adaptively Informed Trees (AIT*) is an algorithm that uses the problem-specific heuristic to
avoid unnecessary searches, which significantly improves its performance, especially when …

Robot path planning in high-dimensional continuous space is of great significance in
robotics. The conventional bidirectional fast marching method utilizes brute-force search to …