Survey of Parallel A* in Rust

05/08/2021
by   Brett Fazio, et al.
0

A* is one of the most popular Best First Search (BFS) techniques for graphs. It combines the cost-based search of Breadth First Search with a computed heuristic for each node to attempt to locate the goal path faster than traditional Breadth First Search or Depth First Search techniques. However, A* is a sequential algorithm. The standard implementation only runs in one thread. There are a few attempts to get A* to leverage multiple threads. Centralized (SPA*) and Decentralized (DPA*, HDA*) methods are the most standard attempts, with the most unique and modern method being massively-parallel A* (MPA* or GA*). We will attempt an implementation of each in Rust to determine if there is a performance boost, and which one has the best performance.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

05/07/2020

Linear Time LexDFS on Chordal Graphs

Lexicographic Depth First Search (LexDFS) is a special variant of a Dept...
08/16/2017

A Survey of Parallel A*

A* is a best-first search algorithm for finding optimal-cost paths in gr...
01/16/2014

Best-First Heuristic Search for Multicore Machines

To harness modern multicore processors, it is imperative to develop para...
03/27/2013

Heuristic Search as Evidential Reasoning

BPS, the Bayesian Problem Solver, applies probabilistic inference and de...
05/27/2011

Adaptive Parallel Iterative Deepening Search

Many of the artificial intelligence techniques developed to date rely on...
12/18/2019

Busca de melhor caminho entre múltiplas origens e múltiplos destinos em redes complexas que representam cidades

Was investigated in this paper the use of a search strategy in the probl...
12/06/2021

SIMD-Optimized Search Over Sorted Data

Applications often require a fast, single-threaded search algorithm over...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.