Josep M Porta

Dr. Josep M Porta

orcid

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

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

Representative Publications

View All Publications
10 November 2009 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
VIViorela Ila
Viorela Ila
JPJosep M Porta
Josep M Porta
JAJuan Andrade-Cetto
Juan Andrade-Cetto
Pose SLAM is the variant of simultaneous localization and map building (SLAM) is the variant of SLAM, in which only the robot trajectory is estimated and where landmarks are only used to produce relative constraints between robot poses. To reduce the computational cost of the information filter form of Pose SLAM and, at the same time, to delay inconsistency as much as possible, we introduce an approach that takes into account only highly informative loop-closure links and nonredundant poses. This approach includes constant time procedures to compute the distance between poses, the expected information gain for each potential link, and the exact marginal covariances while moving in open loop, as well as a procedure to recover the state after a loop closure that, in practical situations, scales linearly in terms of both time and memory. Using these procedures, the robot operates most of the time in open loop, and the cost of the loop closure is amortized over long trajectories. This way, the computational bottleneck shifts to data association, which is the search over the set of previously visited poses to determine good candidates for sensor registration. To speed up data association, we introduce a method to search for neighboring poses whose complexity ranges from logarithmic in the usual case to linear in degenerate situations. The method is based on organizing the pose information in a balanced tree whose internal levels are defined using interval arithmetic. The proposed Pose-SLAM approach is validated through simulations, real mapping sessions, and experiments using standard SLAM data sets.

1 February 2013 in IEEE Transactions on Robotics
Verified
Journal Article
Open access
LJLéonard Jaillet
Léonard Jaillet
JPJosep M Porta
Josep M Porta
The situation arising in path planning under kinematic constraints, where the valid configurations define a manifold embedded in the joint ambient space, can be seen as a limit case of the well-known narrow corridor problem. With kinematic constraints, the probability of obtaining a valid configuration by sampling in the joint ambient space is not low but null, which complicates the direct application of sampling-based path planners. This paper presents the AtlasRRT algorithm, which is a planner especially tailored for such constrained systems that builds on recently developed tools for higher-dimensional continuation. These tools provide procedures to define charts that locally parametrize a manifold and to coordinate the charts, forming an atlas that fully covers it. AtlasRRT simultaneously builds an atlas and a bidirectional rapidly exploring random tree (RRT), using the atlas to sample configurations and to grow the branches of the RRTs, and the RRTs to devise directions of expansion for the atlas. The efficiency of AtlasRRT is evaluated in several benchmarks involving high-dimensional manifolds embedded in large ambient spaces. The results show that the combined use of the atlas and the RRTs produces a more rapid exploration of the configuration space manifolds than existing approaches.

2 July 2010 in The International Journal of Robotics Research
Verified
Journal Article
Open access
PDF file
CRCarlos Rosales
Carlos Rosales
LRLluís Ros
Lluís Ros
JPJosep M Porta
Josep M Porta
Suárez RaúlSuárez Raúl
Suárez Raúl
In this paper we present a new method to solve the configuration problem on robotic hands: determining how a hand should be configured so as to grasp a given object in a specific way, characterized by a number of hand—object contacts to be satisfied. In contrast to previous algorithms given for the same purpose, the method presented here allows such contacts to be specified between free-form regions on the hand and object surfaces, and always returns a solution whenever one exists. The method is based on formulating the problem as a system of polynomial equations of special form, and then exploiting this form to isolate the solutions, using a numerical technique based on linear relaxations. The approach is general, in the sense that it can be applied to any grasping mechanism involving lower-pair joints, and it can accommodate as many hand—object contacts as required. Experiments are included that illustrate the performance of the method in the particular case of the Schunk Anthropomorphic hand.

1 August 2013 in IEEE Transactions on Robotics
Verified
Journal Article
Open access
RVRafael Valencia
Rafael Valencia
MMMartí Morta
Martí Morta
JAJuan Andrade-Cetto
Juan Andrade-Cetto
JPJosep M Porta
Josep M Porta
The maps that are built by standard feature-based simultaneous localization and mapping (SLAM) methods cannot be directly used to compute paths for navigation, unless enriched with obstacle or traversability information, with the consequent increase in complexity. Here, we propose a method that directly uses the Pose SLAM graph of constraints to determine the path between two robot configurations with lowest accumulated pose uncertainty, i.e., the most reliable path to the goal. The method shows improved navigation results when compared with standard path-planning strategies over both datasets and real-world experiments.

13 September 2022 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
RBRicard Bordalba
Ricard Bordalba
TSTobias Schoels
Tobias Schoels
LRLluis Ros
Lluis Ros
JPJosep M Porta
Josep M Porta
MDMoritz Diehl
Moritz Diehl
Direct collocation methods are powerful tools to solve trajectory optimization problems in robotics. While their resulting trajectories tend to be dynamically accurate, they may also present large kinematic errors in the case of constrained mechanical systems, i.e., those whose state coordinates are subject to holonomic or nonholonomic constraints, such as loop-closure or rolling-contact constraints. These constraints confine the robot trajectories to an implicitly-defined manifold, which complicates the computation of accurate solutions. Discretization errors inherent to the transcription of the problem easily make the trajectories drift away from this manifold, which results in physically inconsistent motions that are difficult to track with a controller. This article reviews existing methods to deal with this problem and proposes new ones to overcome their limitations. Current approaches either disregard the kinematic constraints (which leads to drift accumulation) or modify the system dynamics to keep the trajectory close to the manifold (which adds artificial forces or energy dissipation to the system). The methods we propose, in contrast, achieve full drift elimination on the discrete trajectory, or even along the continuous one, without artificial modifications of the system dynamics. We illustrate and compare the methods using various examples of different complexity.

1 January 2005 in Autonomous Robots
Verified
Journal Article
Closed access
PDF file
JPJosep M Porta
Josep M Porta
JVJ.J. Verbeek
J.J. Verbeek
BKB.J.A. Kröse
B.J.A. Kröse