2,903 research outputs found
Predictive and Multi-rate Sensor-Based Planning under Uncertainty
Email
Print
Request Permissions
In this paper, a general formulation of a predictive and multirate (MR) reactive planning method for intelligent vehicles (IVs) is introduced. The method handles path planning and trajectory planning for IVs in dynamic environments with uncertainty, in which the kinodynamic vehicle constraints are also taken into account. It is based on the potential field projection method (PFP), which combines the classical potential field (PF) method with the MR Kalman filter estimation. PFP takes into account the future object trajectories and their associated uncertainties, which makes it different from other look-ahead approaches. Here, a new PF is included in the Lagrange-Euler formulation in a natural way, accounting for the vehicle dynamics. The resulting accelerations are translated into control inputs that are considered in the estimation process. This leads to the generation of a local trajectory in real time (RT) that fully meets the constraints imposed by the kinematic and dynamic models of the IV. The properties of the method are demonstrated by simulation with MATLAB and C++ applications. Very good performance and execution times are achieved, even in challenging situations. In a scenario with 100 obstacles, a local trajectory is obtained in less than 1 s, which is suitable for RT applications
Past, Present, and Future of Simultaneous Localization And Mapping: Towards the Robust-Perception Age
Simultaneous Localization and Mapping (SLAM)consists in the concurrent
construction of a model of the environment (the map), and the estimation of the
state of the robot moving within it. The SLAM community has made astonishing
progress over the last 30 years, enabling large-scale real-world applications,
and witnessing a steady transition of this technology to industry. We survey
the current state of SLAM. We start by presenting what is now the de-facto
standard formulation for SLAM. We then review related work, covering a broad
set of topics including robustness and scalability in long-term mapping, metric
and semantic representations for mapping, theoretical performance guarantees,
active SLAM and exploration, and other new frontiers. This paper simultaneously
serves as a position paper and tutorial to those who are users of SLAM. By
looking at the published research with a critical eye, we delineate open
challenges and new research issues, that still deserve careful scientific
investigation. The paper also contains the authors' take on two questions that
often animate discussions during robotics conferences: Do robots need SLAM? and
Is SLAM solved
Trajectory planning for industrial robot using genetic algorithms
En las últimas décadas, debido la importancia de sus aplicaciones, se han propuesto muchas investigaciones sobre la planificación de caminos y trayectorias para los manipuladores, algunos de los ámbitos en los que pueden encontrarse ejemplos de aplicación son; la robótica industrial, sistemas autónomos, creación de prototipos virtuales y diseño de fármacos asistido por ordenador. Por otro lado, los algoritmos evolutivos se han aplicado en muchos campos, lo que motiva el interés del autor por investigar sobre su aplicación a la planificación de caminos y trayectorias en robots industriales.
En este trabajo se ha llevado a cabo una búsqueda exhaustiva de la literatura existente relacionada con la tesis, que ha servido para crear una completa base de datos utilizada para realizar un examen detallado de la evolución histórica desde sus orígenes al estado actual de la técnica y las últimas tendencias.
Esta tesis presenta una nueva metodología que utiliza algoritmos genéticos para desarrollar y evaluar técnicas para la planificación de caminos y trayectorias. El conocimiento de problemas específicos y el conocimiento heurístico se incorporan a la codificación, la evaluación y los operadores genéticos del algoritmo.
Esta metodología introduce nuevos enfoques con el objetivo de resolver el problema de la planificación de caminos y la planificación de trayectorias para sistemas robóticos industriales que operan en entornos 3D con obstáculos estáticos, y que ha llevado a la creación de dos algoritmos (de alguna manera similares, con algunas variaciones), que son capaces de resolver los problemas de planificación mencionados.
El modelado de los obstáculos se ha realizado mediante el uso de combinaciones de objetos geométricos simples (esferas, cilindros, y los planos), de modo que se obtiene un algoritmo eficiente para la prevención de colisiones.
El algoritmo de planificación de caminos se basa en técnicas de
optimización globales, usando algoritmos genéticos para minimizar una función
objetivo considerando restricciones para evitar las colisiones con los obstáculos. El
camino está compuesto de configuraciones adyacentes obtenidas mediante una
técnica de optimización construida con algoritmos genéticos, buscando minimizar
una función multiobjetivo donde intervienen la distancia entre los puntos
significativos de las dos configuraciones adyacentes, así como la distancia desde
los puntos de la configuración actual a la final. El planteamiento del problema
mediante algoritmos genéticos requiere de una modelización acorde al
procedimiento, definiendo los individuos y operadores capaces de proporcionar
soluciones eficientes para el problema.Abu-Dakka, FJM. (2011). Trajectory planning for industrial robot using genetic algorithms [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/10294Palanci
An Interior Point Method Solving Motion Planning Problems with Narrow Passages
Algorithmic solutions for the motion planning problem have been investigated
for five decades. Since the development of A* in 1969 many approaches have been
investigated, traditionally classified as either grid decomposition, potential
fields or sampling-based. In this work, we focus on using numerical
optimization, which is understudied for solving motion planning problems. This
lack of interest in the favor of sampling-based methods is largely due to the
non-convexity introduced by narrow passages. We address this shortcoming by
grounding the solution in differential geometry. We demonstrate through a
series of experiments on 3 Dofs and 6 Dofs narrow passage problems, how
modeling explicitly the underlying Riemannian manifold leads to an efficient
interior-point non-linear programming solution.Comment: IEEE RO-MAN 2020, 6 page
Nonholonomic motion planning using the fast marching square method
This research presents two novel approaches to nonholonomic motion planning. The methodologies presented are based on the standard fast marching square path planning method and its application to car-like robots. Under the first method, the environment is considered as a three-dimensional C-space, with the first two dimensions given by the position of the robot and the third dimension by its orientation. This means that we operate over the configuration space instead of the bi-dimensional environment map. Moreover, the trajectory is computed along the C-space taking into account the dimensions of the vehicle, and thus guaranteeing the absence of collisions. The second method uses the standard fast marching square, and takes advantage of the vector field of the velocities computed during the first step of the method in order to adapt the motion plan to the control inputs that a car-like robot is able to execute. Both methods ensure the smoothness and safety of the calculated paths in addition to providing the control actions to perform the trajectory.This work is funded by project number DPI2010-17772, by the Spanish Ministry of Science and Innovation, and also by the RoboCity2030-II-CM project (S2009/DPI-1559), funded by Programas de Actividades I+D en la Comunidad de Madrid, and co-funded by the Structural Funds of the EU
Mobile robot exploration with potential information fields
We present a mobile robot exploration strategy that computes trajectories that minimize both path and map entropies. The method evaluates joint entropy reduction and computes a potential ¿eld in robot con¿guration space using these joint entropy reduction estimates. The exploration trajectory is computed descending on the gradient of these ¿eld. The technique uses Pose SLAM as its estimation backbone. Very ef¿cient kernel convolution mechanisms are used to evaluate entropy reduction for each sensor ray, and for each possible robot orientation, taking frontiers and obstacles into account. In the end, the computation of this ¿eld on the entire C-space is shown to be very efficient computationally. The approach is tested in simulations in a common publicly available dataset comparing favorably both in quality of estimates and execution time against another entropy reduction strategy that uses occupancy mapsPeer ReviewedPostprint (published version
- …