Show simple item record

dc.contributor.authorRahmani, Vahid
dc.contributor.authorPelechano Gómez, Núria
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2020-03-24T12:29:33Z
dc.date.available2021-11-05T01:32:40Z
dc.date.issued2020-02
dc.identifier.citationRahmani, V.; Pelechano, N. Multi-agent parallel hierarchical path finding in navigation meshes (MA-HNA*). "Computers & graphics", Febrer 2020, vol. 86, p. 1-14.
dc.identifier.issn0097-8493
dc.identifier.urihttp://hdl.handle.net/2117/181150
dc.description.abstractOne of the main challenges in video games is to compute paths as efficiently as possible for groups of agents. As both the size of the environments and the number of autonomous agents increase, it becomes harder to obtain results in real time under the constraints of memory and computing resources. Hierarchical approaches, such as HNA* (Hierarchical A* for Navigation Meshes) can compute paths more efficiently, although only for certain configurations of the hierarchy. For other configurations, the method suffers from a bottleneck in the step that connects the Start and Goal positions with the hierarchy. This bottleneck can drop performance drastically. In this paper we present two approaches to solve the HNA* bottleneck and thus obtain a performance boost for all hierarchical configurations. The first method relies on further memory storage, and the second one uses parallelism on the GPU. Our comparative evaluation shows that both approaches offer speed-ups as high as 9x faster than A*, and show no limitations based on hierarchical configuration. Finally we show how our CUDA based parallel implementation of HNA* for multi-agent path finding can now compute paths for over 500K agents simultaneously in real-time, with speed-ups above 15x faster than a parallel multi-agent implementation using A*.
dc.format.extent14 p.
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International
dc.rights© 2019 Elsevier
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectÀrees temàtiques de la UPC::Informàtica::Infografia
dc.subject.lcshMultiagent systems
dc.subject.otherMulti-agent path finding
dc.subject.otherHierarchical search
dc.subject.otherParallel path finding
dc.titleMulti-agent parallel hierarchical path finding in navigation meshes (MA-HNA*)
dc.typeArticle
dc.subject.lemacSistemes multiagent
dc.contributor.groupUniversitat Politècnica de Catalunya. ViRVIG - Grup de Recerca en Visualització, Realitat Virtual i Interacció Gràfica
dc.identifier.doi10.1016/j.cag.2019.10.006
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttps://www.sciencedirect.com/science/article/abs/pii/S0097849319301694
dc.rights.accessOpen Access
local.identifier.drac25957495
dc.description.versionPostprint (author's final draft)
dc.relation.projectidinfo:eu-repo/grantAgreement/AEI/TIN2017-88515-C2-1-R
local.citation.authorRahmani, V.; Pelechano, N.
local.citation.publicationNameComputers & graphics
local.citation.volume86
local.citation.startingPage1
local.citation.endingPage14


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 4.0 Generic
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 4.0 Generic