29 October 2025 in Nature Communications
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.
4 May 2020 in IEEE Wireless Communications Letters
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.
8 March 2025 in European Journal of Control
8 July 2025 in IEEE Transactions on Networking
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.
16 December 2024 in IEEE Transactions on Intelligent Transportation Systems
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.