S. Samaranayake, J. Reilly, W. Krichene, J. Lespiau, M. L. Delle Monache, P. Goatin, A. Bayen
{"title":"水平排队网络的部分控制离散时间系统最优动态流量分配(SO-DTA)","authors":"S. Samaranayake, J. Reilly, W. Krichene, J. Lespiau, M. L. Delle Monache, P. Goatin, A. Bayen","doi":"10.1109/ACC.2015.7170811","DOIUrl":null,"url":null,"abstract":"We consider the System Optimal Dynamic Traffic Assignment problem with Partial Control (SO-DTA-PC) for general networks with horizontal queuing. The goal of which is to optimally control any subset of the networks agents to minimize the total congestion of all agents in the network. We adopt a flow dynamics model that is a Godunov discretization of the Lighthill-Williams-Richards (LWR) partial differential equation with a triangular flux function and a corresponding multi-commodity junction solver. Full Lagrangian paths are assumed to be known for the controllable agents, while we only assume knowledge of the aggregate split ratios for the non-controllable (selfish) agents. We solve the resulting finite horizon non-linear optimal control problem using the discrete adjoint method.","PeriodicalId":223665,"journal":{"name":"2015 American Control Conference (ACC)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Discrete-time system optimal dynamic traffic assignment (SO-DTA) with partial control for horizontal queuing networks\",\"authors\":\"S. Samaranayake, J. Reilly, W. Krichene, J. Lespiau, M. L. Delle Monache, P. Goatin, A. Bayen\",\"doi\":\"10.1109/ACC.2015.7170811\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the System Optimal Dynamic Traffic Assignment problem with Partial Control (SO-DTA-PC) for general networks with horizontal queuing. The goal of which is to optimally control any subset of the networks agents to minimize the total congestion of all agents in the network. We adopt a flow dynamics model that is a Godunov discretization of the Lighthill-Williams-Richards (LWR) partial differential equation with a triangular flux function and a corresponding multi-commodity junction solver. Full Lagrangian paths are assumed to be known for the controllable agents, while we only assume knowledge of the aggregate split ratios for the non-controllable (selfish) agents. We solve the resulting finite horizon non-linear optimal control problem using the discrete adjoint method.\",\"PeriodicalId\":223665,\"journal\":{\"name\":\"2015 American Control Conference (ACC)\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 American Control Conference (ACC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACC.2015.7170811\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 American Control Conference (ACC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACC.2015.7170811","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13
摘要
研究了一般水平排队网络的部分控制系统最优动态流量分配问题(SO-DTA-PC)。其目标是最优地控制网络代理的任何子集，以最小化网络中所有代理的总拥塞。我们采用了一个流动动力学模型，该模型是lighthir - williams - richards (LWR)偏微分方程的Godunov离散化，具有三角形通量函数和相应的多商品结求解器。对于可控的智能体，我们假设完整的拉格朗日路径是已知的，而对于不可控的(自私的)智能体，我们只假设知道总分裂比。用离散伴随法求解了有限水平非线性最优控制问题。
Discrete-time system optimal dynamic traffic assignment (SO-DTA) with partial control for horizontal queuing networks
We consider the System Optimal Dynamic Traffic Assignment problem with Partial Control (SO-DTA-PC) for general networks with horizontal queuing. The goal of which is to optimally control any subset of the networks agents to minimize the total congestion of all agents in the network. We adopt a flow dynamics model that is a Godunov discretization of the Lighthill-Williams-Richards (LWR) partial differential equation with a triangular flux function and a corresponding multi-commodity junction solver. Full Lagrangian paths are assumed to be known for the controllable agents, while we only assume knowledge of the aggregate split ratios for the non-controllable (selfish) agents. We solve the resulting finite horizon non-linear optimal control problem using the discrete adjoint method.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
