Shortest path based decision making using probabilistic inference
We present a new perspective on the classical shortest path routing (SPR) problem in graphs. We show that the SPR problem can be recast to that of probabilistic inference in a mixture of simple Bayesian networks. Maximizing the likelihood in this mixture becomes equivalent to solving the SPR problem...
Saved in:
Main Author: | Akshat KUMAR |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2016
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3396 https://ink.library.smu.edu.sg/context/sis_research/article/4397/viewcontent/ShortestPathBasedDecisionMaking.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Probabilistic Inference Based Message-Passing for Resource Constrained DCOPs
by: GHOSH, Supriyo, et al.
Published: (2015) -
Probabilistic Inference Techniques for Scalable Multiagent Decision Making
by: Akshat KUMAR,, et al.
Published: (2015) -
Dual formulations for optimizing Dec-POMDP controllers
by: Akshat KUMAR,, et al.
Published: (2016) -
Collective multiagent sequential decision making under uncertainty
by: NGUYEN, Duc Thien, et al.
Published: (2017) -
Instance-specific algorithm configuration via unsupervised deep graph clustering
by: SONG, Wen, et al.
Published: (2023)