SearcharxivSearch

arXiv subjects

Daniel Görges

Publications and source records attributed to Daniel Görges.

18 recordsLinked to original sources

Horizon Selection in Physics-Enhanced Neural ODEs: Theoretical Insights and Flux Linkage Application

The integration horizon during the training plays a critical role in Physics-Enhanced Neural Ordinary Differential Equations. We draw conclusions about horizon extension in the training of Neural Ordinary Differential Equations based on classical nonlinear system identification of input-output models. In light of this insight, we propose a framework that exploits longer horizons to reduce bias in physical parameter estimates, extracts residual information from data, and acts as a regularizer improving generalization. In the learning of a model for permanent magnet synchronous machine, the method is used to jointly estimate the flux map and the resistance.

eess.SY

Joint identification of permanent magnet synchronous machine and inverter

In electric drive modeling, identifying the magnetic flux maps is essential for predicting accurately the torque, parameterizing a controller for tracking the torque or creating a simulation model. However, the voltage output by the controller (commanded voltage) is usually disturbed by non-linearity of the inverter, which needs to be taken into account. This paper presents a novel approach to enhance the offline flux identification from commanded voltage inputs, circumventing the need for prior identification of inverter parameters. In the dq reference frame, the flux maps are represented as static relationships between dq fluxes and dq currents. We utilize a tensor product spline model to accurately capture saturation and cross-saturation effects. The effects of the voltage disturbance on the estimated flux maps are not negligible. It is demonstrated that a joint identification of the flux maps and a simple model of the inverter can highly improve the flux model. The method is validated on FEM simulation and test-bench data.

eess.SY

Cooperative Adaptive Cruise Control with Variable Time Headway for Graceful Degradation under Fluctuating Network Quality of Service

This paper proposes a dynamic distance adaptation for Cooperative Adaptive Cruise Control (CACC) under time-varying network conditions. When the Quality of Service (QoS) drops below a level required to maintain desired inter-vehicle distances, an online adaptation of the reference distances, reflected by a change of the time headway factor, becomes necessary. We present a control design algorithm realizing a graceful degradation, for which a distance control to a virtual preceding vehicle is introduced. Furthermore, the Integral Quadratic Constraints (IQC) framework is applied to guarantee robust stability of the time-varying system. The concept is validated in simulation and experimentally using small-scale test vehicles.

eess.SY

Component-Aware Pruning Framework for Neural Network Controllers via Gradient-Based Importance Estimation

The transition from monolithic to multi-component neural architectures in advanced neural network controllers poses substantial challenges due to the high computational complexity of the latter. Conventional model compression techniques for complexity reduction, such as structured pruning based on norm-based metrics to estimate the relative importance of distinct parameter groups, often fail to capture functional significance. This paper introduces a component-aware pruning framework that utilizes gradient information to compute three distinct importance metrics during training: Gradient Accumulation, Fisher Information, and Bayesian Uncertainty. Experimental results with an autoencoder and a TD-MPC agent demonstrate that the proposed framework reveals critical structural dependencies and dynamic shifts in importance that static heuristics often miss, supporting more informed compression decisions.

cs.LG

A Latent Space Framework for Modeling Transient Engine Emissions Using Joint Embedding Predictive Architectures

Accurately modeling and controlling vehicle exhaust emissions during transient events, such as rapid acceleration, is critical for meeting environmental regulations and optimizing powertrains. Conventional data-driven methods, such as Multilayer Perceptrons (MLPs) and Long Short-Term Memory (LSTM) networks, improve upon phenomenological models but often struggle with the complex nonlinear dynamics of emission formation. These monolithic architectures are sensitive to dataset variability and typically require deep, computationally expensive structures to perform well, limiting their practical utility. This paper introduces a novel approach that overcomes these limitations by modeling emission dynamics within a structured latent space. Leveraging a Joint Embedding Predictive Architecture (JEPA), the proposed framework learns from a rich dataset that combines real-world Portable Emission Measurement System (PEMS) data with high-frequency hardware-in-the-loop measurements. The model abstracts away irrelevant noise, encoding only the key factors governing emission behavior into a compact, robust representation. This results in superior data efficiency and predictive accuracy across diverse transient regimes, significantly outperforming high-performing LSTM baselines in generalization. To ensure suitability for real-world deployment, the JEPA framework is structured to support pruning and post-training quantization. This strategy drastically reduces the computational footprint, minimizing inference time and memory demand with negligible accuracy loss. The result is a highly efficient model ideal for on-board implementation of advanced strategies, such as model predictive control or model-based reinforcement learning, in conventional and hybrid powertrains. These findings offer a clear pathway toward more robust emission control systems for next-generation vehicles.

