2,691 research outputs found
Map building, localization and exploration for multi-robot systems
The idea of having robots performing the task for which they have been designed completely autonomously and interacting with the environment has been the main objective since the beginning of mobile robotics. In order to achieve such a degree of autonomy, it is indispensable for the robot to have a map of the environment and to know its location in it, in addition to being able to solve other problems such as motion control and path planning towards its goal. During the fulfillment of certain missions without a prior knowledge of its environment, the robot must use the inaccurate information provided by its on-board sensors to build a map at the same time it is located in it, arising the problem of Simultaneous Localization and Mapping (SLAM) extensively studied in mobile robotics. In recent years, there has been a growing interest in the use of robot teams due to their multiple benefits with respect to single-robot systems such as higher robustness, accuracy, efficiency and the possibility to cooperate to perform a task or to cover larger environments in less time. Robot formations also belongs to this field of cooperative robots, where they have to maintain a predefined structure while navigating in the environment. Despite their advantages, the complexity of autonomous multi-robot systems increases with the number of robots as a consequence of the larger amount of information available that must be handled, stored and transmitted through the communications network. Therefore, the development of these systems presents new difficulties when solving the aforementioned problems which, instead of being addressed individually for each robot, must be solved cooperatively to efficiently exploit all the information collected by the team. The design of algorithms in this multi-robot context should be directed to obtain greater scalability and performance to allow their online execution. This thesis is developed in the field of multi-robot systems and proposes solutions to the navigation, localization, mapping and path planning processes which form an autonomous system. The first part of contributions presented in this thesis is developed in the context of robot formations, which require greater team cooperation and synchronization, although they can be extended to systems without this navigation constraint. We propose localization, map refinement and exploration techniques under the assumption that the formation is provided with a map of the environment, possibly partial and inaccurate, wherein it has to carry out its commanded mission. In a second part, we propose a multi-robot SLAM approach without any assumption about the prior knowledge of a map nor the relationships between robots in which we make use of state of the art methodologies to efficiently manage the resources available in the system. The performance and efficiency of the proposed robot formation and multi-robot SLAM systems have been demonstrated through their implementation and testing both in simulations and with real robots
A Survey on Aerial Swarm Robotics
The use of aerial swarms to solve real-world problems has been increasing steadily, accompanied by falling prices and improving performance of communication, sensing, and processing hardware. The commoditization of hardware has reduced unit costs, thereby lowering the barriers to entry to the field of aerial swarm robotics. A key enabling technology for swarms is the family of algorithms that allow the individual members of the swarm to communicate and allocate tasks amongst themselves, plan their trajectories, and coordinate their flight in such a way that the overall objectives of the swarm are achieved efficiently. These algorithms, often organized in a hierarchical fashion, endow the swarm with autonomy at every level, and the role of a human operator can be reduced, in principle, to interactions at a higher level without direct intervention. This technology depends on the clever and innovative application of theoretical tools from control and estimation. This paper reviews the state of the art of these theoretical tools, specifically focusing on how they have been developed for, and applied to, aerial swarms. Aerial swarms differ from swarms of ground-based vehicles in two respects: they operate in a three-dimensional space and the dynamics of individual vehicles adds an extra layer of complexity. We review dynamic modeling and conditions for stability and controllability that are essential in order to achieve cooperative flight and distributed sensing. The main sections of this paper focus on major results covering trajectory generation, task allocation, adversarial control, distributed sensing, monitoring, and mapping. Wherever possible, we indicate how the physics and subsystem technologies of aerial robots are brought to bear on these individual areas
Computational intelligence approaches to robotics, automation, and control [Volume guest editors]
No abstract available
A robust extended H-infinity filtering approach to multi-robot cooperative localization in dynamic indoor environments
Multi-robot cooperative localization serves as an essential task for a team of mobile robots to work within an unknown environment. Based on the real-time laser scanning data interaction, a robust approach is proposed to obtain optimal multi-robot relative observations using the Metric-based Iterative Closest Point (MbICP) algorithm, which makes it possible to utilize the surrounding environment information directly instead of placing a localization-mark on the robots. To meet the demand of dealing with the inherent non-linearities existing in the multi-robot kinematic models and the relative observations, a robust extended H∞ filtering (REHF) approach is developed for the multi-robot cooperative localization system, which could handle non-Gaussian process and measurement noises with respect to robot navigation in unknown dynamic scenes. Compared with the conventional multi-robot localization system using extended Kalman filtering (EKF) approach, the proposed filtering algorithm is capable of providing superior performance in a dynamic indoor environment with outlier disturbances. Both numerical experiments and experiments conducted for the Pioneer3-DX robots show that the proposed localization scheme is effective in improving both the accuracy and reliability of the performance within a complex environment.This work was supported inpart by the National Natural Science Foundation of China under grants 61075094, 61035005 and 61134009
Gaussian Processes for Machine Learning in Robotics
Mención Internacional en el título de doctorNowadays, machine learning is widely used in robotics for a variety of tasks such as
perception, control, planning, and decision making. Machine learning involves learning,
reasoning, and acting based on the data. This is achieved by constructing computer
programs that process the data, extract useful information or features, make predictions to
infer unknown properties, and suggest actions to take or decisions to make. This computer
program corresponds to a mathematical model of the data that describes the relationship
between the variables that represent the observed data and properties of interest. The
aforementioned model is learned based on the available training data, which is accomplished
using a learning algorithm capable of automatically adjusting the parameters of
the model to agree with the data. Therefore, the architecture of the model needs to be selected
accordingly, which is not a trivial task and usually depends on the machine-learning
engineer’s insights and past experience. The number of parameters to be tuned varies significantly
with the selected machine learning model, ranging from two or three parameters
for Gaussian processes (GP) to hundreds of thousands for artificial neural networks.
However, as more complex and novel robotic applications emerge, data complexity
increases and prior experience may be insufficient to define adequate mathematical models.
In addition, traditional machine learning methods are prone to problems such as
overfitting, which can lead to inaccurate predictions and catastrophic failures in critical
applications. These methods provide probabilistic distributions as model outputs, allowing
for estimating the uncertainty associated with predictions and making more informed
decisions. That is, they provide a mean and variance for the model responses.
This thesis focuses on the application of machine learning solutions based on Gaussian
processes to various problems in robotics, with the aim of improving current methods and
providing a new perspective. Key areas such as trajectory planning for unmanned aerial
vehicles (UAVs), motion planning for robotic manipulators and model identification of
nonlinear systems are addressed. In the field of path planning for UAVs, algorithms based on Gaussian processes that
allow for more efficient planning and energy savings in exploration missions have been
developed. These algorithms are compared with traditional analytical approaches, demonstrating
their superiority in terms of efficiency when using machine learning. Area coverage
and linear coverage algorithms with UAV formations are presented, as well as a
sea surface search algorithm. Finally, these algorithms are compared with a new method
that uses Gaussian processes to perform probabilistic predictions and optimise trajectory
planning, resulting in improved performance and reduced energy consumption.
Regarding motion planning for robotic manipulators, an approach based on Gaussian
process models that provides a significant reduction in computational times is proposed.
A Gaussian process model is used to approximate the configuration space of a robot,
which provides valuable information to avoid collisions and improve safety in dynamic
environments. This approach is compared to conventional collision checking methods
and its effectiveness in terms of computational time and accuracy is demonstrated. In this
application, the variance provides information about dangerous zones for the manipulator.
In terms of creating models of non-linear systems, Gaussian processes also offer significant
advantages. This approach is applied to a soft robotic arm system and UAV energy
consumption models, where experimental data is used to train Gaussian process models
that capture the relationships between system inputs and outputs. The results show accurate
identification of system parameters and the ability to make reliable future predictions.
In summary, this thesis presents a variety of applications of Gaussian processes in
robotics, from trajectory and motion planning to model identification. These machine
learning-based solutions provide probabilistic predictions and improve the ability of robots
to perform tasks safely and efficiently. Gaussian processes are positioned as a powerful
tool to address current challenges in robotics and open up new possibilities in the field.El aprendizaje automático ha revolucionado el campo de la robótica al ofrecer una amplia
gama de aplicaciones en áreas como la percepción, el control, la planificación y la toma de
decisiones. Este enfoque implica desarrollar programas informáticos que pueden procesar
datos, extraer información valiosa, realizar predicciones y ofrecer recomendaciones o
sugerencias de acciones. Estos programas se basan en modelos matemáticos que capturan
las relaciones entre las variables que representan los datos observados y las propiedades
que se desean analizar. Los modelos se entrenan utilizando algoritmos de optimización
que ajustan automáticamente los parámetros para lograr un rendimiento óptimo.
Sin embargo, a medida que surgen aplicaciones robóticas más complejas y novedosas,
la complejidad de los datos aumenta y la experiencia previa puede resultar insuficiente
para definir modelos matemáticos adecuados. Además, los métodos de aprendizaje automático
tradicionales son propensos a problemas como el sobreajuste, lo que puede llevar
a predicciones inexactas y fallos catastróficos en aplicaciones críticas. Para superar estos
desafíos, los métodos probabilísticos de aprendizaje automático, como los procesos
gaussianos, han ganado popularidad. Estos métodos ofrecen distribuciones probabilísticas
como salidas del modelo, lo que permite estimar la incertidumbre asociada a las
predicciones y tomar decisiones más informadas. Esto es, proporcionan una media y una
varianza para las respuestas del modelo.
Esta tesis se centra en la aplicación de soluciones de aprendizaje automático basadas
en procesos gaussianos a diversos problemas en robótica, con el objetivo de mejorar los
métodos actuales y proporcionar una nueva perspectiva. Se abordan áreas clave como la
planificación de trayectorias para vehículos aéreos no tripulados (UAVs), la planificación
de movimientos para manipuladores robóticos y la identificación de modelos de sistemas
no lineales.
En el campo de la planificación de trayectorias para UAVs, se han desarrollado algoritmos basados en procesos gaussianos que permiten una planificación más eficiente y
un ahorro de energía en misiones de exploración. Estos algoritmos se comparan con los
enfoques analíticos tradicionales, demostrando su superioridad en términos de eficiencia
al utilizar el aprendizaje automático. Se presentan algoritmos de recubrimiento de áreas
y recubrimiento lineal con formaciones de UAVs, así como un algoritmo de búsqueda
en superficies marinas. Finalmente, estos algoritmos se comparan con un nuevo método
que utiliza procesos gaussianos para realizar predicciones probabilísticas y optimizar la
planificación de trayectorias, lo que resulta en un rendimiento mejorado y una reducción
del consumo de energía.
En cuanto a la planificación de movimientos para manipuladores robóticos, se propone
un enfoque basado en modelos gaussianos que permite una reducción significativa
en los tiempos de cálculo. Se utiliza un modelo de procesos gaussianos para aproximar
el espacio de configuraciones de un robot, lo que proporciona información valiosa para
evitar colisiones y mejorar la seguridad en entornos dinámicos. Este enfoque se compara
con los métodos convencionales de planificación de movimientos y se demuestra su eficacia
en términos de tiempo de cálculo y precisión de los movimientos. En esta aplicación,
la varianza proporciona información sobre zonas peligrosas para el manipulador.
En cuanto a la identificación de modelos de sistemas no lineales, los procesos gaussianos
también ofrecen ventajas significativas. Este enfoque se aplica a un sistema de
brazo robótico blando y a modelos de consumo energético de UAVs, donde se utilizan
datos experimentales para entrenar un modelo de proceso gaussiano que captura las relaciones
entre las entradas y las salidas del sistema. Los resultados muestran una identificación
precisa de los parámetros del sistema y la capacidad de realizar predicciones
futuras confiables.
En resumen, esta tesis presenta una variedad de aplicaciones de procesos gaussianos
en robótica, desde la planificación de trayectorias y movimientos hasta la identificación
de modelos. Estas soluciones basadas en aprendizaje automático ofrecen predicciones
probabilísticas y mejoran la capacidad de los robots para realizar tareas de manera segura
y eficiente. Los procesos gaussianos se posicionan como una herramienta poderosa para
abordar los desafíos actuales en robótica y abrir nuevas posibilidades en el campo.Programa de Doctorado en Ingeniería Eléctrica, Electrónica y Automática por la Universidad Carlos III de MadridPresidente: Juan Jesús Romero Cardalda.- Secretaria: María Dolores Blanco Rojas.- Vocal: Giuseppe Carbon
Cooperative localization for mobile agents: a recursive decentralized algorithm based on Kalman filter decoupling
We consider cooperative localization technique for mobile agents with
communication and computation capabilities. We start by provide and overview of
different decentralization strategies in the literature, with special focus on
how these algorithms maintain an account of intrinsic correlations between
state estimate of team members. Then, we present a novel decentralized
cooperative localization algorithm that is a decentralized implementation of a
centralized Extended Kalman Filter for cooperative localization. In this
algorithm, instead of propagating cross-covariance terms, each agent propagates
new intermediate local variables that can be used in an update stage to create
the required propagated cross-covariance terms. Whenever there is a relative
measurement in the network, the algorithm declares the agent making this
measurement as the interim master. By acquiring information from the interim
landmark, the agent the relative measurement is taken from, the interim master
can calculate and broadcast a set of intermediate variables which each robot
can then use to update its estimates to match that of a centralized Extended
Kalman Filter for cooperative localization. Once an update is done, no further
communication is needed until the next relative measurement
- …