Mecanismo de negociação para sistema de escalonamento dinâmico

Este artigo propõe um Mecanismo de Negociação para Escalonamento Dinâmico com recurso a Swarm Intelligence (SI). No Mecanismo de Negociação, os agentes devem competir para obter um plano de escalamento global. SI é o termo geral para várias técnicas computacionais que retiram ideias e inspiração nos comportamentos sociais de insectos e outros animais. Este artigo propõe uma abordagem híbrida de diferentes conceitos da Inteligência Artificial (IA), como SI, Negociação em Sistemas Multi-Agente (SMA) e Técnicas de Aprendizagem Automática (AA). Este trabalho concentra a sua atenção na negociação, processo através do qual múltiplos agentes auto-interessados podem chegar a acordo através da troca competitiva de recursos.

Capacidade antioxidante de bebidas comerciais

Mestrado em Engenharia Química

Capacidade antioxidante de cervejas comerciais

Mestrado em Engenharia Química

Processos de purificação/ valorização do glicerol proveniente da produção de biodiesel

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

DNA-based biosensor for the electrocatalytic determination of antioxidant capacity in beverages

Reactive oxygen species (ROS) are produced as a consequence of normal aerobic metabolism and are able to induce DNA oxidative damage. At the cellular level, the evaluation of the protective effect of antioxidants can be achieved by examining the integrity of the DNA nucleobases using electrochemical techniques. Herein, the use of an adenine-rich oligonucleotide (dA21) adsorbed on carbon paste electrodes for the assessment of the antioxidant capacity is proposed. The method was based on the partial damage of a DNA layer adsorbed on the electrode surface by OH• radicals generated by Fenton reaction and the subsequent electrochemical oxidation of the intact adenine bases to generate an oxidation product that was able to catalyze the oxidation of NADH. The presence of antioxidant compounds scavenged hydroxyl radicals leaving more adenines unoxidized, and thus, increasing the electrocatalytic current of NADHmeasured by differential pulse voltammetry (DPV). Using ascorbic acid (AA) as a model antioxidant species, the detection of as low as 50nMof AA in aqueous solution was possible. The protection efficiency was evaluated for several antioxidant compounds. The biosensor was applied to the determination of the total antioxidant capacity (TAC) in beverages.

Control and comparison of the antioxidant capacity of beers

The purpose of the present work is to determine the antioxidant capacity (AC) of 27 commercial beers. The AC indicates the degree of protection of a certain organism against oxidative damage provoked by reactive oxygen and nitrogen species. Assays were carried out by the following methods: (i) total radical trapping antioxidant parameter (TRAP); (ii) trolox equivalent antioxidant capacity (TEAC); (iii) trolox equivalent antioxidant capacity (DPPH); (iv) ferric-ion reducing antioxidant parameter (FRAP); (v) cupric reducing antioxidant capacity (CUPRAC); (vi) oxygen radical absorbance capacity (ORAC). Ascorbic acid (AA), gallic acid (GA) and trolox (TR) were used as standards. All beers showed antioxidant power, but a wide range of ACs was observed. The effect of several factors upon these differences was studied. Statistical differences were found between ACs of beers of different colours. ORAC method provided always higher experimental ACs, of significant statistical differences to other assays.

Entropy diversity in multi-objective particle swarm optimization

Multi-objective particle swarm optimization (MOPSO) is a search algorithm based on social behavior. Most of the existing multi-objective particle swarm optimization schemes are based on Pareto optimality and aim to obtain a representative non-dominated Pareto front for a given problem. Several approaches have been proposed to study the convergence and performance of the algorithm, particularly by accessing the final results. In the present paper, a different approach is proposed, by using Shannon entropy to analyzethe MOPSO dynamics along the algorithm execution. The results indicate that Shannon entropy can be used as an indicator of diversity and convergence for MOPSO problems.

Multi-criteria optimization manipulator trajectory planning

In the last twenty years genetic algorithms (GAs) were applied in a plethora of fields such as: control, system identification, robotics, planning and scheduling, image processing, and pattern and speech recognition (Bäck et al., 1997). In robotics the problems of trajectory planning, collision avoidance and manipulator structure design considering a single criteria has been solved using several techniques (Alander, 2003). Most engineering applications require the optimization of several criteria simultaneously. Often the problems are complex, include discrete and continuous variables and there is no prior knowledge about the search space. These kind of problems are very more complex, since they consider multiple design criteria simultaneously within the optimization procedure. This is known as a multi-criteria (or multiobjective) optimization, that has been addressed successfully through GAs (Deb, 2001). The overall aim of multi-criteria evolutionary algorithms is to achieve a set of non-dominated optimal solutions known as Pareto front. At the end of the optimization procedure, instead of a single optimal (or near optimal) solution, the decision maker can select a solution from the Pareto front. Some of the key issues in multi-criteria GAs are: i) the number of objectives, ii) to obtain a Pareto front as wide as possible and iii) to achieve a Pareto front uniformly spread. Indeed, multi-objective techniques using GAs have been increasing in relevance as a research area. In 1989, Goldberg suggested the use of a GA to solve multi-objective problems and since then other researchers have been developing new methods, such as the multi-objective genetic algorithm (MOGA) (Fonseca & Fleming, 1995), the non-dominated sorted genetic algorithm (NSGA) (Deb, 2001), and the niched Pareto genetic algorithm (NPGA) (Horn et al., 1994), among several other variants (Coello, 1998). In this work the trajectory planning problem considers: i) robots with 2 and 3 degrees of freedom (dof ), ii) the inclusion of obstacles in the workspace and iii) up to five criteria that are used to qualify the evolving trajectory, namely the: joint traveling distance, joint velocity, end effector / Cartesian distance, end effector / Cartesian velocity and energy involved. These criteria are used to minimize the joint and end effector traveled distance, trajectory ripple and energy required by the manipulator to reach at destination point. Bearing this ideas in mind, the paper addresses the planning of robot trajectories, meaning the development of an algorithm to find a continuous motion that takes the manipulator from a given starting configuration up to a desired end position without colliding with any obstacle in the workspace. The chapter is organized as follows. Section 2 describes the trajectory planning and several approaches proposed in the literature. Section 3 formulates the problem, namely the representation adopted to solve the trajectory planning and the objectives considered in the optimization. Section 4 studies the algorithm convergence. Section 5 studies a 2R manipulator (i.e., a robot with two rotational joints/links) when the optimization trajectory considers two and five objectives. Sections 6 and 7 show the results for the 3R redundant manipulator with five goals and for other complementary experiments are described, respectively. Finally, section 8 draws the main conclusions.

