JSJoan Sola

Joan Sola

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Joan Sola has a total of 86 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Uncertainty Quantification of First Fix in a Time-Differenced Carrier Phase Observation Model

    by Hakim Cherfi, Julien Lesouple, Joan Solà, Paul Thevenon

    This paper presents an uncertainty quantification analysis of the first fix in a time-differenced carrier phase (TDCP) observation model. TDCP is a widely used method in GNSS-based odometry for precise positioning and displacement estimation. A key point in the TDCP modeling is the assumption that the GNSS receiver’s initial position is perfectly known, which is never exactly the case in real-world applications. This study assesses the impact of initial position errors on estimated displacement by formulating a correct TDCP model and a misspecified one, where the first position is not correct. Theoretical derivations provide a generic framework of estimation under the misspecified model and its associated mean squared error (MSE), as well as estimation performance bounds through the misspecified Cramer Rao bound (MCRB) for the considered case. These theoretical considerations are then used to build an estimator of the receiver’s displacement, with comparisons to the MCRB for performance evaluation. Extensive simulations using realistic GNSS geometry assess the influence of a first-fix error under various conditions, including different time intervals, first-fix error norms, and first-fix error direction. As an example, it is shown that for the considered geometry, if a TDCP of t2−t1=1 s is built with an initial first fix error norm ∥Δr1∥=10 m, then it introduces an estimation of the displacement, with an error of norm equal to 1.3 mm, at most. The results indicate that the displacement estimation error is linearly related to the initial position error and the time interval between observations, highlighting the importance of accurate first-fix estimation for reliable TDCP-based odometry. The findings contribute to highlighting the order of magnitude of errors on solutions as a function of the error on parameters.

  • Open Access

    Uncertainty Quantification of First Fix in a Time-Differenced-Carrier-Phase Observation Model

    by Hakim Cherfi, Julien Lesouple, Joan Solà, Paul Thevenon

    This paper presents an uncertainty quantification analysis of the first fix in a Time-Differenced Carrier Phase (TDCP) observation model. TDCP is a widely used method in GNSS-based odometry for precise positioning and displacement estimation. A key point in the TDCP modeling is the assumption that the GNSS receiver's initial position is perfectly known, which is never exactly the case in real-world applications. This study assesses impact of initial position errors on estimated displacement by formulating a correct TDCP model and a misspecified one, where the first position is not correct. Theoretical derivations provide a generic framework of estimation under misspecified model and its associated mean squared error (MSE), as well as estimation peformance bounds through the Misspecified Cramer Rao bound (MCRB) for the considered case. These theoretical considerations are then used to build an estimator of the receiver's displacement, with comparisons to the MCRB for performance evaluation. Extensive simulations using realistic GNSS geometry assess the influence of a first-fix error under various conditions, including different time intervals, first-fix error norms and first-fix error direction. The results indicate that the displacement estimation error is linearly related to the initial position error and the time interval between observations, highlighting the importance of accurate first-fix estimation for reliable TDCP-based odometry. The findings contribute to highlighting the order of magnitude of errors on solutions as a function of the error on parameters.

  • Open Access

    On Lie Group IMU and Linear Velocity Preintegration for Autonomous Navigation Considering the Earth Rotation Compensation

    by Pau Vial, Joan Solà, Narcís Palomeras, Marc Carreras

    Robot localization is a fundamental task in achieving true autonomy. Recently, many graph-based navigators have been proposed that combine an inertial measurement unit (IMU) with an exteroceptive sensor applying IMU preintegration to synchronize both sensors. IMUs are affected by biases that also have to be estimated. To increase the navigator robustness when faults appear on the perception system, IMU preintegration can be complemented with linear velocity measurements obtained from visual odometry, leg odometry, or a Doppler Velocity Log (DVL), depending on the robotic application. Moreover, higher grade IMUs are sensitive to the Earth rotation rate, which must be compensated in the preintegrated measurements. In this paper, we propose a general purpose preintegration methodology formulated on a compact Lie group to set motion constraints on Graph SLAM problems considering the Earth rotation effect. We introduce the SE $_{N}(3)$ group to jointly preintegrate IMU data and linear velocity measurements to preserve all the existing correlation within the preintegrated quantity. Field experiments using an Autonomous Underwater Vehicle (AUV) equipped with a DVL and a navigational grade IMU are provided and results are benchmarked against a commercial filter-based Inertial Navigation System (INS) to prove the effectiveness of our methodology.


  • Top Cited Papers
    Open Access

    A feasibility-driven approach to control-limited DDP

    by Carlos Mastalli, Wolfgang Merkt, Josep Marti-Saumell, Henrique Ferrolho, Joan Solà, Nicolas Mansard, Sethu Vijayakumar

    Differential dynamic programming (DDP) is a direct single shooting method for trajectory optimization. Its efficiency derives from the exploitation of temporal structure (inherent to optimal control problems) and explicit roll-out/integration of the system dynamics. However, it suffers from numerical instability and, when compared to direct multiple shooting methods, it has limited initialization options (allows initialization of controls, but not of states) and lacks proper handling of control constraints. In this work, we tackle these issues with a feasibility-driven approach that regulates the dynamic feasibility during the numerical optimization and ensures control limits. Our feasibility search emulates the numerical resolution of a direct multiple shooting problem with only dynamics constraints. We show that our approach (named Box-FDDP) has better numerical convergence than Box-DDP $$^+$$ + (a single shooting method), and that its convergence rate and runtime performance are competitive with state-of-the-art direct transcription formulations solved using the interior point and active set algorithms available in Knitro. We further show that Box-FDDP decreases the dynamic feasibility error monotonically—as in state-of-the-art nonlinear programming algorithms. We demonstrate the benefits of our approach by generating complex and athletic motions for quadruped and humanoid robots. Finally, we highlight that Box-FDDP is suitable for model predictive control in legged robots.


  • Open Access

    A Feasibility-Driven Approach to Control-Limited DDP

    by Carlos Mastalli, Wolfgang Merkt, Josep Marti-Saumell, Henrique Ferrolho, Joan Sola, Nicolas Mansard, Sethu Vijayakumar

    Differential dynamic programming (DDP) is a direct single shooting method for trajectory optimization. Its efficiency derives from the exploitation of temporal structure (inherent to optimal control problems) and explicit roll-out/integration of the system dynamics. However, it suffers from numerical instability and, when compared to direct multiple shooting methods, it has limited initialization options (allows initialization of controls, but not of states) and lacks proper handling of control constraints. In this work, we tackle these issues with a feasibility-driven approach that regulates the dynamic feasibility during the numerical optimization and ensures control limits. Our feasibility search emulates the numerical resolution of a direct multiple shooting problem with only dynamics constraints. We show that our approach (named BOX-FDDP) has better numerical convergence than BOX-DDP+ (a single shooting method), and that its convergence rate and runtime performance are competitive with state-of-the-art direct transcription formulations solved using the interior point and active set algorithms available in KNITRO. We further show that BOX-FDDP decreases the dynamic feasibility error monotonically--as in state-of-the-art nonlinear programming algorithms. We demonstrate the benefits of our approach by generating complex and athletic motions for quadruped and humanoid robots. Finally, we highlight that BOX-FDDP is suitable for model predictive control in legged robots.

  • Event-Based Line SLAM in Real-Time

    by William Chamorro, Joan Solà, Juan Andrade-Cetto

    Event-based cameras generate asynchronous streams of events, triggered proportionally to the logarithmic change of brightness in the scene. These cameras have very low latency and high dynamic range suitable to address challenging motion scenarios in robotics. In this work, we explore a new event-based line-SLAM approach following a parallel tracking and mapping philosophy. Our fast tracking algorithm, produces accurate camera pose estimates at a high rate by minimizing the event-line reprojection error with an error-state Kalman filter formulated entirely with Lie theory. The mapping thread leverages the natural edge highlighting strength of events to recover and optimize straight lines in human-made scenarios. The proper manipulation of matrix sparsity as well as the information sharing between tracking and mapping nodes allow us to achieve real-time performance on a standard multi-core CPU. This system was tested on several scenarios rich in straight edge objects, and compared against, ground truth and frame and event based state-of-the-art approaches.


  • Open Access

    WOLF: A modular estimation framework for robotics based on factor graphs

    by Joan Sola, Joan Vallve, Joaquim Casals, Jeremie Deray, Mederic Fourmy, Dinesh Atchuthan, Andreu Corominas-Murtra, Juan Andrade-Cetto

    This paper introduces WOLF, a C++ estimation framework based on factor graphs and targeted at mobile robotics. WOLF can be used beyond SLAM to handle self-calibration, model identification, or the observation of dynamic quantities other than localization. The architecture of WOLF allows for a modular yet tightly-coupled estimator. Modularity is enhanced via reusable plugins that are loaded at runtime depending on application setup. This setup is achieved conveniently through YAML files, allowing users to configure a wide range of applications without the need of writing or compiling code. Most procedures are coded as abstract algorithms in base classes with varying levels of specialization. Overall, all these assets allow for coherent processing and favor code re-usability and scalability. WOLF can be used with ROS, and is made publicly available and open to collaboration.

  • WOLF: A Modular Estimation Framework for Robotics Based on Factor Graphs

    by Joan Sola, Joan Vallve, Joaquim Casals, Jeremie Deray, Mederic Fourmy, Dinesh Atchuthan, Andreu Corominas-Murtra, Juan Andrade-Cetto

    This letter introduces Wolf , a C++ estimation framework based on factor graphs and targeted at mobile robotics. Wolf can be used beyond SLAM to handle self-calibration, model identification, or the observation of dynamic quantities other than localization. The architecture of Wolf allows for a modular yet tightly-coupled estimator. Modularity is enhanced via reusable plugins that are loaded at runtime depending on application setup. This setup is achieved conveniently through YAML files, allowing users to configure a wide range of applications without the need of writing or compiling code. Most procedures are coded as abstract algorithms in base classes with varying levels of specialization. Overall, all these assets allow for coherent processing and favor code re-usability and scalability. Wolf can be used with ROS , and is made publicly available and open to collaboration.


  • Dual-Branch CNNs for Vehicle Detection and Tracking on LiDAR Data

    by Victor Vaquero, Ivan del Pino, Francesc Moreno-Noguer, Joan Sola, Alberto Sanfeliu, Juan Andrade-Cetto

    We present a novel vehicle detection and tracking system that works solely on 3D LiDAR information. Our approach segments vehicles using a dual-view representation of the 3D LiDAR point cloud on two independently trained convolutional neural networks, one for each view. A bounding box growing algorithm is applied to the fused output of the networks to properly enclose the segmented vehicles. Bounding boxes are grown using a probabilistic method that takes into account also occluded areas. The final vehicle bounding boxes act as observations for a multi-hypothesis tracking system which allows to estimate the position and velocity of the observed vehicles. We thoroughly evaluate our system on the KITTI benchmarks both for detection and tracking separately and show that our dual-branch classifier consistently outperforms previous single-branch approaches, improving or directly competing to other state of the art LiDAR-based methods.