IDAStar< D > Class Template Reference

the iterative-deepening A* search of a Domain More...

#include <PBeFS/astar/IDAStar.h>

Public Types
using	State = state_t< D >
	the state type
using	Cost = cost_t< D >
	the cost type
using	SolutionT = Solution< State , Cost >
	the solution type

Public Member Functions
	IDAStar (const D &domain, const SearchOptions &options={})
	constructor, taking the Domain (which must outlive the IDAStar)
SolutionT	solve (void) const
	searches the Domain, returning the Solution

Detailed Description

template<Domain D>
class PBeFS_di_unipi_it::IDAStar< D >

the iterative-deepening A* search of a Domain

The counters of the Solution are summed over the iterations: expanded counts every expansion, those of the states already expanded in an earlier iteration included, and stored is the length of the longest path held, i.e., the memory of the search in states. The node_limit of the SearchOptions bounds the expansions, and the search stops with Status::node_limit when it reaches it; expected_nodes is not used.

Member Typedef Documentation

Cost

template<Domain D>

using Cost = cost_t< D >

the cost type

SolutionT

template<Domain D>

using SolutionT = Solution< State , Cost >

the solution type

State

template<Domain D>

using State = state_t< D >

the state type

Constructor & Destructor Documentation

IDAStar()

template<Domain D>

IDAStar ( const D & domain, const SearchOptions & options = {} )

inlineexplicit

constructor, taking the Domain (which must outlive the IDAStar)

Member Function Documentation

solve()

template<Domain D>

SolutionT solve ( void ) const

inlinenodiscard

searches the Domain, returning the Solution

---

The documentation for this class was generated from the following file:

• PBeFS/astar/IDAStar.h