This Master's thesis presents a method for on-line estimation of vehicle mass and road grade using Kalman filter. Many control strategies aiming for better fuel economy, drivability and safety in today's vehicles rely on precise vehicle operating information. In this context, vehicle mass and road grade are crucial parameters. The method is based on an extended Kalman filter (EKF) and a longitudinal vehicle model. The main advantage of this method is its applicability on drivelines with continuous power output during gear shifts and cost effectiveness compared to hardware solutions. The performance has been tested on both simulated data and on real measurement data, collected with a truck on road. Two estimators were developed; one estimates both vehicle mass and road grade and the other estimates only vehicle mass using an inclination sensor as an additional measurement. Tests of the former estimator demonstrate that a reliable mass estimate with less than 5 % error is often achievable within 5 minutes of driving. Furthermore, the root mean square error of the grade estimate is often within 0.5°. Tests of the latter estimator show that this is more accurate and robust than the former estimator with a mass error often within 2 %. A sensitivity analysis shows that the former estimator is fairly robust towards minor modelling errors. Also, an observability analysis shows under which circumstances simultaneous vehicle mass and road grade is possible.

Fuzzy set is a generalization of the classical set. A classical set is distinguished from another by a sharp boundary at some threshold value and therefore, they are also known as crisp set. In fuzzy theory, sharp boundary and crisp set are replaced by partial truth and fuzzy sets. The idea of partial truth facilitates information description especially those communicated through natural language whose transition between descriptive terms are not abrupt discontinuities. Instead, the transition is a smooth change over a range corresponding to the degree of fulfillment each intermediate elements has according to the operating definition of the concept. The shape of a fuzzy set is defined by its membership function. This, by far, has been the common extent of concern regarding the membership function. Different applications may use the membership function to describe different variables such as speed, position, temperature, dirtiness, traffic conditions etc. But the underlying application of fuzzy sets remains the same: to describe information whose membership function, created in an initial setting, preserve the same size and shape throughout its entire application. In other word, fuzzy sets are utilized as if they are static entities. Nothing has been said about how an initially defined membership function can develop over time with respect to a system. The current research proposes a new framework that concerns the evolution of membership functions. We introduce the concept of membership function propagation as a dynamic description of uncertainty. Given a dynamical system with a set of uncertain initial states which can be represented by membership functions, the membership function propagation describes how these membership functions evolve over time with respect to the system. The evolution produces a set of propagated membership functions that have different size and shape from their predecessors. They represent the uncertainty associated with the states of the system at a given time. This new description also confers new definitions for two important concepts in control theory, namely controllability and observability. These two concepts are re-introduced in a fuzzy sense, based on the concept of membership function propagation. By assuming convexity of the fuzzy set, criterions for controllability and observability can be derived. These criterions are illustrated by MATLAB and SIMULINK simulations of an inverted pendulum and a 2 degree of freedom mechanical manipulator.

Networked systems have attracted great interests from the control society during the last decade. Several issues rising from the recent research are addressed in this dissertation. Connectedness is one of the important conditions that enable distributed coordination in a networked system. Nonetheless, it has been assumed in most implementations, especially in continuous-time applications, until recently. A nonlinear weighting strategy is proposed in this dissertation to solve the connectedness preserving problem. Both rendezvous and formation problem are addressed in the context of homogeneous network. Controllability of heterogeneous networks is another issue which has been long omitted. This dissertation contributes a graph theoretical interpretation of controllability. Distributed sensor networks make up another important class of networked systems. A novel estimation strategy is proposed in this dissertation. The observability problem is raised in the context of our proposed distributed estimation strategy, and a graph theoretical interpretation is derived as well. The contributions of this dissertation are as follows: It solves the connectedness preserving problem for networked systems. Based on that, a formation process is proposed. For heterogeneous networks, the leader-follower structure is studied and sufficient and necessary conditions are presented for the system to be controllable. A novel estimation strategy is proposed for distributed sensor networks, which could improve the performance. The observability problem is studied for this estimation strategy and a necessary condition is obtained. This work is among the first ones that provide graph theoretical interpretations of the controllability and observability issues.

