Joan Sola

Joan Sola

Auto-generated profile, based on publicly available information

Joan Sola

Institut de Robòtica i Informàtica Industrial (IRII), CSIC-Universitat Politècnica de Catalunya, 08028 Barcelona, Spain

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 September 2011 in International Journal of Computer Vision
Verified
Journal Article
Closed access
PDF file
JSJoan Solà
Joan Solà
TCTeresa Vidal Calleja
Teresa Vidal Calleja
JCJavier Civera
Javier Civera
JMJosé María Martínez Montiel
José María Martínez Montiel

1 January 2010
Verified
Book Chapter
Closed access
PDF file
KKKurt Konolige
Kurt Konolige
MAMotilal Agrawal
Motilal Agrawal
JSJoan Solà
Joan Solà

29 June 2022 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
WCWilliam Chamorro
William Chamorro
JSJoan Solà
Joan Solà
JAJuan Andrade-Cetto
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.

1 January 2005
Verified
Conference Paper
Closed access
JSJ. Sola
J. Sola
AMA. Monin
A. Monin
MDM. Devy
M. Devy
TLT. Lemaire
T. Lemaire
Most solutions to the SLAM problem in robotics have utilised range and beating sensors as the provided perception data is easy to incorporate, allowing immediate landmark initialization. This is not the case when using bearing-only information because the distance to the perceived landmarks is not directly provided. A whole estimate of a landmark position is only possible via a set of measurements taken from different points of view. The vast majority of contributions to this problem perform a parallel task to get this estimate, and hence the landmark initialization is delayed. We give a new insight to the problem and present a method to avoid this delay by initializing the whole ray that defines the direction of the landmark. We utilize a minimal and computationally efficient form to represent this ray and a new strategy for the subsequent updates. Simulations have been carried out to validate the proposed algorithms.

21 September 2022 in Autonomous Robots
Verified
Journal Article
Open access
PDF file
CMCarlos Mastalli
Carlos Mastalli
WMWolfgang Merkt
Wolfgang Merkt
JMJosep Marti-Saumell
Josep Marti-Saumell
HFHenrique Ferrolho
Henrique Ferrolho
JSJoan Solà
Joan Solà
SVSethu Vijayakumar
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.

1 January 2005
Verified
Conference Paper
Closed access
TLT. Lemaire
T. Lemaire
SLS. Lacroix
S. Lacroix
JSJ. Sola
J. Sola
This article presents a bearing only 3D SLAM algorithm which has the same complexity and optimality as the usual extended Kalman filter used in classical SLAM. We especially focus on the landmark initialization process, which relies on visual point features tracked in the sequence of acquired images: a probabilistic approach to estimate their parameters is presented. This induces a particular structure of the filter architecture, in which are memorized a set of past robot poses. Simulations are made to compare the influence of some parameters required by our approach, and results with an indoor robot and an airship are presented.