Searching and mining in enriched geo-spatial data

The emergence of new data collection mechanisms in geo-spatial applications paired with a heightened tendency of users to volunteer information provides an ever-increasing flow of data of high volume, complex nature, and often associated with inherent uncertainty. Such mechanisms include crowdsourcing, automated knowledge inference, tracking, and social media data repositories. Such data bearing additional information from multiple sources like probability distributions, text or numerical attributes, social context, or multimedia content can be called multi-enriched. Searching and mining this abundance of information holds many challenges, if all of the data's potential is to be released. This thesis addresses several major issues arising in that field, namely path queries using multi-enriched data, trend mining in social media data, and handling uncertainty in geo-spatial data. In all cases, the developed methods have made significant contributions and have appeared in or were accepted into various renowned international peer-reviewed venues. A common use of geo-spatial data is path queries in road networks where traditional methods optimise results based on absolute and ofttimes singular metrics, i.e., finding the shortest paths based on distance or the best trade-off between distance and travel time. Integrating additional aspects like qualitative or social data by enriching the data model with knowledge derived from sources as mentioned above allows for queries that can be issued to fit a broader scope of needs or preferences. This thesis presents two implementations of incorporating multi-enriched data into road networks. In one case, a range of qualitative data sources is evaluated to gain knowledge about user preferences which is subsequently matched with locations represented in a road network and integrated into its components. Several methods are presented for highly customisable path queries that incorporate a wide spectrum of data. In a second case, a framework is described for resource distribution with reappearance in road networks to serve one or more clients, resulting in paths that provide maximum gain based on a probabilistic evaluation of available resources. Applications for this include finding parking spots. Social media trends are an emerging research area giving insight in user sentiment and important topics. Such trends consist of bursts of messages concerning a certain topic within a time frame, significantly deviating from the average appearance frequency of the same topic. By investigating the dissemination of such trends in space and time, this thesis presents methods to classify trend archetypes to predict future dissemination of a trend. Processing and querying uncertain data is particularly demanding given the additional knowledge required to yield results with probabilistic guarantees. Since such knowledge is not always available and queries are not easily scaled to larger datasets due to the #P-complete nature of the problem, many existing approaches reduce the data to a deterministic representation of its underlying model to eliminate uncertainty. However, data uncertainty can also provide valuable insight into the nature of the data that cannot be represented in a deterministic manner. This thesis presents techniques for clustering uncertain data as well as query processing, that take the additional information from uncertainty models into account while preserving scalability using a sampling-based approach, while previous approaches could only provide one of the two. The given solutions enable the application of various existing clustering techniques or query types to a framework that manages the uncertainty.Das Erscheinen neuer Methoden zur Datenerhebung in räumlichen Applikationen gepaart mit einer erhöhten Bereitschaft der Nutzer, Daten über sich preiszugeben, generiert einen stetig steigenden Fluss von Daten in großer Menge, komplexer Natur, und oft gepaart mit inhärenter Unsicherheit. Beispiele für solche Mechanismen sind Crowdsourcing, automatisierte Wissensinferenz, Tracking, und Daten aus sozialen Medien. Derartige Daten, angereichert mit mit zusätzlichen Informationen aus verschiedenen Quellen wie Wahrscheinlichkeitsverteilungen, Text- oder numerische Attribute, sozialem Kontext, oder Multimediainhalten, werden als multi-enriched bezeichnet. Suche und Datamining in dieser weiten Datenmenge hält viele Herausforderungen bereit, wenn das gesamte Potenzial der Daten genutzt werden soll. Diese Arbeit geht auf mehrere große Fragestellungen in diesem Feld ein, insbesondere Pfadanfragen in multi-enriched Daten, Trend-mining in Daten aus sozialen Netzwerken, und die Beherrschung von Unsicherheit in räumlichen Daten. In all diesen Fällen haben die entwickelten Methoden signifikante Forschungsbeiträge geleistet und wurden veröffentlicht oder angenommen zu diversen renommierten internationalen, von Experten begutachteten Konferenzen und Journals. Ein gängiges Anwendungsgebiet räumlicher Daten sind Pfadanfragen in Straßennetzwerken, wo traditionelle Methoden die Resultate anhand absoluter und oft auch singulärer Maße optimieren, d.h., der kürzeste Pfad in Bezug auf die Distanz oder der beste Kompromiss zwischen Distanz und Reisezeit. Durch die Integration zusätzlicher Aspekte wie qualitativer Daten oder Daten aus sozialen Netzwerken als Anreicherung des Datenmodells mit aus diesen Quellen abgeleitetem Wissen werden Anfragen möglich, die ein breiteres Spektrum an Anforderungen oder Präferenzen erfüllen. Diese Arbeit präsentiert zwei Ansätze, solche multi-enriched Daten in Straßennetze einzufügen. Zum einen wird eine Reihe qualitativer Datenquellen ausgewertet, um Wissen über Nutzerpräferenzen zu generieren, welches darauf mit Örtlichkeiten im Straßennetz abgeglichen und in das Netz integriert wird. Diverse Methoden werden präsentiert, die stark personalisierbare Pfadanfragen ermöglichen, die ein weites Spektrum an Daten mit einbeziehen. Im zweiten Fall wird ein Framework präsentiert, das eine Ressourcenverteilung im Straßennetzwerk modelliert, bei der einmal verbrauchte Ressourcen erneut auftauchen können. Resultierende Pfade ergeben einen maximalen Ertrag basieren auf einer probabilistischen Evaluation der verfügbaren Ressourcen. Eine Anwendung ist die Suche nach Parkplätzen. Trends in sozialen Medien sind ein entstehendes Forscchungsgebiet, das Einblicke in Benutzerverhalten und wichtige Themen zulässt. Solche Trends bestehen aus großen Mengen an Nachrichten zu einem bestimmten Thema innerhalb eines Zeitfensters, so dass die Auftrittsfrequenz signifikant über den durchschnittlichen Level liegt. Durch die Untersuchung der Fortpflanzung solcher Trends in Raum und Zeit präsentiert diese Arbeit Methoden, um Trends nach Archetypen zu klassifizieren und ihren zukünftigen Weg vorherzusagen. Die Anfragebearbeitung und Datamining in unsicheren Daten ist besonders herausfordernd, insbesondere im Hinblick auf das notwendige Zusatzwissen, um Resultate mit probabilistischen Garantien zu erzielen. Solches Wissen ist nicht immer verfügbar und Anfragen lassen sich aufgrund der \P-Vollständigkeit des Problems nicht ohne Weiteres auf größere Datensätze skalieren. Dennoch kann Datenunsicherheit wertvollen Einblick in die Struktur der Daten liefern, der mit deterministischen Methoden nicht erreichbar wäre. Diese Arbeit präsentiert Techniken zum Clustering unsicherer Daten sowie zur Anfragebearbeitung, die die Zusatzinformation aus dem Unsicherheitsmodell in Betracht ziehen, jedoch gleichzeitig die Skalierbarkeit des Ansatzes auf große Datenmengen sicherstellen

