An Optimal Any-Angle Pathfinding Algorithm
Loading...
Date
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
Citation
Collections
Source
International Conference on Automated Planning & Scheduling
Type
Book Title
Entity type
Access Statement
License Rights
DOI
Restricted until
2037-12-31
Downloads
File
Description