Performance of fractional PID algorithms controlling nonlinear systems with saturation and backlash phenomena

The development of fractional-order controllers is currently one of the most promising fields of research. However, most of the work in this area addresses the case of linear systems. This paper reports on the analysis of fractional-order control of nonlinear systems. The performance of discrete fractional-order PID controllers in the presence of several nonlinearities is discussed. Some results are provided that indicate the superior robustness of such algorithms.

Optimal fuzzy PID control tuned with genetic algorithms

Fuzzy logic controllers (FLC) are intelligent systems, based on heuristic knowledge, that have been largely applied in numerous areas of everyday life. They can be used to describe a linear or nonlinear system and are suitable when a real system is not known or too difficult to find their model. FLC provide a formal methodology for representing, manipulating and implementing a human heuristic knowledge on how to control a system. These controllers can be seen as artificial decision makers that operate in a closed-loop system, in real time. The main aim of this work was to develop a single optimal fuzzy controller, easily adaptable to a wide range of systems – simple to complex, linear to nonlinear – and able to control all these systems. Due to their efficiency in searching and finding optimal solution for high complexity problems, GAs were used to perform the FLC tuning by finding the best parameters to obtain the best responses. The work was performed using the MATLAB/SIMULINK software. This is a very useful tool that provides an easy way to test and analyse the FLC, the PID and the GAs in the same environment. Therefore, it was proposed a Fuzzy PID controller (FL-PID) type namely, the Fuzzy PD+I. For that, the controller was compared with the classical PID controller tuned with, the heuristic Ziegler-Nichols tuning method, the optimal Zhuang-Atherton tuning method and the GA method itself. The IAE, ISE, ITAE and ITSE criteria, used as the GA fitness functions, were applied to compare the controllers performance used in this work. Overall, and for most systems, the FL-PID results tuned with GAs were very satisfactory. Moreover, in some cases the results were substantially better than for the other PID controllers. The best system responses were obtained with the IAE and ITAE criteria used to tune the FL-PID and PID controllers.

A pattern language for parallelizing irregular algorithms

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Informática

Multi-agent system for distributed manufacturing scheduling with genetic algorithms and tabu search

Computerized scheduling methods and computerized scheduling systems according to exemplary embodiments. A computerized scheduling method may be stored in a memory and executed on one or more processors. The method may include defining a main multi-machine scheduling problem as a plurality of single machine scheduling problems; independently solving the plurality of single machine scheduling problems thereby calculating a plurality of near optimal single machine scheduling problem solutions; integrating the plurality of near optimal single machine scheduling problem solutions into a main multi-machine scheduling problem solution; and outputting the main multi-machine scheduling problem solution.

Algorithms and methodologies for decision support in energy efficiency on buildings

Dissertação apresentada na faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia Electrotécnica e de Computadores

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising two different types of processors—such a platform is referred to as two-type platform. We present two low degree polynomial time-complexity algorithms, SA and SA-P, each providing the following guarantee. For a given two-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then (i) using SA, it is guaranteed to find such an assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which processors are 1+α times faster. The parameter 0<α≤1 is a property of the task set; it is the maximum of all the task utilizations that are no greater than 1. We evaluate average-case performance of both the algorithms by generating task sets randomly and measuring how much faster processors the algorithms need (which is upper bounded by 1+α/2 for SA and 1+α for SA-P) in order to output a feasible task assignment (intra-migrative for SA and non-migrative for SA-P). In our evaluations, for the vast majority of task sets, these algorithms require significantly smaller processor speedup than indicated by their theoretical bounds. Finally, we consider a special case where no task utilization in the given task set can exceed one and for this case, we (re-)prove the performance guarantees of SA and SA-P. We show, for both of the algorithms, that changing the adversary from intra-migrative to a more powerful one, namely fully-migrative, in which tasks can migrate between processors of any type, does not deteriorate the performance guarantees. For this special case, we compare the average-case performance of SA-P and a state-of-the-art algorithm by generating task sets randomly. In our evaluations, SA-P outperforms the state-of-the-art by requiring much smaller processor speedup and by running orders of magnitude faster.