Automated Discovery of porous molecular materials facilitated by characterization of molecular porosity

Porous materials are critical to many industrial sectors, including petrochemicals, energy and water. Traditional porous polymers and zeolites are currently most widely employed within membranes, as adsorbents for separations and storage, and as heterogeneous catalysts. The emerging advanced porous materials, e.g. extended framework materials and molecular porous materials, can boost performance and energy-efficiency of the current technologies because of the unprecedented level of control of their structure and function. The enormous possibilities for tuning these materials by changing their building blocks mean that, in principle, optimally performing materials for a variety of applications can be systematically designed. However, the process of finding a set of optimal structures for a given application could take decades using the traditional materials development approaches. These is a substantial payoff for developing tools and approaches that can accelerate this process. Among advanced porous materials, porous molecular materials are one of the most recent members though they have already attracted significant interest......Programa de Doctorado en Ciencia e Ingeniería de Materiales por la Universidad Carlos III de MadridPresidente: Germán Ignacio Sastre Navarro.- Secretario: Javier Carrasco Rodríguez.- Vocal: Andreas Mavrantonaki

Journal of Telecommunications and Information Technology, 2003, nr 4

kwartalni

Automatic triangulation positioning system for wide area coverage from a fixed sensors network

This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University LondonIn a wide area that many Transmitters (TRs) operate, systems of Fixed Sensors (FS) might be used in order to detect them and find TRs position. The detection and the accurate location of a new TR entering in the area frequently can be missed if the system fails to triangulate accurately the relative readings and analyze the changes in the received data. Additionally, there are cases that a Triangulation Station Network (TSN) can detect the heading as well as the transmitter’s position wrong. This thesis presents the design of a Sensors Network (FSN) system which is able to interact with a user, and exploit the relative data of the Sensors (SRs) in real time. The system performs localization with triangulation and the SRs are detect only TRs bearing data (range free). System design and algorithms are also explained. Efficient algorithms were elaborated and the outcomes of their implementation were calculated. The system design targets to reduce system errors and increase the accuracy and the speed of detection. Synchronously and through interaction with the user and changes of relative settings and parameters will be able to offer the user accurate results on localization of TRs in the area minimizing false readings and False Triangulations (FTRNs). The system also enables the user to apply optimization techniques in order to increase the system detection rate and performance and keep the surveillance in the Field of Interest (FoI) on a high level. The optimization methodology applied for the system proves that the FSN system is able to operate with a high performance even when saturation phenomena appear. The unique outcome of the research conducted, is that this thesis paves the way to enhance the localization via Triangulation for a network of Fixed Sensors with known position. The value of this thesis is that the FSN system performs bearing only detection (Range free) with a certain accuracy and the Area of Interest (AOI) is covered efficiently

