Cart (Loading....) | Create Account
Close category search window

Partially Precomputed A ^{\ast }

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Hewlett, W. ; Dept. of Comput. Sci., Univ. of California Los Angeles, Los Angeles, CA, USA

A* is a commonly used technique for finding shortest paths for navigation in video games. We propose partially precomputed A* (PPA*), which is much faster than A* at runtime, and uses much less memory than completely precalculating all shortest paths with an algorithm such as Floyd-Warshall. At runtime, PPA* is very similar to A*, so it is simple and safe to integrate into existing video game code bases.

Published in:

Computational Intelligence and AI in Games, IEEE Transactions on  (Volume:3 ,  Issue: 2 )

Date of Publication:

June 2011

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.