Elevator maintenance progress tracking management system based on industrial internet of things

Abstract

The application discloses an elevator maintenance progress tracking management system based on an industrial internet of things and particularly relates to the field of elevator maintenance management, comprising a time sequence construction module, which is used for reading associated data for elevator maintenance matters, arranging data with the same matter identification from front to back according to writing time, and sequentially connecting adjacent data without other matter data inserted in the middle to form a matter time sequence chain. The application executes time sequence merging, promotes fragment extraction, falls back to check, effectively recombines a chain and outputs results on the basis of multi-end associated data of the same elevator maintenance matter, so as to solve the problem of how to avoid identifying single-end records, short-time recovery or temporary establishment results as real promotion of maintenance progress under the condition of the industrial internet of things.

Description

Technical Field

[0001] This invention relates to the field of elevator maintenance management technology, and more specifically, to an elevator maintenance progress tracking and management system based on the Industrial Internet of Things. Background Technology

[0002] In elevator maintenance management, existing technologies typically focus on integrating fault reporting, task assignment, on-site handling, on-site recording, equipment status collection, and completion feedback into a single management chain. This allows for timely monitoring of the maintenance tasks' stages and enables subsequent follow-up, re-inspection, assessment, and archiving. A common implementation method involves a management platform generating maintenance tasks and combining on-site information such as attendance records, photos, and handling instructions uploaded by maintenance personnel, as well as data collected from the elevator side, including operating status, fault codes, door operator actions, and leveling feedback, to assess the maintenance progress. For scenarios requiring continuous access, such as residential communities, hospitals, and commercial complexes, on-site inspections, handling, restoration, and confirmation are often required to be completed within a short elevator downtime. This often involves situations such as personnel arriving at the scene in multiple shifts, records being added later, equipment malfunctioning again after a short period of restoration, delayed confirmation from property management, and repeated triggering of the same fault. Under these constraints, while existing methods can reflect some of the facts that have occurred at the work order, on-site, and equipment levels, progress assessment often relies on the submission record, restoration status, or confirmation result from one end to advance the stage. This can easily lead to situations where the platform shows the process is complete while the equipment subsequently reports the same fault again, the on-site work is submitted as completed but subsequent stages are not yet ready, or the work order status has been moved forward while the previous processing result has not been verified by subsequent operation. This results in a discrepancy between the recorded progress and the actual completion of maintenance tasks. Therefore, the technical problem to be solved by this application is: how to use end-to-end collaboration to jointly determine whether each stage of elevator maintenance has been established under the conditions of industrial Internet of Things, and to continue to verify the established status in combination with subsequent results, so as to avoid taking the results of single-end recording, short-term recovery or temporary establishment as the maintenance progress has been truly advanced. Summary of the Invention

[0003] To overcome the aforementioned deficiencies of the prior art, embodiments of the present invention provide an elevator maintenance progress tracking and management system based on the Industrial Internet of Things. This system solves the problems mentioned in the background art by performing time-series merging, progress segment extraction, fallback verification, effective chain reorganization, and result output on multi-terminal related data of the same elevator maintenance item.

[0004] To achieve the above objectives, the present invention provides the following technical solution: an elevator maintenance progress tracking and management system based on the Industrial Internet of Things, comprising: The timing construction module is used to read related data for elevator maintenance items, arrange data with the same item identifier from front to back according to the writing time, and connect adjacent data without other item data in the middle to form an item timing chain. The segment extraction module is used to extract continuous data segments from the beginning of each processing start point and the first result landing point after that processing start point in the event sequence chain, and write the continuous data segments into corresponding advancement segments to form an advancement segment sequence. The fallback determination module reads the first reverse change segment after the advancement segment and determines the processing midpoint by the average position of the first and last positions of the advancement segment in the event time sequence chain. It compares the position of the fallback endpoint of the reverse change segment in the event time sequence chain with the position of the processing midpoint in the event time sequence chain. If the fallback endpoint is before the processing midpoint, the advancement segment is recorded as a failed segment; if the fallback endpoint is after the processing midpoint, the advancement segment is recorded as a successful segment, thus forming a determination segment sequence. The chain reorganization module deletes invalid segments in the judgment segment sequence and reconnects valid segments according to the order of their result landing points to form an effective advancement chain. The result output module is used to determine the last established segment of the effective progress chain as the current progress segment, and write the position of the current progress segment in the effective progress chain as the progress tracking result of elevator maintenance matters.

[0005] In a preferred embodiment, the timing construction module includes: Read the event identifier and write time from the associated data, arrange all associated data from front to back according to the write time, and arrange them from front to back according to the reading order when the write times are the same, to form the entire time sequence; Extract related data with the same event identifier from the entire time series, and write the order of each related data in the entire time series into an event position sequence. Calculate the position difference between two adjacent positions in the event position sequence. When the position difference is equal to one, connect the two corresponding related data in sequence. When the position difference is greater than one, end the connection of the current position and start connecting again from the related data of the next position to form the event time sequence chain.

[0006] In a preferred embodiment, the fragment extraction module includes: Read adjacent related data in the event time sequence chain, and calculate the time interval value obtained by subtracting the write time of the previous related data from the write time of the next related data to form a time interval sequence. Read the previous and next time interval values ​​from front to back in the time interval sequence, and determine the previous associated data corresponding to the next time interval value being less than the previous time interval value as the processing starting point, thus forming the processing starting point sequence.

[0007] In a preferred embodiment, the fragment extraction module further includes: For each processing start point in the processing start point sequence, continue reading the time interval sequence after the processing start point in the event time sequence chain, and determine the previous associated data corresponding to the time interval value that is greater than or equal to the previous time interval value as the first result landing point after the processing start point, forming the result landing point sequence. The associated data between each result landing point and the corresponding processing starting point in the result landing point sequence is extracted into continuous data segments, and each continuous data segment is written into a propagation segment to form a propagation segment sequence.

[0008] In a preferred embodiment, the fallback determination module includes: For each advancement segment, read the first and last positions of the segment, calculate the number of positions between the first and last positions of the segment, and determine the corresponding position after the first position of the segment that is half of the number of positions as the processing midpoint, thus forming the midpoint positioning result; After obtaining the midpoint positioning result, read the associated data from the end position of the corresponding advancement segment along the event time chain. Extract the consecutive associated data whose associated content is opposite to the associated content of the corresponding position in the advancement segment as reverse candidate segments, and write each reverse candidate segment into a candidate sequence according to its position in the event time chain.

[0009] In a preferred embodiment, the fallback determination module further includes: For each reverse candidate segment in the candidate sequence, each associated data in the reverse candidate segment is compared with the associated data in the corresponding advancement segment in sequential order. When each associated data can be matched with the associated data of the previous position in the advancement segment, the corresponding positions are written into a fallback position chain in the comparison order and the reverse candidate segment is determined as the first reverse change segment. When any associated data cannot be matched with the associated data of the previous position in the advancement segment, the reverse candidate segment is deleted and the next reverse candidate segment in the candidate sequence is read. When the first reverse change segment is not obtained after all candidate sequences have been read, the corresponding advancement segment is directly written as the established segment.

