Millora aerodinàmica de la nova carrosseria del vehicle l'Àliga. Estudis dels efectes de la rugositat i l'inserció d'apèndixs aerodinàmics

L' objectiu d' aquest estudi és intentar millorar l' aerodinàmica de la nova carrosseria del vehicle de baix consum de la UdG,l' Àliga, a través de programes informàtics de CFD.Des de fa uns anys l' Escola Politècnica Superior de la Universitat de Girona participa a l' Eco Shell Marathon, mirant d' assolir els millors resultats possibles.El nom del vehicle utilitzat per aquesta carrera és l' Àliga.Aquest projecte parteix dels resultats obtinguts al Projece fi de carrera d' en Daniel Vilavedra Vilà (2006):"Redisseny aerodinàmic de la carrosseria del vehicle de baix consum Àliga"

Càlcul, disseny i fabricació d'una carrosseria autoportant en material compòsit per al vehicle de baix consum Àliga

El projecte és l’inici de la creació d’un nou prototip per a poder competir la temporada 2008 a la cursa de vehicles de baix consum Shell Eco-Marathon. El principal objectiu és aconseguir un xassís que redueixi, en la mesura del possible, el pes del prototip a la vegada que asseguri una millor rigidesa i millori l’ergonomia de tot el conjunt. Es dissenyarà tota la part estructural de la carrosseria, que serà sotmesa a càlcul mitjançant la tècnica dels elements finits i posteriorment es realitzarà una guia de producció per tal de guiar els membres de l’equip que en realitzin la producció

Positioning an underwater vehicle through image mosaicking

Mosaics have been commonly used as visual maps for undersea exploration and navigation. The position and orientation of an underwater vehicle can be calculated by integrating the apparent motion of the images which form the mosaic. A feature-based mosaicking method is proposed in this paper. The creation of the mosaic is accomplished in four stages: feature selection and matching, detection of points describing the dominant motion, homography computation and mosaic construction. In this work we demonstrate that the use of color and textures as discriminative properties of the image can improve, to a large extent, the accuracy of the constructed mosaic. The system is able to provide 3D metric information concerning the vehicle motion using the knowledge of the intrinsic parameters of the camera while integrating the measurements of an ultrasonic sensor. The experimental results of real images have been tested on the GARBI underwater vehicle

Ampliació i millora d'un sistema avançat de compartició de vehicle

Actualment el cotxe és un dels mitjans de transport més utilitzats,comportant problemes de trànsit i aparcament, contaminació acústica i ambiental i una important despesa econòmica. Ja fa uns anys, i davant d'aquesta nova realitat, va sorgir la idea del carpooling, un sistema de transport privat compartit protagonitzat per particulars i que pot esdevenir una molt bona alternativa de mobilitat sostenible. Tot i això, els projectes de carpooling són actualment poc dinàmics I majoritàriament acotats a portals web. Molt pocs disposen de portals adaptats adispositius mòbils i, encara menys, disposen d’aplicacions natives. Amb tot, avui en dia elsaparells mòbils, ja siguin smartphones o PDAs, obren un ventall de possibilitats encara noexplotat en aquest camp.Per altra banda, compartir un viatge amb algú desconegut i de qui no se’n tenenreferències és quelcom que ens fa sentir insegurs, però això es pot resoldre gràciesal trust i reputation, un sistema basat en les valoracions dels usuaris que ja han viscutl’experiència, i que per tant, ens permet conèixer la reputació i confiança de que disposaun usuari dins el sistema. A tots aquests punts, cal afegir-hi la importància que té avui endia rebre en tot moment una informació clara i actualitzada.Aquest projecte vol exprimir aquestes oportunitats donant una plataforma d’accésusable per aquesta mena de dispositius, per tal de que no hi hagi cap barrera per estarconnectat al sistema en qualsevol lloc i moment. A més a més, aquests terminals donen lapossibilitat de saber la seva localització en temps real, cosa que pot resultar molt útil per agent que comparteix viatges i que s’està movent d’un lloc a un altre.Així doncs, partint de totes aquestes possibilitats de millora, es van idear una sèried’estratègies per a un projecte de carpooling ja existent anomenat e-hitchhiking, dotant aaquest sistema d’una major comunicació, protecció i seguretat per a que l’experiència del’usuari sigui molt més gratificant, on a més, hi ha la possibilitat de rebre informaciótotalment veraç i actualitzada en certs dispositius mòbils.Per tant la motivació principal per dur a terme aquest projecte és, a part de lesesmentades anteriorment, la de dotar un sistema de compartició de vehicle d’un majordinamisme, més realisme, més fiabilitat i fer-lo més sociable. El sistema s’implanta oficialment al setembre del 2011 amb la creació de lacomunitat UdG

