A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates

Eyal Weiss; Ariel Felner; Gal A. Kaminka

doi:10.3233/FAIA230567

A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates

Eyal Weiss, Ariel Felner, Gal A. Kaminka

Department of Computer Science

Ben-Gurion University of the Negev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

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.

Original language	English
Title of host publication	ECAI 2023 - 26th European Conference on Artificial Intelligence, including 12th Conference on Prestigious Applications of Intelligent Systems, PAIS 2023 - Proceedings
Editors	Kobi Gal, Kobi Gal, Ann Nowe, Grzegorz J. Nalepa, Roy Fairstein, Roxana Radulescu
Publisher	IOS Press BV
Pages	2607-2614
Number of pages	8
ISBN (Electronic)	9781643684369
DOIs	https://doi.org/10.3233/FAIA230567
State	Published - 28 Sep 2023
Event	26th European Conference on Artificial Intelligence, ECAI 2023 - Krakow, Poland Duration: 30 Sep 2023 → 4 Oct 2023

Publication series

Name	Frontiers in Artificial Intelligence and Applications
Volume	372
ISSN (Print)	0922-6389
ISSN (Electronic)	1879-8314

Conference

Conference	26th European Conference on Artificial Intelligence, ECAI 2023
Country/Territory	Poland
City	Krakow
Period	30/09/23 → 4/10/23

Bibliographical note

Publisher Copyright:
© 2023 The Authors.

Funding

The research was partially funded by ISF Grant #2306/18 and BSF-NSF grant 2017764. Thanks to K. Ushi. This research was also supported by ISF grant #909/23 to Ariel Felner. Eyal Weiss is supported by the Adams Fellowship Program of the Israel Academy of Sciences and Humanities and by Bar-Ilan University’s President Scholarship.

Funders	Funder number
BSF-NSF	2017764, 909/23
Bar-Ilan University
Israel Academy of Sciences and Humanities
Israel Science Foundation	2306/18

Access to Document

10.3233/FAIA230567

Cite this

Weiss, E., Felner, A., & Kaminka, G. A. (2023). A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates. In K. Gal, K. Gal, A. Nowe, G. J. Nalepa, R. Fairstein, & R. Radulescu (Eds.), ECAI 2023 - 26th European Conference on Artificial Intelligence, including 12th Conference on Prestigious Applications of Intelligent Systems, PAIS 2023 - Proceedings (pp. 2607-2614). (Frontiers in Artificial Intelligence and Applications; Vol. 372). IOS Press BV. https://doi.org/10.3233/FAIA230567

Weiss, Eyal ; Felner, Ariel ; Kaminka, Gal A. / A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates. ECAI 2023 - 26th European Conference on Artificial Intelligence, including 12th Conference on Prestigious Applications of Intelligent Systems, PAIS 2023 - Proceedings. editor / Kobi Gal ; Kobi Gal ; Ann Nowe ; Grzegorz J. Nalepa ; Roy Fairstein ; Roxana Radulescu. IOS Press BV, 2023. pp. 2607-2614 (Frontiers in Artificial Intelligence and Applications).

@inproceedings{109d1b4cad114a3fb32500c5e0d87865,

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 = "אנגלית",

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 = "הולנד",

}

Weiss, E, Felner, A & Kaminka, GA 2023, A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates. in K Gal, K Gal, A Nowe, GJ Nalepa, R Fairstein & R Radulescu (eds), ECAI 2023 - 26th European Conference on Artificial Intelligence, including 12th Conference on Prestigious Applications of Intelligent Systems, PAIS 2023 - Proceedings. Frontiers in Artificial Intelligence and Applications, vol. 372, IOS Press BV, pp. 2607-2614, 26th European Conference on Artificial Intelligence, ECAI 2023, Krakow, Poland, 30/09/23. https://doi.org/10.3233/FAIA230567

A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates. / Weiss, Eyal; Felner, Ariel; Kaminka, Gal A.
ECAI 2023 - 26th European Conference on Artificial Intelligence, including 12th Conference on Prestigious Applications of Intelligent Systems, PAIS 2023 - Proceedings. ed. / Kobi Gal; Kobi Gal; Ann Nowe; Grzegorz J. Nalepa; Roy Fairstein; Roxana Radulescu. IOS Press BV, 2023. p. 2607-2614 (Frontiers in Artificial Intelligence and Applications; Vol. 372).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates

AU - Weiss, Eyal

AU - Felner, Ariel

AU - Kaminka, Gal A.

PY - 2023/9/28

Y1 - 2023/9/28

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85175827109&partnerID=8YFLogxK

U2 - 10.3233/FAIA230567

DO - 10.3233/FAIA230567

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85175827109

T3 - Frontiers in Artificial Intelligence and Applications

SP - 2607

EP - 2614

BT - ECAI 2023 - 26th European Conference on Artificial Intelligence, including 12th Conference on Prestigious Applications of Intelligent Systems, PAIS 2023 - Proceedings

A2 - Gal, Kobi

A2 - Nowe, Ann

A2 - Nalepa, Grzegorz J.

A2 - Fairstein, Roy

A2 - Radulescu, Roxana

PB - IOS Press BV

T2 - 26th European Conference on Artificial Intelligence, ECAI 2023

Y2 - 30 September 2023 through 4 October 2023

ER -

Weiss E, Felner A, Kaminka GA. A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates. In Gal K, Gal K, Nowe A, Nalepa GJ, Fairstein R, Radulescu R, editors, ECAI 2023 - 26th European Conference on Artificial Intelligence, including 12th Conference on Prestigious Applications of Intelligent Systems, PAIS 2023 - Proceedings. IOS Press BV. 2023. p. 2607-2614. (Frontiers in Artificial Intelligence and Applications). doi: 10.3233/FAIA230567

A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this