38,411 research outputs found

    Intersection SPaT Estimation by means of Single-Source Connected Vehicle Data

    Get PDF
    The file attached to this record is the author's final peer reviewed version.Current traffic management systems in urban networks require real-time estimation of the traffic states. With the development of in-vehicle and communication technologies, connected vehicle data has emerged as a new data source for traffic measurement and estimation. In this work, a machine learning-based methodology for signal phase and timing information (SPaT) which is highly valuable for many applications such as green light optimal advisory systems and real-time vehicle navigation is proposed. The proposed methodology utilizes data from connected vehicles travelling within urban signalized links to estimate the queue tail location, vehicle accumulation, and subsequently, link outflow. Based on the produced high-resolution outflow estimates and data from crossing connected vehicles, SPaT information is estimated via correlation analysis and a machine learning approach. The main contribution is that the single-source proposed approach relies merely on connected vehicle data and requires neither prior information such as intersection cycle time nor data from other sources such as conventional traffic measuring tools. A sample four-leg intersection where each link comprises different number of lanes and experiences different traffic condition is considered as a testbed. The validation of the developed approach has been undertaken by comparing the produced estimates with realistic micro-simulation results as ground truth, and the achieved simulation results are promising even at low penetration rates of connected vehicles

    Observer-biased bearing condition monitoring: from fault detection to multi-fault classification

    Get PDF
    Bearings are simultaneously a fundamental component and one of the principal causes of failure in rotary machinery. The work focuses on the employment of fuzzy clustering for bearing condition monitoring, i.e., fault detection and classification. The output of a clustering algorithm is a data partition (a set of clusters) which is merely a hypothesis on the structure of the data. This hypothesis requires validation by domain experts. In general, clustering algorithms allow a limited usage of domain knowledge on the cluster formation process. In this study, a novel method allowing for interactive clustering in bearing fault diagnosis is proposed. The method resorts to shrinkage to generalize an otherwise unbiased clustering algorithm into a biased one. In this way, the method provides a natural and intuitive way to control the cluster formation process, allowing for the employment of domain knowledge to guiding it. The domain expert can select a desirable level of granularity ranging from fault detection to classification of a variable number of faults and can select a specific region of the feature space for detailed analysis. Moreover, experimental results under realistic conditions show that the adopted algorithm outperforms the corresponding unbiased algorithm (fuzzy c-means) which is being widely used in this type of problems. (C) 2016 Elsevier Ltd. All rights reserved.Grant number: 145602

    A Survey on Soft Subspace Clustering

    Full text link
    Subspace clustering (SC) is a promising clustering technology to identify clusters based on their associations with subspaces in high dimensional spaces. SC can be classified into hard subspace clustering (HSC) and soft subspace clustering (SSC). While HSC algorithms have been extensively studied and well accepted by the scientific community, SSC algorithms are relatively new but gaining more attention in recent years due to better adaptability. In the paper, a comprehensive survey on existing SSC algorithms and the recent development are presented. The SSC algorithms are classified systematically into three main categories, namely, conventional SSC (CSSC), independent SSC (ISSC) and extended SSC (XSSC). The characteristics of these algorithms are highlighted and the potential future development of SSC is also discussed.Comment: This paper has been published in Information Sciences Journal in 201
    corecore