Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Development of a multi-objective optimization algorithm based on lichtenberg figures

This doctoral dissertation presents the most important concepts of multi-objective optimization and a systematic review of the most cited articles in the last years of this subject in mechanical engineering. The State of the Art shows a trend towards the use of metaheuristics and the use of a posteriori decision-making techniques to solve engineering problems. This fact increases the demand for algorithms, which compete to deliver the most accurate answers at the lowest possible computational cost. In this context, a new hybrid multi-objective metaheuristic inspired by lightning and Linchtenberg Figures is proposed. The Multi-objective Lichtenberg Algorithm (MOLA) is tested using complex test functions and explicit contrainted engineering problems and compared with other metaheuristics. MOLA outperformed the most used algorithms in the literature: NSGA-II, MOPSO, MOEA/D, MOGWO, and MOGOA. After initial validation, it was applied to two complex and impossible to be analytically evaluated problems. The first was a design case: the multi-objective optimization of CFRP isogrid tubes using the finite element method. The optimizations were made considering two methodologies: i) using a metamodel, and ii) the finite element updating. The last proved to be the best methodology, finding solutions that reduced at least 45.69% of the mass, 18.4% of the instability coefficient, 61.76% of the Tsai-Wu failure index and increased by at least 52.57% the natural frequency. In the second application, MOLA was internally modified and associated with feature selection techniques to become the Multi-objective Sensor Selection and Placement Optimization based on the Lichtenberg Algorithm (MOSSPOLA), an unprecedented Sensor Placement Optimization (SPO) algorithm that maximizes the acquired modal response and minimizes the number of sensors for any structure. Although this is a structural health monitoring principle, it has never been done before. MOSSPOLA was applied to a real helicopter’s main rotor blade using the 7 best-known metrics in SPO. Pareto fronts and sensor configurations were unprecedentedly generated and compared. Better sensor distributions were associated with higher hypervolume and the algorithm found a sensor configuration for each sensor number and metric, including one with 100% accuracy in identifying delamination considering triaxial modal displacements, minimum number of sensors, and noise for all blade sections.Esta tese de doutorado traz os conceitos mais importantes de otimização multi-objetivo e uma revisão sistemática dos artigos mais citados nos últimos anos deste tema em engenharia mecânica. O estado da arte mostra uma tendência no uso de meta-heurísticas e de técnicas de tomada de decisão a posteriori para resolver problemas de engenharia. Este fato aumenta a demanda sobre os algoritmos, que competem para entregar respostas mais precisas com o menor custo computacional possível. Nesse contexto, é proposta uma nova meta-heurística híbrida multi-objetivo inspirada em raios e Figuras de Lichtenberg. O Algoritmo de Lichtenberg Multi-objetivo (MOLA) é testado e comparado com outras metaheurísticas usando funções de teste complexas e problemas restritos e explícitos de engenharia. Ele superou os algoritmos mais utilizados na literatura: NSGA-II, MOPSO, MOEA/D, MOGWO e MOGOA. Após validação, foi aplicado em dois problemas complexos e impossíveis de serem analiticamente otimizados. O primeiro foi um caso de projeto: otimização multi-objetivo de tubos isogrid CFRP usando o método dos elementos finitos. As otimizações foram feitas considerando duas metodologias: i) usando um meta-modelo, e ii) atualização por elementos finitos. A última provou ser a melhor metodologia, encontrando soluções que reduziram pelo menos 45,69% da massa, 18,4% do coeficiente de instabilidade, 61,76% do TW e aumentaram em pelo menos 52,57% a frequência natural. Na segunda aplicação, MOLA foi modificado internamente e associado a técnicas de feature selection para se tornar o Seleção e Alocação ótima de Sensores Multi-objetivo baseado no Algoritmo de Lichtenberg (MOSSPOLA), um algoritmo inédito de Otimização de Posicionamento de Sensores (SPO) que maximiza a resposta modal adquirida e minimiza o número de sensores para qualquer estrutura. Embora isto seja um princípio de Monitoramento da Saúde Estrutural, nunca foi feito antes. O MOSSPOLA foi aplicado na pá do rotor principal de um helicóptero real usando as 7 métricas mais conhecidas em SPO. Frentes de Pareto e configurações de sensores foram ineditamente geradas e comparadas. Melhores distribuições de sensores foram associadas a um alto hipervolume e o algoritmo encontrou uma configuração de sensor para cada número de sensores e métrica, incluindo uma com 100% de precisão na identificação de delaminação considerando deslocamentos modais triaxiais, número mínimo de sensores e ruído para todas as seções da lâmina