With the development of the broadband and the digital technology, different medium could integrate and converge together and the boundaries become dimmer and dimmer. For example, Chunghwa Telecom¡¦s (CHT) Multimedia On Demand service crossed the boundary and entered the digital visual industry in March, 2004. CHT¡¦s MOD is based on the television and through ADSL to offer the digital interactive TV service, making broadband from the study to the living room. Above the service platform, it could not only transmit the visual message, but also the voice and data messages. This kind of business model will be the operational target of the broadband suppliers in the future. However, there are some problems on the promotional pace of CHT¡¦s MOD mow. Based on the results of the earlier researches, the reason why the interactive visual service could not promote successfully is the government and companies put too much emphases on the technical infrastructure, but they all neglect the market situation and the customers¡¦ usages. But, in order to popularize one kind of new media technology, understanding the conditions of the target audiences accurately is the most important mission. Therefore, this research will take CHT¡¦s MOD as an example to understand the key factors which will influence the target audiences to accept the new media technology. And we will see the viewpoints of users. This research will take the Technology Acceptance Model as the main framework and combine the innovation characteristics, such as the compatibility, Trialability and observability. Moreover, we also take subject norm, network externality and new media technology self ¡Vefficacy into account. Through our survey and analysis, we could also prove the originate TAM again and our extended model is more explicative than the originated one. As TAM says, perceived usefulness and perceived ease of use will influence the behavioral intention to use directly. And perceived usefulness is the most powerful variable in the model. Other variables will influence the perceived usefulness or perceived ease of use. For instance, subjective norm and network externality have the positive and remarkable effect on perceived usefulness. And new media technology self ¡Vefficacy has the direct effects on the perceived ease of use. On the other hand, among the innovation characteristics, the compatibility and observability have the direct effects on the perceived usefulness and perceived ease of use, but trialability doesn¡¦t. That says, the more compatibility and observability are, the stronger perceived usefulness and perceived ease of use are. From the outcome of this research, we could understand the key factors of affecting the behavioral intention to accept CHT¡¦s MOD. And it could be the reference for the operators. Furthermore, all variables included in this research will affect the behavioral intention intensely. When we talk about such kind of information system with entertainments, the motivational variables could be considered.

Στην παρούσα εργασία ασχοληθήκαμε με την παρατηρησιμότητα σε μη-γραμμικά συστήματα, αφού πρώτα εξετάσαμε τα γραμμικά συστήματα μέσω μίας γεωμετρικής προσέγγισης. Αρχικώς, ασχοληθήκαμε με την παρατηρησιμότητα affine συστημάτων υπό τμηματικά σταθερές εισόδους. Στη συνέχεια μελετήσαμε τα ίδια συστήματα υπό διαφορίσιμες εισόδους. Κατόπιν, αποδείξαμε ένα θεώρημα που θέτει ένα άνω φράγμα στο πλήθος των Lie παραγωγίσεων της συνάρτησης εξόδου. Τέλος, εξετάσαμε τη μη-γραμμική μη-παρατηρησιμότητα σε γενικότερες κατηγορίες μη-γραμμικών συστημάτων με χρήση γραμμικών μεθόδων και logic dynamic approach. / This thesis is focused on the problem of observability in non-linear systems. A brief examination of linear systems via a geometric approach is initially given. First, observability of affine systems under piecewise constant controls is examined. Second, the same examination is repeated for the same systems under differentiable inputs. Moreover, a theorem that sets an upper bound on the number of Lie derivatives of the output functions is proved and explained. Finally, the non-linear unobservability of non-linear systems in general is presented under the scope of linear methods and logic dynamic approach.

