Competitive dynamics for behavior coordination in a joint transportation task

We address the problem of coordinating two non-holonomic mobile robots that move in formation while transporting a long payload. A competitive dynamics is introduced that gradually controls the activation and deactivation of individual behaviors. This process introduces (asymmetrical) hysteresis during behavioral switching. As a result behavioral oscillations, due to noisy information, are eliminated. Results in indoor environments show that if parameter values are chosen within reasonable ranges then, in spite of noise in the robots communi- cation and sensors, the overall robotic system works quite well even in cluttered environments. The robots overt behavior is stable and smooth.

On the development of a test-bed application for the ART-WiSe architecture

The ART-WiSe (Architecture for Real-Time communications in Wireless Sensor Networks) framework aims at the design of new communication architectures and mechanisms for time-sensitive Wireless Sensor Networks (WSNs). We adopted a two-tiered architecture where an overlay Wireless Local Area Network (Tier 2) serves as a backbone for a WSN (Tier 1), relying on existing standard communication protocols and commercial-off-the-shell (COTS) technologies – IEEE 802.15.4/ZigBee for Tier 1 and IEEE 802.11 for Tier 2. In this line, a test-bed application is being developed for assessing, validating and demonstrating the ART-WiSe architecture. A pursuit-evasion application was chosen since it fulfils a number of requirements, namely it is feasible and appealing and imposes some stress to the architecture in terms of timeliness. To develop the testbed based on the previously referred technologies, an implementation of the IEEE 8021.5.4/ZigBee protocols is being carried out, since there is no open source available to the community. This paper highlights some relevant aspects of the ART-WiSe architecture, provides some intuition on the protocol stack implementation and presents a general view over the envisaged test-bed application.

On a test-bed application for the ART-WiSe framework

This report describes the development of a Test-bed Application for the ART-WiSe Framework with the aim of providing a means of access, validate and demonstrate that architecture. The chosen application is a kind of pursuit-evasion game where a remote controlled robot, navigating through an area covered by wireless sensor network (WSN), is detected and continuously tracked by the WSN. Then a centralized control station takes the appropriate actions for a pursuit robot to chase and “capture” the intruder one. This kind of application imposes stringent timing requirements to the underlying communication infrastructure. It also involves interesting research problems in WSNs like tracking, localization, cooperation between nodes, energy concerns and mobility. Additionally, it can be easily ported into a real-world application. Surveillance or search and rescue operations are two examples where this kind of functionality can be applied. This is still a first approach on the test-bed application and this development effort will be continuously pushed forward until all the envisaged objectives for the Art-WiSe architecture become accomplished.

Penalty fuzzy function for derivative-free optimization

Penalty and Barrier methods are normally used to solve Nonlinear Optimization Problems constrained problems. The problems appear in areas such as engineering and are often characterised by the fact that involved functions (objective and constraints) are non-smooth and/or their derivatives are not know. This means that optimization methods based on derivatives cannot net used. A Java based API was implemented, including only derivative-free optimizationmethods, to solve both constrained and unconstrained problems, which includes Penalty and Barriers methods. In this work a new penalty function, based on Fuzzy Logic, is presented. This function imposes a progressive penalization to solutions that violate the constraints. This means that the function imposes a low penalization when the violation of the constraints is low and a heavy penalisation when the violation is high. The value of the penalization is not known in beforehand, it is the outcome of a fuzzy inference engine. Numerical results comparing the proposed function with two of the classic penalty/barrier functions are presented. Regarding the presented results one can conclude that the prosed penalty function besides being very robust also exhibits a very good performance.

A web-based tool to evaluate the iterative processes of direct search methods

Constrained and unconstrained Nonlinear Optimization Problems often appear in many engineering areas. In some of these cases it is not possible to use derivative based optimization methods because the objective function is not known or it is too complex or the objective function is non-smooth. In these cases derivative based methods cannot be used and Direct Search Methods might be the most suitable optimization methods. An Application Programming Interface (API) including some of these methods was implemented using Java Technology. This API can be accessed either by applications running in the same computer where it is installed or, it can be remotely accessed through a LAN or the Internet, using webservices. From the engineering point of view, the information needed from the API is the solution for the provided problem. On the other hand, from the optimization methods researchers’ point of view, not only the solution for the problem is needed. Also additional information about the iterative process is useful, such as: the number of iterations; the value of the solution at each iteration; the stopping criteria, etc. In this paper are presented the features added to the API to allow users to access to the iterative process data.

