A* is optimally effective with regard to node expansions among unidirectional admissible algorithms—those that only assume that the heuristic used is admissible. Among …
NBS is a non-parametric bidirectional search algorithm proven to expand at most twice the number of node expansions required to verify the optimality of a solution. We introduce new …
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 …
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 …
V Alcázar, P Riddle, M Barley - Proceedings of the AAAI Conference on …, 2020 - ojs.aaai.org
In the past few years, new very successful bidirectional heuristic search algorithms have been proposed. Their key novelty is a lower bound on the cost of a solution that includes …
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 paper, we develop theoretical foundations for bidirectional bounded-suboptimal search (BiBSS) based on recent advancements in optimal bidirectional search. In addition …
J Che, X Tong, L Yu - CAAI Transactions on Intelligence …, 2022 - Wiley Online Library
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 …