A geração de testes para circuitos combinacionais com fan-outs recovergentes é um problema NP-completo. Com o rápido crescimento da complexidade dos circuitos fabricados, a geração de testes passou a ser um sério problema para a indústria de circuitos integrados. Muitos algoritmos de ATPG (Automatic Test Pattern Generation) baseados no algoritmo D, usam heurísticas para guiar o processo de tomada de decisão na propagação n e na justificação das constantes de forma a aumentar sua eficiencia. Existem heurísticas baseadas em medidas funcionais, estruturais e probabilísticas. Estas medidas são normalmente referidas como observabilidade e controlabilidade que fazem parte de um conceito mais geral, a testabilidade. As medidas que o algoritmo utiliza podem ser calculadas apenas uma vez, durante uma etapa de pré-processamento (medidas de testabilidade estáticas - STM's), ou dinamicamente, recalculando estas medidas durante o processamento sempre que elas forem necessárias (medidas de testabilidade dinâmicas — DTM's). Para alguns circuitos, o use de medidas dinâmicas ao invés de medidas estáticas diminui o número de backtrackings pcir vetor gerado. Apesar disto, o tempo total de CPU por vetor aumenta. Assim, as DTM's só devem ser utilizadas quando as STM's não apresentam uma boa performance. Isto pode ser feito utilizando-se as medidas estáticas ate um certo número de backtrackings. Se o padrão de teste não for encontrado, então medidas dinâmicas são utilizadas. Entretanto, a necessário ainda buscar formas de melhorar o processo dinâmico, diminuindo o custo computacional. A proposta original do calculo das DTM's apresenta algumas técnicas, baseadas em selective tracing, com o objetivo de reduzir o custo computacional. Este trabalho analisa o use combinado de heurísticas e propõe técnicas alternativas, na forma das heurísticas de recalculo parcial e recalculo de linhas não free, que visam minimizar o overhead do calculo das DTM's. E proposta ainda a técnica de Pré-implicação que transfere a complexidade do algoritmo para a memória. Isto é feito através de um preprocessamento que armazena informações necessárias para a geração de todos os vetores de teste. De outra forma estas informações teriam de ser calculadas na geração de cada um destes vetores. A implementação do algoritmo D com as várias heurísticas permitiu a realização de um experimento pratico. Isto possibilitou a análise quantitativa da performance do algoritmo D para vários tipos de circuitos e demonstrou a eficiência de uma das heurísticas propostas neste trabalho. / The test generation for combinational circuits that contain reconvergence is a NP-complete problem. With the rapid increase in the complexity of the fabricated circuits, the generation of test patterns poses a serious problem to the IC industry. A number of existing ATPG algorithms based on the D algorithm use heuristics to guide the decision process in the D-propagation and justification to improve the efficiency. The heuristics used by ATPG algorithm are based on structural, functional and probabilistics measures. These measures are commonly referred to as line controllability and observability and they are combined under the , more general notion of testability. The measures used by ATPG algorithms can be computed only once, during a preprocessing stage (static testability measures - STM's) or can be calculated dinamically, updating the testability measures during the test generation process (dymanic testability measures - DTM's). For some circuits, replacing STM's by DTM's decreases the average number of backtrackings per generated vector. Despite these decrease, the total CPU time per generated vector is greater when using DTM's instead of STM's. So, DTM's only must be used if the STM's don't present a good performance. This can be done by STM's until a certain number of backtrackings. If a test pattern has still not been found, then DTM's are used. Therefore, it is yet necessary to search for ways to improve the dynamic process and decrease the CPU time requirements. In the original approach some techniques for reducing the computational overhead of DTM's based on the well-know technique of selective path tracing are presented. In this work, the combined use of heuristics are analised and alternative techniques — the heuristics of partial recalculus and not free lines recalculus — are proposed. These alternative techniques were developed in order to minimize the overhead of the DTM's calculus. It is yet proposed the pre-implication technique which transfers to memory the algorithm complexity. It includes a preprocessing stage which storages all necesary informations to the generation of all test vectors. So, these informations don't need be computed in the generation of each test vector. The implementation of the D-Algorithm with diferent heuristics has possibilited a practical experiment. It was possible to analise the performance of the D-Algorithm on diferent circuit types and to demonstrate the efficiency of one of the proposed heuristics.

