Abstract
This paper describes BubbleDragon, an entry in the 2012 Grid-based Path-Planning Competition. We aim to solve path-finding problems in the minimum time possible by precomputing paths from states in a region to its frontiers. Experimental results show that suboptimal paths for 1024x1024 grids can be retrieved in less than 1ms on average.
Original language | English |
---|---|
Title of host publication | Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012 |
Number of pages | 2 |
Publisher | AAAI Press |
Publication date | 2012 |
Pages | 211-212 |
ISBN (Print) | 9781577355847 |
Publication status | Published - 2012 |
Externally published | Yes |
Event | 5th International Symposium on Combinatorial Search, SoCS 2012 - Niagara Falls, ON, Canada Duration: 19 Jul 2012 → 21 Jul 2012 |
Conference
Conference | 5th International Symposium on Combinatorial Search, SoCS 2012 |
---|---|
Country/Territory | Canada |
City | Niagara Falls, ON |
Period | 19/07/2012 → 21/07/2012 |
Series | Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012 |
---|
Bibliographical note
Copyright:Copyright 2014 Elsevier B.V., All rights reserved.