Header file that includes the graph searches of PBeFS save the one that needs MPI, HDAStarMPI.h. More...

#include "PBeFS/core.h"
#include "PBeFS/astar/AStar.h"
#include "PBeFS/astar/DDDAStar.h"
#include "PBeFS/astar/Distribution.h"
#include "PBeFS/astar/Domain.h"
#include "PBeFS/astar/ExplicitGraph.h"
#include "PBeFS/astar/FarmAStar.h"
#include "PBeFS/astar/Grid.h"
#include "PBeFS/astar/HDAStar.h"
#include "PBeFS/astar/IDAStar.h"
#include "PBeFS/astar/MissionariesCannibals.h"
#include "PBeFS/astar/NQueens.h"
#include "PBeFS/astar/PASE.h"
#include "PBeFS/astar/MQAStar.h"
#include "PBeFS/astar/PatternDatabase.h"
#include "PBeFS/astar/Romania.h"
#include "PBeFS/astar/SPAStar.h"
#include "PBeFS/astar/SafePBNF.h"
#include "PBeFS/astar/SequenceScore.h"
#include "PBeFS/astar/SlidingTile.h"
#include "PBeFS/astar/SlowDomain.h"
#include "PBeFS/astar/TravelingSalesman.h"
#include "PBeFS/astar/VacuumWorld.h"
#include "PBeFS/astar/WaterJugs.h"

Detailed Description

Header file that includes the graph searches of PBeFS save the one that needs MPI, HDAStarMPI.h.

The searches look for a path of least cost in a Domain [see Domain.h], i.e., an implicit graph given by an initial state, a goal test and an expansion procedure, with:

AStar, the sequential A* [see AStar.h];
IDAStar, the iterative-deepening A*, which holds only the current path [see IDAStar.h];
DDDAStar, the A* with delayed duplicate detection, whose OPEN and CLOSED lists are files on the disk [see DDDAStar.h];
SPAStar, Simple Parallel A*, with one OPEN list shared by the workers [see SPAStar.h];
MQAStar, MultiQueue A*, as SPAStar with a relaxed OPEN list, the MultiQueue of ADS [see MQAStar.h];
HDAStar, Hash Distributed A*, in which a distribution function [see Distribution.h] assigns every state to the worker that owns it, on an executor of ADS, and HDAStarMPI on the processes of MPI [see HDAStarMPI.h];
SafePBNF, Parallel Best-NBlock-First search [see SafePBNF.h];
PASE, Parallel A* for Slow Expansions [see PASE.h];
FarmAStar, a master-worker A* on a farm with feedback [see FarmAStar.h].

The domains are SlidingTile (the puzzle of \( W H - 1 \) tiles), SequenceScore (the same with the heuristic of Nilsson), Grid (pathfinding on a GridMap with 4 or 8 moves), ExplicitGraph (a weighted graph given by adjacency lists) and Romania (the road map of Romania as one of them), and the problems of the textbook of Russell and Norvig that the examples solve, i.e., NQueens, VacuumWorld, MissionariesCannibals, WaterJugs and TravelingSalesman; SlowDomain slows down the expansions of any of them. SlidingTilePDB is SlidingTile with the additive pattern databases of PatternDatabase.h in place of the Manhattan distance.

Author: Donato Meoli
Dipartimento di Informatica
Università di Pisa