A geração de testes para circuitos combinacionais com fan-outs recovergentes é um problema NP-completo. Com o rápido crescimento da complexidade dos circuitos fabricados, a geração de testes passou a ser um sério problema para a indústria de circuitos integrados. Muitos algoritmos de ATPG (Automatic Test Pattern Generation) baseados no algoritmo D, usam heurísticas para guiar o processo de tomada de decisão na propagação n e na justificação das constantes de forma a aumentar sua eficiencia. Existem heurísticas baseadas em medidas funcionais, estruturais e probabilísticas. Estas medidas são normalmente referidas como observabilidade e controlabilidade que fazem parte de um conceito mais geral, a testabilidade. As medidas que o algoritmo utiliza podem ser calculadas apenas uma vez, durante uma etapa de pré-processamento (medidas de testabilidade estáticas - STM's), ou dinamicamente, recalculando estas medidas durante o processamento sempre que elas forem necessárias (medidas de testabilidade dinâmicas — DTM's). Para alguns circuitos, o use de medidas dinâmicas ao invés de medidas estáticas diminui o número de backtrackings pcir vetor gerado. Apesar disto, o tempo total de CPU por vetor aumenta. Assim, as DTM's só devem ser utilizadas quando as STM's não apresentam uma boa performance. Isto pode ser feito utilizando-se as medidas estáticas ate um certo número de backtrackings. Se o padrão de teste não for encontrado, então medidas dinâmicas são utilizadas. Entretanto, a necessário ainda buscar formas de melhorar o processo dinâmico, diminuindo o custo computacional. A proposta original do calculo das DTM's apresenta algumas técnicas, baseadas em selective tracing, com o objetivo de reduzir o custo computacional. Este trabalho analisa o use combinado de heurísticas e propõe técnicas alternativas, na forma das heurísticas de recalculo parcial e recalculo de linhas não free, que visam minimizar o overhead do calculo das DTM's. E proposta ainda a técnica de Pré-implicação que transfere a complexidade do algoritmo para a memória. Isto é feito através de um preprocessamento que armazena informações necessárias para a geração de todos os vetores de teste. De outra forma estas informações teriam de ser calculadas na geração de cada um destes vetores. A implementação do algoritmo D com as várias heurísticas permitiu a realização de um experimento pratico. Isto possibilitou a análise quantitativa da performance do algoritmo D para vários tipos de circuitos e demonstrou a eficiência de uma das heurísticas propostas neste trabalho. / The test generation for combinational circuits that contain reconvergence is a NP-complete problem. With the rapid increase in the complexity of the fabricated circuits, the generation of test patterns poses a serious problem to the IC industry. A number of existing ATPG algorithms based on the D algorithm use heuristics to guide the decision process in the D-propagation and justification to improve the efficiency. The heuristics used by ATPG algorithm are based on structural, functional and probabilistics measures. These measures are commonly referred to as line controllability and observability and they are combined under the , more general notion of testability. The measures used by ATPG algorithms can be computed only once, during a preprocessing stage (static testability measures - STM's) or can be calculated dinamically, updating the testability measures during the test generation process (dymanic testability measures - DTM's). For some circuits, replacing STM's by DTM's decreases the average number of backtrackings per generated vector. Despite these decrease, the total CPU time per generated vector is greater when using DTM's instead of STM's. So, DTM's only must be used if the STM's don't present a good performance. This can be done by STM's until a certain number of backtrackings. If a test pattern has still not been found, then DTM's are used. Therefore, it is yet necessary to search for ways to improve the dynamic process and decrease the CPU time requirements. In the original approach some techniques for reducing the computational overhead of DTM's based on the well-know technique of selective path tracing are presented. In this work, the combined use of heuristics are analised and alternative techniques — the heuristics of partial recalculus and not free lines recalculus — are proposed. These alternative techniques were developed in order to minimize the overhead of the DTM's calculus. It is yet proposed the pre-implication technique which transfers to memory the algorithm complexity. It includes a preprocessing stage which storages all necesary informations to the generation of all test vectors. So, these informations don't need be computed in the generation of each test vector. The implementation of the D-Algorithm with diferent heuristics has possibilited a practical experiment. It was possible to analise the performance of the D-Algorithm on diferent circuit types and to demonstrate the efficiency of one of the proposed heuristics.