Sensor resource management with evolutionary algorithms applied to indoor positioning

Premio Extraordinario de Doctorado de la UAH en el año académico 2016-2017Esta tesis pretende contribuir a la mejora de la gestión de recursos en sistemas de sensores aplicados a localización en interiores. Mediante esta gestión pueden abordarse dos temas, la colocación de estos sensores y su uso óptimo una vez colocados, centrándose la tesis en el primero de ellos. Durante la tesis se considera el uso de un sistema de posicionamiento en interiores basado en señales infrarrojas con medida de diferencia de fase. Estas medidas de fase son posteriormente transformadas en distancias, con lo cual nuestro problema es el de trilateración hiperbólica utilizando medidas de diferencia de distancia. Aunque se describe un modelo para el error en diferencia de distancias del enlace infrarrojo, podemos abstraernos de este y simplemente considerar que utilizamos medidas de diferencia de distancia que están normalmente distribuidas con una varianza dada por el modelo usado. De hecho, el trabajo expuesto en esta tesis podría ser usado con cualquier otro sistema del cual obtengamos un modelo de los errores de medida, ya sea empleando además trilateración esférica o angulación. La gran mayoría de trabajos que mejoran la precisión de un sistema de posicionamiento colocando sensores optimizan funciones de coste basadas en el límite inferior de Cramér-Rao, enfoque que adoptamos también en este trabajo. En el capítulo de la tesis dedicado al estado del arte hacemos un repaso de las diferentes propuestas existentes, que concluye explicando qué pretendemos aportar sobre las contribuciones existentes en la literatura científica. En resumen, podemos clasificar las propuestas actuales en tres clases. La primera de ellas trata de determinar una configuración óptima para localizar un objetivo, normalmente utilizando el determinante de la matriz de información de Fisher o la dilución de la precisión. Estos métodos pueden obtener expresiones analíticas que proporcionan una explicación sobre como intervienen las características de los sensores y su colocación en la precisión obtenida. Sin embargo, carecen de aplicabilidad en situaciones reales. El segundo tipo de propuestas emplea métodos numéricos para optimizar la colocación de sensores considerando varios objetivos o un área entera. Los métodos propuestos en esta tesis encajan dentro de esta categoría. Por último, existen métodos que utilizan técnicas de selección de sensores para obtener configuraciones óptimas. Entre las distintas propuestas encontramos varias deficiencias, como la simplificación del modelo de error de la medida para obtener expresiones fácilmente tratables, la consideración de un solo criterio de precisión de la localización, colocación de un número determinado y fijo de sensores, o su despliegue en áreas simples que no presenten problemas de oclusiones. Nuestra primera aportación trata de solucionar la consideración de un único criterio de precisión, que normalmente es el determinante o la traza de la matriz de covarianza o información de la estimación. Cada métrica obtenida de estas matrices tiene un significado práctico distinto, y la consideración de solo una de ellas puede dar lugar a soluciones que presenten deficiencias en las otras, como la obtención de elipses de error muy alargadas. Nuestra propuesta implica el uso de algoritmos evolutivos multifunción que optimicen varias de estas métricas, como el error cuadrático medio en todo el área, la isotropía de la solución, y la máxima desviación que puede aparecer. Esto nos permite tener un conjunto de soluciones dadas en un frente de Pareto, que permitirán al gestor de la red de sensores visualizar las posibles soluciones y elegir entre ellas según las necesidades. También permite obtener colocaciones que mejoren la convergencia de algunos estimadores. La segunda contribución de la tesis se ocupa de la colocación de sensores en zonas más complejas, donde existan obstáculos que provoquen oclusiones a algunos sensores. De esta manera, podemos introducir el problema de intentar cubrir la mayor cantidad de puntos del espacio con el número mínimo de sensores necesario para calcular la posición de un objetivo. Dicho número influirá en el porcentaje de área cubierto y en la precisión obtenida, además de aumentar el coste del sistema. Debido a esto, también será un objetivo a optimizar junto a la cobertura y la incertidumbre de la posición estimada. Para llevar a cabo esta optimización se propone una mejora sobre el algoritmo utilizado en la aportación anterior basada en el uso de subpoblaciones y añadiendo operadores genéticos que modifiquen el número de sensores según la cobertura y condensación en los distintos puntos de la zona a cubrir. Cada uno de los capítulos dedicado a las aportaciones descritas contiene resultados y conclusiones que confirman el buen funcionamiento de los métodos propuestos. Finalmente, la tesis concluye con una lista de propuestas que serán estudiadas en un futuro

