Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering.
Mikko LauriAino RopponenRisto RitalaPublished in: Ann. Math. Artif. Intell. (2017)
Keyphrases
- information gathering
- shortest path
- directed acyclic graph
- shortest path problem
- information fusion
- resource bounded
- shortest path algorithm
- equivalence class
- equivalence classes
- structural learning
- decision making
- conditional independence
- road network
- path length
- directed graph
- causal models
- random variables
- minimal surface
- flow graph
- weighted graph
- undirected graph
- travel time
- data fusion
- decision process
- markov property
- minimum cost flow
- finding the shortest path
- spatial networks
- social network analysis
- evolutionary algorithm
- optimal solution