Reconnaissance comportementale et suivi multi-cible dans des environnements partiellement observés

In this thesis, we are interested in the problem of pedestrian behavioral tracking within a critical environment partially under sensory coverage. While most of the works found in the literature usually focus only on either the location of a pedestrian or the activity a pedestrian is undertaking, we stands in a general view and consider estimating both data simultaneously. The contributions presented in this document are organized in two parts. The first part focuses on the representation and the exploitation of the environmental context for serving the purpose of behavioral estimation. The state of the art shows few studies addressing this issue where graphical models with limited expressiveness capacity such as dynamic Bayesian networks are used for modeling prior environmental knowledge. We propose, instead, to rely on richer contextual models issued from autonomous agent-based behavioral simulators and we demonstrate the effectiveness of our approach through extensive experimental evaluations. The second part of the thesis addresses the general problem of pedestrians’ mutual influences, commonly known as targets’ interactions, on their respective behaviors during the tracking process. Under the assumption of the availability of a generic simulator (or a function) modeling the tracked targets' behaviors, we develop a yet scalable approach in which interactions are considered at low computational cost. The originality of the proposed approach resides on the introduction of density-based aggregated information, called ‘’representatives’’, computed in such a way to guarantee the behavioral diversity for each target, and on which the filtering system relies for computing, in a finer way, behavioral estimations even in case of occlusions. We present the modeling choices, the resulting algorithms as well as a set of challenging scenarios on which the proposed approach is evaluated.Dans cette thèse, nous nous intéressons au problème du suivi comportemental des piétons au sein d'un environnement critique partiellement observé. Tandis que plusieurs travaux de la littérature s'intéressent uniquement soit à la position d'un piéton dans l'environnement, soit à l'activité à laquelle il s'adonne, nous optons pour une vue générale et nous estimons simultanément à ces deux données. Les contributions présentées dans ce document sont organisées en deux parties. La première partie traite principalement du problème de la représentation et de l'exploitation du contexte environnemental dans le but d'améliorer les estimations résultant du processus de suivi. L'état de l'art fait mention de quelques études adressant cette problématique. Dans ces études, des modèles graphiques aux capacités d'expressivité limitées, tels que des réseaux Bayésiens dynamiques, sont utilisés pour modéliser des connaissances contextuelles a priori. Dans cette thèse, nous proposons d'utiliser des modèles contextuelles plus riches issus des simulateurs de comportements d'agents autonomes et démontrons l’efficacité de notre approche au travers d'un ensemble d'évaluations expérimentales. La deuxième partie de la thèse adresse le problème général d'influences mutuelles - communément appelées interactions - entre piétons et l'impact de ces interactions sur les comportements respectifs de ces derniers durant le processus de suivi. Sous l'hypothèse que nous disposons d'un simulateur (ou une fonction) modélisant ces interactions, nous développons une approche de suivi comportemental à faible coût computationnel et facilement extensible dans laquelle les interactions entre cibles sont prises en compte. L'originalité de l'approche proposée vient de l'introduction des ``représentants'', qui sont des informations agrégées issues de la distribution de chaque cible de telle sorte à maintenir une diversité comportementale, et sur lesquels le système de filtrage s'appuie pour estimer, de manière fine, les comportements des différentes cibles et ceci, même en cas d'occlusions. Nous présentons nos choix de modélisation, les algorithmes résultants, et un ensemble de scénarios difficiles sur lesquels l’approche proposée est évaluée

