Searcharxiv⌕ Search

arXiv subjects

Antônio Augusto Fröhlich

Publications and source records attributed to Antônio Augusto Fröhlich.

9 recordsLinked to original sources

What Do Latent Predictive Vehicle Representations Retain? Measuring State, Geometry, and Local Response

Models of vehicle dynamics learned from logged states and commands complement physics-based models, and latent world models, which predict in a learned representation, are used to plan and train controllers in other domains. Vehicle controllers are usually specified in physical terms: costs, limits, and references depend on position, yaw angle, speed, and yaw rate, and the optimizer compares or differentiates predicted outcomes across nearby commands. A latent model placed in such a controller must therefore let these quantities be recovered and must change its predictions with commands as the vehicle does, and prediction error on its own latent targets measures neither. We contribute a measurement protocol for action-conditioned latent predictors with a physical readout that separately tests retention, physical-neighborhood organization, forecasting, and local response to command perturbations, using an untrained-encoder reference and three matched response paths that locate errors in the representation or the predictor. In a case study of a temporal joint-embedding predictive model trained on signals logged in IPG CarMaker, the representations retain the measured planar outputs, though an untrained encoder of the same architecture retains them slightly better; future-command input improves one-second forecasts with retention nearly unchanged; and responses to small command pulses diverge from the simulator already in latent coordinates, raising regret when choosing among nearby commands in all comparisons. Updating the predictor on responses corrects them locally at a cost in forecast accuracy. Measuring retention, forecasting, and local response separately is thus what qualifies a predictive latent as a candidate model for control, and the protocol provides the basis for its closed-loop evaluation.

cs.LG↗

Ensuring Data Freshness in Multi-Rate Task Chains Scheduling

In safety-critical autonomous systems, data freshness presents a fundamental design challenge. While the Logical Execution Time (LET) paradigm ensures compositional determinism, it often does so at the cost of injected latency, possibly degrading the age of data on high-frequency control loops. Furthermore, heterogeneous, multi-rate, task dependencies is typically guaranteed inefficiently through oversampling. This paper proposes a Task-based scheduling framework extended with data freshness constraints. Unlike traditional models, scheduling decisions are driven by the lifespan of data. We introduce a formal methodology to decompose Data Dependency Graphs into dominant paths by tracing the strictest data freshness constraints backward from the actuators. Based on this decomposition, we propose an offset search algorithm that synchronizes multi-rate, multi-dependencies, task chains. This approach enforces end-to-end data freshness without the artificial latency of LET buffering, a trade-off between data freshness and execution determinism. We formally prove that this offset-based alignment preserves the 100% schedulability capacity of Global EDF while addressing data freshness guarantees.

cs.OS↗

Motion Planning for Autonomous Vehicles using Optimization over Graphs of Convex Sets

Motion planning for autonomous vehicles requires generating collision-free and dynamically feasible trajectories in complex environments under real-time constraints. While nonlinear optimal control formulations provide high-fidelity solutions, they are computationally demanding and sensitive to initialization, whereas geometric planning methods scale well but often decouple path selection from trajectory optimization. This paper studies the extent to which optimization over Graphs of Convex Sets (GCS) can approximate solutions of nonlinear optimal control problems in the context of autonomous driving. The free space is represented as a finite union of convex regions organized as a directed graph, allowing nonconvex geometry to be handled through discrete connectivity decisions while maintaining convex trajectory constraints within each region. Vehicle motion is parameterized using Bezier curves for the spatial path and a polynomial time-scaling function for temporal evolution. Under small-slip and linear tire assumptions, a simplified dynamic bicycle model enables approximate enforcement of dynamic feasibility through convex constraints on trajectory derivatives. The approach is evaluated in CommonRoad scenarios involving static obstacle avoidance and lane-changing maneuvers, and is compared against a nonlinear discrete-time optimal control formulation. The results indicate that the GCS-based method generates collision-free and dynamically consistent trajectories that closely match those obtained from the nonlinear program, while exhibiting improved computational efficiency and reduced sensitivity to initialization. These findings suggest that GCS provides a structured approximation of nonlinear motion planning problems, capturing dominant geometric and dynamic effects while preserving convexity in the continuous relaxation.

cs.RO↗

Verifying Physics-Informed Neural Network Fidelity using Classical Fisher Information from Differentiable Dynamical System

Physics-Informed Neural Networks (PINNs) have emerged as a powerful tool for solving differential equations and modeling physical systems by embedding physical laws into the learning process. However, rigorously quantifying how well a PINN captures the complete dynamical behavior of the system, beyond simple trajectory prediction, remains a challenge. This paper proposes a novel experimental framework to address this by employing Fisher information for differentiable dynamical systems, denoted $g_F^C$. This Fisher information, distinct from its statistical counterpart, measures inherent uncertainties in deterministic systems, such as sensitivity to initial conditions, and is related to the phase space curvature and the net stretching action of the state space evolution. We hypothesize that if a PINN accurately learns the underlying dynamics of a physical system, then the Fisher information landscape derived from the PINN's learned equations of motion will closely match that of the original analytical model. This match would signify that the PINN has achieved comprehensive fidelity capturing not only the state evolution but also crucial geometric and stability properties. We outline an experimental methodology using the dynamical model of a car to compute and compare $g_F^C$ for both the analytical model and a trained PINN. The comparison, based on the Jacobians of the respective system dynamics, provides a quantitative measure of the PINN's fidelity in representing the system's intricate dynamical characteristics.

