Experimental investigation on adaptive robust controller designs applied to a free-floating space manipulator

This paper aims to formulate and investigate the application of various nonlinear H(infinity) control methods to a fiee-floating space manipulator subject to parametric uncertainties and external disturbances. From a tutorial perspective, a model-based approach and adaptive procedures based on linear parametrization, neural networks and fuzzy systems are covered by this work. A comparative study is conducted based on experimental implementations performed with an actual underactuated fixed-base planar manipulator which is, following the DEM concept, dynamically equivalent to a free-floating space manipulator. (C) 2011 Elsevier Ltd. All rights reserved.

Adaptive Approach for a Maximum Entropy Algorithm in Ecological Niche Modeling

This paper presents an Adaptive Maximum Entropy (AME) approach for modeling biological species. The Maximum Entropy algorithm (MaxEnt) is one of the most used methods in modeling biological species geographical distribution. The approach presented here is an alternative to the classical algorithm. Instead of using the same set features in the training, the AME approach tries to insert or to remove a single feature at each iteration. The aim is to reach the convergence faster without affect the performance of the generated models. The preliminary experiments were well performed. They showed an increasing on performance both in accuracy and in execution time. Comparisons with other algorithms are beyond the scope of this paper. Some important researches are proposed as future works.

A Procedure for Semantic Querying in the Adaptive Formalism

