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 …

Most recent theoretical and algorithmic work in bidirectional heuristic search (BiHS) used
front-to-end (F2E) heuristics that estimate the distance to the start and goal states. In this …

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

Online social networks greatly promote peoples' online interaction, where trust plays a
crucial role. Trust prediction with trust path search is widely used to help users find the …

Heuristic search guides the exploration of states via heuristic functions h estimating
remaining cost. Symbolic search instead replaces the exploration of individual states with …

Recently, the proposal of individual bounds that use consistent heuristics in front-to-end
bidirectional search has improved the state of the art. However, modern theory in …

The question of when bidirectional heuristic search outperforms unidirectional heuristic
search has been revisited numerous times in the field of Artificial Intelligence. This paper re …

The field of bidirectional heuristic search has recently seen great advances. However, the
subject of memory-restricted bidirectional search has not received recent attention. In this …

This paper presents two new bidirectional heuristic search algorithms for solving the shortest
path problem on graphs: consistent-heuristic bucket-based bidirectional search (CBBS) and …

Recent research on bidirectional heuristic search (BiHS) is based on the must-expand pairs
theory (MEP theory), which describes which pairs of nodes must be expanded during the …