Sistema de modelização tridimensional de galerias subterrâneas

A presente dissertação apresenta uma solução para o problema de modelização tridimensional de galerias subterrâneas. O trabalho desenvolvido emprega técnicas provenientes da área da robótica móvel para obtenção um sistema autónomo móvel de modelização, capaz de operar em ambientes não estruturados sem acesso a sistemas de posicionamento global, designadamente GPS. Um sistema de modelização móvel e autónomo pode ser bastante vantajoso, pois constitui um método rápido e simples de monitorização das estruturas e criação de representações virtuais das galerias com um elevado nível de detalhe. O sistema de modelização desloca-se no interior dos túneis para recolher informações sensoriais sobre a geometria da estrutura. A tarefa de organização destes dados com vista _a construção de um modelo coerente, exige um conhecimento exacto do percurso praticado pelo sistema, logo o problema de localização da plataforma sensorial tem que ser resolvido. A formulação de um sistema de localização autónoma tem que superar obstáculos que se manifestam vincadamente nos ambientes underground, tais como a monotonia estrutural e a já referida ausência de sistemas de posicionamento global. Neste contexto, foi abordado o conceito de SLAM (Simultaneous Loacalization and Mapping) para determinação da localização da plataforma sensorial em seis graus de liberdade. Seguindo a abordagem tradicional, o núcleo do algoritmo de SLAM consiste no filtro de Kalman estendido (EKF { Extended Kalman Filter ). O sistema proposto incorpora métodos avançados do estado da arte, designadamente a parametrização em profundidade inversa (Inverse Depth Parametrization) e o método de rejeição de outliers 1-Point RANSAC. A contribuição mais importante do método por nós proposto para o avanço do estado da arte foi a fusão da informação visual com a informação inercial. O algoritmo de localização foi testado com base em dados reais, adquiridos no interior de um túnel rodoviário. Os resultados obtidos permitem concluir que, ao fundir medidas inerciais com informações visuais, conseguimos evitar o fenómeno de degeneração do factor de escala, comum nas aplicações de localização através de sistemas puramente monoculares. Provámos simultaneamente que a correcção de um sistema de localização inercial através da consideração de informações visuais é eficaz, pois permite suprimir os desvios de trajectória que caracterizam os sistemas de dead reckoning. O algoritmo de modelização, com base na localização estimada, organiza no espaço tridimensional os dados geométricos adquiridos, resultando deste processo um modelo em nuvem de pontos, que posteriormente _e convertido numa malha triangular, atingindo-se assim uma representação mais realista do cenário original.

Auditoria à qualidade do ar interior de um edifício de serviços - RSECE QAI

O objectivo principal deste trabalho é a realização de uma auditoria, à qualidade do ar interior (QAI), a um edifício de serviços – COCIGA, SA, tendo como base o Regulamento dos Sistemas Energéticos de Climatização dos Edifícios (RSECE). A auditoria QAI implica a medição de vários parâmetros físicos, químicos, microbiológicos e também a inspecção aos componentes do sistema de climatização com a finalidade de averiguar o seu estado de limpeza e manutenção. Assim, foram seleccionados 3 espaços, para a realização de amostragens designados por Comercial - Produtos, AVAC e Mezaninne das oficinas, nos quais foi efectuada a medição de diversos parâmetros, de acordo com as imposições do RSECE, utilizando medidores portáteis ou recorrendo a métodos analíticos. Relativamente aos parâmetros físicos, registaram-se valores de temperatura, para os três espaços estudados, entre os 21 e os 24 ºC e valores médios de humidade relativa de cerca de 50 %. Outro parâmetro medido, e de grande importância para garantir o conforto dos ocupantes, foi a velocidade do ar nos postos de trabalho. De acordo com o RSECE este valor não deve ser superior a 0,2 m/s, o que se verificou em todos os pontos medidos. O último parâmetro físico medido foi a concentração de partículas (PM10) tendo-se obtido valores de cerca de 23 μg/m3ar, valor bastante inferior ao máximo permitido pelo RSECE (150 μg/m3ar). Também no que diz respeito aos parâmetros químicos, ou seja, CO2, CO, formaldeído e ozono, não se verificaram valores superiores aos regulamentares. No caso do CO2, o valor máximo encontrado, nestes três espaços, foi de 745 ppm na Mezaninne das Oficinas e para o CO, na zona AVAC com uma concentração de 0,73 ppm. A medição do formaldeído registou valores perto dos 45 μg/m3ar e o ozono apenas foi detectado, em concentração muito reduzida, na zona Comercial – Produtos. Por fim, as concentrações de bactérias e fungos, de acordo com o RSECE, não devem ultrapassar as 500 UFC/m3ar (parâmetros microbiológicos). Em qualquer dos espaços, os valores medidos foram inferiores ao máximo legal, não ultrapassando as 50 UFC/m3ar. Da avaliação do projecto AVAC, e através da medição dos caudais de insuflação/ extracção em cada zona, concluiu-se que os seus valores não estão de acordo com os valores do projecto inicial que poderá ser imputada a uma insuficiência no funcionamento do sistema detectada na altura das medições. No que diz respeito ao estado de limpeza do sistema AVAC, apenas foi possível inspeccionar as unidades de tratamento de ar, tendo-se constatado que se encontram em boas condições. Ou seja, do ponto de vista do RSECE, e referindo-nos apenas à vertente da Qualidade do Ar Interior, o edifício em causa, cumpre todos os limites impostos para as concentrações de poluentes mas, apresenta algumas deficiências no que respeita aos caudais de ar novo insuflados em cada espaço.

A filter algorithm: comparison with NLP solvers

The purpose of this work is to present an algorithm to solve nonlinear constrained optimization problems, using the filter method with the inexact restoration (IR) approach. In the IR approach two independent phases are performed in each iteration—the feasibility and the optimality phases. The first one directs the iterative process into the feasible region, i.e. finds one point with less constraints violation. The optimality phase starts from this point and its goal is to optimize the objective function into the satisfied constraints space. To evaluate the solution approximations in each iteration a scheme based on the filter method is used in both phases of the algorithm. This method replaces the merit functions that are based on penalty schemes, avoiding the related difficulties such as the penalty parameter estimation and the non-differentiability of some of them. The filter method is implemented in the context of the line search globalization technique. A set of more than two hundred AMPL test problems is solved. The algorithm developed is compared with LOQO and NPSOL software packages.

Lanczos algorithm on the grassmann manifold

5th. European Congress on Computational Methods in Applied Sciences and Engineering (ECCOMAS 2008) 8th. World Congress on Computational Mechanics (WCCM8)

Adaptable control for electrical generation at irregural wind speeds

The main aims of this work are the development and the validation of one generic algorithm to provide the optimal control of small power wind generators. That means up to 40 kW and blades with fixed pitch angle. This algorithm allows the development of controllers to fetch the wind generators at the desired operational point in variable operating conditions. The problems posed by the variable wind intensity are solved using the proposed algorithm. This is done with no explicit measure of the wind velocity, and so no special equipment or anemometer is required to compute or measure the wind velocity.

Genetic algorithm methodology applied to intelligent house control

In recent years the use of several new resources in power systems, such as distributed generation, demand response and more recently electric vehicles, has significantly increased. Power systems aim at lowering operational costs, requiring an adequate energy resources management. In this context, load consumption management plays an important role, being necessary to use optimization strategies to adjust the consumption to the supply profile. These optimization strategies can be integrated in demand response programs. The control of the energy consumption of an intelligent house has the objective of optimizing the load consumption. This paper presents a genetic algorithm approach to manage the consumption of a residential house making use of a SCADA system developed by the authors. Consumption management is done reducing or curtailing loads to keep the power consumption in, or below, a specified energy consumption limit. This limit is determined according to the consumer strategy and taking into account the renewable based micro generation, energy price, supplier solicitations, and consumers’ preferences. The proposed approach is compared with a mixed integer non-linear approach.

Ant colony search algorithm for the optimal power flow problem

To maintain a power system within operation limits, a level ahead planning it is necessary to apply competitive techniques to solve the optimal power flow (OPF). OPF is a non-linear and a large combinatorial problem. The Ant Colony Search (ACS) optimization algorithm is inspired by the organized natural movement of real ants and has been successfully applied to different large combinatorial optimization problems. This paper presents an implementation of Ant Colony optimization to solve the OPF in an economic dispatch context. The proposed methodology has been developed to be used for maintenance and repairing planning with 48 to 24 hours antecipation. The main advantage of this method is its low execution time that allows the use of OPF when a large set of scenarios has to be analyzed. The paper includes a case study using the IEEE 30 bus network. The results are compared with other well-known methodologies presented in the literature.

Optimal dispatch with reactive power compensation by Genetic Algorithm

This paper presents a Unit Commitment model with reactive power compensation that has been solved by Genetic Algorithm (GA) optimization techniques. The GA has been developed a computational tools programmed/coded in MATLAB. The main objective is to find the best generations scheduling whose active power losses are minimal and the reactive power to be compensated, subjected to the power system technical constraints. Those are: full AC power flow equations, active and reactive power generation constraints. All constraints that have been represented in the objective function are weighted with a penalty factors. The IEEE 14-bus system has been used as test case to demonstrate the effectiveness of the proposed algorithm. Results and conclusions are dully drawn.

Ancillary services dispatch using linear programming and genetic algorithm approaches

Electricity market players operating in a liberalized environment requires access to an adequate decision support tool, allowing them to consider all the business opportunities and take strategic decisions. Ancillary services represent a good negotiation opportunity that must be considered by market players. For this, decision support tools must include ancillary market simulation. This paper proposes two different methods (Linear Programming and Genetic Algorithm approaches) for ancillary services dispatch. The methodologies are implemented in MASCEM, a multi-agent based electricity market simulator. A test case concerning the dispatch of Regulation Down, Regulation Up, Spinning Reserve and Non-Spinning Reserve services is included in this paper.

A probabilistic methodology for distributed generation location in isolated electrical service area

Distributed generation unlike centralized electrical generation aims to generate electrical energy on small scale as near as possible to load centers, interchanging electric power with the network. This work presents a probabilistic methodology conceived to assist the electric system planning engineers in the selection of the distributed generation location, taking into account the hourly load changes or the daily load cycle. The hourly load centers, for each of the different hourly load scenarios, are calculated deterministically. These location points, properly weighted according to their load magnitude, are used to calculate the best fit probability distribution. This distribution is used to determine the maximum likelihood perimeter of the area where each source distributed generation point should preferably be located by the planning engineers. This takes into account, for example, the availability and the cost of the land lots, which are factors of special relevance in urban areas, as well as several obstacles important for the final selection of the candidates of the distributed generation points. The proposed methodology has been applied to a real case, assuming three different bivariate probability distributions: the Gaussian distribution, a bivariate version of Freund’s exponential distribution and the Weibull probability distribution. The methodology algorithm has been programmed in MATLAB. Results are presented and discussed for the application of the methodology to a realistic case and demonstrate the ability of the proposed methodology for efficiently handling the determination of the best location of the distributed generation and their corresponding distribution networks.

A study on the encryption algorithm for RFID tag (SEED : 8 Rounds × 64 bits block)

Although it is always weak between RFID Tag and Terminal in focus of the security, there are no security skills in RFID Tag. Recently there are a lot of studying in order to protect it, but because it has some physical limitation of RFID, that is it should be low electric power and high speed, it is impossible to protect with the skills. At present, the methods of RFID security are using a security server, a security policy and security. One of them the most famous skill is the security module, then they has an authentication skill and an encryption skill. In this paper, we designed and implemented after modification original SEED into 8 Round and 64 bits for Tag.

Inexact restoration approaches to solve mathematical program with complementarity constraints

Mathematical Program with Complementarity Constraints (MPCC) finds applica- tion in many fields. As the complementarity constraints fail the standard Linear In- dependence Constraint Qualification (LICQ) or the Mangasarian-Fromovitz constraint qualification (MFCQ), at any feasible point, the nonlinear programming theory may not be directly applied to MPCC. However, the MPCC can be reformulated as NLP problem and solved by nonlinear programming techniques. One of them, the Inexact Restoration (IR) approach, performs two independent phases in each iteration - the feasibility and the optimality phases. This work presents two versions of an IR algorithm to solve MPCC. In the feasibility phase two strategies were implemented, depending on the constraints features. One gives more importance to the complementarity constraints, while the other considers the priority of equality and inequality constraints neglecting the complementarity ones. The optimality phase uses the same approach for both algorithm versions. The algorithms were implemented in MATLAB and the test problems are from MACMPEC collection.

Navegação de um robô autónomo semi-industrial usando diferentes técnicas sensoriais

Mestrado em Engenharia Electrotécnica e de Computadores

Avaliação da qualidade do ar interior e estudos CFD em espaços do ISEP

Mestrado em Engenharia Química. Ramo Tecnologias de Protecção Ambiental.

Análise e optimização dos consumos de utilidades (vapor e energia eléctrica) na Petibol – Embalagens de Plásticos, S.A.

Mestrado em Engenharia Química. Ramo optimização energética na indústria química.