Optimal any-angle pathfinding in practice
Özet
Any-angle pathfinding is a fundamental problem in robotics and computer games. The goal is to find a shortest path between a pair of points on a grid map such that the path is not artificially constrained to the points of the grid. Prior research has focu
Bağlantı
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84975256233&doi=10.1613%2fjair.5007&partnerID=40&md5=d3d21d774046d1fe3f493c5a6e538113https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10202
Koleksiyonlar
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..