cs.LG↗

Hard-Constrained Neural Networks with Physics-Embedded Architecture for Residual Dynamics Learning and Invariant Enforcement in Cyber-Physical Systems

This paper presents a framework for physics-informed learning in complex cyber-physical systems governed by differential equations with both unknown dynamics and algebraic invariants. First, we formalize the Hybrid Recurrent Physics-Informed Neural Network (HRPINN), a general-purpose architecture that embeds known physics as a hard structural constraint within a recurrent integrator to learn only residual dynamics. Second, we introduce the Projected HRPINN (PHRPINN), a novel extension that integrates a predict-project mechanism to strictly enforce algebraic invariants by design. The framework is supported by a theoretical analysis of its representational capacity. We validate HRPINN on a real-world battery prognostics DAE and evaluate PHRPINN on a suite of standard constrained benchmarks. The results demonstrate the framework's potential for achieving high accuracy and data efficiency, while also highlighting critical trade-offs between physical consistency, computational cost, and numerical stability, providing practical guidance for its deployment.

cs.LG↗

Systematic Literature Review on Vehicular Collaborative Perception -- A Computer Vision Perspective

The effectiveness of autonomous vehicles relies on reliable perception capabilities. Despite significant advancements in artificial intelligence and sensor fusion technologies, current single-vehicle perception systems continue to encounter limitations, notably visual occlusions and limited long-range detection capabilities. Collaborative Perception (CP), enabled by Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) communication, has emerged as a promising solution to mitigate these issues and enhance the reliability of autonomous systems. Beyond advancements in communication, the computer vision community is increasingly focusing on improving vehicular perception through collaborative approaches. However, a systematic literature review that thoroughly examines existing work and reduces subjective bias is still lacking. Such a systematic approach helps identify research gaps, recognize common trends across studies, and inform future research directions. In response, this study follows the PRISMA 2020 guidelines and includes 106 peer-reviewed articles. These publications are analyzed based on modalities, collaboration schemes, and key perception tasks. Through a comparative analysis, this review illustrates how different methods address practical issues such as pose errors, temporal latency, communication constraints, domain shifts, heterogeneity, and adversarial attacks. Furthermore, it critically examines evaluation methodologies, highlighting a misalignment between current metrics and CP's fundamental objectives. By delving into all relevant topics in-depth, this review offers valuable insights into challenges, opportunities, and risks, serving as a reference for advancing research in vehicular collaborative perception.

cs.CV↗

Predictor-Based Compensators for Networked Control Systems with Stochastic Delays and Sampling Intervals

The stochastic nature of time delays and sampling intervals in Networked Control Systems poses significant challenges for controller synthesis and analysis, often leading to conservative designs and degraded performance. This work presents a modeling approach for Linear Multiple-Input Multiple-Output Networked Control Systems and introduces a compensation scheme based on the Filtered Smith Predictor to mitigate the adverse effects of stochastic time delays on closed-loop performance. The proposed scheme is evaluated through numerical simulations of a well-established Cooperative Adaptive Cruise Control system. Results demonstrate that the compensator achieves near-ideal average closed-loop performance and significantly reduces response variability compared to a traditional Filtered Smith Predictor. Notably, it yields a 45% reduction in worst-case tracking error signal energy relative to an ideal baseline system with no time delays and constant sampling intervals.

eess.SY↗

Evaluation of Energy-Efficient Heuristics for ACO-based Routing in Mobile Wireless Sensor Networks

Mobile ad-hoc networks demand routing algorithms able to adapt to network topologies subject to constant change. Moreover, with the advent of the Internet-of-Things (IoT), network nodes tend not only to show increased mobility, but also impose further restrictions to these mobile network systems. These restrictions include non-functional requirements of low-power consumption, small-size, and low-cost. ADHOP (Ant-based Dynamic Hop Optimization Protocol) is a routing algorithm based on ant-colony optimizations that target such small-size and low-cost platforms, consuming little amounts of memory and processing power. This paper elaborates on ADHOP to investigate the use of energy-related heuristics to guide routing decisions. The goal is to minimize network usage without jeopardizing network operation. We replace the original ADHOP heuristic of network latency by two energy-related heuristics based on the battery charge and the estimated node lifetime. Simulations compare the energy-aware versions of ADHOP to its original version, to AODV and to AOER. Results show that the proposed approaches are able to balance network load among nodes, resulting in a lower number of failures due to battery depletion. The energy-aware versions of ADHOP also deliver more packets than their counter-parts in the simulated scenario, delivering 2x more packets than the original ADHOP, and, respectively, 5x and 9x more packets than AOER and AODV.

cs.NI↗

Evaluation of silicon consumption for a connectionless Network-on-Chip

We present the design and evaluation of a predictable Network-on-Chip (NoC) to interconnect processing units running multimedia applications with variable-bit-rate. The design is based on a connectionless strategy in which flits from different communication flows are interleaved in the same communication channel between routers. Each flit carries routing information used by routers to perform arbitration and scheduling of the corresponding output communication channel. Analytic comparisons show that our approach keeps average latency lower than a network based on resource reservation, when both networks are working over 80% of offered load. We also evaluate the proposed NoC on FPGA and ASIC technologies to understand the trade-off due to our approach, in terms of silicon consumption.

cs.AR↗