Crate dypdl_heuristic_search

DyPDL Heuristic Search

A library for heuristic search solvers for DyPDL.

Re-exports

• pub use parallel_search_algorithm::ConcurrentStateRegistry;
• pub use parallel_search_algorithm::CostNodeMessage;
• pub use parallel_search_algorithm::FNodeMessage;
• pub use parallel_search_algorithm::SendableCostNode;
• pub use parallel_search_algorithm::SendableFNode;
• pub use search_algorithm::data_structure::TransitionWithCustomCost;
• pub use search_algorithm::BeamSearchParameters;
• pub use search_algorithm::BrfsParameters;
• pub use search_algorithm::CabsParameters;
• pub use search_algorithm::DbdfsParameters;
• pub use search_algorithm::DdLnsParameters;
• pub use search_algorithm::ForwardRecursion;
• pub use search_algorithm::LnbsParameters;
• pub use search_algorithm::Parameters;
• pub use search_algorithm::ProgressiveSearchParameters;
• pub use search_algorithm::Search;
• pub use search_algorithm::Solution;

Modules

• parallel_search_algorithm
  A module for parallel search algorithms.
• search_algorithm
  A module for search algorithms.

Structs

• CustomExpressionParameters
  Parameters for custom cost expressions.
• ExpressionBeamSearch
  Beam search solver using user-defined cost functions.

Enums

• FEvaluatorType
  How to combine the g-value and the h-value to compute the f-value.

Functions

• create_caasdy
  Creates a cost-algebraic A* solver for DyPDL (CAASDy).
• create_dual_bound_acps
  Creates an Anytime Column Progressive Search (ACPS) solver using the dual bound as a heuristic function.
• create_dual_bound_apps
  Creates an Anytime Progressive Pack Search (APPS) solver using the dual bound as a heuristic function.
• create_dual_bound_breadth_first_search
  Creates a breadth-first search solver using the dual bound as a heuristic function.
• create_dual_bound_cabs
  Creates a Complete Anytime Beam Search (CABS) solver using the dual bound as a heuristic function.
• create_dual_bound_cahdbs1
  Creates a Complete Anytime Hash Distributed Beam Search 1 (CAHDBS1) solver using the dual bound as a heuristic function.
• create_dual_bound_cahdbs2
  Creates a Complete Anytime Hash Distributed Beam Search 2 (HDCABS2) solver using the dual bound as a heuristic function.
• create_dual_bound_casbs
  Creates a Complete Anytime Shared Beam Search (CASBS) solver using the dual bound as a heuristic function.
• create_dual_bound_cbfs
  Creates a Cyclic Best-First Search (CBFS) solver using the dual bound as a heuristic function.
• create_dual_bound_dbdfs
  Creates a Discrepancy-Bounded Depth-First Search (DBDFS) solver using the dual bound as a heuristic function.
• create_dual_bound_dd_lns
  Create a Large Neighborhood Search with Decision Diagrams (DD-LNS) solver using the dual bound as a heuristic function.
• create_dual_bound_dfbb
  Creates a DFBB solver using the dual bound as a heuristic function.
• create_dual_bound_lnbs
  Creates a Large Neighborhood Beam Search (LNBS) solver using the dual bound as a heuristic function.
• create_dual_bound_lnhdbs1
  Creates a Large Neighborhood Hash Distributed Beam Search 1 (LNHDBS1) solver using the dual bound as a heuristic function.
• create_dual_bound_lnhdbs2
  Creates a Large Neighborhood Hash Distributed Beam Search 2 (LNHDBS2) solver using the dual bound as a heuristic function.
• create_dual_bound_lnsbs
  Creates a Large Neighborhood Shared Beam Search (LNSBS) solver using the dual bound as a heuristic function.
• create_dual_bound_weighted_astar
  Creates a weighted A* solver using the dual bound as a heuristic function.