Task Assignment Algorithms for Heterogeneous Multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising a constant number (denoted by t) of distinct types of processors—such a platform is referred to as a t-type platform. We present two algorithms, LPGIM and LPGNM, each providing the following guarantee. For a given t-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet their deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then: (i) LPGIM succeeds in finding such an assignment where the same restriction on task migration applies (intra-migrative) but given a platform in which only one processor of each type is 1 + α × t-1/t times faster and (ii) LPGNM succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which every processor is 1 + α times faster. The parameter α is a property of the task set; it is the maximum of all the task utilizations that are no greater than one. To the best of our knowledge, for t-type heterogeneous multiprocessors: (i) for the problem of intra-migrative task assignment, no previous algorithm exists with a proven bound and hence our algorithm, LPGIM, is the first of its kind and (ii) for the problem of non-migrative task assignment, our algorithm, LPGNM, has superior performance compared to state-of-the-art.

Studies on the genetics of artemisinin resistance in malaria

A existência de estirpes de Plasmodium falciparum resistentes a multiplos fármacos é um dos problemas mais graves no controlo da malária. Novos fármacos, como a artemisinina (ART) e seus derivados são cada vez mais utilizados no tratamento da malaria e muito embora até ao momento não haja registos de fármaco-resistência estável à ART o seu surgimento seria desastroso devido á falta de alternativas. A investigação apresentada nesta tese descreve a selecção de resistência estável à ART e ao artesunato (ATN) utilizando um modelo roedor de malária, o parasita Plasmodium chabaudi chabaudi (Plasmodium chabaudi). Dois clones de Plasmodium chabaudi diferentes, AS-15CQ e AS-30CQ, foram inoculados em murganhos que por sua vez foram tratados na presença de concentrações sucessivamente crescentes de ATN e ART, sendo que no final do processo de seleção de resistência, os parasitas obtidos apresentavam uma resistência de 6 e 15 vezes superior ao ATN e à ART, respectivamente, em relação aos parasitas iniciais. Os clones obtidos foram nomeados respectivamente AS-ATN (obtido a partir de AS-15CQ por seleção com pressão de ATN) e AS-ART (obtido a partir de AS-30CQ por seleção com pressão de ART). A resistência obtida durante o processo de seleção é estável após clonagem, congelamento/descongelamento, passagem sanguínea na ausência de pressão de fármaco e transmissão natural através do mosquito vector. A sequência nucleotídica e o número de cópias dos genes previamente descritos na literatura como moduladores putativos de resistência à ART e seus derivados: mdr1, cg10, tctp e atp6; foi comparada entre parasitas resistentes e sensíveis, não tendo sido encontradas nenhumas alterações, quer na sequência quer no número de cópias destes genes. Posteriormente, numa tentativa de identificar os genes envolvidos na resistância à ART e ao ATN a técnica de Linkage Group Selection (LGS) foi utilizada. Para tal dois cruzamentos genéticos foram realizados. Estes cruzamentos foram realizados entre os clones fármaco-resistentes; AS-ART e AS-ATN e um clone geneticamente distinto dos anteriores e sensível aos fármacos em estudos, AJ. Após realização do LGS quatro loci genéticos; nos cromossomas de P. chabaudi 1, 2, 6 e 8 foram encontrados associados à resistência. Atendendo a que, a selecção no cromossoma 2 era a mais forte, este locus foi submetido a subsequentes análises genéticas, tendo sido encontradas duas mutações diferentes (V739F e V770F) num gene que codifica para um enzima de desubiquitinação (gene ubp-1).

Time-domain optimization of amplifiers based on distributed genetic algorithms

Thesis presented in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the subject of Electrical and Computer Engineering

Studies on the genetics of artemisinin resistance in malaria

