Search arXivSearch

arXiv · 2503.17887

An AI-enabled dual-hormone model predictive control algorithm that delivers insulin and pramlintide

Abstract

Current closed-loop insulin delivery algorithms need to be informed of carbohydrate intake disturbances. This can be a burden on people using these systems. Pramlintide is a hormone that delays gastric emptying, which enables insulin kinetics to align with the kinetics of carbohydrate absorption. Integrating pramlintide into an automated insulin delivery system can be helpful in reducing the postprandial glucose excursion and may be helpful in enabling fully-closed loop whereby meals do not need to be announced. We present an AI-enabled dual-hormone model predictive control (MPC) algorithm that delivers insulin and pramlintide without requiring meal announcements that uses a neural network to automatically detect and deliver meal insulin. The MPC algorithm includes a new pramlintide pharmacokinetics and pharmacodynamics model that was identified using data collected from people with type 1 diabetes undergoing a meal challenge. Using a simulator, we evaluated the performance of various pramlintide delivery methods and controller models, as well as the baseline insulin-only scenario. Meals were automatically dosed using a neural network meal detection and dosing (MDD) algorithm. The primary outcome was the percent time glucose is in the target range (TIR: 70-180 mg/dL). Results show that delivering pramlintide at a fixed ratio of 6 mcg pramlintide:1 u insulin using an MPC that is aware of the pramlintide achieved the most significant improved TIR compared with an insulin-only MPC (91.6% vs. 64.1%). Delivering pramlintide as a fixed ratio was better than delivering basal pramlintide at a constant rate, indicating the benefit of the MDD algorithm. There was no advantage of independent control of insulin and pramlintide compared with insulin and pramlintide delivered as a fixed ratio. Preliminary real-world results from a human subject further indicate the benefit of pramlintide delivery.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter G. Jacobs, Wade Hilts, Robert Dodier, Joseph Leitschuh, Jae H. Eom, Deborah Branigan, Forrest Ling, Matthew Howard, Clara Mosquera-Lopez, Leah Wilson. 2025-03-23. An AI-enabled dual-hormone model predictive control algorithm that delivers insulin and pramlintide. https://arxiv.org/abs/2503.17887

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Failure-Aware Iterative Learning of State-Control Invariant Sets

In this paper, we address the problem of computing maximal state-control invariant sets for deterministic linear systems using failing trajectories. We introduce the concept of state-control invariance, which extends control invariance from the state space to the joint state-control space. The maximal state-control invariant (MSCI) set simultaneously encodes the maximal control invariant set (MCI) and, for each state in the MCI, the set of control inputs that preserve invariance. We prove that the state projection of the MSCI is the MCI and the state-dependent sections of the MSCI are the admissible invariance-preserving inputs. Building on this framework, we develop a Failure-Aware Iterative Learning (FAIL) algorithm for deterministic linear time-invariant systems with polytopic constraints. The algorithm iteratively updates a constraint set in the state-control space by learning predecessor halfspaces from one-step failing state-input pairs, without knowing the dynamics. For each failure, FAIL learns the violated halfspaces of the predecessor of the constraint set by a regression on failing trajectories. We prove that the learned constraint set converges monotonically to the MSCI. Numerical experiments on a double integrator system validate the proposed approach.

eess.SY

Consensus and Synchronization of Multi-agent Systems over Finite Fields - Graph Topologies

This paper presents cooperative protocols for multi-agent systems with agents having a finite state-space. Both scalar single-integrator consensus and general LTI system synchronization are considered. Systems having a finite state-space describe agents with minimal memory capacity processing only a finite alphabet. Such systems are remarkably resilient to communication noise. The crucial problem, however, is to construct the admissible communication topology, which is NP-hard. We address this by efficiently exploring the subsets of admissible graph matrices and propose two new algorithms to generate them. Simulations validate the proposed approach.

eess.SY

Extracting Exact Lie Derivatives Without Backpropagation: A Dual Compiler for Neural Control Barrier Functions

A safety filter based on a neural control barrier function (CBF) deployed in an embedded control loop evaluates, at each control cycle, the trained network and its Lie derivatives along the system vector fields, under the memory and worst-case execution time (WCET) constraints that safety-oriented coding standards impose. Reverse-mode automatic differentiation, by which training frameworks obtain these derivatives, retains an activation cache whose size grows with the sum of the layer widths, and general-purpose differentiation runtimes allocate the computational graph from the heap at each call. This paper presents a compiler that evaluates a neural CBF and its exact Lie derivatives by forward-mode dual-number arithmetic. The compiler emits self-contained C++ code in which a single forward pass, without backpropagation, returns the barrier value and its exact Lie derivative along a given vector field; the drift and input Lie derivatives of the safety constraint are obtained from one such pass per vector field, and a second-order extension based on hyper-dual numbers returns the exact second-order Lie derivatives required by CBFs of relative degree two. The dual forward pass requires a workspace bounded by four times the widest layer, independent of network depth, and the emitted code contains no allocation call sites, so the absence of dynamic allocation is verifiable by inspection of the code. On an ESP32-S3 microcontroller, the compiled filter assembles the complete safety constraint in under one millisecond from statically allocated buffers of at most 768 bytes, and the maximum execution time over 1000 evaluations lies within 5% of the median in all three examples, whereas a heap-allocating reverse-mode baseline shows maxima 33% and 70% above its median in the two first-order examples. The compiler and the embedded experiments are released as open-source software.

eess.SY