SearcharxivSearch

arXiv subjects

Dirk Wollherr

Publications and source records attributed to Dirk Wollherr.

At least 19 recordsLinked to original sources

An Adaptive Control Architecture for Slope and Terrain Compensation in Autonomous Navigation in Mediterranean Greenhouses

The ability to move stably over terrain with varying slopes and textures is essential for mobile agricultural robots operating in complex and dynamic environments such as greenhouses, where small terrain irregularities can lead to significant navigation errors. This article presents a novel terrain-adaptation strategy based on the carried payload, ensuring accurate and robust trajectory tracking. The proposed approach is based on: (i) the experimental characterization of the most common types of greenhouse soil, concrete, compacted sand, and gravel, and (ii) the direct measurement of terrain slope using the IMU, in order to estimate the force with which this angle affects the motor input. Based on this information, a cascade trajectory-tracking scheme has been designed, consisting of a model-based predictive controller (MPC) in the outer loop and a PI controller in the inner loop. The system incorporates an adaptive feedforward control through gain scheduling approach, capable of adjusting to disturbances caused by variations in slope and terrain type. Simulation results demonstrate that the differential-drive robot achieves a significant improvement both in error indices and in control signal efficiency, highlighting the effectiveness and robustness of the proposed approach.

cs.RO

Branch-Stochastic Model Predictive Control for Motion Planning under Multi-Modal Uncertainty with Scenario Clustering

Motion planning for autonomous driving must account for multi-modal uncertainty in both the intentions and trajectories of surrounding vehicles. Handling uncertainty in a worst-case manner guarantees robustness but often leads to excessive conservatism. Stochastic Model Predictive Control (SMPC) reduces trajectory-level conservatism through chance constraints, yet remains conservative with respect to intention uncertainty since constraints must hold across all intentions. We present a novel combination of SMPC and the branching structure, enabling the planner to generate distinct trajectories for different possible intentions while maintaining safety under trajectory uncertainty. A novel scenario clustering is proposed to merge prediction scenarios based on high-level decision similarity, thereby ensuring real-time tractability. Furthermore, an adaptive branching-time computation postpones commitment to separate plans until intention uncertainty is sufficiently reduced. Simulation studies in challenging highway scenarios demonstrate that the proposed method improves safety, reduces conservatism, and achieves real-time computational performance.

cs.RO

MITI: SLAM Benchmark for Laparoscopic Surgery