eess.SY

Application-Specific Component-Aware Structured Pruning of Deep Neural Networks in Control via Soft Coefficient Optimization

Deep neural networks (DNNs) offer significant flexibility and robust performance. This makes them ideal for building not only system models but also advanced neural network controllers (NNCs). However, their high complexity and computational needs often limit their use. Various model compression strategies have been developed over the past few decades to address these issues. These strategies are effective for general DNNs but do not directly apply to NNCs. NNCs need both size reduction and the retention of key application-specific performance features. In structured pruning, which removes groups of related elements, standard importance metrics often fail to protect these critical characteristics. In this paper, we introduce a novel framework for calculating importance metrics in pruning groups. This framework not only shrinks the model size but also considers various application-specific constraints. To find the best pruning coefficient for each group, we evaluate two approaches. The first approach involves simple exploration through grid search. The second utilizes gradient descent optimization, aiming to balance compression and task performance. We test our method in two use cases: one on an MNIST autoencoder and the other on a Temporal Difference Model Predictive Control (TDMPC) agent. Results show that the method effectively maintains application-relevant performance while achieving a significant reduction in model size.

cs.LG

Learning State-Space Models of Dynamic Systems from Arbitrary Data using Joint Embedding Predictive Architectures

With the advent of Joint Embedding Predictive Architectures (JEPAs), which appear to be more capable than reconstruction-based methods, this paper introduces a novel technique for creating world models using continuous-time dynamic systems from arbitrary observation data. The proposed method integrates sequence embeddings with neural ordinary differential equations (neural ODEs). It employs loss functions that enforce contractive embeddings and Lipschitz constants in state transitions to construct a well-organized latent state space. The approach's effectiveness is demonstrated through the generation of structured latent state-space models for a simple pendulum system using only image data. This opens up a new technique for developing more general control algorithms and estimation techniques with broad applications in robotics.

cs.LG

COMponent-Aware Pruning for Accelerated Control Tasks in Latent Space Models

The rapid growth of resource-constrained mobile platforms, including mobile robots, wearable systems, and Internet-of-Things devices, has increased the demand for computationally efficient neural network controllers (NNCs) that can operate within strict hardware limitations. While deep neural networks (DNNs) demonstrate superior performance in control applications, their substantial computational complexity and memory requirements present significant barriers to practical deployment on edge devices. This paper introduces a comprehensive model compression methodology that leverages component-aware structured pruning to determine the optimal pruning magnitude for each pruning group, ensuring a balance between compression and stability for NNC deployment. Our approach is rigorously evaluated on Temporal Difference Model Predictive Control (TD-MPC), a state-of-the-art model-based reinforcement learning algorithm, with a systematic integration of mathematical stability guarantee properties, specifically Lyapunov criteria. The key contribution of this work lies in providing a principled framework for determining the theoretical limits of model compression while preserving controller stability. Experimental validation demonstrates that our methodology successfully reduces model complexity while maintaining requisite control performance and stability characteristics. Furthermore, our approach establishes a quantitative boundary for safe compression ratios, enabling practitioners to systematically determine the maximum permissible model reduction before violating critical stability properties, thereby facilitating the confident deployment of compressed NNCs in resource-limited environments.

cs.RO

Enhanced Pruning Strategy for Multi-Component Neural Architectures Using Component-Aware Graph Analysis