[0010] In a preferred embodiment, the fallback determination module further includes: After obtaining the first reverse change segment, the last position in the fallback position chain is determined as the fallback endpoint. The position of the fallback endpoint in the event sequence chain is compared with the position of the processing midpoint in the event sequence chain. When the fallback endpoint is before the processing midpoint, the corresponding advancement segment is written as a failure segment. When the fallback endpoint is after the processing midpoint or coincides with the processing midpoint, the corresponding advancement segment is written as a success segment. Each success segment and each failure segment are written into a decision segment sequence according to the order of the advancement segments in the event sequence chain.

[0011] In a preferred embodiment, the chain recombination module includes: Read each segment in the decision segment sequence, delete invalid segments, and write the first position, last position, and result landing position of each valid segment into a corresponding position group to form a retained segment sequence; For each valid segment in the retained segment sequence, subtract the position of the valid segment from the first position of each valid segment following it to obtain each forward difference value. Then, arrange the valid segments with forward differences greater than zero in ascending order of forward difference value to form the forward candidate sequence corresponding to the current valid segment.

[0012] In a preferred embodiment, the chain recombination module further includes: For each first valid segment in the forward candidate sequence, subtract the position of the result of each valid segment preceding the first valid segment from the first position of the first valid segment to obtain each back-difference value. Then, arrange the valid segments with back-difference values ​​greater than zero in ascending order of back-difference value. When the first valid segment of the forward candidate sequence and the first valid segment of the back-difference arrangement are the same valid segment, write the current valid segment and the first valid segment as a continuation segment pair. When the first valid segment of the forward candidate sequence and the first valid segment of the back-difference arrangement are not the same valid segment, delete the first valid segment in the forward candidate sequence. Repeat the determination of the first valid segment, calculation of back-difference value and consistency judgment of the first valid segment for the forward candidate sequence after deleting the first valid segment to form a continuation segment sequence. Each established segment is sequentially connected according to the sequence of successive segments. Established segments that are not written as subsequent segments in the sequence of successive segments are identified as the first segment of the chain, and established segments that are not written as preceding segments in the sequence of successive segments are identified as the last segment of the chain, thus forming an effective advancement chain.

[0013] In a preferred embodiment, the result output module includes: Read each established segment in the valid progress chain, and write the result landing position of each established segment into a progress position sequence in order from front to back; Calculate the position difference between two adjacent result landing points in the progress position sequence, and when all position differences are greater than zero, determine the established segment corresponding to the last result landing point in the progress position sequence as the current progress segment. At the same time, determine the arrangement position of the last result landing point in the progress position sequence as the current progress position, thus forming the current progress record. Read the current progress segment and current progress position from the current progress record, and write the first position, last position, result landing position, and current progress position of the current progress segment into the progress tracking result of the elevator maintenance item.

[0014] The technical effects and advantages of this invention are as follows: 1. By organizing multi-terminal related data into a timeline chain based on the event identifier, writing time, and reading order, and continuing to verify the reverse changes after the progress segment, it is possible to continue to verify whether each progress stage has been established, thereby relatively reducing the situation where single-terminal records, short-term recovery, or temporarily established results are identified as real progress. 2. By determining the processing start point and result landing point according to the time interval changes of adjacent related data, and writing the continuous data segments between the two as progress segments, the actual progress interval in the maintenance process can be separated from the mixed records, thereby improving the clarity of the boundaries of subsequent progress judgment; 3. By extracting reverse candidate segments after the advancing segments and comparing the reverse candidate segments with the advancing segments one by one to form a fallback position chain, it is possible to identify whether subsequent changes constitute a substantial backtracking, and relatively suppress the interference caused by the recurrence of anomalies after short-term recovery on the progress judgment. 4. By comparing the position of the fallback endpoint with the processing midpoint, and writing the advancement segment as a successful segment or a failed segment accordingly, the subsequent operation results can be incorporated into the current progress judgment, thereby improving the problem of inconsistency between the maintenance record progress and the actual completion of the task. 5. By deleting invalid segments and reconnecting valid segments according to the result landing position to form a valid advancement chain, the real and valid advancement process can be preserved from the data of multiple advances and retreats, which relatively improves the accuracy and continuity of the current progress segment determination; 6. By defining the last segment of the effective progress chain as the current progress segment and writing the progress tracking result in combination with the current progress position, a unified output basis can be provided for expediting, re-inspection, assessment and archiving, thereby relatively improving the consistency of maintenance management results. Attached Figure Description

[0015] Figure 1 This is a schematic diagram of the system modules of the present invention. Detailed Implementation

