no code implementations • 28 Jan 2024 • Marie-Christine Paré, Vasken Dermardiros, Antoine Lesage-Landry
Model predictive control (MPC) has been shown to significantly improve the energy efficiency of buildings while maintaining thermal comfort.
no code implementations • 20 Nov 2023 • Olivier Daoust, Hasan Nayir, Irfan Azam, Antoine Lesage-Landry, Gunes Karabulut Kurt
The analysis reveals that the reflected signals of the THz can be utilized for the detection of space debris.
no code implementations • 6 Oct 2023 • Olfa Ben Yahia, Zineb Garroussi, Olivier Bélanger, Brunilde Sansò, Jean-François Frigon, Stéphane Martel, Antoine Lesage-Landry, Gunes Karabulut Kurt
High throughput satellites (HTS), with their digital payload technology, are expected to play a key role as enablers of the upcoming 6G networks.
no code implementations • 19 Jun 2023 • Antoine Lesage-Landry, Julien Pallage
We propose the online submodular greedy algorithm (OSGA) which solves to optimality an approximation of the previous round loss function to avoid the NP-hardness of the original problem.
no code implementations • 6 Jan 2023 • Vincent Mai, Philippe Maisonneuve, Tianyu Zhang, Hadi Nekoei, Liam Paull, Antoine Lesage-Landry
To integrate high amounts of renewable energy resources, electrical power grids must be able to cope with high amplitude, fast timescale variations in power generation.
Multi-agent Reinforcement Learning reinforcement-learning +1
no code implementations • 19 Apr 2021 • Antoine Lesage-Landry, Duncan S. Callaway
We evaluate the performance of AMAFQI and compare it to FQI in numerical simulations.
no code implementations • 5 May 2020 • Antoine Lesage-Landry, Joshua A. Taylor, Duncan S. Callaway
Then, we derive a finite-time bound that is sublinear in time and linear in the cumulative variation of the relaxed, continuous round optima.
no code implementations • 31 Jan 2020 • Antoine Lesage-Landry, Duncan S. Callaway
We extend the regret analysis of the online distributed weighted dual averaging (DWDA) algorithm [1] to the dynamic setting and provide the tightest dynamic regret bound known to date with respect to the time horizon for a distributed online convex optimization (OCO) algorithm.
no code implementations • 15 May 2019 • Antoine Lesage-Landry, Iman Shames, Joshua A. Taylor
We show that under these conditions and without any assumptions on the predictability of the environment, the predictive update strictly improves on the performance of the standard update.
no code implementations • 12 Sep 2017 • Antoine Lesage-Landry, Joshua A. Taylor
We use online convex optimization (OCO) for setpoint tracking with uncertain, flexible loads.