Chargement en cours...
Robust transport over networks
We consider transportation over a strongly connected, directed graph. The scheduling amounts to selecting transition probabilities for a discrete-time Markov evolution which is designed to be consistent with initial and final marginal constraints on mass transport. We address the situation where ini...
Enregistré dans:
| Publié dans: | IEEE Trans Automat Contr |
|---|---|
| Auteurs principaux: | , , , |
| Format: | Artigo |
| Langue: | Inglês |
| Publié: |
2016
|
| Sujets: | |
| Accès en ligne: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5600536/ https://ncbi.nlm.nih.gov/pubmed/28924302 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1109/TAC.2016.2626796 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|