Skip to main content
Conference ProceedingsOPEN ACCESS

Tree cache

Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012 (2012) 203
DOI: 10.1609/socs.v3i1.18257
1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

This program generates a single search tree, compacts it to reduce memory/disk space, then utilizes it to very quickly generate valid paths in an 8-connected gridworld. This technique is similar in principle to RRTs used in robotics. Copyright © 2012, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Cite

CITATION STYLE

APA

Anderson, K. (2012). Tree cache. In Proceedings of the 5th Annual Symposium on Combinatorial Search, SoCS 2012 (p. 203). https://doi.org/10.1609/socs.v3i1.18257

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