Deep neural networks (DNNs) deliver outstanding performance, but their complexity often prohibits deployment in resource-constrained settings. Comprehensive structured pruning frameworks based on parameter dependency analysis reduce model size with specific regard to computational performance. When applying them to Multi-Component Neural Architectures (MCNAs), they risk network integrity by removing large parameter groups. We introduce a component-aware pruning strategy, extending dependency graphs to isolate individual components and inter-component flows. This creates smaller, targeted pruning groups that conserve functional integrity. Demonstrated effectively on a control task, our approach achieves greater sparsity and reduced performance degradation, opening a path for optimizing complex, multi-component DNNs efficiently.

cs.LG

Polygonal Obstacle Avoidance Combining Model Predictive Control and Fuzzy Logic

In practice, navigation of mobile robots in confined environments is often done using a spatially discrete cost-map to represent obstacles. Path following is a typical use case for model predictive control (MPC), but formulating constraints for obstacle avoidance is challenging in this case. Typically the cost and constraints of an MPC problem are defined as closed-form functions and typical solvers work best with continuously differentiable functions. This is contrary to spatially discrete occupancy grid maps, in which a grid's value defines the cost associated with occupancy. This paper presents a way to overcome this compatibility issue by re-formulating occupancy grid maps to continuously differentiable functions to be embedded into the MPC scheme as constraints. Each obstacle is defined as a polygon -- an intersection of half-spaces. Any half-space is a linear inequality representing one edge of a polygon. Using AND and OR operators, the combined set of all obstacles and therefore the obstacle avoidance constraints can be described. The key contribution of this paper is the use of fuzzy logic to re-formulate such constraints that include logical operators as inequality constraints which are compatible with standard MPC formulation. The resulting MPC-based trajectory planner is successfully tested in simulation. This concept is also applicable outside of navigation tasks to implement logical or verbal constraints in MPC.

cs.RO

Barrier Method for Inequality Constrained Factor Graph Optimization with Application to Model Predictive Control