Dynamic optimization of airspace sector grouping

The current airspace configuration is highly structured, fixed and is less responsive to changes causing the overall system to lack the flexibility, adaptability, and responsibility needed to handle the increasing air traffic demands in the near future. The work presented in this thesis aims at improving the flexibility and adaptability of today's airspace management in Europe in a pretactical context. We focus on the development of a method to support a process of automatic generation of a sequence of sector configurations composed of predefined sectors. Airspace configurations should be dynamically adjusted to provide maximum efficiency and flexibility in response to demand fluctuations. We dynamically build configurations by combining existing elementary sectors. In this step, any sector combination which forms controllable airspace blocks is eligible and may be used during the day of operation. In this work, we developed efficient methods to solve DAC problem. We formulated and study the sectorization problem from an algorithmic point of view. We proposed methods based on a mathematical modeling and heuristic optimization techniques. We also introduced here an approach to evaluate the workload inside sectors

Searching and mining in enriched geo-spatial data

The emergence of new data collection mechanisms in geo-spatial applications paired with a heightened tendency of users to volunteer information provides an ever-increasing flow of data of high volume, complex nature, and often associated with inherent uncertainty. Such mechanisms include crowdsourcing, automated knowledge inference, tracking, and social media data repositories. Such data bearing additional information from multiple sources like probability distributions, text or numerical attributes, social context, or multimedia content can be called multi-enriched. Searching and mining this abundance of information holds many challenges, if all of the data's potential is to be released. This thesis addresses several major issues arising in that field, namely path queries using multi-enriched data, trend mining in social media data, and handling uncertainty in geo-spatial data. In all cases, the developed methods have made significant contributions and have appeared in or were accepted into various renowned international peer-reviewed venues. A common use of geo-spatial data is path queries in road networks where traditional methods optimise results based on absolute and ofttimes singular metrics, i.e., finding the shortest paths based on distance or the best trade-off between distance and travel time. Integrating additional aspects like qualitative or social data by enriching the data model with knowledge derived from sources as mentioned above allows for queries that can be issued to fit a broader scope of needs or preferences. This thesis presents two implementations of incorporating multi-enriched data into road networks. In one case, a range of qualitative data sources is evaluated to gain knowledge about user preferences which is subsequently matched with locations represented in a road network and integrated into its components. Several methods are presented for highly customisable path queries that incorporate a wide spectrum of data. In a second case, a framework is described for resource distribution with reappearance in road networks to serve one or more clients, resulting in paths that provide maximum gain based on a probabilistic evaluation of available resources. Applications for this include finding parking spots. Social media trends are an emerging research area giving insight in user sentiment and important topics. Such trends consist of bursts of messages concerning a certain topic within a time frame, significantly deviating from the average appearance frequency of the same topic. By investigating the dissemination of such trends in space and time, this thesis presents methods to classify trend archetypes to predict future dissemination of a trend. Processing and querying uncertain data is particularly demanding given the additional knowledge required to yield results with probabilistic guarantees. Since such knowledge is not always available and queries are not easily scaled to larger datasets due to the #P-complete nature of the problem, many existing approaches reduce the data to a deterministic representation of its underlying model to eliminate uncertainty. However, data uncertainty can also provide valuable insight into the nature of the data that cannot be represented in a deterministic manner. This thesis presents techniques for clustering uncertain data as well as query processing, that take the additional information from uncertainty models into account while preserving scalability using a sampling-based approach, while previous approaches could only provide one of the two. The given solutions enable the application of various existing clustering techniques or query types to a framework that manages the uncertainty.Das Erscheinen neuer Methoden zur Datenerhebung in räumlichen Applikationen gepaart mit einer erhöhten Bereitschaft der Nutzer, Daten über sich preiszugeben, generiert einen stetig steigenden Fluss von Daten in großer Menge, komplexer Natur, und oft gepaart mit inhärenter Unsicherheit. Beispiele für solche Mechanismen sind Crowdsourcing, automatisierte Wissensinferenz, Tracking, und Daten aus sozialen Medien. Derartige Daten, angereichert mit mit zusätzlichen Informationen aus verschiedenen Quellen wie Wahrscheinlichkeitsverteilungen, Text- oder numerische Attribute, sozialem Kontext, oder Multimediainhalten, werden als multi-enriched bezeichnet. Suche und Datamining in dieser weiten Datenmenge hält viele Herausforderungen bereit, wenn das gesamte Potenzial der Daten genutzt werden soll. Diese Arbeit geht auf mehrere große Fragestellungen in diesem Feld ein, insbesondere Pfadanfragen in multi-enriched Daten, Trend-mining in Daten aus sozialen Netzwerken, und die Beherrschung von Unsicherheit in räumlichen Daten. In all diesen Fällen haben die entwickelten Methoden signifikante Forschungsbeiträge geleistet und wurden veröffentlicht oder angenommen zu diversen renommierten internationalen, von Experten begutachteten Konferenzen und Journals. Ein gängiges Anwendungsgebiet räumlicher Daten sind Pfadanfragen in Straßennetzwerken, wo traditionelle Methoden die Resultate anhand absoluter und oft auch singulärer Maße optimieren, d.h., der kürzeste Pfad in Bezug auf die Distanz oder der beste Kompromiss zwischen Distanz und Reisezeit. Durch die Integration zusätzlicher Aspekte wie qualitativer Daten oder Daten aus sozialen Netzwerken als Anreicherung des Datenmodells mit aus diesen Quellen abgeleitetem Wissen werden Anfragen möglich, die ein breiteres Spektrum an Anforderungen oder Präferenzen erfüllen. Diese Arbeit präsentiert zwei Ansätze, solche multi-enriched Daten in Straßennetze einzufügen. Zum einen wird eine Reihe qualitativer Datenquellen ausgewertet, um Wissen über Nutzerpräferenzen zu generieren, welches darauf mit Örtlichkeiten im Straßennetz abgeglichen und in das Netz integriert wird. Diverse Methoden werden präsentiert, die stark personalisierbare Pfadanfragen ermöglichen, die ein weites Spektrum an Daten mit einbeziehen. Im zweiten Fall wird ein Framework präsentiert, das eine Ressourcenverteilung im Straßennetzwerk modelliert, bei der einmal verbrauchte Ressourcen erneut auftauchen können. Resultierende Pfade ergeben einen maximalen Ertrag basieren auf einer probabilistischen Evaluation der verfügbaren Ressourcen. Eine Anwendung ist die Suche nach Parkplätzen. Trends in sozialen Medien sind ein entstehendes Forscchungsgebiet, das Einblicke in Benutzerverhalten und wichtige Themen zulässt. Solche Trends bestehen aus großen Mengen an Nachrichten zu einem bestimmten Thema innerhalb eines Zeitfensters, so dass die Auftrittsfrequenz signifikant über den durchschnittlichen Level liegt. Durch die Untersuchung der Fortpflanzung solcher Trends in Raum und Zeit präsentiert diese Arbeit Methoden, um Trends nach Archetypen zu klassifizieren und ihren zukünftigen Weg vorherzusagen. Die Anfragebearbeitung und Datamining in unsicheren Daten ist besonders herausfordernd, insbesondere im Hinblick auf das notwendige Zusatzwissen, um Resultate mit probabilistischen Garantien zu erzielen. Solches Wissen ist nicht immer verfügbar und Anfragen lassen sich aufgrund der \P-Vollständigkeit des Problems nicht ohne Weiteres auf größere Datensätze skalieren. Dennoch kann Datenunsicherheit wertvollen Einblick in die Struktur der Daten liefern, der mit deterministischen Methoden nicht erreichbar wäre. Diese Arbeit präsentiert Techniken zum Clustering unsicherer Daten sowie zur Anfragebearbeitung, die die Zusatzinformation aus dem Unsicherheitsmodell in Betracht ziehen, jedoch gleichzeitig die Skalierbarkeit des Ansatzes auf große Datenmengen sicherstellen