[0016] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0017] Refer to the instruction manual appendix Figure 1 The elevator maintenance progress tracking and management system based on the Industrial Internet of Things of the present invention includes: The timing construction module is used to read related data for elevator maintenance items, arrange data with the same item identifier from front to back according to the writing time, and connect adjacent data without other item data in the middle to form an item timing chain. In this implementation, the associated data corresponding to the same elevator maintenance item are first merged and sorted in order, so that each associated data item under the same item has a unique arrangement position in a unified order. The subsequent judgment of the relationship between the preceding and following items, the break position and the connection relationship are all based on this arrangement position. This part first unifies the recording format of the associated data, then completes the arrangement of all data according to the order of writing, and then extracts the associated data under the same item identifier. The connection is determined based on the position difference between adjacent arrangement positions, thereby forming an item sequence chain. The implementation process includes the following: First, read the event identifier and write time from the associated data. The associated data can come from the maintenance work order platform, on-site operation terminal, equipment monitoring unit, and management confirmation terminal. During reading, it is first written into the same record structure. This record structure includes at least the event identifier, write time, reading order, and associated content. The event identifier distinguishes different elevator maintenance events, the write time determines the order, the reading order distinguishes the order of data with the same write time, and the associated content is used for subsequent segment extraction and judgment. The event identifier can be generated by combining the elevator's unique number, the maintenance task number, and the current fault trigger sequence number. When two independent faults occur under the same maintenance task, different event identifiers are generated to avoid merging the two events into one. The write time adopts a unified entry time, and the read order adopts the sequential number of each related data entering the storage system within the same write time. Data with timestamps on the device side is first converted to a unified time base and then written to the write time field. After the fields are sorted, all related data are arranged from front to back according to the write time. When two related data have the same write time, they are arranged from front to back according to the read order. After the arrangement is completed, the data is written to the arranged positions in the current order to obtain the entire time sequence. Next, related data with the same event identifier are extracted from the entire time series. In practice, starting from the first line of the entire time series, related data is read one by one, and the event identifier in each related data is read and compared with the current event identifier to be extracted. When the event identifiers are the same, the related data is retained, and its position in the entire time series is written into the event position sequence according to the order of reading. When the event identifiers are different, the related data is not written into the event position sequence, and the next related data is read. To ensure that the event position sequence corresponds to only one specific elevator maintenance event, the event identifier to be extracted is uniquely determined before entering this step. This event identifier can be the current maintenance event identifier that needs to be tracked, or it can be the target event identifier that is extracted one by one from all event identifiers. The resulting event position sequence retains the original arrangement position of each related data under the same event in the entire time series. Subsequently, the position difference between these arrangement positions can be directly calculated to determine whether other event data has been inserted between the data of the current event. Subsequently, the position difference is calculated for two adjacent positions in the item position sequence, and an item time sequence chain is constructed based on the position difference. Specifically, starting from the first position of the item position sequence, the current position and the next position are read, and the current position is subtracted from the next position to obtain the position difference. When the position difference equals one, it means that the associated data corresponding to the current position and the associated data corresponding to the next position are adjacent in the entire time sequence, and no associated data with different item identifiers is inserted between them. In this case, these two associated data are sequentially connected, and the next position is used as the new current position, and the position difference calculation is repeated with the next position. When the position difference is greater than one, it means that the associated data corresponding to the current position and the next position are adjacent in the entire time sequence. If at least one item with a different identifier has been inserted between the corresponding related data, then the related data corresponding to the current arrangement position is written as the last data of the current position connection segment, ending the connection at the current position. Then, the related data corresponding to the next arrangement position is written as the first data of the next connection segment, and the subsequent connection is restarted. After processing in this way until the end of the item position sequence, an item time sequence chain consisting of one or more connection segments is obtained. The related data within each connection segment are continuously connected in the entire time sequence, and no other item data is inserted. The connection segments are disconnected when the position difference is greater than one. If there is only one arrangement position in the item position sequence, the related data corresponding to that arrangement position is directly written as a single data connection segment and output as the item time sequence chain. After the above processing, the associated data under the same elevator maintenance item is organized into an item sequence chain arranged in global order and segmented and connected according to the break position. Subsequently, the position can be read directly on this chain, the difference can be calculated and continuous data segments can be extracted, without having to go back to all associated data for comparison again. At the same time, each connection and break in the item sequence chain is directly given by the position difference between the arranged positions. When calculating, it is only necessary to read two adjacent arranged positions and perform subtraction to get the result. In practical applications: For example, during a maintenance process, an elevator generates work order acceptance records, on-site sign-in records, equipment status records, and management confirmation records. Another elevator generates multiple records around the same time. The system first writes all records into associated data containing event identifiers, write times, read orders, and related content. Then, it forms a complete time sequence based on write times and read orders. Subsequently, it selects the event identifier corresponding to the current maintenance event of the current elevator and extracts the arrangement position of each associated data under that event identifier. If the position difference between two adjacent arrangement positions is equal to one, the corresponding two associated data are connected into the same connection segment. If the position difference is greater than one, the current connection segment ends at that point and the next connection segment begins. Finally, a time sequence chain corresponding only to the current maintenance event is formed, which is used to extract the starting point and result point for subsequent processing.

[0018] The segment extraction module is used to extract continuous data segments from the beginning of each processing start point and the first result landing point after that processing start point in the event sequence chain, and write the continuous data segments into corresponding advancement segments to form an advancement segment sequence. In this embodiment, this part further extracts data segments that can characterize a progress process from the event timeline. The processing order is as follows: first, calculate the time interval between adjacent related data in the event timeline; then, determine the processing start point based on the position where the time interval changes from large to small; determine the result landing point based on the position where the time interval changes from small to large or remains unchanged after the processing start point; finally, extract the related data between each result landing point and its corresponding processing start point and write it as a progress segment. After this processing, the data that was originally arranged continuously in the event timeline is converted into several progress segments with start and landing point boundaries. Subsequently, the fallback judgment and progress reorganization can be directly performed around the progress segments. The implementation process includes the following steps: First, read the adjacent related data in the event timeline and calculate the time interval between adjacent related data. During execution, starting from the first related data in the event timeline, read the current related data and the next related data in sequence. Subtract the write time of the current related data from the write time of the next related data to obtain the time interval corresponding to the current adjacent data pair. Then, write the position of the current related data in the event timeline, the position of the next related data in the event timeline, and the corresponding time interval value into the time interval sequence in the reading order. Each time a pair of adjacent related data appears in the event timeline, the time interval value is calculated. Therefore, if the event timeline... If the sequence chain contains n related data items, then n minus one time interval value is written into the time interval sequence. If there is only one related data item in the event sequence chain, then adjacent data pairs cannot be formed. In this case, no time interval value is written, and the related data item is directly retained for subsequent processing as a single point segment. If there are two related data items in the event sequence chain, then only one time interval value is formed. This time interval value is retained in the time interval sequence and is treated as the case with only one time interval value when determining the starting point and the ending point of processing. Through this process, each adjacent relationship in the event sequence chain is written as a directly comparable time interval value, and there is no need to repeatedly read and write the time and calculate it repeatedly. Then, the previous and next time interval values ​​are read from the time interval sequence from front to back, and the processing start point is determined accordingly. In specific execution, starting from the beginning of the time interval sequence, the current time interval value is read as the previous time interval value, and then the immediately following time interval value is read as the next time interval value. The size of the next time interval value and the previous time interval value are compared. When the next time interval value is less than the previous time interval value, it indicates that the arrival interval of the associated data after the corresponding position has shortened, and the event time sequence chain begins a more intensive writing phase at this point. At this time, the previous associated data corresponding to the previous time interval value is determined as the processing start point, and the position of this processing start point in the event time sequence chain is written into the processing start point sequence in the order of appearance. When the next time interval value is greater than or equal to the previous time interval value, the previous associated data is not written as the processing start point. Starting from the beginning of the sequence, move forward one time interval, repeatedly read the new previous and next time interval values, and perform comparisons. If there is only one time interval value in the sequence, the preceding associated data corresponding to that time interval value is directly written as the processing starting point, because there is no next time interval value to compare forward in the event time sequence, and the first available associated data is used as the processing starting point for this segment. If no subsequent time interval value is less than the previous time interval value when reading from the beginning to the end of the time interval sequence, the associated data at the beginning of the event time sequence is written as the processing starting point. This is because the writing rhythm in the chain has not changed from sparse to dense, and the beginning of the chain is used as the starting position for this segment. The processing starting point sequence obtained in this way records the position where each advancement in the event time sequence begins to gather and write. Subsequently, for each processing starting point in the processing starting sequence, the time interval sequence following that processing starting point is read further in the event time sequence chain, and the corresponding result landing point is determined. In specific execution, the position of a processing starting point in the event time sequence chain is read first, then the first time interval value following that processing starting point is located. This first time interval value is used as the current comparison starting point, and the next adjacent time interval value is read sequentially. Each time it is read, the size of the next time interval value is compared with the previous time interval value. When the next time interval value is greater than the previous time interval value, it indicates that the arrival pace of the associated data is beginning to slow down; when the next time interval value is equal to the previous time interval value, it indicates that the writing pace is no longer tightening. In both cases, the previous associated data corresponding to the previous time interval value is determined as the first result landing point after that processing starting point, and the position of this result landing point in the event time sequence chain is written into the result landing point sequence according to the processing starting point order. If a certain point... If there is only one time interval value after the starting point and it is impossible to form a subsequent time interval value, then the subsequent associated data corresponding to that time interval value is written as the result endpoint. If, after a certain processing starting point, the event sequence chain is continuously read to the end and no subsequent time interval value is found to be greater than or equal to the previous time interval value, then the associated data at the end of the event sequence chain is written as the result endpoint corresponding to that processing starting point. To ensure a one-to-one correspondence between processing starting points and result endpoints, after determining the result endpoint of each processing starting point, the process of reading and comparing is repeated for the next processing starting point. When the position of the subsequent processing starting point in the event sequence chain is after the previous processing starting point, the result endpoint corresponding to the subsequent processing starting point is re-evaluated from after that processing starting point and does not share the result endpoint with the previous processing starting point. Through this process, a unique result endpoint is obtained after each processing starting point, and it is not necessary to re-search the boundary when extracting continuous data segments. Finally, the associated data between each result landing point and its corresponding processing start point in the result landing point sequence is extracted into continuous data segments, and each continuous data segment is written as a progress fragment. During execution, a correspondence is established based on the same sequence number in the processing start point sequence and the result landing point sequence. The position of a processing start point in the event timeline is taken as the fragment start position, and the position of the corresponding result landing point in the event timeline is taken as the fragment end position. Then, all associated data between the start and end positions is extracted from the event timeline. This extraction range includes the associated data corresponding to the processing start point, the associated data corresponding to the result landing point, and all associated data between them, without skipping any intermediate positions. After extraction, the continuous data segment is written into a progress fragment according to the original order in the event timeline. The process involves creating segments and writing them sequentially into the advancement segment sequence. If a processing start point and its corresponding result landing point are at the same position, then the single associated data corresponding to that position is written as a single data advancement segment. If a processing start point is located before the next processing start point in the event sequence chain, but its corresponding result landing point extends after the next processing start point, then all associated data between the previous processing start point and its corresponding result landing point is still written as the current advancement segment, and the next processing start point forms another advancement segment according to its own corresponding result landing point. In the advancement segment sequence obtained in this way, each advancement segment retains the original order of associated data and already has a clear segment start and segment end position, which can be directly used to determine the processing midpoint, fallback position chain, and fallback endpoint in the future. After the above processing, the continuous related data in the event timeline is split into progressive segments organized according to the progress process. Each progressive segment is bounded by a processing start point and a result landing point. The data order within the segment is consistent with the event timeline. When performing first-position extraction, last-position extraction, processing midpoint calculation, and reverse change segment comparison on the progressive segment, the existing position can be directly referenced without having to return to the event timeline calculation boundary. At the same time, the processing start point and the result landing point are obtained by comparing adjacent time interval values. In practical applications: For example, in the sequence chain of an elevator maintenance task, acceptance records, dispatch records, sign-in records, inspection records, handling records, recovery records, and confirmation records are written sequentially. The system first calculates the time interval value of each record based on the writing time of adjacent related data, and then compares adjacent time interval values ​​from front to back. When a later time interval value is less than a previous time interval value, the corresponding previous related data is written as the processing start point, for example, the sign-in record is written as the processing start point. Then, the time interval values ​​are compared again after this processing start point. When a later time interval value is greater than a previous time interval value, the corresponding previous related data is written as the result endpoint, for example, the recovery record is written as the result endpoint. Finally, all related data between the sign-in record and the recovery record is extracted from the task sequence chain and written as a progress segment. If another set of time interval values ​​changes from large to small and then to greater than or equal to appear at the end of the task sequence chain, the next progress segment is written in the same way until a complete progress segment sequence is formed.

