Conference ProceedingsOPEN ACCESS

Trading space for time in grid-based path finding

Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013 (2013) 1625-1626
DOI: 10.1609/aaai.v27i1.8528
0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Grid-based path finding is required in many games to move agents. We present an algorithm called DBA* that uses a database of pre-computed paths to reduce the time to solve search problems. When evaluated using benchmark maps from Dragon Age™, DBA* requires less time for search and produces less suboptimal paths than the PRA* implementation used in Dragon Age™ Copyright © 2013, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Cite

CITATION STYLE

APA

Lee, W., & Lawrence, R. (2013). Trading space for time in grid-based path finding. In Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013 (pp. 1625–1626). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v27i1.8528

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free