WO2022141213A1 - 一种智慧城市智轨车辆故障基因预测方法及系统 - Google Patents
一种智慧城市智轨车辆故障基因预测方法及系统 Download PDFInfo
- Publication number
- WO2022141213A1 WO2022141213A1 PCT/CN2020/141464 CN2020141464W WO2022141213A1 WO 2022141213 A1 WO2022141213 A1 WO 2022141213A1 CN 2020141464 W CN2020141464 W CN 2020141464W WO 2022141213 A1 WO2022141213 A1 WO 2022141213A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- fault
- dna sequence
- prediction
- data
- esns
- Prior art date
Links
- 108090000623 proteins and genes Proteins 0.000 title claims abstract description 52
- 238000000034 method Methods 0.000 title claims abstract description 51
- 108091028043 Nucleic acid sequence Proteins 0.000 claims abstract description 61
- 238000012549 training Methods 0.000 claims abstract description 20
- 238000005070 sampling Methods 0.000 claims abstract description 6
- 239000011159 matrix material Substances 0.000 claims description 46
- 238000005457 optimization Methods 0.000 claims description 44
- 230000006870 function Effects 0.000 claims description 36
- 108020004414 DNA Proteins 0.000 claims description 20
- 230000003595 spectral effect Effects 0.000 claims description 17
- 241000282461 Canis lupus Species 0.000 claims description 16
- 230000014509 gene expression Effects 0.000 claims description 15
- 239000013598 vector Substances 0.000 claims description 15
- 230000008569 process Effects 0.000 claims description 14
- 238000006243 chemical reaction Methods 0.000 claims description 10
- 238000012360 testing method Methods 0.000 claims description 8
- 238000001228 spectrum Methods 0.000 claims description 7
- UYTPUPDQBNUYGX-UHFFFAOYSA-N guanine Chemical compound O=C1NC(N)=NC2=C1N=CN2 UYTPUPDQBNUYGX-UHFFFAOYSA-N 0.000 claims description 6
- RWQNBRDOKXIBIV-UHFFFAOYSA-N thymine Chemical compound CC1=CNC(=O)NC1=O RWQNBRDOKXIBIV-UHFFFAOYSA-N 0.000 claims description 6
- 238000012800 visualization Methods 0.000 claims description 5
- OPTASPLRGRRNAP-UHFFFAOYSA-N cytosine Chemical compound NC=1C=CNC(=O)N=1 OPTASPLRGRRNAP-UHFFFAOYSA-N 0.000 claims description 4
- GFFGJBXGBJISGV-UHFFFAOYSA-N Adenine Chemical compound NC1=NC=NC2=C1N=CN2 GFFGJBXGBJISGV-UHFFFAOYSA-N 0.000 claims description 3
- 229930024421 Adenine Natural products 0.000 claims description 3
- 229960000643 adenine Drugs 0.000 claims description 3
- 230000008859 change Effects 0.000 claims description 3
- 229940113082 thymine Drugs 0.000 claims description 3
- 229940104302 cytosine Drugs 0.000 claims description 2
- 101150046235 esn gene Proteins 0.000 claims 9
- 238000000605 extraction Methods 0.000 description 9
- 238000009826 distribution Methods 0.000 description 7
- 230000009467 reduction Effects 0.000 description 7
- 230000007246 mechanism Effects 0.000 description 5
- 238000003860 storage Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 238000013135 deep learning Methods 0.000 description 4
- 238000001514 detection method Methods 0.000 description 4
- 238000012423 maintenance Methods 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 238000010276 construction Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000009466 transformation Effects 0.000 description 3
- 230000007704 transition Effects 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 238000003745 diagnosis Methods 0.000 description 2
- 238000005259 measurement Methods 0.000 description 2
- 238000011946 reduction process Methods 0.000 description 2
- 108010076504 Protein Sorting Signals Proteins 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000013480 data collection Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 238000003912 environmental pollution Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000004880 explosion Methods 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 239000012634 fragment Substances 0.000 description 1
- 238000011478 gradient descent method Methods 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000012804 iterative process Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
- G06F30/27—Design optimisation, verification or simulation using machine learning, e.g. artificial intelligence, neural networks, support vector machines [SVM] or training a model
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16B—BIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
- G16B25/00—ICT specially adapted for hybridisation; ICT specially adapted for gene or protein expression
- G16B25/10—Gene or protein expression profiling; Expression-ratio estimation or normalisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2111/00—Details relating to CAD techniques
- G06F2111/06—Multi-objective optimisation, e.g. Pareto optimisation using simulated annealing [SA], ant colony algorithms or genetic algorithms [GA]
Definitions
- the invention relates to the field of vehicle fault detection, in particular to a method and system for predicting fault genes of smart city smart rail vehicles.
- ART Autonomous Rail Rapid Transit
- the patent with publication number CN203732247U adopts the method of physical pressure spring switch to diagnose the unit fault signal.
- This method has certain application limitations, and the fault detection method cannot be adaptively adjusted according to the train conditions.
- the research gap in fault early warning is also an urgent problem to be solved.
- the technical problem to be solved by the present invention is to provide a method and system for predicting fault genes of smart city smart rail vehicles in view of the deficiencies of the prior art, so as to improve the accuracy of fault early warning.
- the technical solution adopted in the present invention is: a method for predicting fault genes of intelligent rail vehicles in a smart city, comprising the following steps:
- Predictive modeling based on DNA coding can deeply develop the potential information in the vibration data of train components, resulting in more accurate fault prediction.
- it also includes:
- the resulting predictive model can help industry managers predict the failure of urban smart rail train equipment, so that it can be repaired in advance before the failure occurs.
- step 2) the specific implementation process of encoding the vibration data into a DNA sequence includes:
- A) select the g-th column sample of the original vibration signal X collected, assign the g-th column sample to the initial DNA helical sequence data matrix X h(0) , and the matrix after the assignment is represented as X g ;
- the vibration data encoding based on the continuous projection method can convert the original vibration signal into a U-dimensional feature vector expressed by the four base elements of A, T, C, and G, so as to avoid losing effective information.
- Feature extraction for base pairs of coded gene sequences can find out the most representative features, and use low-dimensional data to express as much high-dimensional information as possible, which can also avoid model overfitting in the modeling process
- step 3 includes:
- E) Increase the number of iterations by 1, take the new pool layer number ⁇ m+1 and pool matrix spectral radius ⁇ m+1 as the input of the objective optimization function of the multi-objective gray wolf optimization algorithm, and return to step C) until the multi-objective gray
- the target optimization function value of the wolf optimization algorithm reaches the expected accuracy or completes the set number of iterations, completes the training of the ESNs deep echo state network, and obtains the optimal parameters ⁇ optimal and ⁇ optimal .
- the optimal parameters ⁇ optimal and ⁇ optimal correspond to the ESNs
- the deep echo state network model is the prediction model.
- the ESNs deep echo state network model has excellent data fitting ability.
- the ESNs deep echo state network model with parameters optimized by the multi-objective gray wolf optimization algorithm has a smaller prediction error and can more accurately predict vehicle failures.
- ⁇ is the number of reservoir layers
- ⁇ is the spectral radius of the reservoir matrix
- V t is the true value of the DNA sequence, is the average of all true values
- N is the length of the DNA sequence, and 1 ⁇ t ⁇ N
- CT indicates the failure of the car body
- ZXJ indicates the failure of the bogie
- QY indicates the failure of the traction drive control system
- ZD indicates the failure of the braking system
- LJ indicates the failure of the vehicle end connection device
- SL indicates the failure of the current receiving device
- SB indicates the failure of the vehicle interior equipment and cab equipment
- NSE and KGE are indicators used to measure the stability of the model. Setting the objective function for optimization based on these two indicators can make the prediction model more robust.
- It also includes: using the pre-determined candidate vehicle component fault gene V s as the input of the clustering model to build a template library. Building a template library can help relevant industry personnel compare the similarities and differences between current faults and historical faults, so as to take more accurate maintenance operations.
- the specific implementation process of building a template library includes:
- Step 1 Use the pre-determined candidate vehicle component fault gene V s obtained by the continuous projection method as the input of the random adjacency embedding algorithm to obtain the conditional probability p j
- i of points vi and v j is minimized to obtain the minimized conditional probability p j
- Step 2 Calculate the minimum value p ij of the difference between high and low dimensional conditional probability according to the conditional probability minimization result, Minimize the cost function L by gradient descent: get the optimal solution the optimal solution Output as the clustering result of the tSNE clustering algorithm; the clustering result corresponds to the template library template of the ART urban smart rail vehicle:
- CT, ZXJ, QY, ZD, LJ, SL, SB are the fault categories in the DNA sequence template library; CT: vehicle body fault; ZXJ: bogie fault; QY: traction drive control system fault; ZD: braking system fault; LJ: vehicle end connection device fault; SL: current receiving device fault; SB: vehicle interior equipment and cab equipment fault; n represents the number of data samples, and KL represents the divergence.
- the combination of continuous projection method and t-SNE clustering method avoids the disadvantageous situation that a large amount of effective information about vehicle failures is lost, and soft clustering can obtain more reliable template library information.
- step 4 it also includes:
- the method of the present invention also includes:
- the specific implementation process includes: performing binary inverse coding conversion on the prediction results output by the prediction model, wherein the binary inverse The combined base pair of adenine and thymine in the prediction result after code conversion is decoded and corresponds to the number 0, that is, the degree of equipment failure does not reach the warning line threshold, and the combined base pair of guanine and Ccytosine is decoded and corresponds to Number 1, that is, the degree of equipment failure has reached the warning line threshold, and it must be repaired.
- the present invention also provides a smart city smart rail vehicle fault gene prediction system, which includes computer equipment; the computer equipment is configured or programmed to perform the steps of the above method.
- the present invention has the following beneficial effects:
- the present invention provides an accurate fault prediction method based on a DNA sequence template library on the basis of the existing fault diagnosis technology of intelligent rail vehicles.
- the data acquisition module combining wireless sensor network and high and low frequency vibration measuring instruments can collect a large number of historical fault signals, and the data encoding module of multi-source vibration signals converts vibration signals into coded gene sequences, which can encode DNA sequences of base pairs
- the feature extraction module can screen out the pre-determined candidate vehicle component fault genes, and the construction of the DNA sequence template library module can help the relevant industry personnel compare the similarities and differences between newly detected faults and historical faults, and can encode the DNA helix sequence deep learning fault early warning modeling
- the module can predict potential failures of train components.
- the multi-objective optimization-based DNA helix sequence prediction strategy module can improve the accuracy of fault warning.
- the DNA sequence helix decoding and the fault visualization module of the virtual template library help maintenance personnel to quickly identify fault types.
- the present invention builds a DNA sequence template library that can encode fault modules, corresponding to the seven major components of urban smart rail vehicles (car body, bogie, traction drive control system, braking system, vehicle end connection device, current receiving device, Vehicle interior equipment and cab equipment).
- the fault template library is used as a matching template for virtual faults, which provides an accurate direction for training a reliable fault early warning model.
- An accurate and complete fault information database is more conducive to the staff to compare the similarities and differences of the faults of the new and old equipment of the autonomous rail train to carry out fault maintenance.
- the present invention proposes a modeling method for fault diagnosis and multi-fault prediction matching of autonomous rail trains.
- Vibration sensors are installed on the major components of the smart rail train to collect real-time vibration data signals, and through the wireless sensor network (WSN). ) for transmission, and establish deep echo state networks (ESNs) for multi-objective optimal prediction of equipment failures, which greatly improves the accuracy of failure prediction.
- WSN wireless sensor network
- ESNs deep echo state networks
- a complete system framework is built around data collection, original signal helical coding and decoding, gene signal conversion, gene sequence feature extraction, establishment of a DNA sequence template library for failure modules, failure prediction, etc.
- the model can be embedded into the Hadoop big data platform for training to improve the training speed.
- FIG. 1 is a schematic diagram of a method according to an embodiment of the present invention.
- Step 1 Collection of historical failure data of new smart rail train components
- the invention uses high and low frequency sensors and electric sensors to collect historical vibration information data of various types of urban smart rail vehicle components, and the technology change greatly reduces the cost of popularization and application of sensors.
- the wireless sensor network plays an important role.
- the information acquisition modules involved in step 1 include the vibration amplitude acquisition module of vehicle components, Vibration frequency acquisition module and vibration period acquisition module.
- the collected information includes the vibration amplitude A, frequency f, period T and other signals of vehicle components, which need to be filtered through a filter, and finally the original vibration signal X is obtained.
- low frequency vibration measurement relative type moving coil type electric sensor
- high frequency vibration measurement inertia type moving coil type electric sensor.
- Electric sensors can perform vibration tests on important components such as some civilian industrial vehicles.
- Step 2 Code conversion of DNA helix sequence data from multi-source vibrational signals
- the collected multi-source vibration data needs to be encoded into DNA sequences.
- the encoded vibration signals have more obvious and distinguishable characteristics, which facilitates subsequent prediction work.
- the base data of DNA sequence is a high-dimensional or ultra-high-dimensional matrix in mathematical expression after being arranged.
- robust and robust dimensionality reduction processing is required.
- the Continuous Projection Algorithm (SPA) processing of DNA helical sequences can achieve rapid dimensionality reduction to solve the collinearity problem, with few parameters to be adjusted and the idea is simple (see Soares SF C, Gomes A A, Araujo M C U, et al.
- the sample of the gth column of the collected original vibration signal X is selected and assigned to the initial DNA helix sequence data matrix X h(0) , and the assigned matrix is expressed as X g .
- the next step is to calculate the orthogonal projection of the assigned DNA helix sequence data matrix X g and the maximum projection value matrix X h(z-1) in the subspace:
- F is the projection operator, that is, the projection of the initial helical sequence orthogonal to other helical sequences; h(z-1) is the maximum projection value; h(0) is the minimum projection value, and so on, for a total of Z Projection; where the maximum projection value is normalized to be G, that is, vertical projection, and the minimum projection is 0, that is, parallel projection. Starting from the minimum, the projection angle changes by a value ⁇ , and the projection value increases.
- z is the ordinal number of the projected value.
- the data matrix set Y with dimension U obtained after the continuous projection algorithm (SPA) dimension reduction process can be expressed as follows:
- the selection of the initial helical sequence X h(0) is very critical, which directly affects the accuracy of the algorithm.
- the algorithm can be regarded as a matrix projection in essence. In the present invention, it corresponds to the transformation of the dimension of the data type, and the vibration signal is mapped into a set of low-dimensional gene expression, and these genes represent the expression of the faulty component.
- step 2 the equipment vibration signal X collected in step 1 needs to be transformed into a gene sequence.
- the dimension reduction dimension U is defined according to the degree to which information needs to be preserved.
- the continuous projection method (SPA) reduces the dimension of the original vibration data to obtain Y, and Y is used as a set of data, and the amplitude of the data in the matrix varies from high to low. , according to the empirical threshold, the data is normalized.
- Y is roughly divided into 4 categories according to the proportion of 25% of one base, namely A, T, C, G, after normalization
- the data whose amplitude is [0.75, 1] is defined as class A, and then the final proportion of A, T, C, and G is adjusted according to the ratio of the number of sensors in each part of the device.
- the vibration sample data after the continuous projection algorithm (SPA) dimensionality reduction process is defined as the U-dimensional feature vector expressed by the four base elements of A, T, C, and G, that is, the transformed encoded gene required for the subsequent steps.
- Sequence signal the purpose here is to divide the data into 4 categories.
- B 1 , B 2 , B 3 , and B 4 are used to replace the four bases "A, T, C, G" for expression.
- the preprocessed vibration signal is converted into an encoded gene sequence.
- Step 3 Base pair feature extraction of the encoded gene sequence
- the DNA sequence after coding conversion does not yet have the characteristics for efficient and high-precision prediction. Feature extraction is required to extract the deep expression of equipment failures, and arrange and combine them to form predictable DNA sequences.
- step 1 selection of historical fault data
- step 2 coding conversion of DNA helical sequence data
- step 2 coding conversion of DNA helical sequence data
- the DNA sequence feature extraction of the faulty parts of the independent autonomous rail train is carried out by calculating the content, position and transition probability of the bases in the transformed gene sequence.
- n i is defined as the number of occurrences of a single base point B i in the DNA sequence S.
- n ij is defined as the occurrence of the base pair B i B j in the DNA sequence S. number of times.
- the specific calculation formula is:
- W ij can be regarded as the probability of base B i being transferred to base B j , that is, the base transfer probability vector.
- the content vectors are C 1 , C 2 , C 3 ,...,C U .
- the base position ratio D i is obtained by conversion, and the mathematical expression is as follows:
- the position ratio vectors are D 1 , D 2 , D 3 ,...,D U .
- a usable U-dimensional vector can be obtained.
- These feature vectors are defined as pre-decided candidate vehicle component failure genes.
- Step 4 Build the DNA sequence template library of the faulty module
- the candidate fault gene feature vector extracted in step 3 is input into the (t-distributed random neighborhood embedding) t-SNE clustering model in this link, and the DNA sequence template library of the fault module is established through fine clustering division.
- the template library corresponds to the seven major sections of the urban smart rail vehicle, which are the car body (CT) library, the bogie (ZXJ) library, the traction drive control system (QY) library, the braking system (ZD) library, and the vehicle end connection device. (LJ) library, current receiving device (SL) library, vehicle interior equipment and cab equipment (SB) library.
- CT car body
- ZXJ the bogie
- QY traction drive control system
- ZD braking system
- LJ current receiving device
- SB vehicle interior equipment
- the continuous projection algorithm SPA
- the continuous projection algorithm is first used to reduce the vibration signal to a small and medium-sized space.
- the multi-dimensional space U is expressed by multi-dimensional base features, and finally the t-SNE clustering method is used to obtain the final clustering result, which can achieve the effect of soft clustering.
- Each clustering result corresponds to the failure of a component, and the clustered results are sent to the predictor model in step 5 for training, and then the DNA sequence template is used for secondary detailed division.
- t-SNE is a nonlinear dimensionality reduction algorithm that can explore high-dimensional data.
- the DNA sequence clustering method of the vehicle fault module t-SNE is as follows:
- the data is transformed by random adjacency embedding (SNE).
- SNE random adjacency embedding
- the high-dimensional Euclidean distance between the data is transformed and expressed as a similar conditional probability.
- V i of the candidate vehicle component fault gene The mathematical calculation of the conditional probability p j
- Vi , V j are the data points in the DNA sequence S, and ⁇ i is the Gaussian variance centered on the data points Vi , V j .
- s is the sequence number of the pre-determined candidate vehicle component fault gene.
- the optimal solution is several clusters that can be expressed as CT, ZXJ, QY, ZD, LJ, SL and SB.
- y is the number of iterations in the iterative process
- y max is the maximum total number of iterations
- ⁇ is the learning rate
- ⁇ (y) is the learning momentum
- the template library corresponds to the fault type, and a gene feature corresponds to the fault of a component. Finally, the system issues a diagnostic warning report.
- the final optimal solution The clustering results can be expressed as several clusters of CT, ZXJ, QY, ZD, LJ, SL, and SB, and visualized as a clustering template of the DNA sequences of seven large parts of ART urban smart rail vehicles.
- the template library expression corresponding to the clustering results is as follows:
- CT car body
- ZXJ bogie
- QY traction drive control system
- ZD braking system
- LJ vehicle end connection device
- SL current receiving device
- SB vehicle interior equipment and cab equipment.
- Step 5 Multi-objective optimization deep learning fault warning modeling that encodes DNA helical sequences
- the pre-determined candidate vehicle component fault genes are normalized and input into the model for fault prediction training of urban smart rail train equipment.
- the specific modeling process is as follows:
- NSE Nash Sutcliffe Efficiency
- KGE Klingupta Efficiency
- the number of layers ⁇ of the deep echo state network reservoir and the radius ⁇ of the matrix spectrum of each layer reservoir are set as variables to be optimized.
- the reservoir node of the deep echo state network is initially set to 15, and the input and output layers of each layer of the network are relative to each other, and then the deep feature representation of the encoded data is learned.
- Model training The training set, the initial number of layers ⁇ 0 of the ESNs deep echo state network model reservoir and the initial radius ⁇ 0 of the matrix spectrum of each layer reservoir are used as the input of the ESNs deep echo state network model to have the number of reservoir layers ⁇ 0
- the ESNs deep echo state network model with m and the reservoir matrix spectral radius ⁇ m is used as the output to train the ESNs deep echo state network model.
- the multi-objective gray wolf optimization algorithm is embedded in the leader selection mechanism and the archive storage mechanism to improve the convergence ability.
- the test set, the number of reservoir layers ⁇ m and the spectral radius ⁇ m of the reservoir matrix are used as the input of the objective optimization function of the multi-objective gray wolf optimization algorithm, and the value of the objective optimization function is calculated; where m represents the current number of iterations, 0 ⁇ m ⁇ 200.
- ⁇ is the number of reservoir layers
- ⁇ is the spectral radius of the reservoir matrix
- V t is the true value of the DNA base sequence
- N is the length of the DNA sequence
- ZXJ indicates the bogie Fault
- QY means traction drive control system fault
- ZD means braking system fault
- LJ means vehicle end connecting device fault
- SL means current receiving device fault
- SB means vehicle interior equipment and cab equipment fault.
- the number of iterations is increased by 1, and the new pool layer number ⁇ m+1 and pool matrix spectral radius ⁇ m+1 are used as the input of the objective optimization function of the multi-objective gray wolf optimization algorithm, and return to step 4) until the multi-objective gray
- the target optimization function value of the wolf optimization algorithm reaches the expectation or the set number of iterations is completed, the ESNs deep echo state network training is completed, and the optimal parameters ⁇ optimal and ⁇ optimal are obtained, and the optimal parameters ⁇ optimal and ⁇ optimal correspond to the depth of ESNs
- the echo state network model is the prediction model.
- the fault category belongs to a sub-fault in a certain fault category in the template library, the fault category is classified into the template library of the fault and recorded as the old fault If the fault category does not belong to any category in the template library, update the template library, directly add the prediction result to the template library, and mark it as a new fault
- the DNA sequence template library guides the direction for the subsequent training of the prediction model.
- Step 6 Decoding of DNA Helix Sequences and Visualization of Failure of Virtual Template Library
- the original vibration data is subjected to coding transformation and feature extraction steps, the purpose of which is to extract the depth feature expression of the original sequence with inconspicuous original characteristics, and then input the easily distinguishable depth feature sequence into the Go to the prediction model for training.
- the sequence results predicted by the trained model are still deep feature expressions.
- the prediction results of each DNA fragment are connected end to end to form a complete base sequence code, and the corresponding faults correspond to the virtual DNA template library. specific type in .
- the representation of the results is not concrete, so it is necessary to decode the DNA sequence and visualize the failure to restore to the predicted data whose data type corresponds to the original vibration data.
- the prediction model obtained in step 5 is used to predict the vibration data collected in real time, and then the prediction results output by the prediction model (the code of the ART urban smart rail vehicle failure prediction output result)
- the mechanism is based on the base coding system in step 3, so the composition of its sequence is based on A, T, G, C bases and is obtained through deep learning prediction modeling) to perform binary inverse coding conversion.
- the prediction output result is decoded to display the 0/1 state, that is, the visualization of the prediction result is completed, so as to realize timely warning.
- the binding base pairs of A (adenine) and T (thymine) correspond to the number 0 after decoding, that is, the degree of equipment failure does not reach the warning line threshold, and the binding bases of G (guanine) and C (cytosine) After decoding, the corresponding number 1, that is, the equipment failure degree has reached the warning line threshold, and it must be repaired.
- the fault early warning model can also provide a reliable guarantee for the safe and stable operation of ART urban smart rail vehicles.
- the DNA sequence data storage method provides infinite possibilities for information transmission, reception and storage, and the storage time can fully meet the needs of information use in the era of big data.
- Step 7 Distributed System Infrastructure Embedding
- the module can be embedded in the distributed system infrastructure to speed up model training and self-learning update speed, so as to meet application requirements to a greater extent .
- Available distributed system infrastructures include MapReduce, Apache Spark, Hadoop, etc. (see Dittrich J,Quiané-Ruiz J A.Efficient big data processing in Hadoop MapReduce[J].Proceedings of the VLDB Endowment,2012,5(12):2014 -2015.).
- MapReduce MapReduce
- Apache Spark Hadoop
- Hadoop etc.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Business, Economics & Management (AREA)
- Strategic Management (AREA)
- Human Resources & Organizations (AREA)
- Life Sciences & Earth Sciences (AREA)
- Economics (AREA)
- Genetics & Genomics (AREA)
- General Physics & Mathematics (AREA)
- Evolutionary Computation (AREA)
- Medical Informatics (AREA)
- Biotechnology (AREA)
- Development Economics (AREA)
- Artificial Intelligence (AREA)
- Computer Vision & Pattern Recognition (AREA)
- General Health & Medical Sciences (AREA)
- Software Systems (AREA)
- Computer Hardware Design (AREA)
- Geometry (AREA)
- General Engineering & Computer Science (AREA)
- Evolutionary Biology (AREA)
- Bioinformatics & Computational Biology (AREA)
- Spectroscopy & Molecular Physics (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Game Theory and Decision Science (AREA)
- Molecular Biology (AREA)
- Biophysics (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Testing Of Devices, Machine Parts, Or Other Structures Thereof (AREA)
Abstract
Description
Claims (10)
- 一种智慧城市智轨车辆故障基因预测方法,其特征在于,包括以下步骤:1)采集列车部件的振动数据X h(0)=[e 1,e 2,e 3,...,e n]∈R,其中,e 1,e 2,...,e n代表列车上每一个采样点的振动信息;n表示采样点个数;2)将所述振动数据编码为DNA序列,提取所述DNA序列的特征,并排列组合所述特征,形成可预测的DNA序列,即候选车辆部件故障基因;3)利用所述候选车辆部件故障基因训练ESNs深度回声状态网络,得到预测模型;优选地,还包括:4)根据实时采集的振动数据,利用所述预测模型预测车辆故障。
- 根据权利要求1所述的一种智慧城市智轨车辆故障基因预测方法,其特征在于,步骤2)中,将所述振动数据编码为DNA序列的具体实现过程包括:A)选中采集的原始振动信号X的第g列样本,将所述第g列样本赋值到初始的DNA螺旋序列数据矩阵X h(0),赋值后的矩阵表示为X g;B)计算赋值后的DNA螺旋序列数据矩阵X g与最大投影值矩阵X h(z-1)在子空间中的正交投影,得到维度为U的数据矩阵集合Y;z是投影值的序号;h(z-1)是最大投影值;最大投影值正规化后为G,即垂直投影,最小投影值h(0)为0,即平行投影,从最小值开始投影角度每变化一个数值Υ,投影值增大 Z为投影值数量;C)将所述数据矩阵集合Y划分为由A,T,C,G四种碱基元素表达的U维特征向量;将A,T,C,G整合为DNA序列S=S 1,S 2,S 3,...,S N;其中,N为DNA序列长度。
- 根据权利要求1~3之一所述的一种智慧城市智轨车辆故障基因预测方法,其特征在于,步骤3)的具体实现过程包括:A)将车辆部件故障基因V s随机划分为训练集和测试集;初始化多目标灰狼优化算法的迭代次数m、预期精度;B)将所述训练集、ESNs深度回声状态网络模型储蓄池的初始层数θ 0和每一层储蓄池矩阵谱的初始半径κ 0作为ESNs深度回声状态网络模型的输入,以具有储蓄池层数θ m和储蓄池矩阵谱半径κ m的ESNs深度回声状态网络模型作为输出,训练ESNs深度回声状态网络模型;C)将所述测试集、储蓄池层数θ m和储蓄池矩阵谱半径κ m作为多目标灰狼优化算法两个目标优化函数的输入,计算两个目标优化函数的值;D)根据两个所述目标优化函数的值的乘积,更新ESNs深度回声状态网络储蓄池层数和每一层储蓄池矩阵谱半径的搜索路径,使得下一次两个目标函数值的乘积大于当前次两个目标函数值的乘积,从而得到新的储蓄池层数θ m+1和储蓄池矩阵谱半径κ m+1;E)迭代次数加1,将新的储蓄池层数θ m+1和储蓄池矩阵谱半径κ m+1作为多目标灰狼优化算法目标优化函数的输入,返回步骤C),直至多目标灰狼优化算法目标优化函数值达到预期精度或完成所设定的迭代次数,完成ESNs深度回声状态网络训练,并获取最优参数θ optimal和κ optimal,该最优参数θ optimal和κ optimal对应的ESNs深度回声状态网络模型即预测模型。
- 根据权利要求1~5之一所述的一种智慧城市智轨车辆故障基因预测方法,其特征在于,还包括:将预判定的候选车辆部件故障基因V s作为聚类模型的输入,搭建模板库。
- 根据权利要求6所述的一种智慧城市智轨车辆故障基因预测方法,其特征在于, 搭建模板库的具体实现过程包括:步骤1:将连续投影法降维得到的预判定的候选车辆部件故障基因V s作为随机邻接嵌入算法的输入,得到高维数据点V i和V j的条件概率p j|i、低维数据点v i和v j的条件概率q j|i,将条件概率最小化,得到最小化的高维数据的条件概率p j|i和最小化的低维数据的条件概率q ij;步骤2:依据条件概率最小化结果计算出高低维条件概率差异的最小值p ij, 通过梯度下降法最小化代价函数L: 得到最优解 将所述最优解 作为tSNE聚类算法的聚类结果输出;所述聚类结果对应ART城市智轨车辆的模板库template:template=[CT,ZXJ,QY,ZD,LJ,SL,SB];其中,CT,ZXJ,QY,ZD,LJ,SL,SB为DNA序列模板库中的故障类别;CT:车体故障;ZXJ:转向架故障;QY:牵引传动控制系统故障;ZD:制动系统故障;LJ:车端连接装置故障;SL:受流装置故障;SB:车辆内部设备和驾驶室设备故障;KL表示散度。
- 根据权利要求1~8之一所述的一种智慧城市智轨车辆故障基因预测方法,其特征在于,还包括:利用预测模型对实时采集的振动数据进行预测,再利用DNA螺旋序列解码及虚拟模板库实现预测结果的可视化;具体实现过程包括:对预测模型输出的预测结果进行二进制逆编码转换,其中,二进制逆编码转换后的预测结果中的腺嘌呤、胸腺嘧啶的结合碱基对被解码后对应数字0,即设备故障程度未达到警戒线阈值,鸟嘌呤、C 胞嘧啶的结合碱基对被解码后对应数字1,即设备故障程度达到了警戒线阈值,必须进行检修修复。
- 一种智慧城市智轨车辆故障基因预测系统,其特征在于,包括计算机设备;所述计算机设备被配置或编程为用于执行权利要求1~9之一所述方法的步骤。
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/CN2020/141464 WO2022141213A1 (zh) | 2020-12-30 | 2020-12-30 | 一种智慧城市智轨车辆故障基因预测方法及系统 |
AU2020471210A AU2020471210B2 (en) | 2020-12-30 | 2020-12-30 | Fault gene predicting method and system for Autonomous-Rail Rapid Transit vehicle in smart city |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/CN2020/141464 WO2022141213A1 (zh) | 2020-12-30 | 2020-12-30 | 一种智慧城市智轨车辆故障基因预测方法及系统 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2022141213A1 true WO2022141213A1 (zh) | 2022-07-07 |
Family
ID=82259989
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2020/141464 WO2022141213A1 (zh) | 2020-12-30 | 2020-12-30 | 一种智慧城市智轨车辆故障基因预测方法及系统 |
Country Status (2)
Country | Link |
---|---|
AU (1) | AU2020471210B2 (zh) |
WO (1) | WO2022141213A1 (zh) |
Cited By (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN115174639A (zh) * | 2022-09-07 | 2022-10-11 | 吉林信息安全测评中心 | 一种基于物联网的工业设备管理方法和系统 |
CN115333990A (zh) * | 2022-10-14 | 2022-11-11 | 中国人民解放军海军工程大学 | 一种基于郊狼与灰狼混合优化的高效传输路由方法 |
CN116028822A (zh) * | 2023-03-30 | 2023-04-28 | 国网福建省电力有限公司 | 一种电能表误差状态评估方法、系统、设备及存储介质 |
CN116165274A (zh) * | 2023-02-17 | 2023-05-26 | 哈尔滨工业大学 | 基于贝叶斯全局稀疏概率主成分分析的城市轨道损伤识别方法 |
CN116366477A (zh) * | 2023-05-30 | 2023-06-30 | 中车工业研究院(青岛)有限公司 | 一种列车网络通信信号检测方法、装置、设备及存储介质 |
CN116579112A (zh) * | 2023-05-17 | 2023-08-11 | 西南交通大学 | 一种基于轨道交通网络的应急桥接公交驻车点选址方法 |
CN116861218A (zh) * | 2023-07-25 | 2023-10-10 | 上海华菱电站成套设备股份有限公司 | 一种矿井提升机关键设备状态监测预警系统 |
CN116956197A (zh) * | 2023-09-14 | 2023-10-27 | 山东理工昊明新能源有限公司 | 基于深度学习的能源设施故障预测方法、装置及电子设备 |
CN117132130A (zh) * | 2023-08-31 | 2023-11-28 | 江西航天国数信息科技有限公司 | 一种实时采集信息进行建模的智慧城市预测系统 |
CN117290764A (zh) * | 2023-11-23 | 2023-12-26 | 湖南省交通科学研究院有限公司 | 基于数据特征分析的治超系统故障智能识别及诊断的方法 |
CN117302293A (zh) * | 2023-08-14 | 2023-12-29 | 北京城建智控科技股份有限公司 | 轮径值预测方法、装置、电子设备及存储介质 |
CN117649876A (zh) * | 2024-01-29 | 2024-03-05 | 长春大学 | 基于gwo算法在gwas数据上检测与复杂疾病相关snp组合的方法 |
WO2024077642A1 (zh) * | 2022-10-12 | 2024-04-18 | 大连理工大学 | 针对航空发动机故障预警的量子回声状态网络模型构建方法 |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7610130B1 (en) * | 2005-07-20 | 2009-10-27 | Sandia Corporation | Physical context management for a motor vehicle |
CN107886193A (zh) * | 2017-10-27 | 2018-04-06 | 太原理工大学 | 一种基于灰狼优化回声状态网络的时序预测方法 |
CN108267312A (zh) * | 2017-12-25 | 2018-07-10 | 北京建筑大学 | 一种基于快速搜索算法的地铁列车轴承智能诊断方法 |
CN108304960A (zh) * | 2017-12-29 | 2018-07-20 | 中车工业研究院有限公司 | 一种轨道交通设备故障诊断方法 |
CN110232415A (zh) * | 2019-06-12 | 2019-09-13 | 中南大学 | 一种基于生物信息特征的列车转向架故障识别方法 |
-
2020
- 2020-12-30 AU AU2020471210A patent/AU2020471210B2/en active Active
- 2020-12-30 WO PCT/CN2020/141464 patent/WO2022141213A1/zh active Application Filing
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7610130B1 (en) * | 2005-07-20 | 2009-10-27 | Sandia Corporation | Physical context management for a motor vehicle |
CN107886193A (zh) * | 2017-10-27 | 2018-04-06 | 太原理工大学 | 一种基于灰狼优化回声状态网络的时序预测方法 |
CN108267312A (zh) * | 2017-12-25 | 2018-07-10 | 北京建筑大学 | 一种基于快速搜索算法的地铁列车轴承智能诊断方法 |
CN108304960A (zh) * | 2017-12-29 | 2018-07-20 | 中车工业研究院有限公司 | 一种轨道交通设备故障诊断方法 |
CN110232415A (zh) * | 2019-06-12 | 2019-09-13 | 中南大学 | 一种基于生物信息特征的列车转向架故障识别方法 |
Cited By (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN115174639A (zh) * | 2022-09-07 | 2022-10-11 | 吉林信息安全测评中心 | 一种基于物联网的工业设备管理方法和系统 |
CN115174639B (zh) * | 2022-09-07 | 2022-12-06 | 吉林信息安全测评中心 | 一种基于物联网的工业设备管理方法和系统 |
WO2024077642A1 (zh) * | 2022-10-12 | 2024-04-18 | 大连理工大学 | 针对航空发动机故障预警的量子回声状态网络模型构建方法 |
CN115333990A (zh) * | 2022-10-14 | 2022-11-11 | 中国人民解放军海军工程大学 | 一种基于郊狼与灰狼混合优化的高效传输路由方法 |
CN115333990B (zh) * | 2022-10-14 | 2023-02-03 | 中国人民解放军海军工程大学 | 一种基于郊狼与灰狼混合优化的高效传输路由方法 |
CN116165274A (zh) * | 2023-02-17 | 2023-05-26 | 哈尔滨工业大学 | 基于贝叶斯全局稀疏概率主成分分析的城市轨道损伤识别方法 |
CN116165274B (zh) * | 2023-02-17 | 2023-11-14 | 哈尔滨工业大学 | 基于贝叶斯全局稀疏概率主成分分析的城市轨道损伤识别方法 |
CN116028822A (zh) * | 2023-03-30 | 2023-04-28 | 国网福建省电力有限公司 | 一种电能表误差状态评估方法、系统、设备及存储介质 |
CN116579112A (zh) * | 2023-05-17 | 2023-08-11 | 西南交通大学 | 一种基于轨道交通网络的应急桥接公交驻车点选址方法 |
CN116579112B (zh) * | 2023-05-17 | 2024-02-02 | 西南交通大学 | 一种基于轨道交通网络的应急桥接公交驻车点选址方法 |
CN116366477B (zh) * | 2023-05-30 | 2023-08-18 | 中车工业研究院(青岛)有限公司 | 一种列车网络通信信号检测方法、装置、设备及存储介质 |
CN116366477A (zh) * | 2023-05-30 | 2023-06-30 | 中车工业研究院(青岛)有限公司 | 一种列车网络通信信号检测方法、装置、设备及存储介质 |
CN116861218A (zh) * | 2023-07-25 | 2023-10-10 | 上海华菱电站成套设备股份有限公司 | 一种矿井提升机关键设备状态监测预警系统 |
CN117302293B (zh) * | 2023-08-14 | 2024-06-07 | 北京城建智控科技股份有限公司 | 轮径值预测方法、装置、电子设备及存储介质 |
CN117302293A (zh) * | 2023-08-14 | 2023-12-29 | 北京城建智控科技股份有限公司 | 轮径值预测方法、装置、电子设备及存储介质 |
CN117132130A (zh) * | 2023-08-31 | 2023-11-28 | 江西航天国数信息科技有限公司 | 一种实时采集信息进行建模的智慧城市预测系统 |
CN116956197A (zh) * | 2023-09-14 | 2023-10-27 | 山东理工昊明新能源有限公司 | 基于深度学习的能源设施故障预测方法、装置及电子设备 |
CN116956197B (zh) * | 2023-09-14 | 2024-01-19 | 山东理工昊明新能源有限公司 | 基于深度学习的能源设施故障预测方法、装置及电子设备 |
CN117290764B (zh) * | 2023-11-23 | 2024-02-09 | 湖南省交通科学研究院有限公司 | 基于数据特征分析的治超系统故障智能识别及诊断的方法 |
CN117290764A (zh) * | 2023-11-23 | 2023-12-26 | 湖南省交通科学研究院有限公司 | 基于数据特征分析的治超系统故障智能识别及诊断的方法 |
CN117649876A (zh) * | 2024-01-29 | 2024-03-05 | 长春大学 | 基于gwo算法在gwas数据上检测与复杂疾病相关snp组合的方法 |
CN117649876B (zh) * | 2024-01-29 | 2024-04-12 | 长春大学 | 基于gwo算法在gwas数据上检测与复杂疾病相关snp组合的方法 |
Also Published As
Publication number | Publication date |
---|---|
AU2020471210B2 (en) | 2023-10-26 |
AU2020471210A1 (en) | 2022-07-14 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2022141213A1 (zh) | 一种智慧城市智轨车辆故障基因预测方法及系统 | |
CN112734094B (zh) | 一种智慧城市智轨车辆故障基因预测方法及系统 | |
CN108629978B (zh) | 一种基于高维路网和循环神经网络的交通轨迹预测方法 | |
CN111832814A (zh) | 一种基于图注意力机制的空气污染物浓度预测方法 | |
CN111915059B (zh) | 基于注意力机制的Seq2seq泊位占有率预测方法 | |
Zhu et al. | Dynamic prediction of traffic incident duration on urban expressways: A deep learning approach based on LSTM and MLP | |
CN113487061A (zh) | 一种基于图卷积-Informer模型的长时序交通流量预测方法 | |
CN103921743B (zh) | 汽车行驶工况判别系统及其判别方法 | |
Yan et al. | Spatial-temporal chebyshev graph neural network for traffic flow prediction in iot-based its | |
WO2021013190A1 (zh) | 基于气象参数的高速列车导航盲区定位方法及系统 | |
CN112966871B (zh) | 基于卷积长短期记忆神经网络的交通拥堵预测方法及系统 | |
WO2021013192A1 (zh) | 列车过隧道时长计算方法、系统及存储介质 | |
CN112650204B (zh) | 一种智慧轨道无人驾驶车辆故障基因识别方法及系统 | |
CN114202120A (zh) | 一种针对多源异构数据的城市交通行程时间预测方法 | |
CN112966853A (zh) | 基于时空残差混合模型的城市路网短时交通流预测方法 | |
CN110929951B (zh) | 一种用于电网告警信号的关联分析和预测方法 | |
CN116631186B (zh) | 基于危险驾驶事件数据的高速公路交通事故风险评估方法、系统 | |
CN112990545A (zh) | 一种高速公路交织区交通安全状态预测方法 | |
CN113762338A (zh) | 一种基于多重图注意力机制的交通流预测方法、设备及介质 | |
CN107688556B (zh) | 一种基于函数型主成分分析的实时行程时间计算方法 | |
CN114882069A (zh) | 基于lstm网络和注意力机制的出租车轨迹异常检测方法 | |
CN115310677A (zh) | 一种基于二进制编码表示与多分类的航迹预测方法及装置 | |
CN116307152A (zh) | 时空交互式动态图注意力网络的交通预测方法 | |
CN116523177A (zh) | 融合机理和深度学习模型的车辆能耗预测方法及装置 | |
CN111311905A (zh) | 一种基于粒子群优化小波神经网络的高速公路行程时间预测方法 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
ENP | Entry into the national phase |
Ref document number: 2020471210 Country of ref document: AU Date of ref document: 20201230 Kind code of ref document: A |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 20967554 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 20967554 Country of ref document: EP Kind code of ref document: A1 |