[0019] The fallback determination module reads the first reverse change segment after the advancement segment and determines the processing midpoint by the average position of the first and last positions of the advancement segment in the event time sequence chain. It compares the position of the fallback endpoint of the reverse change segment in the event time sequence chain with the position of the processing midpoint in the event time sequence chain. If the fallback endpoint is before the processing midpoint, the advancement segment is recorded as a failed segment; if the fallback endpoint is after the processing midpoint, the advancement segment is recorded as a successful segment, thus forming a determination segment sequence. In this implementation, this section deals with the determination process of whether a progress segment continues to be valid. The processing order is as follows: first, a boundary position is determined within each progress segment; then, a data segment that can represent a reverse rollback is found in the event sequence chain following the progress segment; subsequently, this data segment is compared with the original progress segment item by item to confirm whether the reverse rollback has truly fallen back into the progress segment; finally, based on the relationship between the rollback endpoint and the processing midpoint, it is determined whether the progress segment should be written as a valid segment or an invalid segment. After this processing, the progress segment is no longer considered valid simply because it ends, but must continue to be subject to reverse verification of subsequent related data, thereby distinguishing between real progress and short-term rollback. The implementation process includes the following steps: First, the first and last positions of each advancement segment are read, and the processing midpoint is determined accordingly. In practice, the first and last positions of a given advancement segment in the event sequence chain are read. The first position is subtracted from the last position to obtain the position number between the beginning and end of the advancement segment. If the position number is zero, it means the advancement segment corresponds to only one associated data point, and the first position is directly written as the processing midpoint. If the position number is greater than zero, the position number is divided by two, and the integer quotient is added to the first position to obtain the processing midpoint position. Using this method, when the position number is odd, the midpoint falls on a unique position; when the position number is even, the midpoint is taken from the side closest to the first position, ensuring that the processing midpoint always corresponds to the actual position in the event sequence chain and does not fall between two positions. After the processing midpoint is determined, the advancement segment identifier, the first position, the last position, and the processing midpoint position are sequentially written as the midpoint positioning result for subsequent segment-by-segment reading and comparison. Next, after obtaining the midpoint positioning result, the associated data is read backward along the event timeline from the end position of the corresponding advancement segment to extract reverse candidate segments. In specific execution, the end position of the advancement segment is read first, and then the associated data in the event timeline is read line by line starting from the next position after the end position. When reading each piece of associated data, the associated content of that data is compared directionally with the associated content at the corresponding position in the advancement segment. The corresponding positions are determined in reverse order, meaning that the associated data read later in the event timeline is first compared with the associated content corresponding to the end position of the advancement segment, and then sequentially compared with the associated content at the preceding and second preceding positions in the advancement segment. The reversal of associated content is determined according to a pre-stored correspondence: for state-type associated content, the opposite state value is used as the opposite relationship; for action-type associated content, the opposite action result is used as the opposite relationship; for numerical associated content, the opposite value is used as the opposite relationship. Opposite directions of change are considered opposite relationships. During the reading process, when the content of the current associated data is opposite to the content of the corresponding position in the advancing segment, the current associated data is written into the current reverse candidate segment, and the reading of the associated data at the next position continues. When the content of the current associated data is no longer opposite to the content of the corresponding position in the advancing segment, the extraction of the current reverse candidate segment ends. If the first piece of associated data read after the last position of the segment does not satisfy the opposite relationship, no reverse candidate segment is written, and the reading continues to the next position until the first piece of associated data that satisfies the opposite relationship appears, and then a new reverse candidate segment is extracted from that position. Each extracted reverse candidate segment is written into the candidate sequence according to the order of the first and second positions of the reverse candidate segment in the event sequence chain. In the candidate sequence formed in this way, each reverse candidate segment corresponds to a piece of reverse associated data that appears continuously after the advancing segment, which can be checked one by one later. Subsequently, for each reverse candidate segment in the candidate sequence, each associated data in the reverse candidate segment is compared with the associated data in the corresponding advancement segment to determine whether the first reverse change segment can be formed. Specifically, the first reverse candidate segment in the candidate sequence is read first, and then the associated data in that reverse candidate segment is read sequentially according to their order. When reading the first associated data, its associated content is compared with the associated content corresponding to the last position of the advancement segment. If the opposite relationship is true, the last position of the advancement segment is written into the fallback position chain. When reading the second associated data, its associated content is compared with the associated content of the advancement segment at the position preceding the last position. If the opposite relationship is true, the preceding position is written into the fallback position chain. This process continues to read subsequent associated data in the same way, ensuring that for each newly read associated data, the comparison position is moved back towards the beginning of the advancement segment. Move back one position; if all related data in the reverse candidate segment have been compared and each comparison satisfies the opposite relationship, then the reverse candidate segment is determined as the first reverse change segment, and the written fallback position chain is retained; if the opposite relationship is not satisfied in the comparison of any related data, then the current reverse candidate segment and its corresponding fallback position chain are deleted, and it is not written as the first reverse change segment. Then, the next reverse candidate segment in the candidate sequence is read and the above comparison is repeated; if the candidate sequence has been read completely and the first reverse change segment is still not obtained, it means that although there may be scattered changes after the advancement segment, a complete forward fallback reverse change process has not been formed. At this time, the advancement segment is directly written as the established segment, and the segment first position, segment last position, and result landing position of the advancement segment in the event sequence chain are written into the established segment record; Finally, after obtaining the first reverse change segment, the fallback endpoint is determined and the validity judgment is completed. Specifically, the fallback position chain corresponding to the first reverse change segment is read first, and the last position in the fallback position chain is taken as the fallback endpoint. Since the fallback position chain is written in a line-by-line comparison order, the last position indicates that the first reverse change segment has finally fallen back to the first position reached in the advancing segment; therefore, this last position is written as the fallback endpoint. Then, the positions of the fallback endpoint and the processing midpoint in the event sequence chain are read, and their relationship is compared. When the fallback endpoint is before the processing midpoint, it indicates that the reverse change has fallen back to the first half of the advancing segment, corresponding to the advancing segment. The fragment is written as an invalid fragment; when the fallback endpoint is after the processing midpoint, it means that the reverse change has not fallen back to the processing midpoint, and the corresponding advancement fragment is written as an established fragment; when the fallback endpoint coincides with the processing midpoint, the corresponding advancement fragment is still written as an established fragment; after each advancement fragment is judged, the established fragment record or invalid fragment record written by the advancement fragment is written into the judgment fragment sequence according to the order of the first and second fragment positions of the advancement fragment in the event sequence chain; if an advancement fragment has been directly written as an established fragment in the previous step because it did not obtain the first reverse change fragment, then the advancement fragment will not enter the fallback endpoint comparison, and will be directly written into the judgment fragment sequence according to its first and second fragment positions; After the above processing, each advancement segment is first checked in reverse, and then written as a valid segment or invalid segment according to the relationship between the fallback endpoint and the processing midpoint. The judgment criteria always fall on the actual position in the event sequence chain, and the processing order remains consistent. In practical applications: For example, a certain progress segment consists of on-site sign-in records, detection records, handling records, and recovery records. The system first reads the first and last positions of the progress segment and extracts the processing midpoint based on the position number between the first and last positions. Then, it continues reading along the event sequence chain after the recovery record. If it continuously reads related data that is opposite to the related content of the later part of the progress segment, such as recovery failure, fault recurrence, and re-handling request, it writes the continuous data segment as a reverse candidate segment. Next, it compares each related data in the reverse candidate segment with the recovery record, handling record, and detection record in the progress segment one by one. If each comparison satisfies the opposite relationship, it writes the fallback position chain and determines the reverse candidate segment as the first reverse change segment. If the final fallback endpoint has fallen back to before the processing midpoint, the progress segment is written as a failed segment. If the fallback endpoint is still after the processing midpoint, or if a complete first reverse change segment is never formed in the subsequent data, the progress segment is written as a successful segment. Finally, all successful segments and failed segments are written into the judgment segment sequence according to the order of the progress segments for subsequent effective progress chain reorganization.