Dynamic modelling of an underwater vehicle

Nessie is an Autonomous Underwater Vehicle (AUV) created by a team of students in the Heriot Watt University to compete in the Student Autonomous Underwater Competition, Europe (SAUC-E) in August 2006. The main objective of the project is to find the dynamic equation of the robot, dynamic model. With it, the behaviour of the robot will be easier to understand and movement tests will be available by computer without the need of the robot, what is a way to save time, batteries, money and the robot from water inside itself. The object of the second part in this project is setting a control system for Nessie by using the model

Prototip culata del vehicle de baix consum (equip EPS-UdG Shell Eco)

Aquest projecte s’ha portat a terme per tal de millorar en diferentsaspectes el motor Honda Gx35 , del vehicle de baix consum de la Universitat deGirona (Udg). Aquest és un motor de combustió interna de gasolina (cicle Otto).L’objectiu és el disseny d’una culata per poder minimitzar el consum de gasolina, la qual s’ha de poder acoblar amb el motor Honda Gx35. Aquest motor,prèviament s’haurà de modificar per poder-hi instal•lari la nova culata

Industrialització i fabricació d'una carrosseria d'un vehicle de baix consum

El projecte es desenvolupa amb la intenció de millorar ell cotxe queparticipa, en nom de la Universitat de Girona, a la shell eco-marathon en lacategoria de prototips i amb gasolina com a combustible.El motiu principal que ha donat peu a aquest projecte és la realització d’unestudi aerodinàmic que ha desembocat en un disseny totalment nou de lageometria de la carrosseria. Aquest estudi i el disseny aerodinàmic de lacarrosseria obtingut es pot consultar al projecte titulat “Disseny i estudi del’aerodinàmica del vehicle àliga” de l’autor Albert Marron

Vehicle WiFi

El projecte presenta el disseny d'un vehicle a motor elèctric construït sobre el sistema microcontrolador LPC1769 amb comunicacions sense fils via xarxes WiFi i detecció d'obstacles per sonar.

Algorithm optimization for solving crew scheduling problems

In this paper, we are proposing a methodology to determine the most efficient and least costly way of crew pairing optimization. We are developing a methodology based on algorithm optimization on Eclipse opensource IDE using the Java programming language to solve the crew scheduling problems.

Comparison of Work Scheduling Using Constraint Programming or Auctions

Business processes designers take into account the resources that the processes would need, but, due to the variable cost of certain parameters (like energy) or other circumstances, this scheduling must be done when business process enactment. In this report we formalize the energy aware resource cost, including time and usage dependent rates. We also present a constraint programming approach and an auction-based approach to solve the mentioned problem including a comparison of them and a comparison of the proposed algorithms for solving them

On Certain Greedoid Polyhedra, Partially Indexable Scheduling Problems, and Extended Restless Bandit Allocation Indices

