Search arXivSearch

arXiv · 2510.15708

Sugar Shack 4.0: Practical Demonstration of an IIoT-Based Event-Driven Automation System

Abstract

This paper presents a practical alternative to programmable-logic-controller-centric automation by implementing an event-driven architecture built with industrial Internet of Things tools. A layered design on a local edge server (i) abstracts actuators, (ii) enforces mutual exclusion of shared physical resources through an interlock with priority queueing, (iii) composes deterministic singular operations, and (iv) orchestrates complete workflows as state machines in Node-RED, with communication over MQTT. The device layer uses low-cost ESP32-based gateways to interface sensors and actuators, while all automation logic is offloaded to the server side. As part of a larger project involving the first scientifically-documented integration of Industry 4.0 technologies in a maple syrup boiling center, this work demonstrates the deployment of the proposed system as a case-study. Evaluation over an entire production season shows median message time of flight around one tenth of a second, command issuance-to-motion latencies of about two to three seconds, and command completion near six seconds dominated by actuator mechanics; operation runtimes span tens of seconds to minutes. These results indicate that network and orchestration overheads are negligible relative to process dynamics, enabling modular, distributed control without compromising determinism or fault isolation. The approach reduces material and integration effort, supports portable containerized deployment, and naturally enables an edge/cloud split in which persistence and analytics are offloaded while automation remains at the edge.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thomas Bernard, François Grondin, Jean-Michel Lavoie. 2025-10-17. Sugar Shack 4.0: Practical Demonstration of an IIoT-Based Event-Driven Automation System. https://arxiv.org/abs/2510.15708

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

KEEP EXPLORING

Related papers

Observability and parameter estimation of a generic model for aggregated distributed energy resources

We propose a novel framework for estimating the parameters of an aggregated distributed energy resources (DER A) model. First, we introduce a rigorous method to determine whether all model parameters are estimable. When they are not, our approach identifies the subset of parameters that can be estimated. The proposed framework offers new insights into the number and specific parameters that can be reliably estimated based on commonly available measurements. It also highlights the limitations of calibrating such models. Second, we introduce a Kalman filtering method to calibrate the DER A model. Since we account for nonlinear effects such as saturation and deadbands, we develop a specific mechanism to handle smoothing functions within the Kalman filter. Specifically, we consider the extended and the unscented Kalman filter. We demonstrate the effectiveness of the proposed framework on a modified IEEE 34-node distribution feeder with inverter- based resources. Our findings align with the North American Electric Reliability Corporation's parameterization guideline and underscore the importance of model calibration in accurately capturing the collective dynamics of distributed energy resources installed on distribution systems.

eess.SY

Salted Fisher Information for Hybrid Systems

Discrete events change how parameter-influence propagates in hybrid systems. Prevailing Fisher information for- mulations assume that sensitivities evolve smoothly according to continuous-time variational equations and therefore neglect the sensitivity updates induced by discrete events. This paper derives a Fisher information matrix formulation compatible with hybrid systems. To do so, we use the saltation matrix, which encodes the first-order transformation of sensitivities induced by discrete events. We call the resulting formulation the salted Fisher information matrix (SFIM). The proposed framework unifies continuous information accumulation during flows with discrete updates at event times. We also show that hybrid persistence of excitation is sufficient for the SFIM to be positive definite

eess.SY

Min-Max Grassmannian Optimization for Online Subspace Tracking

We propose GeRoST (Geometrically Robust Subspace Tracking), an online subspace tracking algorithm that models uncertainty in a subspace using a Grassmannian ball. We derive an exact scalar dual for the worst-case subspace problem, establish conditions for a unique worst-case subspace and a Riemannian gradient, and characterize the minimum radius needed to cover a dimensional extension of the target subspace. Each update uses either a spectral direction computed in a reduced subspace or the gradient of the window reconstruction loss. Our numerical experiments show that GeRoST achieves lower mean post-fault prediction error than GREAT in system identification. In video separation, it achieves higher precision and a better precision--recall balance, as measured by the F$_1$ score, than both GREAT and GRASTA at the reported thresholds, with lower recall and longer runtime.

eess.SY