Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2503.10934 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929759694356480 |
|---|---|
| author | Li, Zhexian Savla, Ketan |
| author_facet | Li, Zhexian Savla, Ketan |
| contents | This paper designs traffic signal control policies for a network of signalized intersections without knowing the demand and parameters. Within a model predictive control (MPC) framework, control policies consist of an algorithm that estimates parameters and a one-step MPC that computes control inputs using estimated parameters. The algorithm switches between different terminal sets of the MPC to explore different regions of the state space, where different parameters are identifiable. The one-step MPC minimizes a cost that approximates the sum of squares of all the queue lengths within a constant and does not require demand information. We show that the algorithm can estimate parameters exactly in finite time, and the one-step MPC renders maximum throughput in terms of input-to-state practical stability. Simulations indicate better transient performance regarding queue lengths under our proposed policies than existing ones. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_10934 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Adaptive model predictive control for traffic signal timing with unknown demand and parameters Li, Zhexian Savla, Ketan Systems and Control This paper designs traffic signal control policies for a network of signalized intersections without knowing the demand and parameters. Within a model predictive control (MPC) framework, control policies consist of an algorithm that estimates parameters and a one-step MPC that computes control inputs using estimated parameters. The algorithm switches between different terminal sets of the MPC to explore different regions of the state space, where different parameters are identifiable. The one-step MPC minimizes a cost that approximates the sum of squares of all the queue lengths within a constant and does not require demand information. We show that the algorithm can estimate parameters exactly in finite time, and the one-step MPC renders maximum throughput in terms of input-to-state practical stability. Simulations indicate better transient performance regarding queue lengths under our proposed policies than existing ones. |
| title | Adaptive model predictive control for traffic signal timing with unknown demand and parameters |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2503.10934 |