@techreport{oai:ipsj.ixsq.nii.ac.jp:00200710,
 author = {足立, 亮介 and 若佐, 裕治 and 小林, 孝一 and Ryosuke, Adachi and Yuji, Wakasa and Koichi, Kobayashi},
 issue = {22},
 month = {Nov},
 note = {本稿では，グラフ上の動的輸送問題を考える．複数のエージェントはグラフ上に配置された資源をそれぞれの目的場所に輸送する．各エージェントはグラフ上に割り当られた容量を共有しながら輸送を行う．この時，最小の時間で輸送する問題を有限時間の最適制御問題として最適化する．この最適化問題は，交互方向乗数法を用いて分
散的に解かれる．, In this paper, a dynamical transportation problem over the graph is discussed. Over the graph, more than one agent transports its own assets to goals. In ransportation, all agents share capacities of nodes and edges. We formulate the optimization problem such that a transportation time is minimized by using finite optimal control problems. The optimization problem is dispersively solved by using the alternating direction method of multipliers.},
 title = {ADMMを用いたグラフ上の動的輸送},
 year = {2019}
}