PAE / O transporte rodoviário é um dos modais mais utilizados para o transporte de passageiros principalmente devido à sua acessibilidade, tanto no contexto nacional como mundial. As organizações buscam métodos e sistemas cada vez mais eficientes para atender de forma satisfatória seus clientes, oferencendo serviços de qualidade e confiáveis. O presente trabalho teve como objetivo propor um modelo matemático de veículos para a minimização de ônibus, evitando ao máximo o desbalanceamento da rede de transporte. O modelo buscou abranger as restrições inerentes aos fluxos em rodoviárias de modo a cobrir todas as viagens de uma tabela de horários já definida, alocando apenas um veículo para cada viagem e aproveitando o mesmo para outras viagens quando possível, atendendo à função objetivo. O modelo foi aplicado à uma empresa de transportes de passageiros com quatro cidades envolvidas e 105 viagens em um tempo de 24 horas. As variáveis e restrições foram identificadas a partir de entrevistas semi -estruturadas e visitas à organização, observando roteiros de viagens a serem cumpridos por dois modelos de ônibus: metropolitanos e articulados. Neste contexto, dois modelos distintos foram montados de forma a atender as viagens, sendo analisadas separadamente. Os resultados definiram um total necessário de 12 ônibus metropolitanos e 4 ônibus articulados para atender às exigências da empresa e da tabela viagens, sendo que todas as restrições foram satisfeitas, detectando -se a necessidade da realização de seis viagens mortas (sem passageiros) para suprir a necessidade de d emanda de ônibus para cada tabela de viagens diárias. Com os resultados, fez-se uma comparação com a programação que a empresa necessitava para cumprir a tabela de viagens, identificando a diminuição de um ônibus metropolitano, sem deixar de cumprir a restrição de autonomia de cada ônibus poder rodar 400 quilômetros sem necessidade de reabastecimento. Algumas melhorias foram identificadasanalisando-se a rede resultante, sendo discutidas ao final da pesquisa e norteando novas intenções de trabalhos futuros. / Road transport is one of the most used modes for passenger transport mainly due to its affordability, in the national and global context. Organizations seek for a better methods and systems to meet the satisfaction of its customers, offering quality and reliable services. This research aimed to propose a vehicle scheduling model to minimize buses, avoiding the transmission system imbalance. The model tried to cover the restrictions inherent about the vehicle flow on bus stations to cover all travel in a given timetable, allocating only one vehicle for each trip and using it for other trips when it is possible, given the objective function. The model was applied to a passenger transportation company with four cities involved and 105 trips in a time of 24 hours. The variables and constraints were identified from semi-structured interviews and visits at organization, identifying the tours to be met by two bus models: articulated and metropolitan. In this context, two different models were fitted to meet the travel , and analyzed separately. The results defined a required total of twelve metropolitan buses and four articulated buses to meet the company and timetable requirements and all constraints were satisfied, detecting the need of perform six deadheading trips (without passengers) to meet the need for demand bus for each table in the daily trips. With the results, a comparison was made between the old programming system adopted by the organization to fulfill the timetable, identifying the reduction of a metropolitan bus, while fulfilling the constraint of autonomy that each bus can travel 400 kilometers. Some improvements were identified by observing the resulting route network, being discussed at the end of the research and guiding for a new works in the future.

This paper deals with the consensus problem under communication network inducing delays. It is well-known that introducing a delay leads in general to a reduction of the performance or to instability due to the fact that timedelay systems are infinite dimensional. For instance, the set of initial conditions of a time-delay system is not a vector but a function taken in an interval. Therefore, investigating the effect of time-delays in the consensus problem is an important issue. In the present paper, we assume that each agent receives instantaneously its own state information but receives the state information from its neighbors after a constant delay. Two stability criteria are provided based on the frequency approach and on Lyapunov-Krasovskii techniques given in terms of LMI. An analytic expression of the consensus equilibrium which depends on the delay and on the initial conditions taken in an interval is derived. The efficiency of the method is tested for different network communication schemes. / <p>QC 20110120</p>

