Graph planning with expected finite horizon

DOI10.1016/j.jcss.2022.04.003zbMath1487.68209arXiv1802.03642OpenAlexW2787230815MaRDI QIDQ2672939

Krishnendu Chatterjee, Laurent Doyen

Publication date: 13 June 2022

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.03642

zbMATH Keywords

shortest pathfinite horizonexpected stopping timegraph planning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Stopping times; optimal stopping problems; gambling theory (60G40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• The directed subgraph homeomorphism problem
• A characterization of the minimum cycle mean in a digraph
• The Complexity of Markov Decision Processes
• Planning Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item