@inproceedings{8869596be46b471d8fce2eaa9eeea52f,
title = "A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates",
abstract = "The shortest path problem in graphs is a cornerstone of AI theory and applications. Existing algorithms generally ignore edge weight computation time. We present a generalized framework for weighted directed graphs, where edge weight can be computed (estimated) multiple times, at increasing accuracy and run-time expense. This raises several generalized variants of the shortest path problem. We introduce the problem of finding a path with the tightest lower-bound on the optimal cost. We then present two complete algorithms for the generalized problem, and empirically demonstrate their efficacy.",
author = "Eyal Weiss and Ariel Felner and Kaminka, {Gal A.}",
note = "Publisher Copyright: {\textcopyright} 2023 The Authors.; 26th European Conference on Artificial Intelligence, ECAI 2023 ; Conference date: 30-09-2023 Through 04-10-2023",
year = "2023",
month = sep,
day = "28",
doi = "10.3233/FAIA230567",
language = "English",
series = "Frontiers in Artificial Intelligence and Applications",
publisher = "IOS Press BV",
pages = "2607--2614",
editor = "Kobi Gal and Kobi Gal and Ann Nowe and Nalepa, {Grzegorz J.} and Roy Fairstein and Roxana Radulescu",
booktitle = "ECAI 2023 - 26th European Conference on Artificial Intelligence, including 12th Conference on Prestigious Applications of Intelligent Systems, PAIS 2023 - Proceedings",
address = "Netherlands",
}