2021 IEEE International Intelligent Transportation Systems Conference (ITSC) 2021
DOI: 10.1109/itsc48978.2021.9564651
|View full text |Cite
|
Sign up to set email alerts
|

Graph Embedding and Approximate Dynamic Programming for the Reliable Shortest Path Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 19 publications
0
1
0
Order By: Relevance
“…Dynamic programming techniques based on the greedy approach are well-suited for path planning on large, wide roads [23][24][25]. For example, in reference [26], a solution was proposed that uses dynamic programming to inspire continuous state spaces and obtain globally optimal path planning.…”
Section: Introductionmentioning
confidence: 99%
“…Dynamic programming techniques based on the greedy approach are well-suited for path planning on large, wide roads [23][24][25]. For example, in reference [26], a solution was proposed that uses dynamic programming to inspire continuous state spaces and obtain globally optimal path planning.…”
Section: Introductionmentioning
confidence: 99%