SearcharxivSearch

arXiv subjects

Alan Williams

Publications and source records attributed to Alan Williams.

At least 19 recordsLinked to original sources

Multivariable Extremum Seeking for Locally Lipschitz Objectives

Classical extremum seeking (ES) is commonly interpreted as approximating gradient descent, but this interpretation is less clear for nonsmooth objectives in the continuous-time multivariable setting. We propose a minimal modification of the classical multivariable perturbation--demodulation architecture: rationally independent perturbation frequencies and matched demodulation signals. For any locally Lipschitz static objective, the Kronecker--Weyl theorem shows that, at every fixed perturbation amplitude, the long-time averaged dynamics are exactly the negative gradient of a kernel-smoothed objective. Because rationally independent frequencies render the perturbation and demodulation signals nonperiodic, we employ general averaging theory rather than periodic averaging theory. If the gradient flow of the smoothed objective is globally uniformly asymptotically stable, then the ES dynamics are practically globally uniformly asymptotically stable. We also derive a general matching condition relating the perturbation occupation density, demodulation signal, and smoothing kernel, yielding a family of alternative designs. Numerical examples include a nonsmooth objective function, which may be interpreted as the penalty function of a nonlinear program, and the Rastrigin function, for which smoothing eliminates all undesired local minima.

math.OC

Sonar-GPS Fusion for Seabed Mapping in Turbid Shallow Waters with an Autonomous Surface Vehicle

Accurate seabed mapping is essential for habitat monitoring and infrastructure inspection. In turbid, shallow coastal waters, such as shellfish aquaculture farms, the effectiveness of traditional optical methods is limited. Autonomous surface vehicles (ASVs) equipped with forward-looking sonar (FLS) offer a promising alternative. However, existing sonar-based systems face challenges in achieving fine resolution mapping over long trajectories due to low-resolution positioning measurements and accumulated drift over long trajectories. In this paper, we present a drift-resilient seabed mapping framework that integrates local FLS frame alignment using the Fourier-Mellin transform (FMT) with global trajectory optimization based on an extended Kalman filter (EKF) that fuses global positioning system (GPS), inertial measurement unit (IMU), and compass data. A variance-based image blending strategy is used to further reduce visual artifacts in overlapping regions. Field trials on a structured oyster farm site show that our framework helps reduce drift in RMSE by 9.5% relative to the FMT-only baseline. This framework also enables sub-meter reconstruction accuracy and preservation of high-resolution textures needed for oyster inventory estimation within the mapped areas.

cs.RO

MPC and System Identification with Differentiable Physics: Fluid System and Particle Beam Control

We consider the problem of simultaneous control and parameter estimation when the model is available only as a differentiable physics simulator. We propose a receding-horizon control framework in which a model predictive control (MPC) objective is optimized using gradients obtained by differentiating through the simulator, while physical parameters are updated online using measurement data. Unlike classical MPC, which relies on explicit algebraic models, our approach treats the dynamics as a computational object and performs simulation-based optimization using automatic differentiation. A shared differentiable model enables joint, real-time optimization of control inputs and physical parameters. We present two preliminary examples to demonstrate the proposed framework on two challenging applications: a fluid flow problem and a particle accelerator.

math.OC

Nested Extremum Seeking Converges to Stackelberg Equilibrium

The nested Extremum Seeking (nES) algorithm is a model-free optimization method that has been shown to converge to a neighborhood of a Nash equilibrium. In this work, we demonstrate that the same nES dynamics can instead be made to converge to a neighborhood of a Stackelberg (leader--follower) equilibrium by imposing a different scaling law on the algorithm's design parameters. For the two--level nested case, using Lie--bracket averaging and singular perturbation arguments, we provide a rigorous stability proof showing semi-global practical asymptotic convergence to a Stackelberg equilibrium under appropriate time-scale separation. The results reveal that equilibrium selection, Nash versus Stackelberg, depends not on modifying the closed-loop dynamics, but on the hierarchical scaling of design parameters and the induced time-scale structure. We demonstrate this effect using a simple quadratic example and the canonical Fish War game. The Stackelberg variant of nES provides a model-free framework for hierarchical optimization in multi-time-scale systems, with potential applications in power grids, networked dynamical systems, and tuning of particle accelerators.

math.OC

Generalized Multi-Constraint Extremum Seeking

We generalize the Safe Extremum Seeking algorithm to address the minimization of an unknown objective function subject to multiple unknown inequality and equality constraints, relying on recent results of gradient flow systems. These constraints may represent safety or other critical conditions. The proposed ES algorithm functions as a general nonlinear programming tool, offering practical maintenance of all constraints and semiglobal practical asymptotic stability, utilizing a Lyapunov argument on the penalty function and the set-valued Lie derivative. The efficacy of the algorithm is demonstrated on a 2D problem.

