.png){kind=icon}
返回
Efficient Robust Routing for Single Commodity Network Flows
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2017.2763418.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study single commodity network flows with suitable robustness and efficiency specs. An original use of a maximum entropy problem for distributions on the paths of the graph turns this problem into a steering problem for Markov chains with prescribed initial and final marginals. From a computational standpoint, viewing scheduling this way is especially attractive in light of the existence of an iterative algorithm to compute the solution. This paper builds on the work proposed by Y. Chen et al., [Robust transport over networks, IEEE Transactions on Automatic Control, vol. 62, no. 9, pp. 4675-4682, Sep. 2017] by introducing an index of efficiency of a transportation plan and points, accordingly, to efficient robust transport policies. In developing the theory, we establish two new invariance properties of the solution (called bridge)-an iterated bridge invariance property and the invariance of the most probable paths. These properties, which were tangentially mentioned in our previous work, are fully developed here. We also show that the distribution on paths of the optimal transport policy, which depends on a temperature parameter, tends to the solution of the most economical but possibly less robust optimal mass transport problem as the temperature goes to zero. The relevance of all of these properties for transport over networks is illustrated in an example.
Keyword:
Maximum entropy problem
most probable path
temperature parameter
transport over networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Elastic deformability and luminescence of crystals of polyhalogenated platinum(ii)–bipyridine complexes.png)
CrystEngComm
CrystEngCommIF0
PREAI
分享收藏分享收藏分享收藏
查看更多内容