NSNiklas Schmid

Niklas Schmid

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Niklas Schmid has a total of 32 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Optimization of precision fertilizer management to reduce nitrogen pollution while maintaining agricultural productivity

    by Rye Gleason, Niklas Schmid, Kevin Wallington, John Lygeros

    Cheap and abundant nitrogen (N) fertilizer has driven revolutionary increases in global crop yields. However, N is susceptible to being lost from agricultural fields and transported into water bodies where, in excess, it contributes to drinking water contamination, harmful algal blooms, and hypoxia. This work investigates the potential to improve the Pareto front of crop yield and N loss outcomes through high-frequency, in-season soil sampling and fertilizer application. The current paradigm in agriculture is (1) to apply N either entirely before plant emergence or split between pre-plant and a single “side-dressing” after plant emergence and (2) to measure soil N concentrations yearly or less often. However, advances in agricultural field robotics and remote sensing are making it possible to attain and act on soil data more quickly and precisely and thus to maintain crop yield while decreasing N losses. To date though, few studies have attempted to describe optimal fertilizer strategies that make use of such high-frequency monitoring and actuation tools or how much N loss abatement these strategies could achieve. Indeed, such analysis is challenging due to the complex and high-dimensional nature of the N management problem.This study provides a model abstraction and discretization scheme that make dynamic programming (DP) for N management computationally feasible while maintaining decision-relevant features of the problem. The DP algorithm computes a strategy on incremental fertilizer application rates and timing based on the N and water content in the soil as well as weather predictions. The strategy is optimized for a maximum expected land profitability minus a fine that is incurred when N losses exceed a statutory threshold. By varying the level of the fine for N loss violations, we map the DP outcomes to a Pareto front that characterizes the maximum land profitability that can be achieved at different likelihoods of violating the N loss threshold. Finally, we compute multiple strategies via DP, each using different frequencies for soil monitoring and fertilizer application, and we show that increasing the frequency shifts the Pareto front toward improved (lower) likelihoods of N loss violation without sacrificing land profitability.

  • Parameter-Robust MPPI for Safe Online Learning of Unknown Parameters

    by Matti Vahs, Jaeyoun Choi, Niklas Schmid, Jana Tumova, Chuchu Fan

    Robots deployed in dynamic environments must remain safe even when key physical parameters are uncertain or change over time. We propose Parameter-Robust Model Predictive Path Integral (PRMPPI) control, a framework that integrates online parameter learning with probabilistic safety constraints. PRMPPI maintains a particle-based belief over parameters via Stein Variational Gradient Descent, evaluates safety constraints using Conformal Prediction, and optimizes both a nominal performance-driven and a safety-focused backup trajectory in parallel. This yields a controller that is cautious at first, improves performance as parameters are learned, and ensures safety throughout. Simulation and hardware experiments demonstrate higher success rates, lower tracking error, and more accurate parameter estimates than baselines.

  • Open Access

    Parallel Model Predictive Control for Deterministic Systems

    by Yuchao Li, Aren Karapetyan, Niklas Schmid, John Lygeros, Karl H. Johansson, Jonas Mårtensson

    In this note, we consider infinite horizon optimal control problems with deterministic systems. Since exact solutions to these problems are often intractable, we propose a parallel model predictive control (MPC) method that provides an approximate solution. Our method computes multiple lookahead minimization problems at each time, where each minimization may involve a different number of lookahead steps, and terminal cost and constraint. The policy computed via parallel MPC applies the first control of the lookahead minimization with the lowest cost. We show that the proposed method can harnesses the power of multiple computing units. Moreover, we prove that the policy computed via parallel MPC has better performance guarantee than that computed via the single lookahead minimization involved in parallel MPC.


  • Computing Optimal Joint Chance Constrained Control Policies

    by Niklas Schmid, Marta Fochesato, Sarah H.Q. Li, Tobias Sutter, John Lygeros

    We consider the problem of optimally controlling stochastic, Markovian systems subject to joint chance constraints over a finite-time horizon. For such problems, standard Dynamic Programming is inapplicable due to the time correlation of the joint chance constraints, which calls for non-Markovian, and possibly stochastic, policies. Hence, despite the popularity of this problem, solution approaches capable of providing provably-optimal and easy-to-compute policies are still missing. We fill this gap by augmenting the dynamics via a binary state, allowing us to characterize the optimal policies and develop a Dynamic Programming based solution method.


  • Open Access

    Stopping power and range estimations in proton therapy based on prompt gamma timing: motion models and automated parameter optimization

    by Julius Werner, Francesco Pennazio, Niklas Schmid, Elisa Fiorina, Davide Bersani, Piergiorgio Cerello, Jona Kasprzak, Nicola Mosco, Sahar Ranjbar, Roberto Sacchi, et al.

    Objective. Particle therapy treatments are currently limited by uncertainties of the delivered dose. Verification techniques like Prompt-Gamma-Timing-based Stopping Power Estimation (PGT-SPE) may allow for reduction of safety margins in treatment planning. Approach. From Prompt-Gamma-Timing measurements, we reconstruct the spatiotemporal distribution of prompt gamma emissions, which is linked to the average motion of the primary particles. The stopping power is determined by fitting a model of the average particle motion. Here, we compare a previously published implementation of the particle motion model with an alternative formulation and present two formulations to automatically select the hyperparameters of our procedure. The performance was assessed using Monte-Carlo simulations of proton beams (60 MeV–219 MeV) impinging on a homogeneous PMMA phantom. Main results. The range was successfully determined within a standard deviation of 3 mm for proton beam energies from 70 MeV to 219 MeV. Stopping power estimates showed errors below 5% for beam energies above 160 MeV. At lower energies, the estimation performance degraded to unsatisfactory levels due to the short range of the protons. The new motion model improved the estimation performance by up to 5% for beam energies from 100 MeV to 150 MeV with mean errors ranging from 6% to 18%. The automated hyperparameter optimization matched the average error of previously reported manual selections, while significantly reducing the outliers. Significance. The data-driven hyperparameter optimization allowed for a reproducible and fast evaluation of our method. The updated motion model and evaluation at new beam energies bring us closer to applying PGT-SPE in more complex scenarios. Direct comparison of stopping power estimates between treatment planning and measurements during irradiation would offer a more direct verification than other secondary-particle-based techniques.


  • Joint Chance Constrained Optimal Control via Linear Programming

    by Niklas Schmid, Marta Fochesato, Tobias Sutter, John Lygeros

    We establish a linear programming formulation for the solution of joint chance constrained optimal control problems over finite time horizons. The joint chance constraint may represent an invariance, reachability or reach-avoid specification that the trajectory must satisfy with a predefined probability. For finite state and action spaces, the solution is exact and our method computationally superior to approaches in the literature. For continuous state or action spaces, our linear programming formulation enables basis function approximations.