Joint optimization for wireless sensor networks in critical infrastructures

Energy optimization represents one of the main goals in wireless sensor network design where a typical sensor node has usually operated by making use of the battery with limited-capacity. In this thesis, the following main problems are addressed: first, the joint optimization of the energy consumption and the delay for conventional wireless sensor networks is presented. Second, the joint optimization of the information quality and energy consumption of the wireless sensor networks based structural health monitoring is outlined. Finally, the multi-objectives optimization of the former problem under several constraints is shown. In the first main problem, the following points are presented: we introduce a joint multi-objective optimization formulation for both energy and delay for most sensor nodes in various applications. Then, we present the Karush-Kuhn-Tucker analysis to demonstrate the optimal solution for each formulation. We introduce a method of determining the knee on the Pareto front curve, which meets the network designer interest for focusing on more practical solutions. The sensor node placement optimization has a significant role in wireless sensor networks, especially in structural health monitoring. In the second main problem of this work, the existing work optimizes the node placement and routing separately (by performing routing after carrying out the node placement). However, this approach does not guarantee the optimality of the overall solution. A joint optimization of sensor placement, routing, and flow assignment is introduced and is solved using mixed-integer programming modelling. In the third main problem of this study, we revisit the placement problem in wireless sensor networks of structural health monitoring by using multi-objective optimization. Furthermore, we take into consideration more constraints that were not taken into account before. This includes the maximum capacity per link and the node-disjoint routing. Since maximum capacity constraint is essential to study the data delivery over limited-capacity wireless links, node-disjoint routing is necessary to achieve load balancing and longer wireless sensor networks lifetime. We list the results of the previous problems, and then we evaluate the corresponding results

Development of a GIS-based method for sensor network deployment and coverage optimization