A Java expression evaluator for nonlinear programming

Finding the optimal value for a problem is usual in many areas of knowledge where in many cases it is needed to solve Nonlinear Optimization Problems. For some of those problems it is not possible to determine the expression for its objective function and/or its constraints, they are the result of experimental procedures, might be non-smooth, among other reasons. To solve such problems it was implemented an API contained methods to solve both constrained and unconstrained problems. This API was developed to be used either locally on the computer where the application is being executed or remotely on a server. To obtain the maximum flexibility both from the programmers’ and users’ points of view, problems can be defined as a Java class (because this API was developed in Java) or as a simple text input that is sent to the API. For this last one to be possible it was also implemented on the API an expression evaluator. One of the drawbacks of this expression evaluator is that it is slower than the Java native code. In this paper it is presented a solution that combines both options: the problem can be expressed at run-time as a string of chars that are converted to Java code, compiled and loaded dynamically. To wide the target audience of the API, this new expression evaluator is also compatible with the AMPL format.

Direct-search penalty/barrier methods

In Nonlinear Optimization Penalty and Barrier Methods are normally used to solve Constrained Problems. There are several Penalty/Barrier Methods and they are used in several areas from Engineering to Economy, through Biology, Chemistry, Physics among others. In these areas it often appears Optimization Problems in which the involved functions (objective and constraints) are non-smooth and/or their derivatives are not know. In this work some Penalty/Barrier functions are tested and compared, using in the internal process, Derivative-free, namely Direct Search, methods. This work is a part of a bigger project involving the development of an Application Programming Interface, that implements several Optimization Methods, to be used in applications that need to solve constrained and/or unconstrained Nonlinear Optimization Problems. Besides the use of it in applied mathematics research it is also to be used in engineering software packages.

Calculation of fractional derivatives of noisy data with genetic algorithms

This paper addresses the calculation of derivatives of fractional order for non-smooth data. The noise is avoided by adopting an optimization formulation using genetic algorithms (GA). Given the flexibility of the evolutionary schemes, a hierarchical GA composed by a series of two GAs, each one with a distinct fitness function, is established.

Eficiência energética, aplicação em edifícios de serviços: o caso do hospital do ICUF

Mestrado em Engenharia Electrotécnica – Sistemas Eléctricos de Energia

Rhapsody in fractional

This paper studies several topics related with the concept of “fractional” that are not directly related with Fractional Calculus, but can help the reader in pursuit new research directions. We introduce the concept of non-integer positional number systems, fractional sums, fractional powers of a square matrix, tolerant computing and FracSets, negative probabilities, fractional delay discrete-time linear systems, and fractional Fourier transform.

O alisamento dos resultados numa empresa: o caso do Grupo SONANGOL

Dissertação de Mestrado apresentada ao Instituto de Contabilidade e Administração do Porto para a obtenção do grau de Mestre em Contabilidade e Finanças sob orientação de Professor Doutor Adalmiro Alvaro Malheiro de Castro Andrade Pereira

Deteção e identificação de anomalias em redes de distribuição de energia elétrica

Na ocorrência de anomalias nas redes de distribuição de energia elétrica, muitas vezes devido ao reduzido número de informação disponível, a determinação da localização dos defeitos é uma tarefa árdua e morosa. Consequentemente, impõe-se o recurso por parte das companhias elétricas a sistemas que, contribuindo para a diminuição do tempo despendido na localização dos defeitos, assegurem a redução da duração e frequência das falhas de alimentação. Esta dissertação pretende estudar os diversos sistemas de deteção de defeitos existentes, com destaque para a utilização de Indicadores de Passagem de Defeito e analisar o contributo destes sistemas para a melhoria dos Índices de Qualidade de Serviço. Abordar as dificuldades que se colocam à implementação destes sistemas, nomeadamente, pelas características específicas das redes de distribuição. Pretende, ainda, desenvolver uma metodologia e a respetiva ferramenta, que permita a deteção de defeitos baseada na utilização de Indicadores de Passagem de Defeito comunicantes, numa saída da rede de distribuição de média tensão pertencente à EDP. Analisar técnica e economicamente os benefícios a obter com a implementação da metodologia desenvolvida. Esta dissertação pretende, não só atingir os objetivos acima referidos, mas também, através deles, elaborar uma ferramenta útil para as Companhias Elétricas, no sentido de adotarem sistemas de deteção de defeitos e com fim principal de uma possível redução dos tempos de indisponibilidade de alimentação, intimamente associados à persecução de melhores índices de Qualidade de Serviço por parte das mesmas.

