Show simple item record

dc.contributor.advisorMerino, Luis 
dc.contributor.advisorShutin, Dmitriy
dc.contributor.authorViseras Ruiz, Alberto
dc.date.accessioned2019-01-23T10:48:24Z
dc.date.available2019-01-23T10:48:24Z
dc.date.issued2018
dc.date.submitted2018-04-05
dc.identifier.urihttp://hdl.handle.net/10433/6301
dc.descriptionPrograma de Doctorado en Biotecnología, Ingeniería y Tecnología Químicaes_ES
dc.descriptionLínea de Investigación: Ingeniería Informática
dc.descriptionClave Programa: DBI
dc.descriptionCódigo Línea: 19
dc.description.abstractMobile robots have emerged as a prime alternative to explore physical processes of interest. This is particularly relevant in situations that have a high risk for humans, like e.g. in search and rescue missions, and for applications in which it is desirable to reduce the required time and manpower to gather information, like e.g. for environmental analysis. In such context, exploration tasks can clearly benefit from multi-robot coordination. In particular, distributed multi-robot coordination strategies offer enormous advantages in terms of both system¿s efficiency and robustness, compared to single-robot systems. However, most state-of-the-art strategies employ discretization of robots¿ state and action spaces. This makes them computationally intractable for robots with complex dynamics, and limits their generality. Moreover, most strategies cannot handle complex inter-robot constraints like e.g. communication constraints. The goal of this thesis is to develop a distributed multi-robot exploration algorithm that tackles the two aforementioned issues. To achieve this goal we first propose a single-robot myopic approach, in which we build to develop a non-myopic informative path planner. In a second step, we extend our non-myopic single-robot algorithm to the multi-robot case. Our proposed algorithms build on the following techniques: (i) Gaussian Processes (GPs) to model the spatial dependencies of a physical process of interest, (ii) sampling-based planners to calculate feasible paths; (iii) information metrics to guide robots towards informative locations; and (iv) distributed constraint optimization techniques for multi-robot coordination. We validated our proposed algorithms in simulations and experiments. Specifically, we carried out the following experiments: mapping of a magnetic field with a ground-based robot, mapping of a terrain profile with two quadcopters equipped with an ultrasound sensor, and exploration of a simulated wind field with three quadcopters. Results demonstrate the effectiveness of our approach to perform exploration tasks under complex constraints.es_ES
dc.description.sponsorshipUniversidad Pablo de Olavide de Sevilla. Departamento de Deporte e Informáticaes_ES
dc.format.mimetypeapplication/pdf
dc.language.isoenes_ES
dc.rightsAtribución-NoComercial-SinDerivadas 3.0 España*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/*
dc.subjectRobóticaes_ES
dc.subjectRobots móvileses_ES
dc.subjectSituaciones de riesgoes_ES
dc.titleDistributed multi-robot exploration under complex constraintses_ES
dc.typedoctoral thesises_ES
dc.description.versionPostprintes_ES
dc.rights.accessRightsopen accesses_ES


Files in this item

This item appears in the following Collection(s)

Show simple item record

Atribución-NoComercial-SinDerivadas 3.0 España
Except where otherwise noted, this item's license is described as Atribución-NoComercial-SinDerivadas 3.0 España