IFAC-PapersOnLinePub Date : 2025-01-01DOI: 10.1016/j.ifacol.2025.06.009
Mohammad Ahmadasas , Mate Siket , Mudassir M. Rashid , Ali Cinar , Mustafa Bilgic
{"title":"Stochastic Model Predictive Control of Blood Glucose Levels using Probabilistic Meal Anticipation⁎","authors":"Mohammad Ahmadasas , Mate Siket , Mudassir M. Rashid , Ali Cinar , Mustafa Bilgic","doi":"10.1016/j.ifacol.2025.06.009","DOIUrl":"10.1016/j.ifacol.2025.06.009","url":null,"abstract":"<div><div>Unannounced meals introduce substantial disturbances, causing large deviations in blood glucose concentrations from the desired range. Accurate estimation of meal timing and size is crucial for precise state estimation in a Kalman filter. Achieving accurate meal estimation remains a challenging task for fully-automated insulin delivery systems. This paper proposes incorporating a correction mechanism for the estimated states, where missed meals are detected by a neural network. Additionally, a Bayesian network is utilized to forecast timing probabilities of the next meal. Our proposed stochastic model predictive controller (SMPC) incorporates predicted meal scenarios. We evaluate the controller performance with respect to the stochasticity of the dietary patterns; the results illustrate that integrating the most likely meal scenarios into SMPC decision-making enhances both robustness and performance.</div></div>","PeriodicalId":37894,"journal":{"name":"IFAC-PapersOnLine","volume":"59 2","pages":"Pages 49-54"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144588465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
IFAC-PapersOnLinePub Date : 2025-01-01DOI: 10.1016/j.ifacol.2025.06.022
María F. Villa-Tamayo (Ms) , Jacopo Pavan (PhD) , Marc Breton (PhD)
{"title":"In-Silico Validation of Parameter Optimization Strategies for Automated Insulin Delivery Systems using the UVA Replay Simulation Technology","authors":"María F. Villa-Tamayo (Ms) , Jacopo Pavan (PhD) , Marc Breton (PhD)","doi":"10.1016/j.ifacol.2025.06.022","DOIUrl":"10.1016/j.ifacol.2025.06.022","url":null,"abstract":"<div><div>Automated insulin delivery (AID) systems have shown significant potential in managing type 1 diabetes (T1D), yet personalizing therapy parameters remains challenging. This study advances the optimization of AID therapy profiles through an updated decision support system (DSS) leveraging the University of Virginia Replay Simulator (UVA-RS). The DSS employs a personalized glucose-insulin dynamics model to simulate glucose response to therapy adjustments and an optimization algorithm to determine therapy parameters that improves overall glycemic control. We evaluated the system’s performance through three in-silico scenarios, focusing on recommendation reliability, constraint impact, robustness to metabolic and behavioral variability, and performance over five-month simulated use. Results indicate improved therapy personalization and glycemic control, supporting the potential for DSS to enhance AID system efficacy.</div></div>","PeriodicalId":37894,"journal":{"name":"IFAC-PapersOnLine","volume":"59 2","pages":"Pages 127-132"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144588472","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
IFAC-PapersOnLinePub Date : 2025-01-01DOI: 10.1016/j.ifacol.2025.06.023
Dinesh Krishnamoorthy , Francis J. Doyle (III)
{"title":"Personalized Meal Bolus Calculator for Type-1 Diabetes Accounting for Diurnal Effects","authors":"Dinesh Krishnamoorthy , Francis J. Doyle (III)","doi":"10.1016/j.ifacol.2025.06.023","DOIUrl":"10.1016/j.ifacol.2025.06.023","url":null,"abstract":"<div><div>Type 1 diabetes management requires compensating carbohydrate intake with bolus insulin matched to the meal size. Recent clinical studies revealed diurnal variations in insulin sensitivity (SI) in patients with type 1 diabetes, where the insulin resistance varies over the day. Diurnal variations in insulin sensitivity requires different bolus insulin dose for the same meal size depending on the time of the meal. Standard bolus calculators that use patient-specific parameters such as insulin-carb-ratio (CR) and correction factors (CF), however do not account for such diurnal variations. To address this gap, this paper proposes a fully data-driven safe and personalized bolus calculator that explicitly accounts for the diurnal variations. The proposed algorithm safely learns the optimum bolus needs tailored to each patient without the need for any patient-specific parameters such as carb-ratio, correction factor, insulin sensitivity etc., nor any historical clinical data. The proposed algorithm is tested and verified on the 10-adult cohort of the FDA-accepted UVA/Padova T1DM simulator.</div></div>","PeriodicalId":37894,"journal":{"name":"IFAC-PapersOnLine","volume":"59 2","pages":"Pages 133-138"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144588473","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
IFAC-PapersOnLinePub Date : 2025-01-01DOI: 10.1016/j.ifacol.2025.06.025
Lara Hauser , John Bagterp Jørgensen , Heiko Peuscher
{"title":"An Open-Source Browser-Based Nonlinear Model Predictive Controller for Type 1 Diabetes","authors":"Lara Hauser , John Bagterp Jørgensen , Heiko Peuscher","doi":"10.1016/j.ifacol.2025.06.025","DOIUrl":"10.1016/j.ifacol.2025.06.025","url":null,"abstract":"<div><div>We provide an open-source implementation of the NMPC algorithm for closed-loop insulin therapy presented by Hovorka et. al. in the seminal paper from 2004. An extended Kalman filter is added as observer, since specifics on state estimation have been omitted in the original paper. The controller is now part of the TypeScript-based closed-loop diabetes simulator LT1, which also comprises a library of models describing CGM sensors, infusion pumps, and patient physiology. The controller can thus be extensively tested in various closed-loop configurations. Also, the graphical user interface enables its integration in educational tools.</div></div>","PeriodicalId":37894,"journal":{"name":"IFAC-PapersOnLine","volume":"59 2","pages":"Pages 143-148"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144588475","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
IFAC-PapersOnLinePub Date : 2025-01-01DOI: 10.1016/j.ifacol.2025.06.003
Giada Lops, Vito Andrea Racanelli, Gioacchino Manfredi, Luca De Cicco, Saverio Mascolo
{"title":"A Deep Deterministic Policy Gradient control algorithm for Automatic Insulin Delivery","authors":"Giada Lops, Vito Andrea Racanelli, Gioacchino Manfredi, Luca De Cicco, Saverio Mascolo","doi":"10.1016/j.ifacol.2025.06.003","DOIUrl":"10.1016/j.ifacol.2025.06.003","url":null,"abstract":"<div><div>This study investigates the use of Reinforcement Learning (RL) to optimize insulin infusion in Automated Insulin Delivery (AID) systems. The Deep Deterministic Policy Gradient (DDPG) algorithm is evaluated as a potential control strategy and compared to Model Predictive Control (MPC) and PID controllers using a highly realistic in silico simulation model. Simulations for adult Type 1 Diabetes (T1D) patients demonstrate that the DDPG controller effectively reduces hypo- and hyperglycemic episodes and improves glucose stability.</div></div>","PeriodicalId":37894,"journal":{"name":"IFAC-PapersOnLine","volume":"59 2","pages":"Pages 13-18"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144588566","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
IFAC-PapersOnLinePub Date : 2025-01-01DOI: 10.1016/j.ifacol.2025.06.006
Matteo Ragni , Paolo A. Mongini , Lalo Magni , Chiara Toffanin
{"title":"Multiple Constrained MPCs for glucose regulation in Type 1 Diabetes1","authors":"Matteo Ragni , Paolo A. Mongini , Lalo Magni , Chiara Toffanin","doi":"10.1016/j.ifacol.2025.06.006","DOIUrl":"10.1016/j.ifacol.2025.06.006","url":null,"abstract":"<div><div>This study introduces a personalized Model Predictive Control (MPC) strategy for managing type 1 diabetes, specifically addressing intra-day variability in glucose regulation. The proposed method uses a soft-switching mechanism combining multiple MPCs, each optimized for distinct day periods (breakfast, lunch, and dinner). Patient-specific models were identified using an enhanced impulse response technique, featuring a novel clinically-based cost function to better capture circadian dynamics. A switching mechanism ensures smooth transitions between controllers, minimizing disruptions. Performance was evaluated using the FDA-approved UVA/Padova simulator, demonstrating a 20% improvement in model fit and enhanced control performance compared to the state-of-art approach. The strategy consistently prevented hypoglycemia while improving time-in-target metrics.</div></div>","PeriodicalId":37894,"journal":{"name":"IFAC-PapersOnLine","volume":"59 2","pages":"Pages 31-36"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144588569","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the rate of convergence of distributed relaxed-ADMM algorithms in distributed optimization","authors":"Leonardo Armijos-Bacuilima , A. Mohamed Messilem , Luca Schenato , Ruggero Carli","doi":"10.1016/j.ifacol.2025.07.066","DOIUrl":"10.1016/j.ifacol.2025.07.066","url":null,"abstract":"<div><div>In this paper, we present a preliminary analysis of the convergence rate of the relaxed ADMM-based algorithm recently introduced in the literature for distributed optimization problems. It is well known that the relaxed ADMM is a more general algorithm than the classical ADMM. Indeed, while the performance of the latter typically depends on one parameter, say <em>p,</em> the performance of the former depends on two parameters, say <em>p</em> and a, and the relaxed ADMM reduces to the classical ADMM when <em>α =</em> 1/2. Interestingly, from a computational point of view, the presence of the additional parameter <em>a</em> does not significantly complicate the updating steps of the algorithm. Nevertheless, the relaxed ADMM is much less considered in distributed optimization problems than the classical ADMM. In this paper, we show that by restricting to quadratic functions with the same convexity and to communication graphs that are regular connected graphs, it is possible to analytically compute the eigenvalues of the matrix that governs the dynamics of the algorithm based on the relaxed ADMM. Based on these eigenvalues, it is possible to design an efficient numerical procedure to evaluate the rate of convergence and to optimise it with respect to both <em>α</em> and <em>p.</em> Our results show that, by properly tuning the <em>a</em> parameter, the relaxed ADMM can can achieve superior convergence rates compared to its classical ADMM counterpart; in particular, for the family of graphs we considered, the optimal <em>a</em> typically tends to 1 as the number of agents increases. The analysis we present is preliminary, but suggests that the use of the relaxed ADMM can significantly improve the performance of the classical ADMM when applied to distributed optimization problems, at the price of a slight increase in computational complexity.</div></div>","PeriodicalId":37894,"journal":{"name":"IFAC-PapersOnLine","volume":"59 4","pages":"Pages 187-192"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144724132","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
IFAC-PapersOnLinePub Date : 2025-01-01DOI: 10.1016/j.ifacol.2025.07.067
A. Mohamed Messilem , Guido Carnevale , Ruggero Carli
{"title":"Distributed Constraint-Coupled Optimization: Harnessing ADMM-consensus for robustness","authors":"A. Mohamed Messilem , Guido Carnevale , Ruggero Carli","doi":"10.1016/j.ifacol.2025.07.067","DOIUrl":"10.1016/j.ifacol.2025.07.067","url":null,"abstract":"<div><div>In this paper, we consider a network of agents that jointly aim to minimize the sum of local functions subject to coupling constraints involving all local variables. To solve this problem, we propose a novel solution based on a primal-dual architecture. The algorithm is derived starting from an alternative definition of the Lagrangian function, and its convergence to the optimal solution is proved using recent advanced results in the theory of timescale separation in nonlinear systems. The rate of convergence is shown to be linear under standard assumptions on the local cost functions. Interestingly, the algorithm is amenable to a direct implementation to deal with asynchronous communication scenarios that may be corrupted by other non-idealities such as packet loss. We numerically test the validity of our approach on a real-world application related to the provision of ancillary services in three-phase low-voltage microgrids.</div></div>","PeriodicalId":37894,"journal":{"name":"IFAC-PapersOnLine","volume":"59 4","pages":"Pages 193-198"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144724133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
IFAC-PapersOnLinePub Date : 2025-01-01DOI: 10.1016/j.ifacol.2025.07.069
Hongyu Liu , Hao Xia
{"title":"Multilayer Information Spillover Networks: Application to Stocks Cross-listed in Mainland China and Hong Kong","authors":"Hongyu Liu , Hao Xia","doi":"10.1016/j.ifacol.2025.07.069","DOIUrl":"10.1016/j.ifacol.2025.07.069","url":null,"abstract":"<div><div>This study constructs a multilayer network framework that captures both within and across market interactions, to measure the volatility spillovers among stocks listed across both Hong Kong and Mainland Chinese exchanges. We find that: (i) From a system-level perspective, the volatility network’s total connectedness reacts notably to major events, while the leader for cross-market spillovers is not constant but shifts with time. (ii) From an individual-level perspective, cross-listed stock pairs display varying spillover influence across and within markets; however, the bidirectional spillovers between them are generally symmetric and tend to be strengthened by the introduction of inter-market connectivity policies. This research offers an innovative approach for a deeper understanding of the connectedness characteristics of cross-listed stocks and for optimizing risk management decisions.</div></div>","PeriodicalId":37894,"journal":{"name":"IFAC-PapersOnLine","volume":"59 4","pages":"Pages 205-209"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144724135","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
IFAC-PapersOnLinePub Date : 2025-01-01DOI: 10.1016/j.ifacol.2025.07.054
Liwei Yuan , Hideaki Ishii
{"title":"Distributed Parameter Estimation with Adversaries via Multi-Hop Relays⁎","authors":"Liwei Yuan , Hideaki Ishii","doi":"10.1016/j.ifacol.2025.07.054","DOIUrl":"10.1016/j.ifacol.2025.07.054","url":null,"abstract":"<div><div>We study resilient distributed parameter estimation in multi-agent systems where some agents may malfunction. The objective is for each nonfaulty agent to locally estimate its parameter while it may interact with adversaries. To this end, we develop an algorithm using multi-hop relaying to achieve the goal in multi-agent networks with directed topologies. With multi-hop relays, agents can access more information of remote agents even though they communicate with only direct neighbors. We characterize a necessary and sufficient graph condition for our algorithm to succeed, which is denoted by the notion of robust following graphs. We prove that our condition with multi-hop relays is more relaxed than the one with one-hop case, and hence, our approach can tolerate more adversaries in the same network when multi-hop relays are applied. Lastly, numerical examples verify the efficacy of our algorithm.</div></div>","PeriodicalId":37894,"journal":{"name":"IFAC-PapersOnLine","volume":"59 4","pages":"Pages 115-120"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144724120","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}