Experimental Investigation of the Hydrodynamic Coefficients of a Remotely Operated Vehicle Using a Planar Motion Mechanism

The determination of hydrodynamic coefficients of full scale underwater vehicles using system identification (SI) is an extremely powerful technique. The procedure is based on experimental runs and on the analysis of on-board sensors and thrusters signals. The technique is cost effective and it has high repeatability; however, for open-frame underwater vehicles, it lacks accuracy due to the sensors' noise and the poor modeling of thruster-hull and thruster-thruster interaction effects. In this work, forced oscillation tests were undertaken with a full scale open-frame underwater vehicle. These conducted tests are unique in the sense that there are not many examples in the literature taking advantage of a PMM installation for testing a prototype and; consequently, allowing the comparison between the experimental results and the ones estimated by parameter identification. The Morison's equation inertia and drag coefficients were estimated with two parameter identification methods, that is, the weighted and the ordinary least-squares procedures. It was verified that the in-line force estimated from Morison's equation agrees well with the measured one except in the region around the motion inversion points. On the other hand, the error analysis showed that the ordinary least-squares provided better accuracy and, therefore, was used to evaluate the ratio between inertia and drag forces for a range of Keulegan-Carpenter and Reynolds numbers. It was concluded that, although both experimental and estimation techniques proved to be powerful tools for evaluation of an open-frame underwater vehicle's hydrodynamic coefficients, the research provided a rich amount of reference data for comparison with reduced models as well as for dynamic motion simulation of ROVs. [DOI: 10.1115/1.4004952]

The Use of Nanotechnology in Cosmetic Formulations: The Influence of Vehicle in the Vitamin A Skin Penetration

Despite the efficacy of topical retinoic acid, skin reactions have limited its acceptance by patients. Other retinoids, like Retinyl Palmitate (RP), are considerably less irritating, but they are also less effective. In order to enhance the performance of retinoids, in this work RP has been added to cosmetic formulations such as nanoemulsions, which can provide better penetration of this active substance. Because the vehicle can directly influence the skin penetration and the effectiveness of RP, two skin care products containing 5000 UI RP have been developed and investigated, namely a nanoemulsifying system and a classic gel cream. In vitro penetration tests were conducted by using Franz diffusion cells and placing porcine ear skin and iso-propanol in the receptor compartment. The RP concentration in the skin layers was analyzed by high performance liquid chromatography, and a Zeta-Sizer system was employed for measurement of the the particle size distribution. The penetration tests revealed a large difference between the vehicles in terms of the RP concentrations in each skin layer. The classic gel cream furnished better RP penetration in both the stratum corneum and the epidermis without stratum corneum + dermis, as compared to the self-nanoemulsifying system. The two vehicles displayed the same particle size (between 100 and 200 nm). Better understanding of RP skin delivery using different vehicles has been acquired, and the importance of evaluating the efficacy of nanocosmetics. Results from the present study should also contribute to the assessment of commercial self-nanoemulsifying systems with potential application in the facile production of nanoemulsions.

Modeling and Identification of an Open-frame Underwater Vehicle: The Yaw Motion Dynamics

A semi-autonomous unmanned underwater vehicle (UUV), named LAURS, is being developed at the Laboratory of Sensors and Actuators at the University of Sao Paulo. The vehicle has been designed to provide inspection and intervention capabilities in specific missions of deep water oil fields. In this work, a method of modeling and identification of yaw motion dynamic system model of an open-frame underwater vehicle is presented. Using an on-board low cost magnetic compass sensor the method is based on the utilization of an uncoupled 1-DOF (degree of freedom) dynamic system equation and the application of the integral method which is the classical least squares algorithm applied to the integral form of the dynamic system equations. Experimental trials with the actual vehicle have been performed in a test tank and diving pool. During these experiments, thrusters responsible for yaw motion are driven by sinusoidal voltage signal profiles. An assessment of the feasibility of the method reveals that estimated dynamic system models are more reliable when considering slow and small sinusoidal voltage signal profiles, i.e. with larger periods and with relatively small amplitude and offset.

