Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

An Optimal Any-Angle Pathfinding Algorithm

Thumbnail Image

Date

2013

Authors

Harabor, Daniel
Grastien, Alban

Journal Title

Journal ISSN

Volume Title

Publisher

AAAI Press

Abstract

Any-angle pathfinding is a common problem from robotics and computer games: it requires finding a Euclidean shortest path between a pair of points in a grid map. Prior research has focused on approximate online solutions. A number of exact methods exist b

Description

Keywords

Keywords: Euclidean shortest path; Exact methods; Game development; Memory overheads; Optimal paths; Path-finding algorithms; Pathfinding; Preprocessing time; Algorithms; Artificial intelligence; Optimization

Citation

URI

http://hdl.handle.net/1885/65981

Collections

ANU Research Publications

Source

International Conference on Automated Planning & Scheduling

Type

Conference paper

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

2037-12-31

Downloads

File
Description
01_Harabor_An_Optimal_Any-Angle_2013.pdf (486.31 KB)

DSpace software copyright © 2002-2026 LYRASIS