arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1602.01028eess.SYcs.SY
收藏

一种可证明正确的MPC方法用于城市交通网络的安全控制

A Provably Correct MPC Approach to Safety Control of Urban Traffic Networks

Boston University(波士顿大学)

Sadra Sadraddini, Calin Belta

AI总结:

本文提出一种可证明正确的MPC方法,通过在安全集内寻找鲁棒受控不变集来优化有限时间成本函数,确保城市交通网络的长期安全性能。

摘要:

模型预测控制(MPC)是一种用于城市交通管理的流行策略,能够整合物理和用户定义的约束。然而,当前的MPC方法依赖于有限时间 horizon 的预测,无法保证在长时间内具有 desirable 的行为。在本文中,我们设计了一种MPC策略,该策略能够保证网络演化的安全集内保持 desirable 但任意的安全集,同时优化有限时间 horizon 成本函数。我们的方法依赖于在安全集内寻找一个鲁棒受控不变集,该集为MPC优化问题提供适当的终端约束。一个示例性例子被包含在内。

英文摘要:

Model predictive control (MPC) is a popular strategy for urban traffic management that is able to incorporate physical and user defined constraints. However, the current MPC methods rely on finite horizon predictions that are unable to guarantee desirable behaviors over long periods of time. In this paper we design an MPC strategy that is guaranteed to keep the evolution of a network in a desirable yet arbitrary -safe- set, while optimizing a finite horizon cost function. Our approach relies on finding a robust controlled invariant set inside the safe set that provides an appropriate terminal constraint for the MPC optimization problem. An illustrative example is included.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