Au cours des dernières années, les réseaux de capteurs ont été de plus en plus utilisés dans différents contextes d’application allant de la surveillance de l’environnement au suivi des objets en mouvement, au développement des villes intelligentes et aux systèmes de transport intelligent, etc. Un réseau de capteurs est généralement constitué de nombreux dispositifs sans fil déployés dans une région d'intérêt. Une question fondamentale dans un réseau de capteurs est l'optimisation de sa couverture spatiale. La complexité de l'environnement de détection avec la présence de divers obstacles empêche la couverture optimale de plusieurs zones. Par conséquent, la position du capteur affecte la façon dont une région est couverte ainsi que le coût de construction du réseau. Pour un déploiement efficace d'un réseau de capteurs, plusieurs algorithmes d'optimisation ont été développés et appliqués au cours des dernières années. La plupart de ces algorithmes reposent souvent sur des modèles de capteurs et de réseaux simplifiés. En outre, ils ne considèrent pas certaines informations spatiales de l'environnement comme les modèles numériques de terrain, les infrastructures construites humaines et la présence de divers obstacles dans le processus d'optimisation. L'objectif global de cette thèse est d'améliorer les processus de déploiement des capteurs en intégrant des informations et des connaissances géospatiales dans les algorithmes d'optimisation. Pour ce faire, trois objectifs spécifiques sont définis. Tout d'abord, un cadre conceptuel est développé pour l'intégration de l'information contextuelle dans les processus de déploiement des réseaux de capteurs. Ensuite, sur la base du cadre proposé, un algorithme d'optimisation sensible au contexte local est développé. L'approche élargie est un algorithme local générique pour le déploiement du capteur qui a la capacité de prendre en considération de l'information spatiale, temporelle et thématique dans différents contextes d'applications. Ensuite, l'analyse de l'évaluation de la précision et de la propagation d'erreurs est effectuée afin de déterminer l'impact de l'exactitude des informations contextuelles sur la méthode d'optimisation du réseau de capteurs proposée. Dans cette thèse, l'information contextuelle a été intégrée aux méthodes d'optimisation locales pour le déploiement de réseaux de capteurs. L'algorithme développé est basé sur le diagramme de Voronoï pour la modélisation et la représentation de la structure géométrique des réseaux de capteurs. Dans l'approche proposée, les capteurs change leur emplacement en fonction des informations contextuelles locales (l'environnement physique, les informations de réseau et les caractéristiques des capteurs) visant à améliorer la couverture du réseau. La méthode proposée est implémentée dans MATLAB et est testée avec plusieurs jeux de données obtenus à partir des bases de données spatiales de la ville de Québec. Les résultats obtenus à partir de différentes études de cas montrent l'efficacité de notre approche.In recent years, sensor networks have been increasingly used for different applications ranging from environmental monitoring, tracking of moving objects, development of smart cities and smart transportation system, etc. A sensor network usually consists of numerous wireless devices deployed in a region of interest. A fundamental issue in a sensor network is the optimization of its spatial coverage. The complexity of the sensing environment with the presence of diverse obstacles results in several uncovered areas. Consequently, sensor placement affects how well a region is covered by sensors as well as the cost for constructing the network. For efficient deployment of a sensor network, several optimization algorithms are developed and applied in recent years. Most of these algorithms often rely on oversimplified sensor and network models. In addition, they do not consider spatial environmental information such as terrain models, human built infrastructures, and the presence of diverse obstacles in the optimization process. The global objective of this thesis is to improve sensor deployment processes by integrating geospatial information and knowledge in optimization algorithms. To achieve this objective three specific objectives are defined. First, a conceptual framework is developed for the integration of contextual information in sensor network deployment processes. Then, a local context-aware optimization algorithm is developed based on the proposed framework. The extended approach is a generic local algorithm for sensor deployment, which accepts spatial, temporal, and thematic contextual information in different situations. Next, an accuracy assessment and error propagation analysis is conducted to determine the impact of the accuracy of contextual information on the proposed sensor network optimization method. In this thesis, the contextual information has been integrated in to the local optimization methods for sensor network deployment. The extended algorithm is developed based on point Voronoi diagram in order to represent geometrical structure of sensor networks. In the proposed approach sensors change their location based on local contextual information (physical environment, network information and sensor characteristics) aiming to enhance the network coverage. The proposed method is implemented in MATLAB and tested with several data sets obtained from Quebec City spatial database. Obtained results from different case studies show the effectiveness of our approach

Navigace mobilních robotů v neznámém prostředí s využitím měření vzdáleností

