Budget Amount *help |
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2019: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2018: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2017: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
|
Outline of Final Research Achievements |
We developed Block-parallel IDA*, an admissible search algorithm for finding optimal solutions for heterogeneous CPU/GPU environments. Block-parallel IDA* allocates subtrees of a search tree to each GPU block. We showed that on the standard sliding tiles benchmark domain, Block-parallel IDA* significantly outperforms thread-parallel IDA*. We also developed Bach Monte Carlo Random Walk, a satisficing (non-optimal) search algorithm which significantly outperformed previous Random Walk search algorithms on a large set of domain-independent planning benchmark instances.
|