Precomputed-direction heuristics for suboptimal grid-based path-finding

Álvaro Parra, Álvaro Torralba, Carlos Linares López

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

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 languageEnglish
Title of host publicationProceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012
Number of pages2
PublisherAAAI Press
Publication date2012
Pages211-212
ISBN (Print)9781577355847
Publication statusPublished - 2012
Externally publishedYes
Event5th International Symposium on Combinatorial Search, SoCS 2012 - Niagara Falls, ON, Canada
Duration: 19 Jul 201221 Jul 2012

Conference

Conference5th International Symposium on Combinatorial Search, SoCS 2012
Country/TerritoryCanada
CityNiagara Falls, ON
Period19/07/201221/07/2012
SeriesProceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012

Bibliographical note

Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.

Fingerprint

Dive into the research topics of 'Precomputed-direction heuristics for suboptimal grid-based path-finding'. Together they form a unique fingerprint.

Cite this