4 papers
Bidirectional Search for Longest Paths: Case for Front-to-Front Heuristics
Tzur Shubi, Ariel Felner, Solomon Eyal Shimony +1
Bidirectional heuristic search can potentially reduce search effort for problems amenable to backward search. Therein, it is well-known that front-to-front heuristics can reduce th…
Bidirectional Bounded-Suboptimal Heuristic Search with Consistent Heuristics
Shahaf S. Shperberg, Natalie Morad, Lior Siag +2
Recent advancements in bidirectional heuristic search have yielded significant theoretical insights and novel algorithms. While most previous work has concentrated on optimal searc…
On Parallel External-Memory Bidirectional Search
Lior Siag, Shahaf S. Shperberg, Ariel Felner +1
Parallelization and External Memory (PEM) techniques have significantly enhanced the capabilities of search algorithms when solving large-scale problems. Previous research on PEM h…
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search
Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner
While the study of unit-cost Multi-Agent Pathfinding (MAPF) problems has been popular, many real-world problems require continuous time and costs due to various movement models. In…