An Optimal Any-Angle Pathfinding Algorithm

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

Source

International Conference on Automated Planning & Scheduling

Type

Conference paper

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

2037-12-31