Alternativas Processuais e Valorização de Correntes da Refinaria de Matosinhos.

Evolução, ato ou efeito de evoluir, sequência de transformações, desenvolvimento progressivo. Se tudo à nossa volta se transforma, a indústria tem de acompanhar esse sistema evolutivo, tornando assim imprescindível alterar ou melhorar processos de produção quando estes não se enquadram com a realidade, ou porque o mercado se altera, ou porque as necessidades mudam, ou por simplesmente ser mais rentável. Sendo a Galp Energia uma empresa que se encontra sempre na vanguarda da evolução tecnológica, encontra no Departamento de Engenharia Química do Instituto Superior de Engenharia do Porto um aliado na procura do melhor modo de valorizar os seus produtos. A Refinaria de Matosinhos tem atualmente duas correntes de gasolina leve e uma de refinado que apresentam grande potencialidade de valorização. Parte destas correntes incorporam atualmente a pool de nafta química da refinaria que é vendida à Repsol Polímeros. O desafio que é proposto baseia-se em valorizar essas correntes através da sua isomerização aumentando o seu RON podendo então ter como fim a pool de gasolinas. Tirando partido da tecnologia disponível para este efeito são apresentados quatro cenários de possíveis soluções. Sendo os dois primeiros excluídos por violarem restrições impostas, o terceiro e quarto cenários foram analisados de um ponto de vista económico. O terceiro cenário conduz a gasolina leve da Fábrica de Aromáticos para a pool de gasolinas sem qualquer tratamento e a gasolina leve da Fábrica de Combustíveis continua a integrar a pool de nafta química. O refinado da Fábrica de Aromáticos será enviado para um splitter, sendo a corrente de topo destinada à pool de nafta química e a corrente de fundo enviada a um reator de isomerização, Isomalk-4SM, passando previamente por uma torre de argila de forma a assegurar que a restrição em teor de olefinas no reator não é violada. O efluente, com RON maior, integrará igualmente a pool de gasolinas. No quarto cenário a corrente de refinado da Fábrica de Aromáticos não sofre qualquer tratamento, continuando a alimentar a unidade de solventes, a gasolina leve da Fábrica de Aromáticos irá diretamente para a pool de gasolinas e a gasolina leve da Fábrica de Combustíveis passará pelo Isomalk-2SM para aumentar o índice de octanos garantido assim ter condições de integrar a pool de gasolinas. Dissertação de Mestrado em Engenharia Química Isomerização de Gasolina Leve O terceiro cenário apresenta um aumento de 4 576 773 € anuais nas receitas e o quarto alcança 11 333 982 € anuais. O investimento inicial total do terceiro cenário é de 28 821 608 € quando o quarto cenário carece de um investimento inicial de apenas 18 028 349 €. Quanto aos custos associados à implementação da unidade estes demonstram-se elevados, o terceiro cenário apresenta um custo de 23 133 429 € enquanto o do quarto cenário é de 13 998 797 €. O quarto cenário apresenta-se assim como a solução mais rentável para o objetivo desta dissertação.

Arc exchange systems and renormalization

We exhibit the construction of stable arc exchange systems from the stable laminations of hyperbolic diffeomorphisms. We prove a one-to-one correspondence between (i) Lipshitz conjugacy classes of C(1+H) stable arc exchange systems that are C(1+H) fixed points of renormalization and (ii) Lipshitz conjugacy classes of C(1+H) diffeomorphisms f with hyperbolic basic sets Lambda that admit an invariant measure absolutely continuous with respect to the Hausdorff measure on Lambda. Let HD(s)(Lambda) and HD(u)(Lambda) be, respectively, the Hausdorff dimension of the stable and unstable leaves intersected with the hyperbolic basic set L. If HD(u)(Lambda) = 1, then the Lipschitz conjugacy is, in fact, a C(1+H) conjugacy in (i) and (ii). We prove that if the stable arc exchange system is a C(1+HDs+alpha) fixed point of renormalization with bounded geometry, then the stable arc exchange system is smooth conjugate to an affine stable arc exchange system.

Explosion of smoothness from a point to everywhere for conjugacies between diffeomorphisms on surfaces

For diffeomorphisms on surfaces with basic sets, we show the following type of rigidity result: if a topological conjugacy between them is differentiable at a point in the basic set then the conjugacy has a smooth extension to the surface. These results generalize the similar ones of D. Sullivan, E. de Faria and ours for one-dimensional expanding dynamics.