• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • 1
  • Tagged with
  • 3
  • 3
  • 3
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Intelligent Machine Learning Approaches for Aerospace Applications

Sathyan, Anoop 15 June 2017 (has links)
No description available.
2

Hybridation d’algorithmes évolutionnaires et de méthodes d’intervalles pour l’optimisation de problèmes difficiles / Hybridization of evolutionary algorithms and interval-based methods for optimizing difficult problems

Vanaret, Charlie 27 January 2015 (has links)
L’optimisation globale fiable est dédiée à la recherche d’un minimum global en présence d’erreurs d’arrondis. Les seules approches fournissant une preuve numérique d’optimalité sont des méthodes d’intervalles qui partitionnent l’espace de recherche et éliminent les sous-espaces qui ne peuvent contenir de solution optimale. Ces méthodes exhaustives, appelées branch and bound par intervalles, sont étudiées depuis les années 60 et ont récemment intégré des techniques de réfutation et de contraction, issues des communautés d’analyse par intervalles et de programmation par contraintes. Il est d’une importance cruciale de calculer i) un encadrement précis de la fonction objectif et des contraintes sur un sous-domaine ; ii) une bonne approximation (un majorant) du minimum global. Les solveurs de pointe sont généralement des méthodes intégratives : ils invoquent sur chaque sous-domaine des algorithmes d’optimisation locale afin d’obtenir une bonne approximation du minimum global. Dans ce document, nous nous intéressons à un cadre coopératif combinant des méthodes d’intervalles et des algorithmes évolutionnaires. Ces derniers sont des algorithmes stochastiques faisant évoluer une population de solutions candidates (individus) dans l’espace de recherche de manière itérative, dans l’espoir de converger vers des solutions satisfaisantes. Les algorithmes évolutionnaires, dotés de mécanismes permettant de s’échapper des minima locaux, sont particulièrement adaptés à la résolution de problèmes difficiles pour lesquels les méthodes traditionnelles peinent à converger. Au sein de notre solveur coopératif Charibde, l’algorithme évolutionnaire et l’algorithme sur intervalles exécutés en parallèle échangent bornes, solutions et espace de recherche par passage de messages. Une stratégie couplant une heuristique d’exploration géométrique et un opérateur de réduction de domaine empêche la convergence prématurée de la population vers des minima locaux et évite à l’algorithme évolutionnaire d’explorer des sous-espaces sous-optimaux ou non réalisables. Une comparaison de Charibde avec des solveurs de pointe (GlobSol, IBBA, Ibex) sur une base de problèmes difficiles montre un gain de temps d’un ordre de grandeur. De nouveaux résultats optimaux sont fournis pour cinq problèmes multimodaux pour lesquels peu de solutions, même approchées, sont connues dans la littérature. Nous proposons une application aéronautique dans laquelle la résolution de conflits est modélisée par un problème d’optimisation sous contraintes universellement quantifiées, et résolue par des techniques d’intervalles spécifiques. Enfin, nous certifions l’optimalité de la meilleure solution connue pour le cluster de Lennard-Jones à cinq atomes, un problème ouvert en dynamique moléculaire. / Reliable global optimization is dedicated to finding a global minimum in the presence of rounding errors. The only approaches for achieving a numerical proof of optimality in global optimization are interval-based methods that interleave branching of the search-space and pruning of the subdomains that cannot contain an optimal solution. The exhaustive interval branch and bound methods have been widely studied since the 1960s and have benefitted from the development of refutation methods and filtering algorithms, stemming from the interval analysis and interval constraint programming communities. It is of the utmost importance: i) to compute sharp enclosures of the objective function and the constraints on a given subdomain; ii) to find a good approximation (an upper bound) of the global minimum. State-of-the-art solvers are generally integrative methods, that is they embed local optimization algorithms to compute a good upper bound of the global minimum over each subspace. In this document, we propose a cooperative framework in which interval methods cooperate with evolutionary algorithms. The latter are stochastic algorithms in which a population of individuals (candidate solutions) iteratively evolves in the search-space to reach satisfactory solutions. Evolutionary algorithms, endowed with operators that help individuals escape from local minima, are particularly suited for difficult problems on which traditional methods struggle to converge. Within our cooperative solver Charibde, the evolutionary algorithm and the intervalbased algorithm run in parallel and exchange bounds, solutions and search-space via message passing. A strategy combining a geometric exploration heuristic and a domain reduction operator prevents premature convergence toward local minima and prevents the evolutionary algorithm from exploring suboptimal or unfeasible subspaces. A comparison of Charibde with state-of-the-art solvers based on interval analysis (GlobSol, IBBA, Ibex) on a benchmark of difficult problems shows that Charibde converges faster by an order of magnitude. New optimality results are provided for five multimodal problems, for which few solutions were available in the literature. We present an aeronautical application in which conflict solving between aircraft is modeled by an universally quantified constrained optimization problem, and solved by specific interval contractors. Finally, we certify the optimality of the putative solution to the Lennard-Jones cluster problem for five atoms, an open problem in molecular dynamics.
3

Utilizing Data-Driven Approaches to Evaluate and Develop Air Traffic Controller Action Prediction Models

Jeongjoon Boo (9106310) 27 July 2020 (has links)
Air traffic controllers (ATCos) monitor flight operations and resolve predicted aircraft conflicts to ensure safe flights, making them one of the essential human operators in air traffic control systems. Researchers have been studying ATCos with human subjective approaches to understand their tasks and air traffic managing processes. As a result, models were developed to predict ATCo actions. However, there is a gap between our knowledge and the real-world. The developed models have never been validated against the real-world, which creates uncertainties in our understanding of how ATCos detect and resolve predicted aircraft conflicts. Moreover, we do not know how information from air traffic control systems affects their actions. This Ph.D. dissertation work introduces methods to evaluate existing ATCo action prediction models. It develops a prediction model based on flight contextual information (information describing flight operations) to explain the relationship between ATCo actions and information. Unlike conventional approaches, this work takes data-driven approaches that collect large-scale flight tracking data. From the collected real-world data, ATCo actions and corresponding predicted aircraft conflicts were identified by developed algorithms. Comparison methods were developed to measure both qualitative and quantitative differences between solutions from the existing prediction models and ATCo actions on the same aircraft conflicts. The collected data is further utilized to develop an ATCo action prediction model. A hierarchical structure found from analyzing the collected ATCo actions was applied to build a structure for the model. The flight contextual information generated from the collected data was used to predict the actions. Results from this work found that the collected ATCo actions do not show any preferences on the methods to resolve aircraft conflicts. Results found that the evaluated existing prediction model does not reflect the real-world. Also, a large portion of the real conflicts was to be solved by the model both physically and operationally. Lastly, the developed prediction model showed a clear relationship between ATCo actions and applied flight contextual information. These results suggest the following takeaways. First, human actions can be identified from closed-loop data. It could be an alternative approach to collect human subjective data. Second, the importance of evaluating models before implications. Third, potentials to utilize the flight contextual information to conduct high-end prediction models.

Page generated in 0.1314 seconds