Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Action Partitioning Heuristic Search"”.

  1. Solving Automated Planning Problems with Parallel Decomposition

    … problems have good locality which means their actions can be clustered in such a way that nearby actions in the solution plan are usually also from the same cluster. We have also observed that the problem structure is regular and has lots of repetitions. The repetitions come from symmetric …

    uiuc Repository record for Solving Automated Planning Problems with Parallel Decomposition (opens in a new tab)