Pengbo Zhu

Pengbo Zhu
Pengbo Zhu
PhD Student
EPF Lausanne
As the creator of intelligent machine, it’s our turn to endow them with the concepts of control and optimization, which we human beings have innately.

Pengbo Zhu is a PhD student in the Laboratory of Urban Transport systems(LUTS) in EPFL Lausanne. She obtained her bachelor degree in Automation in 2017, and her master degree in Control Science and Engineering in 2019 both from Harbin Institute of Technology, China. Her research interests are model and automatic control, optimization with applications in transport system.

Pengbo has taken part in the #NCCRWomen campaign. You can see her great video here

Scientific Publications

Published
Data-Enabled Predictive Control for Empty Vehicle Rebalancing
European Control Conference (ECC 23)
Published
Idle-vehicle rebalancing coverage control for ride-sourcing systems
2022 European Control Conference (ECC)
Pages 1970-1975

Research projects as Researcher

Title
Principal Investigators

Distributed Dynamic Coverage Control for On-Demand Transportation Operations

Summary

Emerging shared-mobility systems create additional opportunities to decrease car ownership and congestion. Asymmetric demand creates imbalances in the distribution of vehicles for these systems. To maximize the covered demand and decrease the waiting time of passengers, vehicle distribution has to be rebalanced with relocations. The potentially very high number of vehicles necessitates using distributed control algorithms to efficiently solve this problem. Presence of multiple companies competing to serve the same demand can be addressed via game theoretic approaches. Μatching algorithms to create shared rides can be combined with the coverage problem to increase coverage in areas with high demand. Fairness in covering low demand areas will also be investigated.

Distributed Dynamic Coverage Control for On-Demand Transportation Operations

Emerging shared-mobility systems create additional opportunities to decrease car ownership and congestion. Asymmetric demand creates imbalances in the distribution of vehicles for these systems. To maximize the covered demand and decrease the waiting time of passengers, vehicle distribution has to be rebalanced with relocations. The potentially very high number of vehicles necessitates using distributed control algorithms to efficiently solve this problem. Presence of multiple companies competing to serve the same demand can be addressed via game theoretic approaches. Μatching algorithms to create shared rides can be combined with the coverage problem to increase coverage in areas with high demand. Fairness in covering low demand areas will also be investigated.

105
91547dbb-fb8b-4801-9b24-09f41492e308