Performance of polymeric reinforcements in vehicle structures submitted to frontal impact

Preformed structural reinforcements have shown good performance in crash tests, where the great advantage is their weight. These reinforcements are designed with the aim of increasing the rigidity of regions with large deformations, thus stabilising sections of the vehicle that work as load path during impact. The objective of this work is to show the application of structural reinforcements made of polymeric material PA66 in the field of vehicle safety, through finite element simulations. Simulations of frontal impact at 50 km/h and in ODB (offset deformable barrier) at 57 km/h configurations (standards such as ECE R-94 and ECE R-12) were performed in the software LS-DYNA R (R) and MADYMO (R). The simulations showed that the use of polymeric reinforcements leads to a 70% reduction in A-pillar intrusion, a 65% reduction in the displacement of the steering column and a 59% reduction in the deformation in the region of the occupant legs and feet. The level of occupant injuries was analysed by MADYMO (R) software, and a reduction of 23.5% in the chest compression and 80% in the tibia compression were verified. According to the standard, such conditions lead to an improvement in the occupant safety in a vehicle collision event.

Vehicle emissions and PM2.5 mass concentrations in six Brazilian cities

In Brazil, the principal source of air pollution is the combustion of fuels (ethanol, gasohol, and diesel). In this study, we quantify the contributions that vehicle emissions make to the urban fine particulate matter (PM2.5) mass in six state capitals in Brazil, collecting data for use in a larger project evaluating the impact of air pollution on human health. From winter 2007 to winter 2008, we collected 24-h PM2.5 samples, employing gravimetry to determine PM2.5 mass concentrations; reflectance to quantify black carbon concentrations; X-ray fluorescence to characterize elemental composition; and ion chromatography to determine the composition and concentrations of anions and cations. Mean PM2.5 concentrations in the cities of Sao Paulo, Rio de Janeiro, Belo Horizonte, Curitiba, Porto Alegre, and Recife were 28, 17.2, 14.7, 14.4, 13.4, and 7.3 mu g/m(3), respectively. In Sao Paulo and Rio de Janeiro, black carbon explained approximately 30% of the PM2.5 mass. We used receptor models to identify distinct source-related PM2.5 fractions and correlate those fractions with daily mortality rates. Using specific rotation factor analysis, we identified the following principal contributing factors: soil and crustal material; vehicle emissions and biomass burning (black carbon factor); and fuel oil combustion in industries (sulfur factor). In all six cities, vehicle emissions explained at least 40% of the PM2.5 mass. Elemental composition determination with receptor modeling proved an adequate strategy to identify air pollution sources and to evaluate their short- and long-term effects on human health. Our data could inform decisions regarding environmental policies vis-a-vis health care costs.

Influence of psychosocial risk factors on the trajectory of mental health problems from childhood to adolescence: a longitudinal study

Background Longitudinal epidemiological studies involving child/adolescent mental health problems are scarce in developing countries, particularly in regions characterized by adverse living conditions. We examined the influence of psychosocial factors on the trajectory of child/adolescent mental health problems (CAMHP) over time. Methods A population-based sample of 6- to 13-year-olds with CAMHP was followed-up from 2002–2003 (Time 1/T1) to 2007–2008 (Time 2/T2), with 86 out of 124 eligible children/adolescents at T1 being reassessed at T2 (sample loss: 30.6%). Outcome: CAMHP at T2 according to the Child Behavior Checklist/CBCL’s total problem scale. Psychosocial factors: T1 variables (child/adolescent’s age, family socioeconomic status); trajectory of variables from T1 to T2 (child/adolescent exposure to severe physical punishment, mother exposure to severe physical marital violence, maternal anxiety/depression); and T2 variables (maternal education, child/adolescent’s social support and pro-social activities). Results Multivariate analysis identified two risk factors for child/adolescent MHP at T2: aggravation of child/adolescent physical punishment and aggravation of maternal anxiety/depression. Conclusions The current study shows the importance of considering child/adolescent physical punishment and maternal anxiety/depression in intervention models and mental health care policies.

