Junyan Su
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Junyan Su has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Minghua Chen
Department of Data Science, City University of Hong Kong, Kowloon, Hong Kong
5 shared publications - Qiulin Lin
Department of Data Science, City University of Hong Kong, Hong Kong, China
4 shared publications - Boris Houska
School of Information Science and Technology, ShanghaiTech University, Shanghai, China
3 shared publications - Yuning Jiang
Automatic Control Laboratory, EPFL, Lausanne, Switzerland
3 shared publications - Colin Neil Jones
Automatic Control Laboratory, EPFL, Lausanne, Switzerland
2 shared publications - Juraj Oravec
FCHPT, Slovak University of Technology in Bratislava
2 shared publications
Latest Publications
- Open Access
- 22 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 251-260
Learning When to Update: A Near-Optimal Timing Bandit Approach
- 22 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 251-260
Open AccessLearning When to Update: A Near-Optimal Timing Bandit Approach
- 7 October 2026
- Published by Elsevier in Systems & Control Letters
- Vol. 218
High-performance real-time model predictive control via operator splitting for embedded applications
- 7 October 2026
- Published by Elsevier in Systems & Control Letters
- Vol. 218
High-performance real-time model predictive control via operator splitting for embedded applications
- Open Access
- 29 October 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-16
Optimizing carbon footprint in long-haul heavy-duty E-Truck transportation
Electrifying heavy-duty trucks is crucial for decarbonizing transportation, but maximizing their potential requires minimizing the carbon footprint of timely deliveries. This complex optimization task involves strategic path, speed, and charging planning, which traditional methods struggle to optimize at scale. We present a stage-expanded graph formulation that reduces complexity and reveals a useful problem structure. Our formulation naturally decomposes the problem into more tractable subproblems, allowing efficient coordination between routing and charging decisions, and maintains a manageable graph size. We exploit these structural insights to design an efficient algorithm with performance guarantees. Simulations using real-world data over the U.S. highway system demonstrate that our method complements the 36% carbon reduction from electrification with an additional 25% decrease, totaling a 61% reduction. Moreover, our carbon-optimized strategy, applicable to various truck types, can achieve comparable carbon reductions 9 years sooner than zero-emission truck adoption alone. This approach accelerates transportation decarbonization, offering a powerful tool in the fight against climate change.
- 29 October 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-16
Open AccessOptimizing carbon footprint in long-haul heavy-duty E-Truck transportation
Electrifying heavy-duty trucks is crucial for decarbonizing transportation, but maximizing their potential requires minimizing the carbon footprint of timely deliveries. This complex optimization task involves strategic path, speed, and charging planning, which traditional methods struggle to optimize at scale. We present a stage-expanded graph formulation that reduces complexity and reveals a useful problem structure. Our formulation naturally decomposes the problem into more tractable subproblems, allowing efficient coordination between routing and charging decisions, and maintains a manageable graph size. We exploit these structural insights to design an efficient algorithm with performance guarantees. Simulations using real-world data over the U.S. highway system demonstrate that our method complements the 36% carbon reduction from electrification with an additional 25% decrease, totaling a 61% reduction. Moreover, our carbon-optimized strategy, applicable to various truck types, can achieve comparable carbon reductions 9 years sooner than zero-emission truck adoption alone. This approach accelerates transportation decarbonization, offering a powerful tool in the fight against climate change.
- 8 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (6) , 3146-3161
Optimal Algorithms for Online Age-of-Information Optimization in Energy Harvesting Systems
We consider the scenario where an energy harvesting source sends its updates to a receiver. The source optimizes its energy allocation over a decision period to maximize a sum of time-varying functions of the age of information (AoI), representing the value of providing timely information. In a practical online setting, we need to make irrevocable energy allocation decisions at each time while the time-varying functions and the energy arrivals are only revealed sequentially. The problem is then challenging as 1) we are facing uncertain energy harvesting arrivals and time-varying functions, and 2) the energy allocation decisions and the energy harvesting process are coupled due to the capacity-limited battery. In this paper, we develop an optimal online algorithm $\textsf {CR-RePursuit}$ and show it achieves $(\ln \theta +1)$ -competitiveness, where $\theta $ is a parameter representing the level of uncertainty of the time-varying functions. It is the optimal competitive ratio among all deterministic and randomized online algorithms. We also introduce an adaptive variant of the algorithm, +, that further exploits the revealed information to obtain significantly improved empirical performance. We conduct simulations based on real-world traces and compare our algorithms with conceivable alternatives. The results show that our algorithms achieve 15% performance improvement as compared to the state-of-the-art baseline.
- 8 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 33 (6) , 3146-3161
Optimal Algorithms for Online Age-of-Information Optimization in Energy Harvesting Systems
We consider the scenario where an energy harvesting source sends its updates to a receiver. The source optimizes its energy allocation over a decision period to maximize a sum of time-varying functions of the age of information (AoI), representing the value of providing timely information. In a practical online setting, we need to make irrevocable energy allocation decisions at each time while the time-varying functions and the energy arrivals are only revealed sequentially. The problem is then challenging as 1) we are facing uncertain energy harvesting arrivals and time-varying functions, and 2) the energy allocation decisions and the energy harvesting process are coupled due to the capacity-limited battery. In this paper, we develop an optimal online algorithm $\textsf {CR-RePursuit}$ and show it achieves $(\ln \theta +1)$ -competitiveness, where $\theta $ is a parameter representing the level of uncertainty of the time-varying functions. It is the optimal competitive ratio among all deterministic and randomized online algorithms. We also introduce an adaptive variant of the algorithm, +, that further exploits the revealed information to obtain significantly improved empirical performance. We conduct simulations based on real-world traces and compare our algorithms with conceivable alternatives. The results show that our algorithms achieve 15% performance improvement as compared to the state-of-the-art baseline.
- Open Access
- 8 March 2025
- Published by Elsevier in European Journal of Control
- Vol. 83
Fast and Lightweight: A real-time parallelizable MPC for embedded systems
- 8 March 2025
- Published by Elsevier in European Journal of Control
- Vol. 83
Open AccessFast and Lightweight: A real-time parallelizable MPC for embedded systems
- 16 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (2) , 1454-1469
Minimizing Emission for Timely Heavy-Duty Truck Transportation
We consider the problem of minimizing emission of a heavy-duty truck transporting freight between two locations subject to a hard deadline constraint. The truck is equipped with a multi-speed transmission and a modern combustion engine that intelligently switches among multiple fuel injection strategies at certain engine speeds (called switching speeds ) to achieve lower emission profiles. Our objective is to minimize the emission by optimizing both path and speed planning for heavy-duty trucks with multi-speed transmission and multiple injection strategies in the engine. This emission minimization problem, while pervasive in practice, has two challenges: i) the emission rate function is discontinuous and non-convex due to switching of the fuel injections and gear ratios, which makes the common practice of driving at a constant speed on a road segment not eco-friendly; ii) the problem is NP-hard due to the combinatorial nature of the simultaneous path and speed planning. We tackle the first challenge by considering the case where the truck can travel at a heterogeneous speed profile over a road segment and then formulate the speed planning problem as a convex problem. We further identify special structures in this problem and provide an efficient method for computing the optimal speed profile. We then tackle the second challenge by developing an efficient heuristic for both path planning and speed planning to solve the emission minimization problem on the scale of national highway systems. Our extensive simulations on the US highway system show that our solution reduces up to 46% NOx emission as compared to the commonly-adopted fastest path approach. We also find that optimizing heterogeneous speed profiles reduce up to 32% emission as compared to their homogeneous counterpart, thus are necessary to be considered in eco-friendly truck operations.
- 16 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 26 (2) , 1454-1469
Minimizing Emission for Timely Heavy-Duty Truck Transportation
We consider the problem of minimizing emission of a heavy-duty truck transporting freight between two locations subject to a hard deadline constraint. The truck is equipped with a multi-speed transmission and a modern combustion engine that intelligently switches among multiple fuel injection strategies at certain engine speeds (called switching speeds ) to achieve lower emission profiles. Our objective is to minimize the emission by optimizing both path and speed planning for heavy-duty trucks with multi-speed transmission and multiple injection strategies in the engine. This emission minimization problem, while pervasive in practice, has two challenges: i) the emission rate function is discontinuous and non-convex due to switching of the fuel injections and gear ratios, which makes the common practice of driving at a constant speed on a road segment not eco-friendly; ii) the problem is NP-hard due to the combinatorial nature of the simultaneous path and speed planning. We tackle the first challenge by considering the case where the truck can travel at a heterogeneous speed profile over a road segment and then formulate the speed planning problem as a convex problem. We further identify special structures in this problem and provide an efficient method for computing the optimal speed profile. We then tackle the second challenge by developing an efficient heuristic for both path planning and speed planning to solve the emission minimization problem on the scale of national highway systems. Our extensive simulations on the US highway system show that our solution reduces up to 46% NOx emission as compared to the commonly-adopted fastest path approach. We also find that optimizing heterogeneous speed profiles reduce up to 32% emission as compared to their homogeneous counterpart, thus are necessary to be considered in eco-friendly truck operations.
- Open Access
- 29 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 258-259
Minimizing Carbon Footprint for Timely E-Truck Transportation
Electrifying heavy-duty trucks is essential for decarbonizing the transportation sector and combating climate change. To fully leverage the advantages of electric trucks (E-Trucks), we need to optimize the operational carbon footprint by carefully planning routes, speeds, and charging stops, despite complex logistics and tight schedules. We propose a novel stage-expanded graph formulation that simplifies these challenges, allowing us to develop an efficient algorithm with strong performance guarantees. Utilizing real-world data from U.S. highway network, we conduct extensive simulation and show that our approach not only enhances the inherent 44% carbon reduction from electrification alone but adds an extra 24%, totaling a 68% decrease.
- 29 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 258-259
Open AccessMinimizing Carbon Footprint for Timely E-Truck Transportation
Electrifying heavy-duty trucks is essential for decarbonizing the transportation sector and combating climate change. To fully leverage the advantages of electric trucks (E-Trucks), we need to optimize the operational carbon footprint by carefully planning routes, speeds, and charging stops, despite complex logistics and tight schedules. We propose a novel stage-expanded graph formulation that simplifies these challenges, allowing us to develop an efficient algorithm with strong performance guarantees. Utilizing real-world data from U.S. highway network, we conduct extensive simulation and show that our approach not only enhances the inherent 44% carbon reduction from electrification alone but adds an extra 24%, totaling a 68% decrease.
- Open Access
- 16 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 159-171
Follow the Sun and Go with the Wind: Carbon Footprint Optimized Timely E-Truck Transportation
- 16 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 159-171
Open AccessFollow the Sun and Go with the Wind: Carbon Footprint Optimized Timely E-Truck Transportation
- 4 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 9 (9) , 1412-1416
Distributed Optimization for Massive Connectivity
Massive device connectivity in Internet of Thing (IoT) networks with sporadic traffic poses significant communication challenges. To overcome this challenge, the serving base station is required to detect the active devices and estimate the corresponding channel state information during each coherence block. The corresponding joint activity detection and channel estimation problem can be formulated as a group sparse estimation problem, also known under the name “Group Lasso”. This letter presents a fast and efficient distributed algorithm to solve such Group Lasso problems, which alternates between solving small-scaled problems in parallel and dealing with a linear equation for consensus. Numerical results demonstrate the speedup of this algorithm compared with the state-of-the-art methods in terms of convergence speed and computation time.
- 4 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 9 (9) , 1412-1416
Distributed Optimization for Massive Connectivity
Massive device connectivity in Internet of Thing (IoT) networks with sporadic traffic poses significant communication challenges. To overcome this challenge, the serving base station is required to detect the active devices and estimate the corresponding channel state information during each coherence block. The corresponding joint activity detection and channel estimation problem can be formulated as a group sparse estimation problem, also known under the name “Group Lasso”. This letter presents a fast and efficient distributed algorithm to solve such Group Lasso problems, which alternates between solving small-scaled problems in parallel and dealing with a linear equation for consensus. Numerical results demonstrate the speedup of this algorithm compared with the state-of-the-art methods in terms of convergence speed and computation time.
- 1 January 2020
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 53 (2) , 17113-17118
Distributed Multi-Building Coordination for Demand Response
- 1 January 2020
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 53 (2) , 17113-17118
Distributed Multi-Building Coordination for Demand Response