We present a polyhedral framework for establishing general structural properties on optimal solutions of stochastic scheduling problems, where multiple job classes vie for service resources: the existence of an optimal priority policy in a given family, characterized by a greedoid (whose feasible class subsets may receive higher priority), where optimal priorities are determined by class-ranking indices, under restricted linear performance objectives (partial indexability). This framework extends that of Bertsimas and Niño-Mora (1996), which explained the optimality of priority-index policies under all linear objectives (general indexability). We show that, if performance measures satisfy partial conservation laws (with respect to the greedoid), which extend previous generalized conservation laws, then the problem admits a strong LP relaxation over a so-called extended greedoid polytope, which has strong structural and algorithmic properties. We present an adaptive-greedy algorithm (which extends Klimov's) taking as input the linear objective coefficients, which (1) determines whether the optimal LP solution is achievable by a policy in the given family; and (2) if so, computes a set of class-ranking indices that characterize optimal priority policies in the family. In the special case of project scheduling, we show that, under additional conditions, the optimal indices can be computed separately for each project (index decomposition). We further apply the framework to the important restless bandit model (two-action Markov decision chains), obtaining new index policies, that extend Whittle's (1988), and simple sufficient conditions for their validity. These results highlight the power of polyhedral methods (the so-called achievable region approach) in dynamic and stochastic optimization.

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

Beyond Smith's rule: An optimal dynamic index, rule for single machine stochastic scheduling with convex holding costs

Most research on single machine scheduling has assumedthe linearity of job holding costs, which is arguablynot appropriate in some applications. This motivates ourstudy of a model for scheduling $n$ classes of stochasticjobs on a single machine, with the objective of minimizingthe total expected holding cost (discounted or undiscounted). We allow general holding cost rates that are separable,nondecreasing and convex on the number of jobs in eachclass. We formulate the problem as a linear program overa certain greedoid polytope, and establish that it issolved optimally by a dynamic (priority) index rule,whichextends the classical Smith's rule (1956) for the linearcase. Unlike Smith's indices, defined for each class, ournew indices are defined for each extended class, consistingof a class and a number of jobs in that class, and yieldan optimal dynamic index rule: work at each time on a jobwhose current extended class has larger index. We furthershow that the indices possess a decomposition property,as they are computed separately for each class, andinterpret them in economic terms as marginal expected cost rate reductions per unit of expected processing time.We establish the results by deploying a methodology recentlyintroduced by us [J. Niño-Mora (1999). "Restless bandits,partial conservation laws, and indexability. "Forthcomingin Advances in Applied Probability Vol. 33 No. 1, 2001],based on the satisfaction by performance measures of partialconservation laws (PCL) (which extend the generalizedconservation laws of Bertsimas and Niño-Mora (1996)):PCL provide a polyhedral framework for establishing theoptimality of index policies with special structure inscheduling problems under admissible objectives, which weapply to the model of concern.

Solving two production scheduling problems with sequence-dependent set-up times

In today’s competitive markets, the importance of goodscheduling strategies in manufacturing companies lead to theneed of developing efficient methods to solve complexscheduling problems.In this paper, we studied two production scheduling problemswith sequence-dependent setups times. The setup times areone of the most common complications in scheduling problems,and are usually associated with cleaning operations andchanging tools and shapes in machines.The first problem considered is a single-machine schedulingwith release dates, sequence-dependent setup times anddelivery times. The performance measure is the maximumlateness.The second problem is a job-shop scheduling problem withsequence-dependent setup times where the objective is tominimize the makespan.We present several priority dispatching rules for bothproblems, followed by a study of their performance. Finally,conclusions and directions of future research are presented.

Parallel scheduling of multiclass M/M/m queues: Approximate and heavy-traffic optimization of achievable performance

We address the problem of scheduling a multiclass $M/M/m$ queue with Bernoulli feedback on $m$ parallel servers to minimize time-average linear holding costs. We analyze the performance of a heuristic priority-index rule, which extends Klimov's optimal solution to the single-server case: servers select preemptively customers with larger Klimov indices. We present closed-form suboptimality bounds (approximate optimality) for Klimov's rule, which imply that its suboptimality gap is uniformly bounded above with respect to (i) external arrival rates, as long as they stay within system capacity;and (ii) the number of servers. It follows that its relativesuboptimality gap vanishes in a heavy-traffic limit, as external arrival rates approach system capacity (heavy-traffic optimality). We obtain simpler expressions for the special no-feedback case, where the heuristic reduces to the classical $c \mu$ rule. Our analysis is based on comparing the expected cost of Klimov's ruleto the value of a strong linear programming (LP) relaxation of the system's region of achievable performance of mean queue lengths. In order to obtain this relaxation, we derive and exploit a new set ofwork decomposition laws for the parallel-server system. We further report on the results of a computational study on the quality of the $c \mu$ rule for parallel scheduling.