Particle swarm optimization: dynamical analysis through fractional calculus

This chapter considers the particle swarm optimization algorithm as a system, whose dynamics is studied from the point of view of fractional calculus. In this study some initial swarm particles are randomly changed, for the system stimulation, and its response is compared with a non-perturbed reference response. The perturbation effect in the PSO evolution is observed in the perspective of the fitness time behaviour of the best particle. The dynamics is represented through the median of a sample of experiments, while adopting the Fourier analysis for describing the phenomena. The influence upon the global dynamics is also analyzed. Two main issues are reported: the PSO dynamics when the system is subjected to random perturbations, and its modelling with fractional order transfer functions.

Single-objective spreading algorithm

This paper addresses the problem of finding several different solutions with the same optimum performance in single objective real-world engineering problems. In this paper a parallel robot design is proposed. Thereby, this paper presents a genetic algorithm to optimize uni-objective problems with an infinite number of optimal solutions. The algorithm uses the maximin concept and ε-dominance to promote diversity over the admissible space. The performance of the proposed algorithm is analyzed with three well-known test functions and a function obtained from practical real-world engineering optimization problems. A spreading analysis is performed showing that the solutions drawn by the algorithm are well dispersed.

Optimal location of the workpiece in a PKM-based machining robotic cell

Most machining tasks require high accuracy and are carried out by dedicated machine-tools. On the other hand, traditional robots are flexible and easy to program, but they are rather inaccurate for certain tasks. Parallel kinematic robots could combine the accuracy and flexibility that are usually needed in machining operations. Achieving this goal requires proper design of the parallel robot. In this chapter, a multi-objective particle swarm optimization algorithm is used to optimize the structure of a parallel robot according to specific criteria. Afterwards, for a chosen optimal structure, the best location of the workpiece with respect to the robot, in a machining robotic cell, is analyzed based on the power consumed by the manipulator during the machining process.

Particle swarm optimization with fractional-order velocity

This paper proposes a novel method for controlling the convergence rate of a particle swarm optimization algorithm using fractional calculus (FC) concepts. The optimization is tested for several well-known functions and the relationship between the fractional order velocity and the convergence of the algorithm is observed. The FC demonstrates a potential for interpreting evolution of the algorithm and to control its convergence.

Automated design of microwave discrete tuning differential capacitance circuits in Si-integrated technologies

A genetic algorithm used to design radio-frequency binary-weighted differential switched capacitor arrays (RFDSCAs) is presented in this article. The algorithm provides a set of circuits all having the same maximum performance. This article also describes the design, implementation, and measurements results of a 0.25 lm BiCMOS 3-bit RFDSCA. The experimental results show that the circuit presents the expected performance up to 40 GHz. The similarity between the evolutionary solutions, circuit simulations, and measured results indicates that the genetic synthesis method is a very useful tool for designing optimum performance RFDSCAs.

Automated synthesis procedure of RF discrete tuning differential capacitance circuits

The paper presents a RFDSCA automated synthesis procedure. This algorithm determines several RFDSCA circuits from the top-level system specifications all with the same maximum performance. The genetic synthesis tool optimizes a fitness function proportional to the RFDSCA quality factor and uses the epsiv-concept and maximin sorting scheme to achieve a set of solutions well distributed along a non-dominated front. To confirm the results of the algorithm, three RFDSCAs were simulated in SpectreRF and one of them was implemented and tested. The design used a 0.25 mum BiCMOS process. All the results (synthesized, simulated and measured) are very close, which indicate that the genetic synthesis method is a very useful tool to design optimum performance RFDSCAs.

Manipulator trajectory planning using a MOEA

Generating manipulator trajectories considering multiple objectives and obstacle avoidance is a non-trivial optimization problem. In this paper a multi-objective genetic algorithm based technique is proposed to address this problem. Multiple criteria are optimized considering up to five simultaneous objectives. Simulation results are presented for robots with two and three degrees of freedom, considering two and five objectives optimization. A subsequent analysis of the spread and solutions distribution along the converged non-dominated Pareto front is carried out, in terms of the achieved diversity.