We propose a new benchmark for evaluating stereoscopic visual-inertial computer vision algorithms (SLAM/ SfM/ 3D Reconstruction/ Visual-Inertial Odometry) for minimally invasive surgical (MIS) interventions in the abdomen. Our MITI Dataset available at [https://mediatum.ub.tum.de/1621941] provides all the necessary data by a complete recording of a handheld surgical intervention at Research Hospital Rechts der Isar of TUM. It contains multimodal sensor information from IMU, stereoscopic video, and infrared (IR) tracking as ground truth for evaluation. Furthermore, calibration for the stereoscope, accelerometer, magnetometer, the rigid transformations in the sensor setup, and time-offsets are available. We wisely chose a suitable intervention that contains very few cutting and tissue deformation and shows a full scan of the abdomen with a handheld camera such that it is ideal for testing SLAM algorithms. Intending to promote the progress of visual-inertial algorithms designed for MIS application, we hope that our clinical training dataset helps and enables researchers to enhance algorithms.

eess.IV

Sampling-based Stochastic Data-driven Predictive Control under Data Uncertainty - Extended Version

We present a stochastic constrained output-feedback data-driven predictive control scheme for linear time-invariant systems subject to bounded additive disturbances. The approach uses data-driven predictors based on an extension of Willems' fundamental lemma and requires only a single persistently exciting input-output data trajectory. Compared to current state-of-the-art approaches, we do not rely on availability of exact disturbance data. Instead, we leverage a novel parameterization of the unknown disturbance data considering consistency with the measured data and the system class. This allows for deterministic approximation of the chance constraints in a sampling-based fashion. A robust constraint on the first predicted step enables recursive feasibility, closed-loop constraint satisfaction, and robust asymptotic stability in expectation under standard assumptions. A numerical example demonstrates the efficiency of the proposed control scheme.

eess.SY

Active Fault Identification and Robust Control for Unknown Bounded Faults via Volume-Based Costs

This paper proposes a novel framework for active fault diagnosis and parameter estimation in linear systems operating in closed-loop, subject to unknown but bounded faults. The approach integrates set-membership identification with a cost function designed to accelerate fault identification. Informative excitation is achieved by minimizing the size of the parameter uncertainty set, which is approximated using ellipsoidal outer bounds. Combining this formulation with a scheduling parameter enables a transition back to nominal control as confidence in the model estimates increases. Unlike many existing methods, the proposed approach does not rely on predefined fault models. Instead, it only requires known bounds on parameter deviations and additive disturbances. Robust constraint satisfaction is guaranteed through a tube-based model predictive control scheme. Simulation results demonstrate that the method achieves faster fault detection and identification compared to passive strategies and adaptive ones based on persistent excitation constraints.

math.OC

Grasping in Uncertain Environments: A Case Study For Industrial Robotic Recycling

Autonomous robotic grasping of uncertain objects in uncertain environments is an impactful open challenge for the industries of the future. One such industry is the recycling of Waste Electrical and Electronic Equipment (WEEE) materials, in which electric devices are disassembled and readied for the recovery of raw materials. Since devices may contain hazardous materials and their disassembly involves heavy manual labor, robotic disassembly is a promising venue. However, since devices may be damaged, dirty and unidentified, robotic disassembly is challenging since object models are unavailable or cannot be relied upon. This case study explores grasping strategies for industrial robotic disassembly of WEEE devices with uncertain vision data. We propose three grippers and appropriate tactile strategies for force-based manipulation that improves grasping robustness. For each proposed gripper, we develop corresponding strategies that can perform effectively in different grasping tasks and leverage the grippers design and unique strengths. Through experiments conducted in lab and factory settings for four different WEEE devices, we demonstrate how object uncertainty may be overcome by tactile sensing and compliant techniques, significantly increasing grasping success rates.

cs.RO

Adaptive Stochastic Predictive Control from Noisy Data: A Sampling-based Approach

In this work, an adaptive predictive control scheme for linear systems with unknown parameters and bounded additive disturbances is proposed. In contrast to related adaptive control approaches that robustly consider the parametric uncertainty, the proposed method handles all uncertainties stochastically by employing an online adaptive sampling-based approximation of chance constraints. The approach requires initial data in the form of a short input-output trajectory and distributional knowledge of the disturbances. This prior knowledge is used to construct an initial set of data-consistent system parameters and a distribution that allows for sample generation. As new data stream in online, the set of consistent system parameters is adapted by exploiting set membership identification. Consequently, chance constraints are deterministically approximated using a probabilistic scaling approach by sampling from the set of system parameters. In combination with a robust constraint on the first predicted step, recursive feasibility of the proposed predictive controller and closed-loop constraint satisfaction are guaranteed. A numerical example demonstrates the efficacy of the proposed method.

eess.SY

Safe and Non-Conservative Trajectory Planning for Autonomous Driving Handling Unanticipated Behaviors of Traffic Participants

Trajectory planning for autonomous driving is challenging because the unknown future motion of traffic participants must be accounted for, yielding large uncertainty. Stochastic Model Predictive Control (SMPC)-based planners provide non-conservative planning, but do not rule out a (small) probability of collision. We propose a control scheme that yields an efficient trajectory based on SMPC when the traffic scenario allows, still avoiding that the vehicle causes collisions with traffic participants if the latter move according to the prediction assumptions. If some traffic participant does not behave as anticipated, no safety guarantee can be given. Then, our approach yields a trajectory which minimizes the probability of collision, using Constraint Violation Probability Minimization techniques. Our algorithm can also be adapted to minimize the anticipated harm caused by a collision. We provide a thorough discussion of the benefits of our novel control scheme and compare it to a previous approach through numerical simulations from the CommonRoad database.

eess.SY

Factor Graph-Based Planning as Inference for Autonomous Vehicle Racing

Factor graph, as a bipartite graphical model, offers a structured representation by revealing local connections among graph nodes. This study explores the utilization of factor graphs in modeling the autonomous racecar planning problem, presenting an alternate perspective to the traditional optimization-based formulation. We model the planning problem as a probabilistic inference over a factor graph, with factor nodes capturing the joint distribution of motion objectives. By leveraging the duality between optimization and inference, a fast solution to the maximum a posteriori estimation of the factor graph is obtained via least-squares optimization. The localized design thinking inherent in this formulation ensures that motion objectives depend on a small subset of variables. We exploit the locality feature of the factor graph structure to integrate the minimum curvature path and local planning computations into a unified algorithm. This diverges from the conventional separation of global and local planning modules, where curvature minimization occurs at the global level. The evaluation of the proposed framework demonstrated superior performance for cumulative curvature and average speed across the racetrack. Furthermore, the results highlight the computational efficiency of our approach. While acknowledging the structural design advantages and computational efficiency of the proposed methodology, we also address its limitations and outline potential directions for future research.

cs.RO

Minimal Constraint Violation Probability in Model Predictive Control for Linear Systems

Handling uncertainty in model predictive control comes with various challenges, especially when considering state constraints under uncertainty. Most methods focus on either the conservative approach of robustly accounting for uncertainty or allowing a small probability of constraint violation. In this work, we propose a linear model predictive control approach that minimizes the probability that linear state constraints are violated in the presence of additive uncertainty. This is achieved by first determining a set of inputs that minimize the probability of constraint violation. Then, this resulting set is used to define admissible inputs for the optimal control problem. Recursive feasibility is guaranteed and input-to-state stability is proved under assumptions. Numerical results illustrate the benefits of the proposed model predictive control approach.

eess.SY

Combining Belief Function Theory and Stochastic Model Predictive Control for Multi-Modal Uncertainty in Autonomous Driving

In automated driving, predicting and accommodating the uncertain future motion of other traffic participants is challenging, especially in unstructured environments in which the high-level intention of traffic participants is difficult to predict. Several possible uncertain future behaviors of traffic participants must be considered, resulting in multi-modal uncertainty. We propose a novel combination of Belief Function Theory and Stochastic Model Predictive Control for trajectory planning of the autonomous vehicle in presence of significant uncertainty about the intention estimation of traffic participants. A misjudgment of the intention of traffic participants may result in dangerous situations. At the same time, excessive conservatism must be avoided. Therefore, the measure of reliability of the estimation provided by Belief Function Theory is used in the design of collision-avoidance safety constraints, in particular to increase safety when the intention of traffic participants is not clear. We discuss two methods to leverage on Belief Function Theory: we introduce a novel belief-to-probability transformation designed not to underestimate unlikely events if the information is uncertain, and a constraint tightening mechanism using the reliability of the estimation. We evaluate our proposal through simulations comparing to state-of-the-art approaches.

eess.SY

Optimal Control for Indoor Vertical Farms Based on Crop Growth

Vertical farming allows for year-round cultivation of a variety of crops, overcoming environmental limitations and ensuring food security. This closed and highly controlled system allows the plants to grow in optimal conditions, so that they reach maturity faster and yield more than on a conventional outdoor farm. However, one of the challenges of vertical farming is the high energy consumption. In this work, we optimize wheat growth using an optimal control approach with two objectives: first, we optimize inputs such as water, radiation, and temperature for each day of the growth cycle, and second, we optimize the duration of the plant's growth period to achieve the highest possible yield over a whole year. For this, we use a nonlinear, discrete-time hybrid model based on a simple universal crop model that we adapt to make the optimization more efficient. Using our approach, we find an optimal trade-off between used resources, net profit of the yield, and duration of a cropping period, thus increasing the annual yield of crops significantly while keeping input costs as low as possible. This work demonstrates the high potential of control theory in the discipline of vertical farming.

eess.SY

Comparison of Dynamic Tomato Growth Models for Optimal Control in Greenhouses

As global demand for efficiency in agriculture rises, there is a growing interest in high-precision farming practices. Particularly greenhouses play a critical role in ensuring a year-round supply of fresh produce. In order to maximize efficiency and productivity while minimizing resource use, mathematical techniques such as optimal control have been employed. However, selecting appropriate models for optimal control requires domain expertise. This study aims to compare three established tomato models for their suitability in an optimal control framework. Results show that all three models have similar yield predictions and accuracy, but only two models are currently applicable for optimal control due to implementation limitations. The two remaining models each have advantages in terms of economic yield and computation times, but the differences in optimal control strategies suggest that they require more accurate parameter identification and calibration tailored to greenhouses.

math.OC

An Online Adaptation Strategy for Direct Data-driven Control

The fundamental lemma from behavioral systems theory yields a data-driven non-parametric system representation that has shown great potential for the data-efficient control of unknown linear and weakly nonlinear systems, even in the presence of measurement noise. In this work, we strive to extend the applicability of this paradigm to more strongly nonlinear systems by updating the system representation during control. Unlike existing approaches, our method does not impose suitable excitation to the control inputs, but runs as an observer parallel to the controller. Whenever a rank condition is deemed to be fulfilled, the system representation is updated using newly available datapoints. In a reference tracking simulation of a two-link robotic arm, we showcase the performance of the proposed strategy in a predictive control framework.

eess.SY

Offline Uncertainty Sampling in Data-driven Stochastic MPC

In this work, we exploit an offline-sampling based strategy for the constrained data-driven predictive control of an unknown linear system subject to random measurement noise. The strategy uses only past measured, potentially noisy data in a non-parametric system representation and does not require any prior model identification. The approximation of chance constraints using uncertainty sampling leads to efficient constraint tightening. Under mild assumptions, robust recursive feasibility and closed-loop constraint satisfaction is shown. In a simulation example, we provide evidence for the improved control performance of the proposed control scheme in comparison to a purely robust data-driven predictive control approach.

eess.SY

Data-driven tube-based stochastic predictive control

A powerful result from behavioral systems theory known as the fundamental lemma allows for predictive control akin to Model Predictive Control (MPC) for linear time invariant (LTI) systems with unknown dynamics purely from data. While most of data-driven predictive control literature focuses on robustness with respect to measurement noise, only few works consider exploiting probabilistic information of disturbances for performance-oriented control as in stochastic MPC. In this work, we propose a novel data-driven stochastic predictive control scheme for chance-constrained LTI systems subject to measurement noise and additive stochastic disturbances. In order to render the otherwise stochastic and intractable optimal control problem deterministic, our approach leverages ideas from tube-based MPC by decomposing the state into a deterministic nominal state driven by inputs and a stochastic error state affected by disturbances. By tightening constraints probabilistically with respect to the additive disturbance and robustly with respect to the measurement noise, satisfaction of original chance-constraints is guaranteed. The resulting data-driven receding horizon optimal control problem is lightweight and recursively feasible, and renders the closed loop input-to-state stable with respect to both additive disturbances and measurement noise. We demonstrate the effectiveness of the proposed approach in a simulation example.

eess.SY

Disturbance Estimation for High-Degree-of-Freedom Euler-Lagrangian Systems Using Sliding Mode Observer without Matching Conditions

This paper proposes a novel observer-based disturbance estimation method for high degree-of-freedom Euler-Lagrangian systems using an unknown input-output (UIO) sliding mode observer (SMO). Different from the previous SMO methods, this approach does not assume the matching condition of the disturbances. Besides, compared to the conventional disturbance estimation methods, the proposed method does not require the calculation of the inverse inertia matrices and accurate measurement of system velocities. This advantage resolves the concerns of heavy computational load and amplified noise for practical problems like external torque estimation of high degree-of-freedom manipulators in safe human-robot collaboration. We achieve this by defining a novel linearized model for the Euler-Lagrangian system and designing a sliding-mode-based disturbance observer. The estimation precision of the observer is ensured by the Lyapunov-based stability proof and the equivalent control theory of sliding mode. At the end of this paper, the method is implemented on a seven-degree-of-freedom robot manipulator, and the experimental results confirm its decent performance and potential to be applied in practice.

cs.RO

Safe Stochastic Model Predictive Control

Combining efficient and safe control for safety-critical systems is challenging. Robust methods may be overly conservative, whereas probabilistic controllers require a trade-off between efficiency and safety. In this work, we propose a safety algorithm that is compatible with any stochastic Model Predictive Control method for linear systems with additive uncertainty and polytopic constraints. This safety algorithm allows to use the optimistic control inputs of stochastic Model Predictive Control as long as a safe backup planner can ensure safety with respect to satisfying hard constraints subject to bounded uncertainty. Besides ensuring safe behavior, the proposed stochastic Model Predictive Control algorithm guarantees recursive feasibility and input-to-state stability of the system origin. The benefits of the safe stochastic Model Predictive Control algorithm are demonstrated in a numerical simulation, highlighting the advantages compared to purely robust or stochastic predictive controllers.

eess.SY