A Factor Graph-based approach to vehicle sideslip angle estimation

• URL: http://arxiv.org/abs/2107.09815v1
• Date: Wed, 21 Jul 2021 00:25:06 GMT
• Title: A Factor Graph-based approach to vehicle sideslip angle estimation
• Authors: Antonio Leanza, Giulio Reina and Jose-Luis Blanco-Claraco
• Abstract summary: This work proposes modelling the problem directly as a graphical model (factor graph) Experimental results on real vehicle datasets validate the proposal with a good agreement between estimated and actual sideslip angle.
• Score: 0.8701566919381223
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Sideslip angle is an important variable for understanding and monitoring vehicle dynamics but it lacks an inexpensive method for direct measurement. Therefore, it is typically estimated from inertial and other proprioceptive sensors onboard using filtering methods from the family of the Kalman Filter. As a novel alternative, this work proposes modelling the problem directly as a graphical model (factor graph), which can then be optimized using a variety of methods, such as whole dataset batch optimization for offline processing or fixed-lag smoother for on-line operation. Experimental results on real vehicle datasets validate the proposal with a good agreement between estimated and actual sideslip angle, showing similar performance than the state-of-the-art with a great potential for future extensions due to the flexible mathematical framework.

Related papers

• Event-Aided Time-to-Collision Estimation for Autonomous Driving [28.13397992839372]
  We present a novel method that estimates the time to collision using a neuromorphic event-based camera. The proposed algorithm consists of a two-step approach for efficient and accurate geometric model fitting on event data. Experiments on both synthetic and real data demonstrate the effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2024-07-10T02:37:36Z)
• Interactive Graph Convolutional Filtering [79.34979767405979]
  Interactive Recommender Systems (IRS) have been increasingly used in various domains, including personalized article recommendation, social media, and online advertising. These problems are exacerbated by the cold start problem and data sparsity problem. Existing Multi-Armed Bandit methods, despite their carefully designed exploration strategies, often struggle to provide satisfactory results in the early stages. Our proposed method extends interactive collaborative filtering into the graph model to enhance the performance of collaborative filtering between users and items.
  arXiv  Detail & Related papers  (2023-09-04T09:02:31Z)
• Improving Online Lane Graph Extraction by Object-Lane Clustering [106.71926896061686]
  We propose an architecture and loss formulation to improve the accuracy of local lane graph estimates. The proposed method learns to assign the objects to centerlines by considering the centerlines as cluster centers. We show that our method can achieve significant performance improvements by using the outputs of existing 3D object detection methods.
  arXiv  Detail & Related papers  (2023-07-20T15:21:28Z)
• Parameter Estimation in DAGs from Incomplete Data via Optimal Transport [24.740382124473975]
  We develop a theoretical framework and support it with extensive empirical evidence demonstrating the robustness and versatility of our approach. We show that not only can our method effectively recover the ground-truth parameters but it also performs comparably or better than competing baselines on downstream applications.
  arXiv  Detail & Related papers  (2023-05-25T10:54:36Z)
• MACE: An Efficient Model-Agnostic Framework for Counterfactual Explanation [132.77005365032468]
  We propose a novel framework of Model-Agnostic Counterfactual Explanation (MACE) In our MACE approach, we propose a novel RL-based method for finding good counterfactual examples and a gradient-less descent method for improving proximity. Experiments on public datasets validate the effectiveness with better validity, sparsity and proximity.
  arXiv  Detail & Related papers  (2022-05-31T04:57:06Z)
• Rethinking Efficient Lane Detection via Curve Modeling [37.45243848960598]
  The proposed method achieves a new state-of-the-art performance on the popular LLAMAS benchmark. It also achieves favorable accuracy on the TuSimple and CU datasets, while retaining both low latency (> 150 FPS) and small model size ( 10M)
  arXiv  Detail & Related papers  (2022-03-04T17:00:33Z)
• Efficient Globally-Optimal Correspondence-Less Visual Odometry for Planar Ground Vehicles [23.910735789004075]
  We introduce the first globally-optimal, correspondence-less solution to plane-based Ackermann motion estimation. We prove its property of global optimality and analyse the impact of assuming a locally constant centre of rotation.
  arXiv  Detail & Related papers  (2022-03-01T08:49:21Z)
• Auto-weighted Multi-view Feature Selection with Graph Optimization [90.26124046530319]
  We propose a novel unsupervised multi-view feature selection model based on graph learning. The contributions are threefold: (1) during the feature selection procedure, the consensus similarity graph shared by different views is learned. Experiments on various datasets demonstrate the superiority of the proposed method compared with the state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-04-11T03:25:25Z)
• Tracking Performance of Online Stochastic Learners [57.14673504239551]
  Online algorithms are popular in large-scale learning settings due to their ability to compute updates on the fly, without the need to store and process data in large batches. When a constant step-size is used, these algorithms also have the ability to adapt to drifts in problem parameters, such as data or model properties, and track the optimal solution with reasonable accuracy. We establish a link between steady-state performance derived under stationarity assumptions and the tracking performance of online learners under random walk models.
  arXiv  Detail & Related papers  (2020-04-04T14:16:27Z)
• Variational Inference with Parameter Learning Applied to Vehicle Trajectory Estimation [20.41604350878599]
  We present parameter learning in a Gaussian variational inference setting using only noisy measurements. We demonstrate our technique using a 36km dataset consisting of a car using lidar to localize against a high-definition map.
  arXiv  Detail & Related papers  (2020-03-21T19:48:07Z)
• Holistically-Attracted Wireframe Parsing [123.58263152571952]
  This paper presents a fast and parsimonious parsing method to detect a vectorized wireframe in an input image with a single forward pass. The proposed method is end-to-end trainable, consisting of three components: (i) line segment and junction proposal generation, (ii) line segment and junction matching, and (iii) line segment and junction verification.
  arXiv  Detail & Related papers  (2020-03-03T17:43:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.