Moving Target Search with Compressed Path Databases
Moving target search, where the goal state changes during a search, has recently seen a revived interest. Incremental Anytime Repairing A* (I-ARA*) is a very recent, state-of-the-art algorithm for moving target search in a known terrain. In this work, we
|Collections||ANU Research Publications|
|Source:||International Conference on Automated Planning & Scheduling|
|01_Botea_Moving_Target_Search_with_2013.pdf||178.23 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.