math.OC

Improved Robustness of Deep Reinforcement Learning for Control of Time-Varying Systems by Bounded Extremum Seeking

In this paper, we study the use of robust model independent bounded extremum seeking (ES) feedback control to improve the robustness of deep reinforcement learning (DRL) controllers for a class of nonlinear time-varying systems. DRL has the potential to learn from large datasets to quickly control or optimize the outputs of many-parameter systems, but its performance degrades catastrophically when the system model changes rapidly over time. Bounded ES can handle time-varying systems with unknown control directions, but its convergence speed slows down as the number of tuned parameters increases and, like all local adaptive methods, it can get stuck in local minima. We demonstrate that together, DRL and bounded ES result in a hybrid controller whose performance exceeds the sum of its parts with DRL taking advantage of historical data to learn how to quickly control a many-parameter system to a desired setpoint while bounded ES ensures its robustness to time variations. We present a numerical study of a general time-varying system and a combined ES-DRL controller for automatic tuning of the Low Energy Beam Transport section at the Los Alamos Neutron Science Center linear particle accelerator.

cs.LG

An Ecosystem of Services for FAIR Computational Workflows

Computational workflows represent major investments of effort and expertise. As first-class, publishable research objects of their own, they are key to sharing methodological know-how for reuse, reproducibility, and transparency. Thus, the application of the FAIR Principles to workflows is inevitable to enable them to be Findable, Accessible, Interoperable, and Reusable. Making workflows FAIR reduces duplication of effort, assists in the reuse of best practice approaches and community-supported standards, and ensures that workflows as digital objects can support reproducible, robust science. FAIR workflows draw from both FAIR data and software principles, and they help ensure and support data FAIRification. The FAIR Principles emphasize the association of persistent identifiers and machine-actionable metadata with workflows. Implementing the Principles requires a framework with appropriate programmatic protocols and an accompanying ecosystem of services, tools, policies, and best practices, as well the buy-in of existing workflow systems. The European EOSC-Life Workflow Collaboratory is an example of such a digital infrastructure for the Biosciences. It includes a metadata standards framework for describing workflows that is managed and used by dedicated new FAIR workflow services and programmatic APIs for interoperability and metadata access. It includes the WorkflowHub registry and LifeMonitor workflow testing service, and it incorporates existing workflow systems and packaging solutions. Here, we introduce the FAIR Principles for workflows and connect FAIR workflows with the FAIR ecosystems they inhabit with the EOSC-Life Collaboratory as a concrete example. We also introduce other community efforts that are easing the ways that workflows are shared and reused by others, and we discuss how the variations in different workflow settings impact their FAIR perspectives.

cs.DC

Is AI currently capable of identifying wild oysters? A comparison of human annotators against the AI model, ODYSSEE

Oysters are ecologically and commercially important species that require frequent monitoring to track population demographics (e.g. abundance, growth, mortality). Current methods of monitoring oyster reefs often require destructive sampling methods and extensive manual effort. Therefore, they are suboptimal for small-scale or sensitive environments. A recent alternative, the ODYSSEE model, was developed to use deep learning techniques to identify live oysters using video or images taken in the field of oyster reefs to assess abundance. The validity of this model in identifying live oysters on a reef was compared to expert and non-expert annotators. In addition, we identified potential sources of prediction error. Although the model can make inferences significantly faster than expert and non-expert annotators (39.6 s, $2.34 \pm 0.61$ h, $4.50 \pm 1.46$ h, respectively), the model overpredicted the number of live oysters, achieving lower accuracy (63\%) in identifying live oysters compared to experts (74\%) and non-experts (75\%) alike. Image quality was an important factor in determining the accuracy of the model and the annotators. Better quality images improved human accuracy and worsened model accuracy. Although ODYSSEE was not sufficiently accurate, we anticipate that future training on higher-quality images, utilizing additional live imagery, and incorporating additional annotation training classes will greatly improve the model's predictive power based on the results of this analysis. Future research should address methods that improve the detection of living vs. dead oysters.

cs.AI

Adaptive conditional latent diffusion maps beam loss to 2D phase space projections