A existência de estirpes de Plasmodium falciparum resistentes a multiplos fármacos é um dos problemas mais graves no controlo da malária. Novos fármacos, como a artemisinina (ART) e seus derivados são cada vez mais utilizados no tratamento da malaria e muito embora até ao momento não haja registos de fármaco-resistência estável à ART o seu surgimento seria desastroso devido á falta de alternativas. A investigação apresentada nesta tese descreve a selecção de resistência estável à ART e ao artesunato (ATN) utilizando um modelo roedor de malária, o parasita Plasmodium chabaudi chabaudi (Plasmodium chabaudi). Dois clones de Plasmodium chabaudi diferentes, AS-15CQ e AS-30CQ, foram inoculados em murganhos que por sua vez foram tratados na presença de concentrações sucessivamente crescentes de ATN e ART, sendo que no final do processo de seleção de resistência, os parasitas obtidos apresentavam uma resistência de 6 e 15 vezes superior ao ATN e à ART, respectivamente, em relação aos parasitas iniciais. Os clones obtidos foram nomeados respectivamente AS-ATN (obtido a partir de AS-15CQ por seleção com pressão de ATN) e AS-ART (obtido a partir de AS-30CQ por seleção com pressão de ART). A resistência obtida durante o processo de seleção é estável após clonagem, congelamento/descongelamento, passagem sanguínea na ausência de pressão de fármaco e transmissão natural através do mosquito vector. A sequência nucleotídica e o número de cópias dos genes previamente descritos na literatura como moduladores putativos de resistência à ART e seus derivados: mdr1, cg10, tctp e atp6; foi comparada entre parasitas resistentes e sensíveis, não tendo sido encontradas nenhumas alterações, quer na sequência quer no número de cópias destes genes. Posteriormente, numa tentativa de identificar os genes envolvidos na resistância à ART e ao ATN a técnica de Linkage Group Selection (LGS) foi utilizada. Para tal dois cruzamentos genéticos foram realizados. Estes cruzamentos foram realizados entre os clones fármaco-resistentes; AS-ART e AS-ATN e um clone geneticamente distinto dos anteriores e sensível aos fármacos em estudos, AJ. Após realização do LGS quatro loci genéticos; nos cromossomas de P. chabaudi 1, 2, 6 e 8 foram encontrados associados à resistência. Atendendo a que, a selecção no cromossoma 2 era a mais forte, este locus foi submetido a subsequentes análises genéticas, tendo sido encontradas duas mutações diferentes (V739F e V770F) num gene que codifica para um enzima de desubiquitinação (gene ubp-1).

Algorithms for time series clustering applied to biomedical signals

Thesis submitted in the fulfillment of the requirements for the Degree of Master in Biomedical Engineering

Genetics of berry colour and anthocyanin content variation in grapevine (Vitis vinifera L.subsp. vinifera)

Dissertation presented in fulfillment of the requirements for the Degree of Doctor of Philosophy in Biology (Molecular Genetics) at the Instituto de Tecnologia Química e Biológica da Universidade Nova de Lisboa

New Concepts Towards the Synthesis of Digital Circuits Through Genetic Algorithms

This paper analyses the performance of a Genetic Algorithm using two new concepts, namely a static fitness function including a discontinuity measure and a fractional-order dynamic fitness function, for the synthesis of combinational logic circuits. In both cases, experiments reveal superior results in terms of speed and convergence to achieve a solution.

System Modeling and Control Through Fractional-Order Algorithms

The theory of fractional calculus goes back to the beginning of thr throry of differential calculus but its inherent complexity postponed the applications of the associated concepts. In the last decade the progress in the areas of chaos and fractals revealed subtle relationships with the fractional calculus leading to an increasing interest in the development of the new paradigm. In the area of automaticcontrol preliminary work has already been carried out but the proposed algorithms are restricted to the frequency domain. The paper discusses the design of fractional-order discrete-time controllers. The algorithms studied adopt the time domein, which makes them suited for z-transform analusis and discrete-time implementation. The performance of discrete-time fractional-order controllers with linear and non-linear systems is also investigated.