Caricamento...
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...
Salvato in:
| Pubblicato in: | IEEE Trans Automat Contr |
|---|---|
| Autori principali: | , , , |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
2016
|
| Soggetti: | |
| Accesso online: | 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: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|