[0020] The chain reorganization module deletes invalid segments in the judgment segment sequence and reconnects valid segments according to the order of their result landing points to form an effective advancement chain. In this embodiment, the process involves filtering out valid segments from the decision segment sequence that can be retained, and reorganizing these valid segments into an effective advancement chain according to their sequential connection relationship. Specifically, the failed segments in the decision segment sequence are first deleted, leaving only valid segments. Then, the result landing position of each valid segment is used as the starting position for finding the next segment, and the first position of the subsequent valid segment is used as the access position. The forward difference between the two is calculated to form a forward candidate sequence. Subsequently, the backward difference between the first valid segment of the forward candidate sequence and each of the preceding valid segments is calculated in reverse. This is used to confirm whether the first valid segment should indeed be connected to the current valid segment. When the first valid segment obtained by forward search matches the first valid segment obtained by reverse check, the two are written as a continuation segment pair. When the two do not match, the first valid segment in the current forward candidate sequence is deleted and the calculation is repeated until a continuation segment pair is written or the current forward candidate sequence is empty. After this processing, the connection between valid segments is no longer directly connected in order, but is simultaneously processed by forward search and reverse check. Finally, the first segment and the last segment are determined based on the continuation segment sequence to form an effective advancing chain. The implementation process includes the following steps: First, read each segment in the decision segment sequence, delete invalid segments, and organize the positional relationships of each valid segment into a retained segment sequence. During execution, start reading segment by segment from the beginning of the decision segment sequence, first determining whether the current segment is a valid or invalid segment. If the current segment is invalid, delete it directly and do not write it into the subsequent sequence. If the current segment is valid, read its first, last, and result placement positions in the event sequence chain, and write these three positions into corresponding position groups in a fixed order. The first position indicates the beginning position of the valid segment in the event sequence chain, and the last position indicates the position of the valid segment in the event sequence chain. The ending position in the result is used to indicate the output position of the valid segment. For each valid segment read, a corresponding position group is written out and written into the reserved segment sequence according to the order of the valid segment in the decision segment sequence. If the decision segment sequence contains only invalid segments, all invalid segments are deleted and the reserved segment sequence is not written out, and the effective advancement chain is written as an empty chain. If the decision segment sequence contains only one valid segment, the valid segment is directly retained in the reserved segment sequence and processed as a single valid advancement chain. Through this step, all subsequent calculations are based on the valid segments in the reserved segment sequence and no longer involve the deleted invalid segments. Subsequently, for each valid segment in the retained segment sequence, its corresponding forward candidate sequence is calculated. Specifically, a valid segment in the retained segment sequence is first taken as the current valid segment. Then, the first and second positions of each valid segment following the current valid segment are read, and the result landing position of the current valid segment is subtracted from these first and second positions to obtain the forward difference values ​​corresponding to the current valid segment. The forward difference value represents the interval between the subsequent valid segment and the result landing position of the current valid segment. A forward difference value greater than zero indicates that the first position of the subsequent valid segment is after the result landing position of the current valid segment and can be used as a continuation object. A forward difference value equal to zero indicates that the first position of the subsequent valid segment coincides with the result landing position of the current valid segment. A forward difference value less than zero indicates that the... The first position of the subsequent valid fragment is located before the result landing position of the current valid fragment. In this step, only valid fragments with a forward difference greater than zero are retained, and these valid fragments are arranged in ascending order of forward difference to form the forward candidate sequence corresponding to the current valid fragment. If two valid fragments have the same forward difference, the valid fragment with the earlier first position is placed first. If the first positions are still the same, the valid fragment with the earlier result landing position is placed first. If there are no valid fragments with a forward difference greater than zero after the current valid fragment, the current valid fragment is not written into the forward candidate sequence and is not continued in the subsequent connection. Through this process, each current valid fragment corresponds to a forward candidate sequence arranged according to the degree of proximity, and the reverse check is performed starting from the first valid fragment of the sequence. Next, a backward check is performed on the first valid segment in each forward candidate sequence to confirm whether the continuation relationship is valid. Specifically, the forward candidate sequence corresponding to a currently valid segment is read first, and the first valid segment in that sequence is taken as the segment to be checked. Then, the result landing positions of each valid segment preceding the segment to be checked are read, and these result landing positions are subtracted from the first position of the segment to be checked to obtain backward differences. Backward differences represent the interval between the segment to be checked and the preceding valid segments when looking back. Only valid segments with backward differences greater than zero are retained, and these segments are then arranged in ascending order of backward differences. If two valid segments have the same backward difference, the segment with the earlier result landing position is placed first. If the result landing positions are still the same, the segment with the earlier first position is placed first. After arrangement, the first valid segment in the backward difference arrangement is read, and it is determined whether this first valid segment is the current valid segment. When the first valid segment in the backward difference arrangement is the same valid segment as the current valid segment, it means that the segment to be checked found by the current valid segment is also the first valid segment that corresponds to the segment to be checked when looking back. At this time, the current valid segment and the segment to be checked are written as a continuation segment pair. When the first valid segment in the backward difference arrangement is not the current valid segment, it means that the segment to be checked is closer to another previous valid segment and should not be directly connected by the current valid segment. At this time, the first valid segment in the forward candidate sequence is deleted, and the first valid segment is re-selected for the forward candidate sequence after deletion. The backward difference calculation and consistency judgment are then repeated. If no continuation segment pair is written after all valid segments in a forward candidate sequence are deleted, the current valid segment is not connected to other valid segments. Through this process, only the segment pairs that pass both forward search and backward check are retained and written into the continuation segment sequence, thereby avoiding misconnection caused by simply connecting according to position. Finally, the established segments are sequentially connected according to the continuation segment sequence, and the first and last segments are determined to form a valid advancement chain. In practice, all continuation segment pairs are first read, and the preceding and following established segments in each pair are recorded in writing order. Then, it is counted which established segments have been written as following segments and which have been written as preceding segments. Established segments not written as following segments indicate that there is no preceding segment to connect them in the current continuation relationship, therefore they are determined as the first segment. Established segments not written as preceding segments indicate that there is no following segment to connect them in the current continuation relationship, therefore they are determined as the first segment. The segment is designated as the tail segment. If only one valid segment in the sequence of consecutive segments does not form a consecutive segment pair with other valid segments, then this valid segment is written as both the head segment and the tail segment. If there are multiple unconnected segment groups, the result landing position of the tail segment in each segment group is read, and the segment group with the result landing position later is taken as the segment group corresponding to the effective advancement chain. Then, the head segment and the tail segment are determined in this segment group. After the head segment and the tail segment are determined, starting from the head segment, the segments in the sequence of consecutive segments are connected sequentially until they are connected to the tail segment to form an effective advancement chain. This effective advancement chain retains the continuation order of the valid segments after bidirectional verification, and the current progress segment and progress position can be directly output based on this. After the above processing, the valid segments in the segment sequence are first screened out, and then the consecutive segment sequence is written by bidirectional verification of the forward difference and the backward difference. Finally, the chain head segment, chain tail segment and valid advancement chain are determined by the consecutive segment sequence. The connection object, difference calculation object and writing object are consistent throughout the process. For cases with the same forward difference, the same backward difference, an empty forward candidate sequence and multiple segment groups, the aforementioned sequential judgment, stopping the continuation and segment group screening methods are used respectively. Therefore, when the process is repeated in different elevator maintenance matters, the continuation result can maintain the same judgment caliber. In practical applications: For example, in a decision sequence corresponding to an elevator maintenance item, there are three valid segments and two invalid segments. The system first deletes the two invalid segments and writes the three valid segments into corresponding position groups containing the first position, the last position, and the result landing position. Then, taking the first valid segment as the current valid segment, the system calculates the forward difference between the first position of the second valid segment and the result landing position of the first valid segment, and the forward difference between the first position of the third valid segment and the result landing position of the first valid segment. These forward differences are then written into a forward candidate sequence from smallest to largest. Finally, the system reads the first valid segment from the forward candidate sequence. For each segment, calculate the back-return difference between the first segment and the landing point of each preceding segment. If the first segment in the back-return difference sequence is the first segment, write them as a continuation segment pair. Otherwise, delete the first segment in the current forward candidate sequence and continue to check the next segment. After all continuation segment pairs are written, determine the first segment of the chain from the segments that were never written as subsequent segments in the continuation segment sequence, and determine the last segment of the chain from the segments that were never written as preceding segments in the continuation segment sequence. Finally, connect a set of segments that can truly and coherently represent the progress of the elevator maintenance task into an effective progress chain.