In advanced process control, the Model Predictive Control (MPC) may be considered the most important innovation in recent years and the standard tool for industrial applications due to the fact that it keeps the plant operating in the constraints more profitable. However, like every control algorithm, the MPC after some time in operation rarely works as originally designed. Thus, to preserve the benefits of MPC systems for a long period of time, their performance needs to be monitored and evaluated during the operation. This task require the presence of reliable and effective tools to detect when the controller performance is below of the desirable, to define the need, or not, of recommissioning the system. Thus, the objective of this work is development of techniques for monitoring and evaluating the performance of multivariable predictive controllers, being developed two new tools: LQG benchmark Modified and IHMC benchmark. The results obtained from numerical simulations were satisfactory and consistent with the technical literature applied in the developments of the evaluators, which were used in the monitoring of the control system MPC of the oil-water-gas three-phase separation process, offering an appropriate solution and providing subsidies for implementations in real industrial systems. / Em controle avançado de processos, o controlador preditivo ou MPC (Model Predictive Control) pode ser considerado como a mais importante inovação dos últimos anos e a ferramenta padrão para aplicações industriais, devido ao fato do MPC manter a planta operando dentro das suas restrições de forma mais lucrativa. Entretanto, como todo algoritmo de controle, o MPC depois de algum tempo em operação dificilmente funciona como quando fora inicialmente projetado. Desta forma, com o objetivo de manter os benefícios dos sistemas MPC por um longo período de tempo, seu desempenho precisa ser monitorado e avaliado durante a operação. Esta tarefa requer a presença de ferramentas efetivas e confiáveis para detectar quando o desempenho do controlador estiver abaixo do desejável, para definir a necessidade, ou não, de um recomissionamento do sistema. Destarte, aborda-se neste trabalho o desenvolvimento de técnicas para monitoramento e avaliação de desempenho de controladores preditivos multivariáveis, sendo desenvolvidas duas novas ferramentas: LQG benchmark Modificado e IHMC benchmark. Os resultados obtidos a partir de simulações numéricas foram satisfatórios e coerentes com a literatura técnica aplicada no desenvolvimento dos avaliadores, os quais foram utilizados no monitoramento do sistema de controle MPC do processo de separação trifásica água-óleo-gás, oferecendo assim uma solução apropriada e fornecendo subsídios para implementações em sistemas industrias reais.

<p>    </p> <p>This thesis studies networked Gaussian linear control systems with random delays. Networked control systems is a popular topic these years because of their versatile applications in daily life, such as smart grid and unmanned vehicles. With the development of these systems, researchers have explored this area in two directions. The first one is to derive the inherent rate-cost relationship in the systems, that is the minimal transmission rate needed to achieve an arbitrarily given stability requirement. The other one is to design achievability schemes, which aim at using as less as transmission rate to achieve an arbitrarily given stability requirement. In this thesis, we explore both directions. We assume the sensor-to-controller channels experience independently and identically distributed random delays of bounded support. Our work separates into two parts. In the first part, we consider networked systems with only one sensor. We focus on deriving a lower bound, R_{LB}(D), of the rate-cost tradeoff with the cost function to be E{| <strong>x^</strong>T<strong>x </strong>|} ≤ D, where <strong>x </strong>refers to the state to be controlled. We also propose an achievability scheme as an upper bound, R_{UB}(D), of the optimal rate-cost tradeoff. The scheme uses lattice quantization, entropy encoder, and certainty-equivalence controller. It achieves a good performance that roughly requires 2 bits per time slot more than R_{LB}(D) to achieve the same stability level. We also generalize the cost function to be of both the state and the control actions. For the joint state-and-control cost, we propose the minimal cost a system can achieve. The second part focuses on to the covariance-based fusion scheme design for systems with multiple > 1 sensors. We notice that in the multi-sensor scenario, the outdated arrivals at the controller, which many existing fusion schemes often discard, carry additional information. Therefore, we design an implementable fusion scheme (CQE) which is the MMSE estimator using both the freshest and outdated information at the controller. Our experiment demonstrates that CQE out-performances the MMSE estimator using the freshest information (LQE) exclusively by achieving a 15% smaller average L2 norm using the same transmission rate. As a benchmark, we also derive the minimal achievable L2 norm, Dmin, for the multi-sensor systems. The simulation shows that CQE approaches Dmin significantly better than LQE. </p>