Karl Berntorp

SY
h-index25
8papers
171citations
Novelty47%
AI Score41

8 Papers

SYMay 22
Autonomous Navigation and Station-Keeping on Near-Rectilinear Halo Orbits

Yuri Shimane, Karl Berntorp, Stefano Di Cairano et al.

This article develops an optical navigation (OPNAV) and station-keeping pipeline for the near-rectilinear halo orbit (NRHO) in high-fidelity ephemeris model dynamics, using synthetic images of the Moon in a non-iterative horizon-based OPNAV algorithm, applying the result in a navigation filter, and using the obtained estimates in a station-keeping control scheme that keeps the spacecraft in the vicinity of a reference orbit. We study differential correction-based and minimization-based implementations of the so-called x-axis and propose an improved targeting prediction scheme by incorporating the filter's state covariance with an unscented transform. We also introduce a hysteresis mechanism, which improves stationkeeping cost and provides insight into the difference in performance between the differential correction-based and minimization-based approaches. We perform Monte-Carlo experiments to assess the pipeline's tracking and Delta-V performances. We report several key findings, including the variability of the filter performance with the sensor field of view and measurement locations, station-keeping cost reduction achieved by the unscented transform-based prediction and hysteresis, as well as the variability of the cumulative Delta-V as a function of maneuver location due to the periodic structure in the OPNAV-based filter's estimation accuracy.

SYDec 4, 2017
Path Planning using Positive Invariant Sets

Claus Danielson, Avishai Weiss, Karl Berntorp et al.

We present an algorithm for steering the output of a linear system from a feasible initial condition to a desired target position, while satisfying input constraints and non-convex output constraints. The system input is generated by a collection of local linear state-feedback controllers. The path-planning algorithm selects the appropriate local controller using a graph search, where the nodes of the graph are the local controllers and the edges of the graph indicate when it is possible to transition from one local controller to another without violating input or output constraints. We present two methods for computing the local controllers. The first uses a fixed-gain controller and scales its positive invariant set to satisfy the input and output constraints. We provide a linear program for determining the scale-factor and a condition for when the linear program has a closed-form solution. The second method designs the local controllers using a semi-definite program that maximizes the volume of the positive invariant set that satisfies state and input constraints. We demonstrate our path-planning algorithm on docking of a spacecraft. The semi-definite programming based control design has better performance but requires more computation.

LGMay 17, 2022
Mobility, Communication and Computation Aware Federated Learning for Internet of Vehicles

Md Ferdous Pervej, Jianlin Guo, Kyeong Jin Kim et al.

While privacy concerns entice connected and automated vehicles to incorporate on-board federated learning (FL) solutions, an integrated vehicle-to-everything communication with heterogeneous computation power aware learning platform is urgently necessary to make it a reality. Motivated by this, we propose a novel mobility, communication and computation aware online FL platform that uses on-road vehicles as learning agents. Thanks to the advanced features of modern vehicles, the on-board sensors can collect data as vehicles travel along their trajectories, while the on-board processors can train machine learning models using the collected data. To take the high mobility of vehicles into account, we consider the delay as a learning parameter and restrict it to be less than a tolerable threshold. To satisfy this threshold, the central server accepts partially trained models, the distributed roadside units (a) perform downlink multicast beamforming to minimize global model distribution delay and (b) allocate optimal uplink radio resources to minimize local model offloading delay, and the vehicle agents conduct heterogeneous local model training. Using real-world vehicle trace datasets, we validate our FL solutions. Simulation shows that the proposed integrated FL platform is robust and outperforms baseline models. With reasonable local training episodes, it can effectively satisfy all constraints and deliver near ground truth multi-horizon velocity and vehicle-specific power predictions.

CVApr 3, 2022
Exploiting Temporal Relations on Radar Perception for Autonomous Driving

Peizhao Li, Pu Wang, Karl Berntorp et al.

We consider the object recognition problem in autonomous driving using automotive radar sensors. Comparing to Lidar sensors, radar is cost-effective and robust in all-weather conditions for perception in autonomous driving. However, radar signals suffer from low angular resolution and precision in recognizing surrounding objects. To enhance the capacity of automotive radar, in this work, we exploit the temporal information from successive ego-centric bird-eye-view radar image frames for radar object recognition. We leverage the consistency of an object's existence and attributes (size, orientation, etc.), and propose a temporal relational layer to explicitly model the relations between objects within successive radar images. In both object detection and multiple object tracking, we show the superiority of our method compared to several baseline approaches.