[0021] The result output module is used to determine the last established segment of the effective progress chain as the current progress segment, and write the position of the current progress segment in the effective progress chain as the progress tracking result of elevator maintenance matters. In this implementation, this section handles the identification and result writing process of the end of the effective progress chain. The purpose is to determine the current actual progress position within the established effective progress chain and organize the corresponding established segments and their positional relationships into a directly output progress tracking result. Specifically, each established segment in the effective progress chain is first read, and a progress position sequence is written according to the result landing position of each established segment. Then, the sequential relationship between adjacent result landing positions in the progress position sequence is checked. If the result landing positions maintain an increasing order from front to back, the established segment corresponding to the last result landing position is determined as the current progress segment, and the position of this last result landing position in the progress position sequence is also determined. Finally, the first position, last position, result landing position, and current progress position of the current progress segment are written out in a fixed order to form the progress tracking result for elevator maintenance matters. The implementation process includes the following steps: First, read each established segment in the valid progress chain and write the result landing positions of each established segment in order from front to back into a progress position sequence. During execution, starting from the first segment of the valid progress chain, read each established segment sequentially along the chain's connection order. For each established segment read, extract its result landing position in the event sequence chain and write it into the progress position sequence in the order it was read. Since the established segments in the valid progress chain are already connected sequentially according to their successive relationship, the result landing positions in the progress position sequence maintain the same front-to-back order as the valid progress chain. If there is only one established segment in the valid progress chain, only one result landing position is written, forming a single-position progress position sequence. If the valid progress chain is empty, no progress position sequence is written, and the current progress record is written as an empty record. To ensure that established segments can be directly retrieved from the progress position sequence later, when writing each result landing position, the correspondence between that result landing position and the corresponding established segment is retained, so that the corresponding established segment can be directly located when reading the last result landing position later. Next, the position difference between two adjacent result landing points in the progress position sequence is calculated, and the current progress segment and current progress position are determined accordingly. Specifically, starting from the first position of the progress position sequence, the current result landing point position and the next result landing point position are read sequentially. The position difference is obtained by subtracting the current result landing point position from the next result landing point position. This process continues until all adjacent result landing point positions have been calculated. If there is only one result landing point position in the progress position sequence, the adjacent position difference calculation is not performed; the segment corresponding to this unique result landing point position is directly determined as the current progress segment, and the position of this unique result landing point position in the progress position sequence is written as the current progress position, which is set to one. If there are two or more result landing point positions in the progress position sequence, each position difference is checked to see if it is greater than zero. When each position difference is greater than zero... At time zero, it indicates that the result landing positions in the progress position sequence continue to increase from front to back. At this time, the last result landing position in the progress position sequence is taken, and the valid segment corresponding to the last result landing position is determined as the current progress segment. At the same time, the arrangement position of the last result landing position in the progress position sequence is determined as the current progress position. If a position difference is less than or equal to zero during the check, it indicates that there is an abnormal order in the current progress position sequence. At this time, the value is taken from the position where the abnormality occurs and the valid segment corresponding to the previous result landing position before the abnormal position is determined as the current progress segment. The arrangement position of the previous result landing position in the progress position sequence is written as the current progress position. After this processing, regardless of whether the progress position sequence is a single position case or a multi-position case, a unique current progress segment and current progress position can be obtained, forming the current progress record. Then, the current progress segment and current progress position are read from the current progress record, and the first position, last position, result landing position, and current progress position of the current progress segment are written into the progress tracking result of the elevator maintenance item in sequence. Specifically, the current progress segment is first read from the current progress record, and then the first position, last position, and result landing position of the current progress segment in the item's timeline are extracted. Then, the current progress position is read from the current progress record, and the first position, last position, result landing position, and current progress position are written into the result record in a fixed order. This ensures that the same elevator maintenance item can be displayed and stored in subsequent steps. Consistent with the reference basis during transmission, the result record can also simultaneously write the event identifier and the output time. The event identifier uses the event identifier from the aforementioned associated data, and the output time is the recording time when the current progress tracking result is written to the system. If the current progress record is empty, the event identifier and empty progress marker are written to the result record, but the first position, last position, result landing point position, and current progress position are not written. Through this processing, the segment position and progress position corresponding to the elevator maintenance event at the current moment are written as a single result record, which is used as the basis for the same progress tracking result in subsequent use, whether for interface display, status synchronization, or management feedback. After the above processing, the established segments in the effective progress chain are further merged into a progress position sequence, current progress record, and progress tracking result that can be directly output. The processing order is always maintained as follows: first write the result landing position, then determine the current progress segment, and finally write the result record. In the case of an empty effective progress chain, an empty progress marker is written. In the case of a progress position sequence with only one result landing position, the established segment corresponding to that result landing position is directly used as the current progress segment. In the case of a position difference less than or equal to zero in the progress position sequence, the value taking is stopped, and the established segment corresponding to the previous result landing position is used as the current progress segment. In practical applications: For example, in the effective progress chain corresponding to an elevator maintenance task, there are three establishment segments in sequence. The system first reads the result landing positions of the three establishment segments in sequence and writes them into a progress position sequence. Then, it calculates the position difference between the first and second result landing positions, and between the second and third result landing positions. If both position differences are greater than zero, the establishment segment corresponding to the third result landing position is determined as the current progress segment, and the arrangement position of the third result landing position in the progress position sequence is written as the current progress position. Finally, the first position, last position, and result landing position of the current progress segment are read, and then written together with the current progress position as the progress tracking result of the elevator maintenance task. If the position difference between the second and third result landing positions is found to be less than or equal to zero when calculating the position difference, the system stops taking values, and the establishment segment corresponding to the second result landing position is written as the current progress segment. The current progress position is then written with the arrangement position of the second result landing position.

