PBeFS
Parallel Best-First Search
Loading...
Searching...
No Matches
PBeFS_di_unipi_it::NBlockDomain Concept Reference

a Domain whose state space is partitioned into nblocks More...

#include <PBeFS/astar/Domain.h>

Concept definition

template<class D>
requires( const D & d , const typename D::state_type & s , std::size_t b ) {
{ d.num_nblocks() } -> std::convertible_to< std::size_t >;
{ d.nblock( s ) } -> std::convertible_to< std::size_t >;
d.for_each_nblock_successor( b , detail::index_sink{} );
}
a search domain
Definition Domain.h:103
a Domain whose state space is partitioned into nblocks
Definition Domain.h:182

Detailed Description

a Domain whose state space is partitioned into nblocks

Besides an abstraction with num_nblocks() abstract states, given by nblock( s ), the Domain enumerates with for_each_nblock_successor( b , f ) the abstract successors of the nblock b, which define the duplicate detection scope of Parallel Best-NBlock-First search [see Burns et al., JAIR 2010].