Hierarchical path-finding for Navigation Meshes (HNA⁎)-Reference-Cited by-同舟云学术

Hierarchical path-finding for Navigation Meshes (HNA⁎)

Published:2016-10 Issue: Volume:59 Page:68-78
ISSN:0097-8493
Container-title:Computers & Graphics
language:en
Short-container-title:Computers & Graphics

Author:

Pelechano Nuria^ORCID,Fuentes Carlos

Funder

Spanish Ministry of Science and Innovation and FEDER

Publisher

Elsevier BV

Subject

Computer Graphics and Computer-Aided Design,Human-Computer Interaction,General Engineering

Reference39 articles.

1. A formal basis for the heuristic determination of minimum cost paths;Hart;IEEE Trans Syst Sci Cybern SSC,1968

2. Ara⁎;Likhachev;Adv Neural Inf Process Syst,2004

3. Koenig S, Likhachev M. D⁎lite, Eighteenth national conference on artificial intelligence; 2002. p. 476–83.

4. Likhachev M, Ferguson D, Gordon G, Stentz AT, Thrun S. Anytime dynamic a⁎: an anytime, replanning algorithm. In: Proceedings of the international conference on automated planning and scheduling (ICAPS); 2005. pp. 262–71.

5. Lee W, Lawrence R. Trading space for time in grid-based path finding. AAAI.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Accelerated Path Planning for Large-Scale Grid Maps;IEEE Access;2024

2. Formation‐Aware Planning and Navigation with Corridor Shortest Path Maps;Computer Graphics Forum;2023-12-04

3. A fine-grained navigation network construction method for urban environments;International Journal of Applied Earth Observation and Geoinformation;2022-09

4. Hierarchical and smoothed topographic path planning for large-scale virtual simulation environments;Expert Systems with Applications;2022-03

5. Toward competitive multi-agents in Polo game based on reinforcement learning;Multimedia Tools and Applications;2021-05-09