[0022] Working Principle: This solution first organizes related data from different sources for the same elevator maintenance task into a single timeline. Then, it identifies each actual progress step within this timeline and checks for any significant setbacks afterward. Finally, it retains only the truly successful progress steps to determine the current maintenance progress. Specifically, it first organizes data from the work order side, site side, equipment side, and management side in chronological order using task identifiers, write times, and read sequences to form a task timeline. Then, it identifies the processing start point and result endpoint based on the time interval changes between adjacent data, and connects the data between them. The data is written as a progress segment; then, the data after the progress segment is read to check if there is a reverse change segment that is opposite to the content of the progress segment. The relationship between the fallback endpoint and the processing midpoint is used to determine whether the progress segment is a valid segment or a invalid segment. Finally, invalid segments are deleted, valid segments are reconnected to form a valid progress chain, and the last valid segment of the valid progress chain outputs the current progress segment and progress tracking result. The whole process does not directly judge the progress by looking at a single record, but connects the data from multiple ends through end-to-end collaboration, and then judges whether this progress is really valid based on the connection between the preceding and following segments and the subsequent rollback situation. In practical applications, for example, when an elevator in a residential community malfunctions, the platform first generates a maintenance task. Maintenance personnel arrive, sign in, and upload inspection records. Simultaneously, the equipment generates status change data. Later, recovery records and management confirmation records appear. This data is first organized into a timeline of events for the same task. The system observes that the data arrival pace between sign-in and recovery clearly tightens and then slows down, so this segment is written as a progress segment. Continuing to observe, if fault reproduction data recurs soon after, contradicting the recovery data, and the rollback position has already fallen within this progress segment... If the progress segment is before the middle of the process, it indicates that the recovery is only short-lived, and this progress segment will be written as a failed segment. If a complete rollback does not occur later, or if the rollback does not reach the processing midpoint, the progress segment will be retained as a successful segment. In this way, in scenarios such as elevator maintenance, hospital elevator maintenance, and high-frequency maintenance of commercial complexes, the system does not simply look at whether the work has been submitted for completion or whether the operation has been restored for a short time. Instead, it uses end-to-end collaboration to put the information from the work order end, the field end, the equipment end, and the management end into the same progress chain for comprehensive judgment, and finally gives a maintenance progress that is closer to the actual processing status.

[0023] The above description is merely a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

Claims