The ability of a robot to navigate itself in the environment is a crucial step towards its autonomy. Navigation as a subtask of the development of autonomous robots is the subject of this thesis, focusing on the development of a method for simultaneous localization an mapping (SLAM) of mobile robots in six degrees of freedom (DOF). As a part of this research, a platform for 3D range data acquisition based on a continuously inclined laser rangefinder was developed. This platform is presented, evaluating the measurements and also presenting the robotic equipment on which the platform can be fitted. The localization and mapping task is equal to the registration of multiple 3D images into a common frame of reference. For this purpose, a method based on the Iterative Closest Point (ICP) algorithm was developed. First, the originally implemented SLAM method is presented, focusing on the time-wise performance and the registration quality issues introduced by the implemented algorithms. In order to accelerate and improve the quality of the time-demanding 6DOF image registration, an extended method was developed. The major extension is the introduction of a factorized registration, extracting 2D representations of vertical objects called leveled maps from the 3D point sets, ensuring these representations are 3DOF invariant. The extracted representations are registered in 3DOF using ICP algorithm, allowing pre-alignment of the 3D data for the subsequent robust 6DOF ICP based registration. The extended method is presented, showing all important modifications to the original method. The developed registration method was evaluated using real 3D data acquired in different indoor environments, examining the benefits of the factorization and other extensions as well as the performance of the original ICP based method. The factorization gives promising results compared to a single phase 6DOF registration in vertically structured environments. Also, the disadvantages of the method are discussed, proposing possible solutions. Finally, the future prospects of the research are presented.Schopnost lokalizace a navigace je podmínkou autonomního provozu mobilních robotů. Předmětem této disertační práce jsou navigační metody se zaměřením na metodu pro simultánní lokalizaci a mapování (SLAM) mobilních robotů v šesti stupních volnosti (6DOF). Nedílnou součástí tohoto výzkumu byl vývoj platformy pro sběr 3D vzdálenostních dat s využitím kontinuálně naklápěného laserového řádkového scanneru. Tato platforma byla vyvinuta jako samostatný modul, aby mohla být umístěna na různé šasi mobilních robotů. Úkol lokalizace a mapování je ekvivalentní registraci více 3D obrazů do společného souřadného systému. Pro tyto účely byla vyvinuta metoda založená na algoritmu Iterative Closest Point Algorithm (ICP). Původně implementovaná verze navigační metody využívá ICP s akcelerací pomocí kd-stromů přičemž jsou zhodnoceny její kvalitativní a výkonnostní aspekty. Na základě této analýzy byly vyvinuty rozšíření původní metody založené na ICP. Jednou z hlavních modifikací je faktorizace registračního procesu, kdy tato faktorizace je založena na redukci dat: vytvoření 2D „leveled“ map (ve smyslu jednoúrovňových map) ze 3D vzdálenostních obrazů. Pro tuto redukci je technologicky i algoritmicky zajištěna invariantnost těchto map vůči třem stupňům volnosti. Tyto redukované mapy jsou registrovány pomocí ICP ve zbylých třech stupních volnosti, přičemž získaná transformace je aplikována na 3D data za účelem před-registrace 3D obrazů. Následně je provedena robustní 6DOF registrace. Rozšířená metoda je v disertační práci v popsána spolu se všemi podstatnými modifikacemi. Vyvinutá metoda byla otestována a zhodnocena s využitím skutečných 3D vzdálenostních dat naměřených v různých vnitřních prostředích. Jsou zhodnoceny přínosy faktorizace a jiných modifikací ve srovnání s původní jednofázovou 6DOF registrací, také jsou zmíněny nevýhody implementované metody a navrženy způsoby jejich řešení. Nakonec následuje návrh budoucího výzkumu a diskuse o možnostech dalšího rozvoje.

NASA Automated Rendezvous and Capture Review. Executive summary

In support of the Cargo Transfer Vehicle (CTV) Definition Studies in FY-92, the Advanced Program Development division of the Office of Space Flight at NASA Headquarters conducted an evaluation and review of the United States capabilities and state-of-the-art in Automated Rendezvous and Capture (AR&C). This review was held in Williamsburg, Virginia on 19-21 Nov. 1991 and included over 120 attendees from U.S. government organizations, industries, and universities. One hundred abstracts were submitted to the organizing committee for consideration. Forty-two were selected for presentation. The review was structured to include five technical sessions. Forty-two papers addressed topics in the five categories below: (1) hardware systems and components; (2) software systems; (3) integrated systems; (4) operations; and (5) supporting infrastructure

Perception architecture exploration for automotive cyber-physical systems