abstract: Recently, automation, shared use, and electrification are proposed and viewed as the “three revolutions” in the future transportation sector to significantly relieve traffic congestion, reduce pollutant emissions, and increase transportation system sustainability. Motivated by the three revolutions, this research targets on the passenger-focused scheduled transportation systems, where (1) the public transit systems provide high-quality ridesharing schedules/services and (2) the upcoming optimal activity planning systems offer the best vehicle routing and assignment for household daily scheduled activities. The high quality of system observability is the fundamental guarantee for accurately predicting and controlling the system. The rich information from the emerging heterogeneous data sources is making it possible. This research proposes a modeling framework to systemically account for the multi-source sensor information in urban transit systems to quantify the estimated state uncertainty. A system of linear equations and inequalities is proposed to generate the information space. Also, the observation errors are further considered by a least square model. Then, a number of projection functions are introduced to match the relation between the unique information space and different system states, and its corresponding state estimate uncertainties are further quantified by calculating its maximum state range. In addition to optimizing daily operations, the continuing advances in information technology provide precious individual travel behavior data and trip information for operational planning in transit systems. This research also proposes a new alternative modeling framework to systemically account for boundedly rational decision rules of travelers in a dynamic transit service network with tight capacity constraints. An agent-based single-level integer linear formulation is proposed and can be effectively by the Lagrangian decomposition. The recently emerging trend of self-driving vehicles and information sharing technologies starts creating a revolutionary paradigm shift for traveler mobility applications. By considering a deterministic traveler decision making framework, this research addresses the challenges of how to optimally schedule household members’ daily scheduled activities under the complex household-level activity constraints by proposing a set of integer linear programming models. Meanwhile, in the microscopic car-following level, the trajectory optimization of autonomous vehicles is also studied by proposing a binary integer programming model. / Dissertation/Thesis / Doctoral Dissertation Civil, Environmental and Sustainable Engineering 2018