LSST Science Book, Version 2.0

A survey that can cover the sky in optical bands over wide fields to faint magnitudes with a fast cadence will enable many of the exciting science opportunities of the next decade. The Large Synoptic Survey Telescope (LSST) will have an effective aperture of 6.7 meters and an imaging camera with field of view of 9.6 deg^2, and will be devoted to a ten-year imaging survey over 20,000 deg^2 south of +15 deg. Each pointing will be imaged 2000 times with fifteen second exposures in six broad bands from 0.35 to 1.1 microns, to a total point-source depth of r~27.5. The LSST Science Book describes the basic parameters of the LSST hardware, software, and observing plans. The book discusses educational and outreach opportunities, then goes on to describe a broad range of science that LSST will revolutionize: mapping the inner and outer Solar System, stellar populations in the Milky Way and nearby galaxies, the structure of the Milky Way disk and halo and other objects in the Local Volume, transient and variable objects both at low and high redshift, and the properties of normal and active galaxies at low and high redshift. It then turns to far-field cosmological topics, exploring properties of supernovae to z~1, strong and weak lensing, the large-scale distribution of galaxies and baryon oscillations, and how these different probes may be combined to constrain cosmological models and the physics of dark energy.Comment: 596 pages. Also available at full resolution at http://www.lsst.org/lsst/sciboo