Column generation for a multitrip vehicle routing problem with time windows, driver work hours, and heterogeneous fleet

This study addresses a vehicle routing problem with time windows, accessibility restrictions on customers, and a fleet that is heterogeneous with regard to capacity and average speed. A vehicle can performmultiple routes per day, all starting and ending at a single depot, and it is assigned to a single driverwhose totalwork hours are limited.Acolumn generation algorithmis proposed.The column generation pricing subproblem requires a specific elementary shortest path problem with resource constraints algorithm to address the possibility for each vehicle performingmultiple routes per day and to address the need to set the workday’s start time within the planning horizon. A constructive heuristic and a metaheuristic based on tabu search are also developed to find good solutions.

Motion control and real-time systems: an approach to trajectory rebuilding in non-deterministic networks

Motion control is a sub-field of automation, in which the position and/or velocity of machines are controlled using some type of device. In motion control the position, velocity, force, pressure, etc., profiles are designed in such a way that the different mechanical parts work as an harmonious whole in which a perfect synchronization must be achieved. The real-time exchange of information in the distributed system that is nowadays an industrial plant plays an important role in order to achieve always better performance, better effectiveness and better safety. The network for connecting field devices such as sensors, actuators, field controllers such as PLCs, regulators, drive controller etc., and man-machine interfaces is commonly called fieldbus. Since the motion transmission is now task of the communication system, and not more of kinematic chains as in the past, the communication protocol must assure that the desired profiles, and their properties, are correctly transmitted to the axes then reproduced or else the synchronization among the different parts is lost with all the resulting consequences. In this thesis, the problem of trajectory reconstruction in the case of an event-triggered communication system is faced. The most important feature that a real-time communication system must have is the preservation of the following temporal and spatial properties: absolute temporal consistency, relative temporal consistency, spatial consistency. Starting from the basic system composed by one master and one slave and passing through systems made up by many slaves and one master or many masters and one slave, the problems in the profile reconstruction and temporal properties preservation, and subsequently the synchronization of different profiles in network adopting an event-triggered communication system, have been shown. These networks are characterized by the fact that a common knowledge of the global time is not available. Therefore they are non-deterministic networks. Each topology is analyzed and the proposed solution based on phase-locked loops adopted for the basic master-slave case has been improved to face with the other configurations.

A numerical program for Railway vehicle-track-structure dynamic interaction using a modal substructuring approach

This work presents a program for simulations of vehicle-track and vehicle-trackstructure dynamic interaction . The method used is computationally efficient in the sense that a reduced number of coordinates is sufficient and doesn’t require high efficiency computers. The method proposes a modal substructuring approach of the system by modelling rails , sleepers and underlying structure with modal coordinates, the vehicle with physical lumped elements coordinates and by introducing interconnection elements between these structures (wheel-rail contact, railpads and ballast) by means of their interaction forces. The Frequency response function (FRF) is also calculated for both cases of track over a structure (a bridge, a viaduct ...) and for the simple vehicle-track program; for each case the vehicle effect on the FRF is then analyzed through the comparison of the FRFs obtained introducing or not a simplified vehicle on the system.

Exact Algorithms for Different Classes of Vehicle Routing Problems

We deal with five problems arising in the field of logistics: the Asymmetric TSP (ATSP), the TSP with Time Windows (TSPTW), the VRP with Time Windows (VRPTW), the Multi-Trip VRP (MTVRP), and the Two-Echelon Capacitated VRP (2E-CVRP). The ATSP requires finding a lest-cost Hamiltonian tour in a digraph. We survey models and classical relaxations, and describe the most effective exact algorithms from the literature. A survey and analysis of the polynomial formulations is provided. The considered algorithms and formulations are experimentally compared on benchmark instances. The TSPTW requires finding, in a weighted digraph, a least-cost Hamiltonian tour visiting each vertex within a given time window. We propose a new exact method, based on new tour relaxations and dynamic programming. Computational results on benchmark instances show that the proposed algorithm outperforms the state-of-the-art exact methods. In the VRPTW, a fleet of identical capacitated vehicles located at a depot must be optimally routed to supply customers with known demands and time window constraints. Different column generation bounding procedures and an exact algorithm are developed. The new exact method closed four of the five open Solomon instances. The MTVRP is the problem of optimally routing capacitated vehicles located at a depot to supply customers without exceeding maximum driving time constraints. Two set-partitioning-like formulations of the problem are introduced. Lower bounds are derived and embedded into an exact solution method, that can solve benchmark instances with up to 120 customers. The 2E-CVRP requires designing the optimal routing plan to deliver goods from a depot to customers by using intermediate depots. The objective is to minimize the sum of routing and handling costs. A new mathematical formulation is introduced. Valid lower bounds and an exact method are derived. Computational results on benchmark instances show that the new exact algorithm outperforms the state-of-the-art exact methods.