Les débris spatiaux sont devenus une menace considérable pour la viabilité des satellites opérationnels en orbite basse. Afin de pouvoir éviter des collisions accidentelles, des systèmes de surveillance de l'espace existent mais sont limités en performances de détection pour les objets de petite taille (diamètre inférieur à 10cm), ce qui pousse à l'étude de nouvelles solutions. Cette thèse a pour objectif d'appuyer la faisabilité d'un système radar au sol utilisant un champ de veille étroit pour le catalogage de petits débris en orbite basse. Un tel système fournirait en effet des observations dites « isolées », c'est-à-dire qu'une orbite n'est pas immédiatement déductible de chacune d'entre elles. Le grand nombre combinaisons nécessaires est alors prohibitif en termes de temps de calcul pour la résolution de ce problème de pistage. Nous proposons dans ces travaux une nouvelle méthode pour initialiser les pistes, c'est-à-dire associer des observations isolées avec une faible ambiguïté et en déduire des orbites précises. Les pistes ainsi obtenues sont combinées et filtrées grâce à un algorithme de pistage multicible que nous avons adapté aux particularités du problème. Avec un taux de couverture de plus de 80 % obtenu en temps réel sur 3 jours pour des scénarios de 500 à 800 objets en plus d'un fort taux de fausses alarmes, les performances de la méthode proposée tendent à prouver la faisabilité du système envisagé. Afin d'extrapoler les résultats obtenus à de plus fortes densités d'observations, nous proposons un modèle de complexité combinatoire calibré sur les performances de l'algorithme aux faibles densités. L'apport d'un second capteur identique est également étudié et met en évidence un point de compromis entre réactivité et complexité combinatoire, ce qui offre un degré de liberté supplémentaire dans la conception d'un tel système. / Space debris have become a significant threat to the viability of operational satellites in Low-Earth-Orbit. In order to avoid accidental collisions, space surveillance systems exist but their detection performance is limited for the small debris (less than 10cm). New solutions are then at study. This thesis aims at supporting the feasibility of a ground-based radar sensor with a narrow-fence type field of regard for the cataloging of the small space debris. Such a system would produce “isolated” observations, that is to say that an orbit is not directly available from each one of them. The large number of potential combinations is then computationally prohibitive for solving this tracking problem. In this work, we propose a new method for track initiation, i.e. associating isolated observations with little ambiguity and deduce accurate orbits. The obtained set of tracks are combined and filtered using an multitarget tracking algorithm that we have adapted to the peculiarities of the problem. With a coverage rate of more than 80% in real-time on 3 days for 500 to 800-objects scenarios in addition of a high false alarm rate, the performance of the proposed method supports the feasibility of the considered system. Aiming at extrapolating the obtained results to higher observation densities, we propose a combinatorial complexity model calibrated with the algorithm performance for low detection densities. The contribution of a second identical sensor is also assessed and reveals a possible trade-off between reactivity and combinatorial complexity, which offers an additional degree of freedom in the design of such a system.

O processo de estimação de estado em sistemas elétricos de potência está sujeito a três tipos de erros: erros nas medidas analógicas (erros grosseiros); erros devido a informações erradas quanto aos estados de chaves e/ou disjuntores (erros topológicos) e erros causados por informações erradas de algum parâmetro do sistema (erros de parâmetros). É drástico o efeito de erros de parâmetros, para o processo de estimação de estado, normalmente intolerável, sendo, entretanto, menos evidente que os erros grosseiros e topológicos. Aproveitando o fato de que certas medidas não sofrem mudanças significativas de valor, durante um determinado intervalo de tempo, propõe-se uma metodologia para estimação de estado e parâmetros de linhas de transmissão. Na metodologia proposta, que se baseia nas equações normais, o vetor de estado convencional é aumentado para a inclusão dos parâmetros a serem estimados. Este vetor de estado aumentado é então estimado através de uma grande quantidade de medidas, obtidas em diversas amostras, durante um intervalo de tempo em que as variáveis de estado do sistema não tenham sofrido alterações significativas de valor. Esta situação ocorre tipicamente à noite, fora dos horários de pico. Propõe-se também uma metodologia para análise de observabilidade para o estimador proposto. Para comprovar a eficiência das metodologias propostas, vários testes foram realizados, utilizando os sistemas de 6, 14 e 30 barras do IEEE. / The process of power system state estimation is subjected to three types of errors: errors in analogical measurements (gross errors), incorrect information about the status of switching devices (topology errors) and incorrect information about the model of the systems equipment (parameter errors). The effects of parameter errors on the process of power system state estimation are drastic and less evident to detect than gross and topology errors. Taking advantage of the fact that a certain fraction of the measurements varies over a small range in a certain period of time, a methodology to estimative transmission line parameters and state based on normal equations has been proposed. In such methodology, which is based on normal equations, the traditional state vector is expanded to include the parameters to be estimated. This augmented state vector is estimated through a large collection of measurements, recorded within several snapshots of the power system, during which the actual system state varies over a small range. This situation typically occurs during the night off-peak periods. An observability analysis methodology is also proposed for the presented estimator. To prove the efficiency of the methodologies, several tests were made using the systems of 6, 14 and 30 buses from IEEE.