Beam loss (BLM) and beam current monitors (BCM) are ubiquitous at particle accelerator around the world. These simple devices provide non-invasive high level beam measurements, but give no insight into the detailed 6D (x,y,z,px,py,pz) beam phase space distributions or dynamics. We show that generative conditional latent diffusion models can learn intricate patterns to map waveforms of tens of BLMs or BCMs along an accelerator to detailed 2D projections of a charged particle beam's 6D phase space density. This transformational method can be used at any particle accelerator to transform simple non-invasive devices into detailed beam phase space diagnostics. We demonstrate this concept via multi-particle simulations of the high intensity beam in the kilometer-long LANSCE linear proton accelerator.

physics.acc-ph

QP Based Constrained Optimization for Reliable PINN Training

Physics-Informed Neural Networks (PINNs) have emerged as a powerful tool for integrating physics-based constraints and data to address forward and inverse problems in machine learning. Despite their potential, the implementation of PINNs are hampered by several challenges, including issues related to convergence, stability, and the design of neural networks and loss functions. In this paper, we introduce a novel training scheme that addresses these challenges by framing the training process as a constrained optimization problem. Utilizing a quadratic program (QP)-based gradient descent law, our approach simplifies the design of loss functions and guarantees convergences to optimal neural network parameters. This methodology enables dynamic balancing, over the course of training, between data-based loss and a partial differential equation (PDE) residual loss, ensuring an acceptable level of accuracy while prioritizing the minimization of PDE-based loss. We demonstrate the formulation of the constrained PINNs approach with noisy data, in the context of solving Laplace's equation in a capacitor with complex geometry. This work not only advances the capabilities of PINNs but also provides a framework for their training.

math.OC

Classifier-pruned Bayesian optimization for particle accelerator tuning: Exploring temporally structured manifold of 6D beam phase space

Complex dynamical systems, such as particle accelerators, often require intricate and time-consuming tuning procedures to achieve optimal performance. In many cases, these procedures must also estimate the optimal system parameters governing the dynamics of a spatiotemporal beam, making the task a high-dimensional optimization problem. To address this, we propose a Classifier-pruned Bayesian Optimization-based Latent space Tuner (CBOL-Tuner), a framework for efficient exploration within a temporally-structured latent manifold of 6D beam phase space. The CBOL-Tuner integrates a conditional variational autoencoder for latent space representation, a long short-term memory network for temporal dynamics, a lightweight neural network for parameter estimation, and a classifier-pruned Bayesian optimizer to adaptively search and filter the latent space for optimal solutions.

cs.LG

3D Water Quality Mapping using Invariant Extended Kalman Filtering for Underwater Robot Localization

Water quality mapping for critical parameters such as temperature, salinity, and turbidity is crucial for assessing an aquaculture farm's health and yield capacity. Traditional approaches involve using boats or human divers, which are time-constrained and lack depth variability. This work presents an innovative approach to 3D water quality mapping in shallow water environments using a BlueROV2 equipped with GPS and a water quality sensor. This system allows for accurate location correction by resurfacing when errors occur. This study is being conducted at an oyster farm in the Chesapeake Bay, USA, providing a more comprehensive and precise water quality analysis in aquaculture settings.

cs.RO

ODYSSEE: Oyster Detection Yielded by Sensor Systems on Edge Electronics

Oysters are a vital keystone species in coastal ecosystems, providing significant economic, environmental, and cultural benefits. As the importance of oysters grows, so does the relevance of autonomous systems for their detection and monitoring. However, current monitoring strategies often rely on destructive methods. While manual identification of oysters from video footage is non-destructive, it is time-consuming, requires expert input, and is further complicated by the challenges of the underwater environment. To address these challenges, we propose a novel pipeline using stable diffusion to augment a collected real dataset with realistic synthetic data. This method enhances the dataset used to train a YOLOv10-based vision model. The model is then deployed and tested on an edge platform in underwater robotics, achieving a state-of-the-art 0.657 mAP@50 for oyster detection on the Aqua2 platform.

cs.CV

Time-inversion of spatiotemporal beam dynamics using uncertainty-aware latent evolution reversal

Charged particle dynamics under the influence of electromagnetic fields is a challenging spatiotemporal problem. Many high performance physics-based simulators for predicting behavior in a charged particle beam are computationally expensive, limiting their utility for solving inverse problems online. The problem of estimating upstream six-dimensional phase space given downstream measurements of charged particles in an accelerator is an inverse problem of growing importance. This paper introduces a reverse Latent Evolution Model (rLEM) designed for temporal inversion of forward beam dynamics. In this two-step self-supervised deep learning framework, we utilize a Conditional Variational Autoencoder (CVAE) to project 6D phase space projections of a charged particle beam into a lower-dimensional latent distribution. Subsequently, we autoregressively learn the inverse temporal dynamics in the latent space using a Long Short-Term Memory (LSTM) network. The coupled CVAE-LSTM framework can predict 6D phase space projections across all upstream accelerating sections based on single or multiple downstream phase space measurements as inputs. The proposed model also captures the aleatoric uncertainty of the high-dimensional input data within the latent space. This uncertainty, which reflects potential uncertain measurements at a given module, is propagated through the LSTM to estimate uncertainty bounds for all upstream predictions, demonstrating the robustness of the LSTM against in-distribution variations in the input data.