This paper contains a new proposal for the definition of the fundamental operation of query under the Adaptive Formalism, one capable of locating functional nuclei from descriptions of their semantics. To demonstrate the method`s applicability, an implementation of the query procedure constrained to a specific class of devices is shown, and its asymptotic computational complexity is discussed.

Evaluation of Adaptive Genetic Algorithm to Environmental Modeling of Peponapis and Cucurbita

This paper presents a free software tool that supports the next-generation Mobile Communications, through the automatic generation of models of components and electronic devices based on neural networks. This tool enables the creation, training, validation and simulation of the model directly from measurements made on devices of interest, using an interface totally oriented to non-experts in neural models. The resulting model can be exported automatically to a traditional circuit simulator to test different scenarios.

Assessing the evolution of sustainability reporting in the mining sector

Since the 1990s several large companies have been publishing nonfinancial performance reports. Focusing initially on the physical environment, these reports evolved to consider social relations, as well as data on the firm`s economic performance. A few mining companies pioneered this trend, and in the last years some of them incorporated the three dimensions of sustainable development, publishing so-called sustainability reports. This article reviews 31 reports published between 2001 and 2006 by four major mining companies. A set of 62 assessment items organized in six categories (namely context and commitment, management, environmental, social and economic performance, and accessibility and assurance) were selected to guide the review. The items were derived from international literature and recommended best practices, including the Global Reporting Initiative G3 framework. A content analysis was performed using the report as a sampling unit, and using phrases, graphics, or tables containing certain information as data collection units. A basic rating scale (0 or 1) was used for noting the presence or absence of information and a final percentage score was obtained for each report. Results show that there is a clear evolution in report`s comprehensiveness and depth. Categories ""accessibility and assurance"" and ""economic performance"" featured the lowest scores and do not present a clear evolution trend in the period, whereas categories ""context and commitment"" and ""social performance"" presented the best results and regular improvement; the category ""environmental performance,"" despite it not reaching the biggest scores, also featured constant evolution. Description of data measurement techniques, besides more comprehensive third-party verification are the items most in need of improvement.

Placement over containers with fixed dimensions solved with adaptive neighborhood simulated annealing

This work deals with the problem of minimizing the waste of space that occurs on a rotational placement of a set of irregular bi-dimensional items inside a bi-dimensional container. This problem is approached with a heuristic based on Simulated Annealing (SA) with adaptive neighborhood. The objective function is evaluated in a constructive approach, where the items are placed sequentially. The placement is governed by three different types of parameters: sequence of placement, the rotation angle and the translation. The rotation applied and the translation of the polygon are cyclic continuous parameters, and the sequence of placement defines a combinatorial problem. This way, it is necessary to control cyclic continuous and discrete parameters. The approaches described in the literature deal with only type of parameter (sequence of placement or translation). In the proposed SA algorithm, the sensibility of each continuous parameter is evaluated at each iteration increasing the number of accepted solutions. The sensibility of each parameter is associated to its probability distribution in the definition of the next candidate.

Simulated annealing with adaptive neighborhood: A case study in off-line robot path planning

Simulated annealing (SA) is an optimization technique that can process cost functions with degrees of nonlinearities, discontinuities and stochasticity. It can process arbitrary boundary conditions and constraints imposed on these cost functions. The SA technique is applied to the problem of robot path planning. Three situations are considered here: the path is represented as a polyline; as a Bezier curve; and as a spline interpolated curve. In the proposed SA algorithm, the sensitivity of each continuous parameter is evaluated at each iteration increasing the number of accepted solutions. The sensitivity of each parameter is associated to its probability distribution in the definition of the next candidate. (C) 2010 Elsevier Ltd. All rights reserved.

Evidences of the evolution from solid solution to surface segregation in Ni-doped SnO(2) nanoparticles using Raman spectroscopy

Ni-doped SnO(2) nanoparticles, promising for gas-sensing applications, have been synthesized by a polymer precursor method. X-ray diffraction (XRD) and transmission electron microscopy (TEM) data analyses indicate the exclusive formation of nanosized particles with rutile-type phase (tetragonal SnO(2)) for Ni contents below 10 mol%. The mean crystallite size shows a progressive reduction with the Ni content. Room-temperature Raman spectra of Ni-doped SnO(2) nanoparticles show the presence of Raman active modes and modes activated by size effects. From the evolution of the A(1g) mode with the Ni content, a solubility limit at similar to 2 mol% was estimated. Below that content, Raman results are consistent with the occurrence of solid solution (ss) and surface segregation (seg.) of Ni ions. Above similar to 2 mol% Ni, the redshift of A(1g) mode suggests that the surface segregation of Ni ions takes place. Disorder-activated bands were determined and their integrated intensity evolution with the Ni content suggest that the solid-solution regime favors the increase of disorder; meanwhile, that disorder becomes weaker as the Ni content is increased. Copyright (C) 2010 John Wiley & Sons, Ltd.

Texture and mechanical properties evolution of a deep drawing medium carbon steel during cold rolling and subsequent recrystallization

Medium carbon steels are mostly used for simple applications; however, new applications have been developed for which good sheet metal formability is required. These types of steels have an inherent low formability. A medium-carbon hot-rolled SAE 1050 steel was selected for this study. It has been cold rolled with thickness reductions varying between 7 and 80%. The samples obtained were used to evaluate the strain hardening curve. For samples with a 50 and 80% thickness reduction, an annealing heat treatment was performed to achieve recrystallization. The material was characterized in the ""as-received"", cold rolled and annealed conditions using several methods: optical metallography, X-ray diffraction (texture), Vickers hardness, and tensile testing. For large thickness reductions, the SAE 1050 steel presented low elongation, less than 2%, and yield strength (YS) and tensile strength (TS) around 1400 MPa. Texture in the ""as-received"" condition showed strong components on the {001} plane, in the < 100 >, < 210 > and (110) directions. After cold rolling, the texture did not present any significant changes for small thickness reductions, however. It changed completely for large ones, where gamma, < 111 >//ND, alpha, < 110 > HRD, and gamma prime, < 223 >//ND, fibres were strengthened. After annealing, the microstructure of the SAE 1050 steel was characterized by recrystallized ferrite and globular cementite. There was little change in the alpha fibre for the 50% reduction, whereas for the 80% reduction, its intensity increased. Both gamma and gamma prime fibres vanished upon annealing for 50 and 80% reductions alike. (c) 2008 Elsevier B.V. All rights reserved.

Medium carbon steel deep drawing: A study on the evolution of mechanical properties, texture and simulations, from cold rolling to the end product

Medium carbon steels are mostly used for simple applications; nevertheless new applications have been developed for which good sheet formability is required. This class of steels has an inherent low formability. A medium carbon hot rolled SAE 1050 steel has been selected for this study. It has been cold rolled with reductions in the 7-80% range. Samples have been used to assess the cold work hardening curve. For samples with a 50 and 80% thickness reduction, an annealing heat treatment has been performed to obtain recrystallization. The material has been characterized in the ""as received"", cold rolled and annealed conditions, using several methods: optical microscopy, X-ray diffraction (texture), Vickers hardness and tensile testing. The 50% cold rolled and recrystallized material has been further studied in terms of sheet metal formability and texture evolution during the actual stamping of a steel toecap that has been used to validate the finite element simulations. (C) 2008 Elsevier B.V. All rights reserved.

Magnetic losses evolution of a semi-processed steel during forced aging treatments

An ultra-low carbon steel (30 ppm after decarburization) containing Al and Si was aged for distinct soaking times at 210 degrees C. The core loss increased continuously until around 24 h. After that, only slight changes were verified. It was found that only the hysteresis loss component changed during the aging treatment. By internal friction test and transmission electron microscopy it was seen that carbon precipitation caused the magnetic aging. By scanning electron microscopy it could be concluded that the increase of aging index was attributed to the high number of carbides larger than 0.1 mu m. (C) 2008 Elsevier B. V. All rights reserved.

Adaptive Carrier Tracking for Mars to Earth Communications During Entry, Descent, and Landing

We propose a robust and low complexity scheme to estimate and track carrier frequency from signals traveling under low signal-to-noise ratio (SNR) conditions in highly nonstationary channels. These scenarios arise in planetary exploration missions subject to high dynamics, such as the Mars exploration rover missions. The method comprises a bank of adaptive linear predictors (ALP) supervised by a convex combiner that dynamically aggregates the individual predictors. The adaptive combination is able to outperform the best individual estimator in the set, which leads to a universal scheme for frequency estimation and tracking. A simple technique for bias compensation considerably improves the ALP performance. It is also shown that retrieval of frequency content by a fast Fourier transform (FFT)-search method, instead of only inspecting the angle of a particular root of the error predictor filter, enhances performance, particularly at very low SNR levels. Simple techniques that enforce frequency continuity improve further the overall performance. In summary we illustrate by extensive simulations that adaptive linear prediction methods render a robust and competitive frequency tracking technique.

Transient and Steady-State Analysis of the Affine Combination of Two Adaptive Filters

In this paper, we propose an approach to the transient and steady-state analysis of the affine combination of one fast and one slow adaptive filters. The theoretical models are based on expressions for the excess mean-square error (EMSE) and cross-EMSE of the component filters, which allows their application to different combinations of algorithms, such as least mean-squares (LMS), normalized LMS (NLMS), and constant modulus algorithm (CMA), considering white or colored inputs and stationary or nonstationary environments. Since the desired universal behavior of the combination depends on the correct estimation of the mixing parameter at every instant, its adaptation is also taken into account in the transient analysis. Furthermore, we propose normalized algorithms for the adaptation of the mixing parameter that exhibit good performance. Good agreement between analysis and simulation results is always observed.

Distributed Estimation Over an Adaptive Incremental Network Based on the Affine Projection Algorithm

We study the problem of distributed estimation based on the affine projection algorithm (APA), which is developed from Newton`s method for minimizing a cost function. The proposed solution is formulated to ameliorate the limited convergence properties of least-mean-square (LMS) type distributed adaptive filters with colored inputs. The analysis of transient and steady-state performances at each individual node within the network is developed by using a weighted spatial-temporal energy conservation relation and confirmed by computer simulations. The simulation results also verify that the proposed algorithm provides not only a faster convergence rate but also an improved steady-state performance as compared to an LMS-based scheme. In addition, the new approach attains an acceptable misadjustment performance with lower computational and memory cost, provided the number of regressor vectors and filter length parameters are appropriately chosen, as compared to a distributed recursive-least-squares (RLS) based method.

Improving the tracking capability of adaptive filters via convex combination

As is well known, Hessian-based adaptive filters (such as the recursive-least squares algorithm (RLS) for supervised adaptive filtering, or the Shalvi-Weinstein algorithm (SWA) for blind equalization) converge much faster than gradient-based algorithms [such as the least-mean-squares algorithm (LMS) or the constant-modulus algorithm (CMA)]. However, when the problem is tracking a time-variant filter, the issue is not so clear-cut: there are environments for which each family presents better performance. Given this, we propose the use of a convex combination of algorithms of different families to obtain an algorithm with superior tracking capability. We show the potential of this combination and provide a unified theoretical model for the steady-state excess mean-square error for convex combinations of gradient- and Hessian-based algorithms, assuming a random-walk model for the parameter variations. The proposed model is valid for algorithms of the same or different families, and for supervised (LMS and RLS) or blind (CMA and SWA) algorithms.