Reproducibility Code for "Safe Actuator Reconfiguration Under Bounded Disturbances: Constraint-Adapted Control Authority and Viability-Kernel Handoffs"

Reproducibility Code for “Safe Actuator Reconfiguration Under Bounded Disturbances: Constraint-Adapted Control Authority and Viability-Kernel Handoffs” This repository contains the Python code and computational materials used to reproduce the numerical experiments and figures accompanying the manuscript “Safe Actuator Reconfiguration Under Bounded Disturbances: Constraint-Adapted Control Authority and Viability-Kernel Handoffs.” The manuscript studies robust safety during actuator or control-channel degradation and subsequent architecture reconfiguration under bounded disturbances. The analysis combines control-authority geometry, constraint-adapted response measures, robust viability kernels, and targeted safe-handoff conditions. The supplied code reproduces the numerical scenarios used to illustrate the analytical results. In particular, it covers: degradation and loss of control channels under bounded disturbances; computation and comparison of available control authority; numerical safety trajectories for the benchmark scenarios; the distinction between disturbance-level response sufficiency and constraint-adapted control authority; targeted and untargeted bridge policies during actuator reconfiguration; robust handoff to the viability kernel of the reconstructed architecture; extremal-disturbance reachable envelopes for the safe-handoff example; and numerical sensitivity checks with respect to the integration step size. A central numerical example demonstrates that remaining safe until reconstruction is completed is not, by itself, sufficient for persistent post-reconfiguration safety. The system must reach an appropriate state in the robust viability kernel of the reconstructed architecture before handoff. The accompanying simulations illustrate both an untargeted bridge policy that remains temporarily safe but fails after reconstruction and a targeted state-feedback policy that robustly reaches the required handoff set. The code also reproduces the minimum robust handoff time identified analytically in the manuscript, [T_{\min}=5\ln(5/4)\approx1.1157,] and illustrates the reachable-state envelopes generated by the extremal bounded disturbances. The computational materials are provided for transparency and reproducibility. The theoretical results, propositions, and proofs in the associated manuscript are analytical and do not depend on the numerical implementation. Contents The archive includes the main Python reproduction script, numerical output tables, figure-generation routines, and documentation describing the computational setup and dependencies. Software The simulations are implemented in Python using standard scientific-computing packages, including NumPy, pandas, and Matplotlib. Related manuscript Title: Safe Actuator Reconfiguration Under Bounded Disturbances: Constraint-Adapted Control Authority and Viability-Kernel Handoffs Author: Jihoon Yang Affiliation: Independent Researcher, Republic of Korea Citation If these computational materials are used in subsequent research, please cite this Zenodo record. Once the associated article is published, the bibliographic information for the final publication may also be added to this record.