LGJan 10, 2025
Meta-Learning for Physically-Constrained Neural System Identification

Ankush Chakrabarty, Gordon Wichern, Vedang M. Deshpande et al.

We present a gradient-based meta-learning framework for rapid adaptation of neural state-space models (NSSMs) for black-box system identification. When applicable, we also incorporate domain-specific physical constraints to improve the accuracy of the NSSM. The major benefit of our approach is that instead of relying solely on data from a single target system, our framework utilizes data from a diverse set of source systems, enabling learning from limited target data, as well as with few online training iterations. Through benchmark examples, we demonstrate the potential of our approach, study the effect of fine-tuning subnetworks rather than full fine-tuning, and report real-world case studies to illustrate the practical application and generalizability of the approach to practical problems with physical-constraints. Specifically, we show that the meta-learned models result in improved downstream performance in model-based state estimation in indoor localization and energy systems.

SYMay 25, 2023
Gaussian Processes with State-Dependent Noise for Stochastic Control

Marcel Menner, Karl Berntorp

This paper considers a stochastic control framework, in which the residual model uncertainty of the dynamical system is learned using a Gaussian Process (GP). In the proposed formulation, the residual model uncertainty consists of a nonlinear function and state-dependent noise. The proposed formulation uses a posterior-GP to approximate the residual model uncertainty and a prior-GP to account for state-dependent noise. The two GPs are interdependent and are thus learned jointly using an iterative algorithm. Theoretical properties of the iterative algorithm are established. Advantages of the proposed state-dependent formulation include (i) faster convergence of the GP estimate to the unknown function as the GP learns which data samples are more trustworthy and (ii) an accurate estimate of state-dependent noise, which can, e.g., be useful for a controller or decision-maker to determine the uncertainty of an action. Simulation studies highlight these two advantages.

SYNov 21, 2021
Automated Controller Calibration by Kalman Filtering

Marcel Menner, Karl Berntorp, Stefano Di Cairano

This paper proposes a method for calibrating control parameters. Examples of such control parameters are gains of PID controllers, weights of a cost function for optimal control, filter coefficients, the sliding surface of a sliding mode controller, or weights of a neural network. Hence, the proposed method can be applied to a wide range of controllers. The method uses a Kalman filter that estimates control parameters, using data of closed-loop system operation. The control parameter calibration is driven by a training objective, which encompasses specifications on the performance of the dynamical system. The performance-driven calibration method tunes the parameters online and robustly, is computationally efficient, has low data storage requirements, and is easy to implement making it appealing for many real-time applications. Simulation results show that the method is able to learn control parameters quickly, is able to tune the parameters to compensate for disturbances, and is robust to noise. A simulation study with the high-fidelity vehicle simulator CarSim shows that the method can calibrate controllers of a complex dynamical system online, which indicates its applicability to a real-world system. We also verify the real-time feasibility on an embedded platform with automotive-grade processors by implementing our method on a dSPACE MicroAutoBox-II rapid prototyping unit.

ROJan 23, 2016
Sampling-based Algorithms for Optimal Motion Planning Using Closed-loop Prediction

Oktay Arslan, Karl Berntorp, Panagiotis Tsiotras

Motion planning under differential constraints, kinodynamic motion planning, is one of the canonical problems in robotics. Currently, state-of-the-art methods evolve around kinodynamic variants of popular sampling-based algorithms, such as Rapidly-exploring Random Trees (RRTs). However, there are still challenges remaining, for example, how to include complex dynamics while guaranteeing optimality. If the open-loop dynamics are unstable, exploration by random sampling in control space becomes inefficient. We describe a new sampling-based algorithm, called CL-RRT#, which leverages ideas from the RRT# algorithm and a variant of the RRT algorithm that generates trajectories using closed-loop prediction. The idea of planning with closed-loop prediction allows us to handle complex unstable dynamics and avoids the need to find computationally hard steering procedures. The search technique presented in the RRT# algorithm allows us to improve the solution quality by searching over alternative reference trajectories. Numerical simulations using a nonholonomic system demonstrate the benefits of the proposed approach.