Heuristic algorithms for the Capacitated Location-Routing Problem and the Multi-Depot Vehicle Routing Problem

The Capacitated Location-Routing Problem (CLRP) is a NP-hard problem since it generalizes two well known NP-hard problems: the Capacitated Facility Location Problem (CFLP) and the Capacitated Vehicle Routing Problem (CVRP). The Multi-Depot Vehicle Routing Problem (MDVRP) is known to be a NP-hard since it is a generalization of the well known Vehicle Routing Problem (VRP), arising with one depot. This thesis addresses heuristics algorithms based on the well-know granular search idea introduced by Toth and Vigo (2003) to solve the CLRP and the MDVRP. Extensive computational experiments on benchmark instances for both problems have been performed to determine the effectiveness of the proposed algorithms. This work is organized as follows: Chapter 1 describes a detailed overview and a methodological review of the literature for the the Capacitated Location-Routing Problem (CLRP) and the Multi-Depot Vehicle Routing Problem (MDVRP). Chapter 2 describes a two-phase hybrid heuristic algorithm to solve the CLRP. Chapter 3 shows a computational comparison of heuristic algorithms for the CLRP. Chapter 4 presents a hybrid granular tabu search approach for solving the MDVRP.

Metodi euristici per il Vehicle Routing Problem

Il problema della consegna di prodotti da un deposito/impianto ai clienti mediante una flotta di automezzi è un problema centrale nella gestione di una catena di produzione e distribuzione (supply chain). Questo problema, noto in letteratura come Vehicle Routing Problem (VRP), nella sua versione più semplice consiste nel disegnare per ogni veicolo disponibile presso un dato deposito aziendale un viaggio (route) di consegna dei prodotti ai clienti, che tali prodotti richiedono, in modo tale che (i) la somma delle quantità richieste dai clienti assegnati ad ogni veicolo non superi la capacità del veicolo, (ii) ogni cliente sia servito una ed una sola volta, (iii) sia minima la somma dei costi dei viaggi effettuati dai veicoli. Il VRP è un problema trasversale ad una molteplicità di settori merceologici dove la distribuzione dei prodotti e/o servizi avviene mediante veicoli su gomma, quali ad esempio: distribuzione di generi alimentari, distribuzione di prodotti petroliferi, raccolta e distribuzione della posta, organizzazione del servizio scuolabus, pianificazione della manutenzione di impianti, raccolta rifiuti, etc. In questa tesi viene considerato il Multi-Trip VRP, in cui ogni veicolo può eseguire un sottoinsieme di percorsi, chiamato vehicle schedule (schedula del veicolo), soggetto a vincoli di durata massima. Nonostante la sua importanza pratica, il MTVRP ha ricevuto poca attenzione in letteratura: sono stati proposti diversi metodi euristici e un solo algoritmo esatto di risoluzione, presentato da Mingozzi, Roberti e Toth. In questa tesi viene presentato un metodo euristico in grado di risolvere istanze di MTVRP in presenza di vincoli reali, quali flotta di veicoli non omogenea e time windows. L’euristico si basa sul modello di Prins. Sono presentati inoltre due approcci di local search per migliorare la soluzione finale. I risultati computazionali evidenziano l’efficienza di tali approcci.