A generalization of the shortest path problem to graphs with multiple edge-cost estimates (Student abstract)

Eyal Weiss

doi:10.1609/socs.v16i1.27316

A generalization of the shortest path problem to graphs with multiple edge-cost estimates (Student abstract)

Eyal Weiss

Department of Computer Science

Research output: Contribution to journal › Conference article › peer-review

Abstract

The shortest path problem in graphs is a cornerstone of AI theory and applications. Existing algorithms generally ignore edge weight computation time. In this paper 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 a generalized shortest path problem that optimizes different aspects of path cost and its uncertainty. We describe in high-level a complete anytime algorithm for the generalized problem and discuss possible future extensions.

Original language	English
Pages (from-to)	206-207
Number of pages	2
Journal	The International Symposium on Combinatorial Search
Volume	16
Issue number	1
DOIs	https://doi.org/10.1609/socs.v16i1.27316
State	Published - 2023
Event	16th International Symposium on Combinatorial Search, SoCS 2023 - Prague, Czech Republic Duration: 14 Jul 2023 → 16 Jul 2023

Bibliographical note

Publisher Copyright:
© 2023, Association for the Advancement of Artificial Intelligence (www.aaai.org).

Funding

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

Funders	Funder number
BSF-NSF	2017764
Israel Academy of Sciences and Humanities
Israel Science Foundation	2306/18

Access to Document

10.1609/socs.v16i1.27316

Cite this

@article{79b60a7281a64c9182d611ee11424569,

title = "A generalization of the shortest path problem to graphs with multiple edge-cost estimates (Student abstract)",

abstract = "The shortest path problem in graphs is a cornerstone of AI theory and applications. Existing algorithms generally ignore edge weight computation time. In this paper 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 a generalized shortest path problem that optimizes different aspects of path cost and its uncertainty. We describe in high-level a complete anytime algorithm for the generalized problem and discuss possible future extensions.",

author = "Eyal Weiss",

note = "Publisher Copyright: {\textcopyright} 2023, Association for the Advancement of Artificial Intelligence (www.aaai.org).; 16th International Symposium on Combinatorial Search, SoCS 2023 ; Conference date: 14-07-2023 Through 16-07-2023",

year = "2023",

doi = "10.1609/socs.v16i1.27316",

language = "אנגלית",

volume = "16",

pages = "206--207",

journal = "The International Symposium on Combinatorial Search",

issn = "2832-9171",

publisher = "Association for the Advancement of Artificial Intelligence",

number = "1",

}

TY - JOUR

T1 - A generalization of the shortest path problem to graphs with multiple edge-cost estimates (Student abstract)

AU - Weiss, Eyal

PY - 2023

Y1 - 2023

N2 - The shortest path problem in graphs is a cornerstone of AI theory and applications. Existing algorithms generally ignore edge weight computation time. In this paper 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 a generalized shortest path problem that optimizes different aspects of path cost and its uncertainty. We describe in high-level a complete anytime algorithm for the generalized problem and discuss possible future extensions.

AB - The shortest path problem in graphs is a cornerstone of AI theory and applications. Existing algorithms generally ignore edge weight computation time. In this paper 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 a generalized shortest path problem that optimizes different aspects of path cost and its uncertainty. We describe in high-level a complete anytime algorithm for the generalized problem and discuss possible future extensions.

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

U2 - 10.1609/socs.v16i1.27316

DO - 10.1609/socs.v16i1.27316

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:85180550037

SN - 2832-9171

VL - 16

SP - 206

EP - 207

JO - The International Symposium on Combinatorial Search

JF - The International Symposium on Combinatorial Search

IS - 1

T2 - 16th International Symposium on Combinatorial Search, SoCS 2023

Y2 - 14 July 2023 through 16 July 2023

ER -

A generalization of the shortest path problem to graphs with multiple edge-cost estimates (Student abstract)

Abstract

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this