Optimal Any-Angle Path finding In Practice

dc.contributor.author	Harabor, D.
dc.contributor.author	Grastien, A.
dc.contributor.author	Oz, D.
dc.contributor.author	Aksakalli, V.
dc.date.accessioned	2021-01-25T19:34:03Z
dc.date.available	2021-01-25T19:34:03Z
dc.date.issued	2016
dc.identifier	10.1613/jair.5007
dc.identifier.issn	1076-9757
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/7864
dc.description.abstract	Any-angle path finding 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 foc
dc.description.sponsorship	NICTA; Australian GovernmentAustralian Government; Australian Research Council through the ICT Centre of Excellence programAustralian Research Council; Scientific and Technological Research Council of Turkey (TUBITAK)Turkiye Bilimsel ve Teknolojik Arastir
dc.language.iso	English
dc.publisher	AI ACCESS FOUNDATION
dc.title	Optimal Any-Angle Path finding In Practice
dc.type	Article
dc.relation.firstpage	89
dc.relation.lastpage	118
dc.relation.volume	56
dc.description.woscategory	Computer Science, Artificial Intelligence
dc.description.wosresearcharea	Computer Science
dc.identifier.wosid	WOS:000380243800001

Bu öğenin dosyaları:

Dosyalar	Boyut	Biçim	Göster
Bu öğe ile ilişkili dosya yok.