Search arXivSearch

arXiv · 2607.03000

Physics-Informed Neural State-Space Modeling of Battery-Electric Vehicle Dynamics for Closed-Loop Automated Parking Simulation

Abstract

This paper contributes to vehicle dynamics modeling by introducing a physics-informed neural state-space model tailored for the parking regime of a production battery-electric sedan, identified entirely from field-test maneuvers. At parking speeds the model captures what the kinematic idealization omits, including actuator lag, drivetrain creep, brake-hold transitions through standstill, and frequent reversals of the motion direction. A gear-conditioned velocity constraint is imposed during training, and the yaw rate is read out as a learned residual on a kinematic-bicycle prior, so that the network devotes its capacity to the deviation from physics rather than to its reproduction. These training-time physics make the customary inference-time state limiter redundant. The commanded-to-actual behavior of the drive, brake, and steering actuators is reproduced by dedicated submodels, for which signal fidelity proves an unreliable proxy for closed-loop value; tuning the brake on its velocity consequence rather than on its own signal reverses the verdict reached at the signal level. The model generalizes to held-out maneuvers in fully open-loop simulation, and, despite being identified from only 16 field tests, the assembled command-to-vehicle chain earns Good ratings on the vehicle states under the ISO/TS 18571 objective rating metric. Embedded as the real-time plant of an interactive simulator, it enables a production-representative planning stack to park the vehicle through the learned dynamics. This makes the model suitable for pre-calibrating an automated-parking planning and control stack in the virtual development phase without the manufacturer's proprietary chassis and actuator parameters.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sirong Pan, Guannan Tian, Pan Song. 2026-07-03. Physics-Informed Neural State-Space Modeling of Battery-Electric Vehicle Dynamics for Closed-Loop Automated Parking Simulation. https://arxiv.org/abs/2607.03000

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Failure-Aware Iterative Learning of State-Control Invariant Sets

In this paper, we address the problem of computing maximal state-control invariant sets for deterministic linear systems using failing trajectories. We introduce the concept of state-control invariance, which extends control invariance from the state space to the joint state-control space. The maximal state-control invariant (MSCI) set simultaneously encodes the maximal control invariant set (MCI) and, for each state in the MCI, the set of control inputs that preserve invariance. We prove that the state projection of the MSCI is the MCI and the state-dependent sections of the MSCI are the admissible invariance-preserving inputs. Building on this framework, we develop a Failure-Aware Iterative Learning (FAIL) algorithm for deterministic linear time-invariant systems with polytopic constraints. The algorithm iteratively updates a constraint set in the state-control space by learning predecessor halfspaces from one-step failing state-input pairs, without knowing the dynamics. For each failure, FAIL learns the violated halfspaces of the predecessor of the constraint set by a regression on failing trajectories. We prove that the learned constraint set converges monotonically to the MSCI. Numerical experiments on a double integrator system validate the proposed approach.

eess.SY

Consensus and Synchronization of Multi-agent Systems over Finite Fields - Graph Topologies

This paper presents cooperative protocols for multi-agent systems with agents having a finite state-space. Both scalar single-integrator consensus and general LTI system synchronization are considered. Systems having a finite state-space describe agents with minimal memory capacity processing only a finite alphabet. Such systems are remarkably resilient to communication noise. The crucial problem, however, is to construct the admissible communication topology, which is NP-hard. We address this by efficiently exploring the subsets of admissible graph matrices and propose two new algorithms to generate them. Simulations validate the proposed approach.

eess.SY

Extracting Exact Lie Derivatives Without Backpropagation: A Dual Compiler for Neural Control Barrier Functions

A safety filter based on a neural control barrier function (CBF) deployed in an embedded control loop evaluates, at each control cycle, the trained network and its Lie derivatives along the system vector fields, under the memory and worst-case execution time (WCET) constraints that safety-oriented coding standards impose. Reverse-mode automatic differentiation, by which training frameworks obtain these derivatives, retains an activation cache whose size grows with the sum of the layer widths, and general-purpose differentiation runtimes allocate the computational graph from the heap at each call. This paper presents a compiler that evaluates a neural CBF and its exact Lie derivatives by forward-mode dual-number arithmetic. The compiler emits self-contained C++ code in which a single forward pass, without backpropagation, returns the barrier value and its exact Lie derivative along a given vector field; the drift and input Lie derivatives of the safety constraint are obtained from one such pass per vector field, and a second-order extension based on hyper-dual numbers returns the exact second-order Lie derivatives required by CBFs of relative degree two. The dual forward pass requires a workspace bounded by four times the widest layer, independent of network depth, and the emitted code contains no allocation call sites, so the absence of dynamic allocation is verifiable by inspection of the code. On an ESP32-S3 microcontroller, the compiled filter assembles the complete safety constraint in under one millisecond from statically allocated buffers of at most 768 bytes, and the maximum execution time over 1000 evaluations lies within 5% of the median in all three examples, whereas a heap-allocating reverse-mode baseline shows maxima 33% and 70% above its median in the two first-order examples. The compiler and the embedded experiments are released as open-source software.

eess.SY