physics.acc-ph

Accelerator system parameter estimation using variational autoencoded latent regression

Particle accelerators are time-varying systems whose components are perturbed by external disturbances. Tuning accelerators can be a time-consuming process involving manual adjustment of multiple components, such as RF cavities, to minimize beam loss due to time-varying drifts. The high dimensionality of the system ($\sim$100 amplitude and phase RF settings in the LANSCE accelerator) makes it difficult to achieve optimal operation. The time-varying drifts and the dimensionality make system parameter estimation a challenging optimization problem. In this work, we propose a Variational Autoencoded Latent Regression (VALeR) model for robust estimation of system parameters using 2D unique projections of a charged particle beam's 6D phase space. In VALeR, VAE projects the phase space projections into a lower-dimensional latent space, and a dense neural network maps the latent space onto the space of system parameters. The trained network can predict system parameters for unseen phase space projections. Furthermore, VALeR can generate new projections by randomly sampling the latent space of VAE and also estimate the corresponding system parameters.

physics.acc-ph

Towards latent space evolution of spatiotemporal dynamics of six-dimensional phase space of charged particle beams

Addressing the charged particle beam diagnostics in accelerators poses a formidable challenge, demanding high-fidelity simulations in limited computational time. Machine learning (ML) based surrogate models have emerged as a promising tool for non-invasive charged particle beam diagnostics. Trained ML models can make predictions much faster than computationally expensive physics simulations. In this work, we have proposed a temporally structured variational autoencoder model to autoregressively forecast the spatiotemporal dynamics of the 15 unique 2D projections of 6D phase space of charged particle beam as it travels through the LANSCE linear accelerator. In the model, VAE embeds the phase space projections into a lower dimensional latent space. A long-short-term memory network then learns the temporal correlations in the latent space. The trained network can evolve the phase space projections across further modules provided the first few modules as inputs. The model predicts all the projections across different modules with low mean squared error and high structural similarity index.

physics.acc-ph

Practical Safe Extremum Seeking with Assignable Rate of Attractivity to the Safe Set

We present Assignably Safe Extremum Seeking (ASfES), an algorithm designed to minimize a measured objective function while maintaining a measured metric of safety (a control barrier function or CBF) be positive in a practical sense. We ensure that for trajectories with safe initial conditions, the violation of safety can be made arbitrarily small with appropriately chosen design constants. We also guarantee an assignable ``attractivity'' rate: from unsafe initial conditions, the trajectories approach the safe set, in the sense of the measured CBF, at a rate no slower than a user-assigned rate. Similarly, from safe initial conditions, the trajectories approach the unsafe set, in the sense of the CBF, no faster than the assigned attractivity rate. The feature of assignable attractivity is not present in the semiglobal version of safe extremum seeking, where the semiglobality of convergence is achieved by slowing the adaptation. We also demonstrate local convergence of the parameter to a neighborhood of the minimum of the objective function constrained to the safe set. The ASfES algorithm and analysis are multivariable, but we also extend the algorithm to a Newton-Based ASfES scheme (NB-ASfES) which we show is only useful in the scalar case. The proven properties of the designs are illustrated through simulation examples.

math.OC

A conditional latent autoregressive recurrent model for generation and forecasting of beam dynamics in particle accelerators

Particle accelerators are complex systems that focus, guide, and accelerate intense charged particle beams to high energy. Beam diagnostics present a challenging problem due to limited non-destructive measurements, computationally demanding simulations, and inherent uncertainties in the system. We propose a two-step unsupervised deep learning framework named as Conditional Latent Autoregressive Recurrent Model (CLARM) for learning the spatiotemporal dynamics of charged particles in accelerators. CLARM consists of a Conditional Variational Autoencoder (CVAE) transforming six-dimensional phase space into a lower-dimensional latent distribution and a Long Short-Term Memory (LSTM) network capturing temporal dynamics in an autoregressive manner. The CLARM can generate projections at various accelerator modules by sampling and decoding the latent space representation. The model also forecasts future states (downstream locations) of charged particles from past states (upstream locations). The results demonstrate that the generative and forecasting ability of the proposed approach is promising when tested against a variety of evaluation metrics.

physics.acc-ph