Factor graphs have demonstrated remarkable efficiency for robotic perception tasks, particularly in localization and mapping applications. However, their application to optimal control problems -- especially Model Predictive Control (MPC) -- has remained limited due to fundamental challenges in constraint handling. This paper presents a novel integration of the Barrier Interior Point Method (BIPM) with factor graphs, implemented as an open-source extension to the widely adopted g2o framework. Our approach introduces specialized inequality factor nodes that encode logarithmic barrier functions, thereby overcoming the quadratic-form limitations of conventional factor graph formulations. To the best of our knowledge, this is the first g2o-based implementation capable of efficiently handling both equality and inequality constraints within a unified optimization backend. We validate the method through a multi-objective adaptive cruise control application for autonomous vehicles. Benchmark comparisons with state-of-the-art constraint-handling techniques demonstrate faster convergence and improved computational efficiency. (Code repository: https://github.com/snt-arg/bipm_g2o)

cs.RO

Trajectory Planning with Model Predictive Control for Obstacle Avoidance Considering Prediction Uncertainty

This paper introduces a novel trajectory planner for autonomous robots, specifically designed to enhance navigation by incorporating dynamic obstacle avoidance within the Robot Operating System 2 (ROS2) and Navigation 2 (Nav2) framework. The proposed method utilizes Model Predictive Control (MPC) with a focus on handling the uncertainties associated with the movement prediction of dynamic obstacles. Unlike existing Nav2 trajectory planners which primarily deal with static obstacles or react to the current position of dynamic obstacles, this planner predicts future obstacle positions using a stochastic Vector Auto-Regressive Model (VAR). The obstacles' future positions are represented by probability distributions, and collision avoidance is achieved through constraints based on the Mahalanobis distance, ensuring the robot avoids regions where obstacles are likely to be. This approach considers the robot's kinodynamic constraints, enabling it to track a reference path while adapting to real-time changes in the environment. The paper details the implementation, including obstacle prediction, tracking, and the construction of feasible sets for MPC. Simulation results in a Gazebo environment demonstrate the effectiveness of this method in scenarios where robots must navigate around each other, showing improved collision avoidance capabilities.

eess.SY

ecg2o: A Seamless Extension of g2o for Equality-Constrained Factor Graph Optimization

Factor graph optimization serves as a fundamental framework for robotic perception, enabling applications such as pose estimation, simultaneous localization and mapping (SLAM), structure-from-motion (SfM), and situational awareness. Traditionally, these methods solve unconstrained least squares problems using algorithms such as Gauss-Newton and Levenberg-Marquardt. However, extending factor graphs with native support for equality constraints can improve solution accuracy and broaden their applicability, particularly in optimal control. In this paper, we propose a novel extension of factor graphs that seamlessly incorporates equality constraints without requiring additional optimization algorithms. Our approach maintains the efficiency and flexibility of existing second-order optimization techniques while ensuring constraint feasibility. To validate our method, we apply it to an optimal control problem for velocity tracking in autonomous vehicles and benchmark our results against state-of-the-art constraint handling techniques. Additionally, we introduce ecg2o, a header-only C++ library that extends the widely used g2o factor graph library by adding full support for equality-constrained optimization. This library, along with demonstrative examples and the optimal control problem, is available as open source at https://github.com/snt-arg/ecg2o

eess.SY

State Derivative Normalization for Continuous-Time Deep Neural Networks

The importance of proper data normalization for deep neural networks is well known. However, in continuous-time state-space model estimation, it has been observed that improper normalization of either the hidden state or hidden state derivative of the model estimate, or even of the time interval can lead to numerical and optimization challenges with deep learning based methods. This results in a reduced model quality. In this contribution, we show that these three normalization tasks are inherently coupled. Due to the existence of this coupling, we propose a solution to all three normalization challenges by introducing a normalization constant at the state derivative level. We show that the appropriate choice of the normalization constant is related to the dynamics of the to-be-identified system and we derive multiple methods of obtaining an effective normalization constant. We compare and discuss all the normalization strategies on a benchmark problem based on experimental data from a cascaded tanks system and compare our results with other methods of the identification literature.

eess.SY

Evaluation of the Driving Performance and User Acceptance of a Predictive Eco-Driving Assistance System for Electric Vehicles

In this work, a predictive eco-driving assistance system (pEDAS) with the goal to assist drivers in improving their driving style and thereby reducing the energy consumption in battery electric vehicles while enhancing the driving safety and comfort is introduced and evaluated. pEDAS in this work is equipped with two model predictive controllers (MPCs), namely reference-tracking MPC and car-following MPC, that use the information from onboard sensors, signal phase and timing (SPaT) messages from traffic light infrastructure, and geographical information of the driving route to compute an energy-optimal driving speed. An optimal speed suggestion and informative advice are indicated to the driver using a visual feedback. pEDAS provides continuous feedback and encourages the drivers to perform energy-efficient car-following while tracking a preceding vehicle, travel at safe speeds at turns and curved roads, drive at energy-optimal speed determined using dynamic programming in freeway scenarios, and travel with a green-wave optimal speed to cross the signalized intersections at a green phase whenever possible. Furthermore, to evaluate the efficacy of the proposed pEDAS, user studies were conducted with 41 participants on a dynamic driving simulator. The objective analysis revealed that the drivers achieved mean energy savings up to 10%, reduced the speed limit violations, and avoided unnecessary stops at signalized intersections by using pEDAS. Finally, the user acceptance of the proposed pEDAS was evaluated using the Technology Acceptance Model (TAM) and Theory of Planned Behavior (TPB). The results showed an overall positive attitude of users and that the perceived usefulness and perceived behavioral control were found to be the significant factors in influencing the behavioral intention to use pEDAS.

eess.SY

Deep Learning-Based Vehicle Speed Prediction for Ecological Adaptive Cruise Control in Urban and Highway Scenarios

In a typical car-following scenario, target vehicle speed fluctuations act as an external disturbance to the host vehicle and in turn affect its energy consumption. To control a host vehicle in an energy-efficient manner using model predictive control (MPC), and moreover, enhance the performance of an ecological adaptive cruise control (EACC) strategy, forecasting the future velocities of a target vehicle is essential. For this purpose, a deep recurrent neural network-based vehicle speed prediction using long-short term memory (LSTM) and gated recurrent units (GRU) is studied in this work. Besides these, the physics-based constant velocity (CV) and constant acceleration (CA) models are discussed. The sequential time series data for training (e.g. speed trajectories of the target and its preceding vehicles obtained through vehicle-to-vehicle (V2V) communication, road speed limits, traffic light current and future phases collected using vehicle-to-infrastructure (V2I) communication) is gathered from both urban and highway networks created in the microscopic traffic simulator SUMO. The proposed speed prediction models are evaluated for long-term predictions (up to 10 s) of target vehicle future velocities. Moreover, the results revealed that the LSTM-based speed predictor outperformed other models in terms of achieving better prediction accuracy on unseen test datasets, and thereby showcasing better generalization ability. Furthermore, the performance of EACC-equipped host car on the predicted velocities is evaluated, and its energy-saving benefits for different prediction horizons are presented.

eess.SY

Ecological Adaptive Cruise Control for City Buses based on Hybrid Model Predictive Control using PnG and Traffic Light Information

This paper proposes an ecological adaptive cruise control (EACC) concept with the primary goal to minimize the fuel consumption in a city bus with an internal combustion engine (ICE). A hybrid model predictive control (HMPC) is implemented in this work to control both continuous and discrete-time variables. Moreover, a multi-objective optimization problem for EACC is formulated in time-domain as a mixed-integer quadratically constrained quadratic programming (MIQCQP) problem. The proposed HMPC-EACC performs robust vehicle-following while tracking a leading vehicle and plans fuel-efficient acceleration and deceleration maneuvers for the host vehicle. Additionally, it uses the signal phase and timing (SPaT) information to compute a green wave reference speed for the host vehicle to cross the signalized intersections at a green phase. Moreover, the proposed controller performs pulse and glide (PnG) to optimally control the engine ON and OFF states and save additional fuel. Furthermore, the performance of the proposed strategy is evaluated on a real-world driving profile and compared against a baseline controller from the literature. Finally, the influence of different prediction horizons on the fuel savings and computation times are studied. The results reveal significant reduction in fuel consumption with HMPC-EACC and demonstrate that the proposed controller is real-time capable.

eess.SY

Cyber-Automotive Simulation and Evaluation Platform for Vehicular Value Added Services

An easily moving and safe transportation is an indicator in any country in the world of economic growth and well-being. For the past 100 years, innovation within the automotive sector has brought major technological advances leading to safer, cleaner and more affordable vehicles. But for the most time since the inception of the moving assembly line for vehicle production by Henry Ford, the changes have been incremental / evolutionary. Thanks to the new possibilities due to the IT / wireless revolution, the automotive industry appears to be on the cusp of revolutionary change with potential to dramatically reshape not just the competitive landscape but also the way we interact with vehicles, and indeed the future design of our roads and cities. Apart from connected personal mobility, vehicles are also envisioned to provide Value Added Services (VAS) such as autonomous driving via Vehicle-to-Vehicle (V2V) and Vehicle-to-infrastructure (V2I), electric load balancing via Vehicle-to-Grid (V2G) solutions, communication solutions using Visible Light Communications (VLC) etc. The development and evaluation of vehicular VAS requires a modular and scalable multidisciplinary simulation platform. In this paper we propose a novel simulation platform named Cyber-Automotive Simulation \& Evaluation Platform (CASEP). The purpose of CASEP is to evaluate and visualize the gains of various vehicular VAS with special emphasis on commercial vehicle VAS. The use cases are evaluated with respect to the mission-specific performance indicators, thereby providing usable metrics for optimization. The visualization platform is being developed using the UNITY 3D engine, thereby enabling intuitive interaction as in real physics-based games

cs.CY