2022 Spring.Includes bibliographical references.In emerging autonomous and semi-autonomous vehicles, accurate environmental perception by automotive cyber physical platforms are critical for achieving safety and driving performance goals. An efficient perception solution capable of high fidelity environment modeling can improve Advanced Driver Assistance System (ADAS) performance and reduce the number of lives lost to traffic accidents as a result of human driving errors. Enabling robust perception for vehicles with ADAS requires solving multiple complex problems related to the selection and placement of sensors, object detection, and sensor fusion. Current methods address these problems in isolation, which leads to inefficient solutions. For instance, there is an inherent accuracy versus latency trade-off between one stage and two stage object detectors which makes selecting an enhanced object detector from a diverse range of choices difficult. Further, even if a perception architecture was equipped with an ideal object detector performing high accuracy and low latency inference, the relative position and orientation of selected sensors (e.g., cameras, radars, lidars) determine whether static or dynamic targets are inside the field of view of each sensor or in the combined field of view of the sensor configuration. If the combined field of view is too small or contains redundant overlap between individual sensors, important events and obstacles can go undetected. Conversely, if the combined field of view is too large, the number of false positive detections will be high in real time and appropriate sensor fusion algorithms are required for filtering. Sensor fusion algorithms also enable tracking of non-ego vehicles in situations where traffic is highly dynamic or there are many obstacles on the road. Position and velocity estimation using sensor fusion algorithms have a lower margin for error when trajectories of other vehicles in traffic are in the vicinity of the ego vehicle, as incorrect measurement can cause accidents. Due to the various complex inter-dependencies between design decisions, constraints and optimization goals a framework capable of synthesizing perception solutions for automotive cyber physical platforms is not trivial. We present a novel perception architecture exploration framework for automotive cyber- physical platforms capable of global co-optimization of deep learning and sensing infrastructure. The framework is capable of exploring the synthesis of heterogeneous sensor configurations towards achieving vehicle autonomy goals. As our first contribution, we propose a novel optimization framework called VESPA that explores the design space of sensor placement locations and orientations to find the optimal sensor configuration for a vehicle. We demonstrate how our framework can obtain optimal sensor configurations for heterogeneous sensors deployed across two contemporary real vehicles. We then utilize VESPA to create a comprehensive perception architecture synthesis framework called PASTA. This framework enables robust perception for vehicles with ADAS requiring solutions to multiple complex problems related not only to the selection and placement of sensors but also object detection, and sensor fusion as well. Experimental results with the Audi-TT and BMW Minicooper vehicles show how PASTA can intelligently traverse the perception design space to find robust, vehicle-specific solutions

Table Organization Optimization in Schools for Preserving the Social Distance during the COVID-19 Pandemic

[EN] The COVID-19 pandemic has supposed a challenge for education. The school closures during the initial coronavirus outbreak for reducing the infections have promoted negative effects on children, such as the interruption of their normal social relationships or their necessary physical activity. Thus, most of the countries worldwide have considered as a priority the reopening of schools but imposing some rules for keeping safe places for the school lessons such as social distancing, wearing facemasks, hydroalcoholic gels or reducing the capacity in the indoor rooms. In Spain, the government has fixed a minimum distance of 1.5 m among the students’ desks for preserving the social distancing and schools have followed orthogonal and triangular mesh patterns for achieving valid table dispositions that meet the requirements. However, these patterns may not attain the best results for maximizing the distances among the tables. Therefore, in this paper, we introduce for the first time in the authors’ best knowledge a Genetic Algorithm (GA) for optimizing the disposition of the tables at schools during the coronavirus pandemic. We apply this GA in two real-application scenarios in which we find table dispositions that increase the distances among the tables by 19.33% and 10%, respectively, with regards to regular government patterns in these classrooms, thus fulfilling the main objectives of the paper.SIMinisterio de Ciencia, Innovación y Universidade

Analysis of reliable deployment of TDOA local positioning architectures

.Local Positioning Systems (LPS) are supposing an attractive research topic over the last few years. LPS are ad-hoc deployments of wireless sensor networks for particularly adapt to the environment characteristics in harsh environments. Among LPS, those based on temporal measurements stand out for their trade-off among accuracy, robustness and costs. But, regardless the LPS architecture considered, an optimization of the sensor distribution is required for achieving competitive results. Recent studies have shown that under optimized node distributions, time-based LPS cumulate the bigger error bounds due to synchronization errors. Consequently, asynchronous architectures such as Asynchronous Time Difference of Arrival (A-TDOA) have been recently proposed. However, the A-TDOA architecture supposes the concentration of the time measurement in a single clock of a coordinator sensor making this architecture less versatile. In this paper, we present an optimization methodology for overcoming the drawbacks of the A-TDOA architecture in nominal and failure conditions with regards to the synchronous TDOA. Results show that this optimization strategy allows the reduction of the uncertainties in the target location by 79% and 89.5% and the enhancement of the convergence properties by 86% and 33% of the A-TDOA architecture with regards to the TDOA synchronous architecture in two different application scenarios. In addition, maximum convergence points are more easily found in the A-TDOA in both configurations concluding the benefits of this architecture in LPS high-demanded applicationS