Aircraft Trajectory Planning Considering Ensemble Forecasting of Thunderstorms

Mención Internacional en el título de doctorConvective weather poses a major threat that compromises the safe operation of flights while inducing delay and cost. The aircraft trajectory planning problem under thunderstorm evolution is addressed in this thesis, proposing two novel heuristic approaches that incorporate uncertainties in the evolution of convective cells. In this context, two additional challenges are faced. On the one hand, studies have demonstrated that given the computational power available nowadays, the best way to characterize weather uncertainties is through ensemble forecasting products, hence compatibility with them is crucial. On the other hand, for the algorithms to be used during a flight, they must be fast and deliver results in a few seconds. As a first methodology, three variants of the Scenario-Based Rapidly-Exploring Random Trees (SB-RRTs) are proposed. Each of them builds a tree to explore the free airspace during an iterative and random process. The so-called SB-RRT, the SB-RRT∗ and the Informed SB-RRT∗ find point-to-point safe trajectories by meeting a user-defined safety threshold. Additionally, the last two techniques converge to solutions of minimum flight length. In a second instance, the Augmented Random Search (ARS) algorithm is used to sample trajectories from a directed graph and deform them iteratively in the search for an optimal path. The aim of such deformations is to adapt the initial graph to the unsafe set and its possible changes. In the end, the ARS determines the population of trajectories that, on average, minimizes a combination of flight time, time in storms, and fuel consumption Both methodologies are tested considering a dynamic model of an aircraft flying between two waypoints at a constant flight level. Test scenarios consist of realistic weather forecasts described by an ensemble of equiprobable members. Moreover, the influence of relevant parameters, such as the maximum number of iterations, safety margin (in SB-RRTs) or relative weights between objectives (in ARS) is analyzed. Since both algorithms and their convergence processes are random, sensitivity analyses are conducted to show that after enough iterations the results match. Finally, through parallelization on graphical processing units, the required computational times are reduced substantially to become compatible with near real-time operation. In either case, results show that the suggested approaches are able to avoid dangerous and uncertain stormy regions, minimize objectives such as time of flight, flown distance or fuel consumption and operate in less than 10 seconds.Los fenómenos convectivos representan una gran amenaza que compromete la seguridad de los vuelos, a la vez que incrementa los retrasos y costes. En esta tesis se aborda el problema de la planificación de vuelos bajo la influencia de tormentas, proponiendo dos nuevos métodos heurísticos que incorporan incertidumbre en la evolución de las células convectivas. En este contexto, se intentará dar respuesta a dos desafíos adicionales. Por un lado, hay estudios que demuestran que, con los recursos computacionales disponibles hoy en día, la mejor manera de caracterizar la incertidumbre meteorológica es mediante productos de tipo “ensemble”. Por tanto, la compatibilidad con ellos es crucial. Por otro lado, para poder emplear los algoritmos durante el vuelo, deben de ser rápidos y obtener resultados en pocos segundos. Como primera aproximación, se proponen tres variantes de los “Scenario-Based Rapidly-Exploring Random Trees” (SB-RRTs). Cada uno de ellos crea un árbol que explora el espacio seguro durante un proceso iterativo y aleatorio. Los denominados SB-RRT, SB-RRT∗ e Informed SB-RRT∗ calculan trayectorias entre dos puntos respetando un margen de seguridad impuesto por el usuario. Además, los dos últimos métodos convergen en soluciones de mínima distancia de vuelo. En segundo lugar, el algoritmo “Augmented Random Search” (ARS) se utiliza para muestrear trajectorias de un grafo dirigido y deformarlas iterativamente en busca del camino óptimo. El fin de tales deformaciones es adaptar el grafo inicial a las zonas peligrosas y a los cambios que puedan sufrir. Finalmente, el ARS calcula aquella población de trayectorias que, de media, minimiza una combinación del tiempo de vuelo, el tiempo en zonas tormentosas y el consumo de combustible. Ambas metodologías se testean considerando un modelo de avión volando punto a punto a altitud constante. Los casos de prueba se basan en datos meteorológicos realistas formados por un grupo de predicciones equiprobables. Además, se analiza la influencia de los parámetros más importantes como el máximo número de iteraciones, el margen de seguridad (en SB-RRTs) o los pesos relativos de cada objetivo (en ARS). Como ambos algoritmos y sus procesos de convergencia son aleatorios, se realizan análisis de sensibilidad para mostrar que, tras suficientes iteraciones, los resultados coinciden. Por último, mediante técnicas de paralelización en procesadores gráficos, se reducen enormemente los tiempos de cálculo, siendo compatibles con una operación en tiempo casi-real. En ambos casos los resultados muestran que los algoritmos son capaces de evitar zonas inciertas de tormenta, minimizar objetivos como el tiempo de vuelo, la distancia recorrida o el consumo de combustible, en menos de 10 segundos de ejecución.Programa de Doctorado en Ingeniería Aeroespacial por la Universidad Carlos III de MadridPresidente: Ernesto Staffetti Giammaria.- Secretario: Alfonso Valenzuela Romero.- Vocal: Valentin Polishchu