1. An elevator maintenance progress tracking and management system based on the Industrial Internet of Things, characterized in that, include: The timing construction module is used to read related data for elevator maintenance items, arrange data with the same item identifier from front to back according to the writing time, and connect adjacent data without other item data in the middle to form an item timing chain. The segment extraction module is used to extract continuous data segments from the beginning of each processing start point and the first result landing point after that processing start point in the event sequence chain, and write the continuous data segments into corresponding advancement segments to form an advancement segment sequence. The fallback determination module reads the first reverse change segment after the advancement segment and determines the processing midpoint by the average position of the first and last positions of the advancement segment in the event time sequence chain. It compares the position of the fallback endpoint of the reverse change segment in the event time sequence chain with the position of the processing midpoint in the event time sequence chain. If the fallback endpoint is before the processing midpoint, the advancement segment is recorded as a failed segment; if the fallback endpoint is after the processing midpoint, the advancement segment is recorded as a successful segment, thus forming a determination segment sequence. The chain reorganization module deletes invalid segments in the judgment segment sequence and reconnects valid segments according to the order of their result landing points to form an effective advancement chain. The result output module is used to determine the last established segment of the effective progress chain as the current progress segment, and write the position of the current progress segment in the effective progress chain as the progress tracking result of elevator maintenance matters.

2. The elevator maintenance progress tracking and management system based on the Industrial Internet of Things as described in claim 1, characterized in that: The timing construction module includes: Read the event identifier and write time from the associated data, arrange all associated data from front to back according to the write time, and arrange them from front to back according to the reading order when the write times are the same, forming the entire time sequence; Extract related data with the same event identifier from the entire time series, and write the order of each related data in the entire time series into an event position sequence. Calculate the position difference between two adjacent positions in the event position sequence. When the position difference is equal to one, connect the two corresponding related data in sequence. When the position difference is greater than one, end the connection of the current position and start connecting again from the related data of the next position to form the event time sequence chain.

3. The elevator maintenance progress tracking and management system based on the Industrial Internet of Things as described in claim 2, characterized in that: The fragment extraction module includes: Read adjacent related data in the event time sequence chain, and calculate the time interval value obtained by subtracting the write time of the previous related data from the write time of the next related data to form a time interval sequence. Read the previous and next time interval values ​​from front to back in the time interval sequence, and determine the previous associated data corresponding to the next time interval value being less than the previous time interval value as the processing starting point, thus forming the processing starting point sequence.

4. The elevator maintenance progress tracking and management system based on the Industrial Internet of Things as described in claim 3, characterized in that: The fragment extraction module also includes: For each processing start point in the processing start point sequence, continue reading the time interval sequence after the processing start point in the event time sequence chain, and determine the previous associated data corresponding to the time interval value that is greater than or equal to the previous time interval value as the first result landing point after the processing start point, forming the result landing point sequence. The associated data between each result landing point and the corresponding processing starting point in the result landing point sequence is extracted into continuous data segments, and each continuous data segment is written into a propagation segment to form a propagation segment sequence.

5. The elevator maintenance progress tracking and management system based on the Industrial Internet of Things as described in claim 4, characterized in that: The fallback determination module includes: For each advancement segment, read the first and last positions of the segment, calculate the number of positions between the first and last positions of the segment, and determine the corresponding position after the first position of the segment that is half of the number of positions as the processing midpoint, thus forming the midpoint positioning result; After obtaining the midpoint positioning result, read the associated data from the end position of the corresponding advancement segment along the event time chain. Extract the consecutive associated data whose associated content is opposite to the associated content of the corresponding position in the advancement segment as reverse candidate segments, and write each reverse candidate segment into a candidate sequence according to its position in the event time chain.

6. The elevator maintenance progress tracking and management system based on the Industrial Internet of Things as described in claim 5, characterized in that: The fallback determination module also includes: For each reverse candidate segment in the candidate sequence, each associated data in the reverse candidate segment is compared with the associated data in the corresponding advancement segment in sequential order. When each associated data can be matched with the associated data of the previous position in the advancement segment, the corresponding positions are written into a fallback position chain in the comparison order and the reverse candidate segment is determined as the first reverse change segment. When any associated data cannot be matched with the associated data of the previous position in the advancement segment, the reverse candidate segment is deleted and the next reverse candidate segment in the candidate sequence is read. When the first reverse change segment is not obtained after all candidate sequences have been read, the corresponding advancement segment is directly written as the established segment.

7. The elevator maintenance progress tracking and management system based on the Industrial Internet of Things as described in claim 6, characterized in that: The fallback determination module also includes: After obtaining the first reverse change segment, the last position in the fallback position chain is determined as the fallback endpoint. The position of the fallback endpoint in the event sequence chain is compared with the position of the processing midpoint in the event sequence chain. When the fallback endpoint is before the processing midpoint, the corresponding advancement segment is written as a failure segment. When the fallback endpoint is after the processing midpoint or coincides with the processing midpoint, the corresponding advancement segment is written as a success segment. Each success segment and each failure segment are written into a decision segment sequence according to the order of the advancement segments in the event sequence chain.

8. The elevator maintenance progress tracking and management system based on the Industrial Internet of Things as described in claim 7, characterized in that: The in-chain recombination module includes: Read each segment in the decision segment sequence, delete invalid segments, and write the first position, last position, and result landing position of each valid segment into a corresponding position group to form a retained segment sequence; For each valid segment in the retained segment sequence, subtract the position of the valid segment from the first position of each valid segment following it to obtain each forward difference value. Then, arrange the valid segments with forward differences greater than zero in ascending order of forward difference value to form the forward candidate sequence corresponding to the current valid segment.

9. The elevator maintenance progress tracking and management system based on the Industrial Internet of Things as described in claim 8, characterized in that: The in-chain recombination module also includes: For each first valid segment in the forward candidate sequence, subtract the position of the result of each valid segment preceding the first valid segment from the first position of the first valid segment to obtain each back-difference value. Then, arrange the valid segments with back-difference values ​​greater than zero in ascending order of back-difference value. When the first valid segment of the forward candidate sequence and the first valid segment of the back-difference arrangement are the same valid segment, write the current valid segment and the first valid segment as a continuation segment pair. When the first valid segment of the forward candidate sequence and the first valid segment of the back-difference arrangement are not the same valid segment, delete the first valid segment in the forward candidate sequence. Repeat the determination of the first valid segment, calculation of back-difference value and consistency judgment of the first valid segment for the forward candidate sequence after deleting the first valid segment to form a continuation segment sequence. Each established segment is sequentially connected according to the sequence of successive segments. Established segments that are not written as subsequent segments in the sequence of successive segments are identified as the first segment of the chain, and established segments that are not written as preceding segments in the sequence of successive segments are identified as the last segment of the chain, thus forming an effective advancement chain.

10. The elevator maintenance progress tracking and management system based on the Industrial Internet of Things as described in claim 9, characterized in that: The result output module includes: Read each established segment in the valid progress chain, and write the result landing position of each established segment into a progress position sequence in order from front to back; Calculate the position difference between two adjacent result landing points in the progress position sequence, and when all position differences are greater than zero, determine the established segment corresponding to the last result landing point in the progress position sequence as the current progress segment. At the same time, determine the arrangement position of the last result landing point in the progress position sequence as the current progress position, thus forming the current progress record. Read the current progress segment and current progress position from the current progress record, and write the first position, last position, result landing position, and current progress position of the current progress segment into the progress tracking result of the elevator maintenance item.

Images