A pathfinding problem for search trees with unknown edge length

DOI10.1016/J.JDA.2018.04.002zbMath1400.68156OpenAlexW2796967789MaRDI QIDQ1784979

Koichi Kobayashi, Kunihiko Hiraishi

Publication date: 27 September 2018

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2018.04.002

zbMATH Keywords

planning problemonline algorithmshortest path problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Online algorithms; streaming algorithms (68W27)

Cites Work

• Depth-first iterative-deepening: An optimal admissible tree search

This page was built for publication: A pathfinding problem for search trees with unknown edge length