System and method for determining cycle time based on geofencing

Abstract

To provide a system and method for determining haul truck or other apparatus cycle time.SOLUTION: A method for identifying a haul-truck cycle comprises: receiving first position information (1-1), indicative of a first material plant checkpoint in which an apparatus enters a first material plant geofence 104 for the first time; receiving second position information (3-1, 4-1), indicative of a first machine checkpoint in which the apparatus enters and / or exits a machine geofence 106; receiving third position information (5-1), indicative of a second material plant checkpoint in which the apparatus enters the first material plant geofence 104 for the second time; and determining the apparatus cycle time based at least partly on a time associated with the first material plant checkpoint and a time associated with the second material plant checkpoint.SELECTED DRAWING: Figure 1

Description

Technical Field

[0001] The present disclosure relates to systems and methodologies for determining the performance of a haul truck or other equipment via performance measurement criteria. For example, the performance of a haul truck is monitored as the haul truck transports materials from a material plant to a project site. More particularly, the present disclosure relates to systems and methodologies for determining the cycle time of a haul truck or other equipment.

Background Art

[0002] The cycle time of a haul truck is an indicator of the operational efficiency of a paving project or other construction project that utilizes materials transported by the haul truck from a material plant to machinery at a project work site. An accurately determined cycle time of a haul truck can not only estimate the allocation of haul truck resources to a given project, but also help improve the ability to adjust haul truck resources at the project work site. These are only some of the advantages of being able to accurately determine the cycle time of a haul truck.

[0003] Conventional approaches for determining the cycle time of a haul truck consider the time required for the haul truck to move between the material plant and machinery at the project site.

[0004] Exemplary embodiments of the present disclosure are directed to overcoming the deficiencies of such systems.

Summary of the Invention

[0005] In one aspect of the present disclosure, the method includes the operation of receiving first position information indicating a first material plant checkpoint at which a transport truck first enters a perimeter (first material plant perimeter) surrounding a first material plant. The method also includes receiving second position information indicating a first machine checkpoint at which the transport truck enters and / or exits a perimeter surrounding a machine, such as a paving machine (machine perimeter). The method also includes receiving third position information indicating a second material plant checkpoint at which the transport truck enters the first material plant perimeter a second time. The method also includes generating an association between the first material plant checkpoint and the second material plant checkpoint. The method also includes determining a transport truck cycle time based at least in part on the time associated with the first material plant checkpoint and the time associated with the second material plant checkpoint.

[0006] In another aspect of the present disclosure, the device includes one or more processors and a memory coupled to the one or more processors. The memory stores instructions executable by the one or more processors to perform operations including receiving first position information indicating a first material plant checkpoint at which a transport truck first enters a perimeter (first material plant perimeter) surrounding a first material plant. The operations also include receiving second position information indicating a first machine checkpoint at which the transport truck enters and / or exits a perimeter surrounding a machine, such as a paving machine (machine perimeter). The operations also include receiving third position information indicating a second material plant checkpoint at which the transport truck enters the first material plant perimeter a second time. The operations also include generating an association between the first material plant checkpoint and the second material plant checkpoint. The operations also include determining a transport truck cycle time based at least in part on the time associated with the first material plant checkpoint and the time associated with the second material plant checkpoint.

[0007] In yet another aspect of the present disclosure, one or more computer-readable media store instructions that configure a device to perform operations including receiving first position information indicating a first material plant checkpoint where a haul truck first enters a first material plant perimeter when executed by one or more processors of the device. The operations also include receiving second position information indicating a first machine checkpoint where the haul truck enters and / or exits a machine perimeter. The operations also include receiving third position information indicating a second material plant checkpoint where the haul truck re-enters the first material plant perimeter for a second time. The operations also include generating an association between the first material plant checkpoint and the second material plant checkpoint. The operations also include determining a haul truck cycle time based at least in part on a time associated with the first material plant checkpoint and a time associated with the second material plant checkpoint.

Brief Description of the Drawings

[0008]

Figure 1

Figure 2

Figure 3

Figure 4

Figure 5

Figure 6

Figure 7

DETAILED DESCRIPTION OF THE INVENTION

[0009] Wherever possible, the same reference numbers are used throughout the drawings to refer to the same or similar parts.

[0010] FIG. 1 is a diagram showing an example of how a processor can identify a transport truck cycle. The processor obtains a display of where the transport truck is located at various times. The processor determines from the displayed position whether the transport truck has entered and / or exited various defenses. By generating an association between the entry and exit of a first plant defense by the transport truck and the entry and exit of a second plant defense by the same transport truck, the processor can determine the cycle time of the transport truck. Additionally, the processor can determine the cycle time of the transport truck using tickets associated with the entry and exit of the corresponding plant defenses.

[0011] Plants such as material plants are typically locations where haul trucks acquire materials (such as paving materials) for use by machinery at a project work site or for transfer to different material plants. That is, the haul truck acquires materials at the material plant and then transports the materials to machinery at the project work site or to a different material plant. The haul truck can then return to the first material plant and typically acquire additional materials to carry to machinery at the same or a different project work site, or to a different or yet another material plant.

[0012] A portion of the material plant can be indicated by the outline of a geopfence surrounding the plant. A geopfence is a virtual boundary of a physical geographic area. The stationary geopfence can be limited to a fixed boundary, such as a fixed boundary around the material plant. Alternatively, a dynamic geopfence can be generated to enclose an area that encompasses a specified radial distance from an operating center point location. For example, a dynamic geopfence can be generated around an operating paving machine. As the machine moves, the position of the geopfence surrounding the machine moves in response to the movement of the machine.

[0013] Referring to FIG. 1, arrow 102 indicates the first entry into the plant fence 104 by a transport truck to the position shown at 1-1 at time interval TI-1. The processor can determine, for example, based on information obtained about the position of the transport truck at time interval TI-1, that the position is the one shown at 1-1 using, for example, a Global Positioning System (GPS). For example, the processor can receive GPS signals periodically and determine the position of the transport truck based on the position indication of the GPS signal. For example, the GPS signal can indicate the latitude and longitude position of the transport truck. Further, the processor can compare the determined transport truck position with known fence positions and determine whether the transport truck position is within or outside any particular fence known to the processor. For example, the processor may determine that the transport truck is at position 1-1 at time interval TI-1, and by comparing position 1-1 with the known position of the plant fence 104, the processor may determine that the transport truck at position 1-1 is within the plant fence 104.

[0014] Still referring to FIG. 1, the transport truck is moving within the plant fence 104. Thereafter, based on the movement of the transport truck, the processor determines that the transport truck is at position 1-2 at time interval TI-2. Thereafter, at another time when the processor determines the position of the transport truck, at TI-3, the processor determines that the transport truck is at position 1-3. The processor determines that the transport truck is within the plant fence 104 by comparing each of positions 1-2 and 1-3 with the position of the plant fence 104. In another example, at a particular time interval, the processor checks the position of the transport truck. For example, at the first time interval TI-1, the processor can check the position of the transport truck as position 1-1, at the second time interval TI-2, the processor can determine the position of the transport truck as position 1-2, and at the third time interval TI-3, the processor can check the position of the transport truck as position 1-3. After comparing each of the positions with the boundary / area of the plant fence 104, the processor can determine that the transport truck is within the plant fence 104.

[0015] However, at the next time interval TI-4, when the processor determines the position of the transport truck, the processor determines that the transport truck is at position 2-1. By comparing the determined current position 2-1 of the transport truck and the determined previous position 1-3 with the known area of the plant fence 104, the processor can not only determine that the transport truck is outside the plant fence 104, but also determine that the transport truck has exited the plant fence 104. If the previous position is within the fence and the next position is within the fence, the processor determines that the transport truck is within the fence. If the previous position is within the fence and the next position is outside the fence, the processor determines that the transport truck has exited the fence. If the previous position is outside the fence and the next position is outside the fence, the processor determines that the transport truck is in transit. If the previous position is outside the fence and the next position is within the fence, the processor determines that the transport truck has entered the fence. If the previous position is within the fence and the next position is outside the fence, the processor determines that the transport truck has exited the fence.

[0016] As can be seen in FIG. 1, position 1-3 is within the plant fence 104 and position 2-1 is outside the plant fence 104. Therefore, when the transport truck moves from position 1-3 to position 2-1, the processor can determine that the transport truck has exited the plant fence 104.

[0017] When the transport truck moves towards the machines at the project work site to deliver materials, the processor determines and continues to process the position of the transport truck at various time intervals, for example, as indicated by the received GPS signals. Referring further to FIG. 1, at time interval TI-4, the processor determines that the position of the transport truck is at position 2-1. Similarly, at time intervals TI-5, TI-6, TI-7, and TI-8, the processor determines that the position of the transport truck is at positions 2-2, 2-3, 2-4, and 2-5, respectively. At time interval TI-9, the processor determines that the position of the transport truck is at position 3-1.

[0018] Each time the processor determines the position of the transport truck, the processor can compare the determined position with a known geofence and determine whether the position of the transport truck is inside or outside the geofence. Further, the processor can compare the state of the transport truck, inside or outside the geofence, at a particular position with the state of the transport truck at the previous position. Based on the result of the comparison, the processor can determine whether the transport truck has entered or exited the geofence. For example, if the processor determines that the state of the transport truck is outside the geofence and determines that the state of the transport truck at the previous position is inside the geofence, the processor can determine that the transport truck has exited the geofence between the previous position and the current position. As another example, if the processor determines that the state of the transport truck is inside the geofence and determines that the state of the transport truck at the previous position is outside the geofence, the processor can determine that the transport truck has entered the geofence between the previous position and the current position.

[0019] If the processor determines that the current position of the transport truck is at position 3-1 at time interval TI-9, the corresponding state is inside the machine geofence 106, and the previous position of the transport truck at time interval TI-8 is at position 2-5, and the corresponding state is outside the machine geofence 106, the processor can determine that the transport truck has entered the machine geofence 106 between position 2-5 and position 3-1.

[0020] Referring further to FIG. 1, when the transport truck continues to move within the machine geo-fence 106, the processor then determines that the transport truck is at position 3-2 during time interval TI-10, then at position 3-3 at time interval TI-11, and then at position 3-4 at time interval TI-12. The processor determines that the transport truck is at position 4-1 at the next time interval TI-13. When the processor determines that the current position of the transport truck is at position 4-1 and the corresponding state is outside the machine geo-fence 106, and the previous position of the transport truck is at position 3-4 and the corresponding state is inside the machine geo-fence 106, the processor may determine that the transport truck has exited the machine geo-fence 106 between positions 3-4 and 4-1.

[0021] As the transport truck continues to move, the processor determines the position of the transport truck and continues to process. Referring further to FIG. 1, the processor determines that the position of the transport truck is at position 4-2 at time interval TI-14, then at position 4-3 at time interval TI-15, at position 4-4 at time interval TI-16, and at position 4-5 at time interval TI-17. At another point in time, the processor determines the position of the transport truck at time interval TI-18, and the processor determines that the position of the transport truck is at position 5-1. Since the state of the transport truck is outside the plant geo-fence 104 at position 4-5 and inside the plant geo-fence 104 at position 5-1, the processor may determine that the transport truck has entered the plant geo-fence 104 between positions 4-5 and 5-1.

[0022] FIG. 2 is an exemplary data structure 200 that the processor may use to record and process the position and state of the transport truck. The data structure can be an array or a linked list. Each column 202, 204,..., 216 is a node of the data structure 200. Each row indicates an attribute of the node. The exemplary data structure 200 may be, for example, a dynamic linked list data structure, but in FIG. 2, the links between the records are not shown. A node represents a record used to store some attributes of a given record.

[0023] Referring further to the exemplary data structure of FIG. 2, the processor uses column 202 to record and process the movement of the position of the transport truck from position 1-2 (FIG. 1) to position 1-3. In the record of column 202, the processor records the current position of the transport truck (position 1-3) as being within the plant fence 104. The processor also records that the previous position of the transport truck (position 1-2) was also within the plant fence 104, and the processor records the next position (the same position 1-3 as the current position) as being within the plant fence 104. Regarding the state portion of record 202, the processor records the state as "discarded". That is, since both the previous position and the next position are within the plant fence 104, the transport truck has not made any transition with respect to exiting the fence. The record of column 202 is not required for the processor to determine the cycle time of the transport truck, and the processor can discard it.

[0024] Referring further to the exemplary data structure 200 of FIG. 2, the processor uses the record of column 204 to record and process the transition of the position of the transport truck from position 1-3 to position 2-1. In the record of column 204, the processor records the current position of the transport truck (position 2-1) as the first example outside the plant fence 104. The processor records in column 204 that the previous position of the transport truck was within the plant fence 104. Further, the processor records in column 204 that the subsequent position of the transport truck is outside the plant fence 104. Since the processor determines that the current position of the transport truck is the first example of a transport truck outside the plant fence 104, the processor records the state in column 204 as exiting the plant fence 104.

[0025] The processor uses column 206 to record and process the transfer of the transport truck from position 2-2 to position 2-3. In the record of column 206, the processor records the current position of the transport truck (position 2-3) as being in transit. In the record of column 206, the processor records the previous position of the transport truck as being outside the plant fence 104 and outside the machine fence 106. Further, in the record of column 206, the processor also records the next position of the transport truck as being outside the plant fence 104 and outside the machine fence 106. As a result, at the position of the state of column 206, the processor records the state as "discarded" because the processor does not require the record of column 206 to determine the transport truck cycle time. For example, if the data structure 200 is a linked list, the memory associated with the record of column 206 may be freed to optimize precious system resources, or otherwise, the data structure 206 may be modified so that it is no longer linked to column 206.

[0026] Referring further to FIG. 2, the processor uses column 208 to record and process the transfer of the transport truck from position 2-5 to position 3-1. In the record of column 208, the processor records the current position of the transport truck (position 3-1) as the first example of a transport truck being inside the machine fence 106. The processor records in column 208 the previous position of the transport truck as being outside the plant fence 104 and outside the machine fence 106. Further, the processor records in column 208 the next position of the transport truck as being inside the machine fence 106. Since the processor determines that the current position of the transport truck is the first example of a transport truck being inside the machine fence 106, the processor records the state in column 208 as being an entry into the machine fence 106.

[0027] In the record of column 210, the processor records the current position of the transport truck (position 3-2) as being within the machine geo-fence 106. Also, the processor records the previous position of the transport truck (position 3-1) as being within the machine geo-fence 106, and the processor records the next position (the same position 3-2 as the current position) as being within the machine geo-fence 106. Regarding the status portion of record 210, the processor records the status as "discarded". That is, since both the previous position and the next position are within the machine geo-fence 106, the transport truck has not made any transition with respect to the geo-fence. Therefore, the record in column 210 is not required for the processor to determine the cycle time of the transport truck.

[0028] Referring further to the exemplary data structure 200 of FIG. 2, the processor uses column 212 to record and process the transition of the position of the transport truck from position 3-4 to position 4-1. In the record of column 212, the processor records the current position of the transport truck (position 4-1) as the first example outside the machine geo-fence 106. The processor records the previous position of the transport truck in column 212 as being within the machine geo-fence 106. Further, the processor records the next position of the transport truck in column 212 as being outside the machine geo-fence 106. Since the processor determines that the current position of the transport truck is the first example of a transport truck outside the machine geo-fence 106, the processor records the status in column 212 as an exit from the machine geo-fence 106.

[0029] The processor uses column 214 to record and process the transfer of the transport truck from position 4-3 to position 4-4. In the record of column 214, the processor records the current position of the transport truck (position 4-4) as being in transit. In the record of column 214, the processor records the previous position of the transport truck as being outside the plant fence 104 and outside the machine fence 106. Further, in the record of column 214, the processor also records the next position of the transport truck as being outside the plant fence 104 and outside the machine fence 106. As a result, at the position of the state of column 214, the processor records the state as "discarded" because it does not indicate a transfer to the fence. The record of column 214 is not required for the processor to determine the transport truck cycle time.

[0030] Referring further to the exemplary data structure 200 of FIG. 2, the processor uses column 216 to record and process the transfer of the position of the transport truck from position 4-5 to position 5-1. In the record of column 216, the processor records the current position of the transport truck (position 5-1) as the first example inside the plant fence 104. The processor records the previous position of the transport truck in column 216 as being outside the plant fence 104 and outside the machine fence. Further, the processor records the next position of the transport truck in column 216 as being inside the plant fence 104. Since the processor determines that the current position of the transport truck is the first example of a transport truck inside the plant fence 104, the processor records the state in column 216 as an entry into the plant fence 104.

[0031] FIG. 3 is a flowchart showing a process 300 by which a processor can determine the cycle time of a transport truck, such as by processing a data structure such as the exemplary data structure 200 of FIG. 2. Process 300 starts at 302. At 304, the processor finds an entry / exit pair (columns 216 / 204) of a plant defense (such as plant defense 104, which is referred to herein as a checkpoint). For example, with respect to the exemplary data structure 200, the processor may process records 202, 204, ..., 216 to identify the column (216) for entry into plant defense 104 and the corresponding column (204) for exit from plant defense 104. The pair of records is for the first checkpoint. In some embodiments, such as at the start of the day, the transport truck may remain parked within the plant defense for an extended period of time. In one example, the cycle time of the next move may be indicated as invalid for productivity calculations (such as the average cycle time of the transport truck) if the transport truck remains within the plant defense for more than 6 hours. However, the user may be able to view the break times of the move, such as the transport time to the paver, the transport time within the paver, the transport time to the plant, and the time within the plant).

[0032] At 306, the processor finds the closest (in time) checkpoint for the same transport truck to the same plant. For example, with respect to the exemplary data structure 200 of FIG. 2, the processor may identify column 216 as being for the next entry into plant defense 104 and the next column (not shown) as being for the corresponding exit from plant defense 104. The pair of records is for the second checkpoint. At 308, the processor generates an association between the first checkpoint and the second checkpoint by storing, for example, the display of a second checkpoint reference value (such as the identification of the second checkpoint) associated with the first checkpoint.

[0033] At 310, the processor determines whether the first checkpoint and the second checkpoint have corresponding tickets. The ticket can include, for example, an indication of the time when the material load is picked up at the material plant, and other information regarding the material load, such as the amount of material, the type of material, the identification of the truck, etc.

[0034] If at 310 the processor determines that the first checkpoint and the second checkpoint have associated tickets, then at 312, the processor determines the cycle time of the transport truck based on the time indicated by the corresponding ticket. This can include, for example, determining the difference between the times indicated on the ticket. If at 310 the processor determines that at least one of the first checkpoint and the second checkpoint does not have an associated ticket, then at 314, the processor determines the cycle time of the transport truck based on the time difference between the entry into the geop fence at the checkpoint. In other embodiments, different times associated with the checkpoint, such as the average of the entry time and the exit time of the geop fence, or the exit time only, may be utilized. At 316, process 300 ends.

[0035] Figure 4 is a flowchart showing an exemplary method that a processor can use to filter false detection checkpoint detections caused by, for example, a hovering transport truck near a geop fence. For example, the transport truck may be waiting in line to enter a material plant, such as a material plant surrounded by the material plant geop fence 104, or the transport truck may be waiting in line to deliver material to a machine. Process 400 starts at 402. At 404, the processor finds a pair of entry / exit of the material plant geop fence (such as the plant geop fence 104) or the machine geop fence (such as the machine geop fence 106). At 406, the processor finds the closest checkpoint of the transport truck and the geop fence. At 408, the processor determines whether another / additional checkpoint is available (i.e., detected and recorded).

[0036] At 410, when the processor determines that another checkpoint is available, the processor determines the time difference between two checkpoints, such as by determining the difference between a first exit and a second entry. At 412, the processor determines whether the time difference is less than the jitter time. The jitter time can be a specified time, for example, generally 20% of the average time spent inside the geofence by the transport truck from the entry time of the geofence to the exit time of the geofence. This is just an example, and other specifications for the jitter time may be used. As an example where the time difference may be less than the jitter, the transport truck is waiting in line until it enters the material plant geofence 104. The received GPS position signal is somewhat inaccurate. For example, the received GPS position signal can be accurate within 25.6 feet (7.8 meters) with a 95% probability. Further, the GPS signal can sometimes be degraded, such as by obstacles or multipath reflections. When the transport truck is waiting in line, the received position of the transport truck can indicate that it is actually inside the material plant geofence 104 and then outside the material plant geofence. However, the transport truck remains outside the material plant geofence 104 and this is the case even if it has not yet entered the material plant geofence 104 since the last actual checkpoint.

[0037] At 414, if it is determined that the time difference is shorter than the jitter time, the two checkpoints are integrated into one, the first entry is recorded as the actual entry of the integrated checkpoint, and the last exit is recorded as the actual exit of the integrated checkpoint. In this way, a possible false detection of crossing the geofence is detected and ignored. Thus, for example, a "false" exit while waiting to depart may be ignored, and as a result, the actual exit is used in determining the cycle time.

[0038] At 416, if it is determined that the time difference is not less than the jitter time, a new checkpoint is generated at 416 using the pair of entry and exit of the geop fence determined at 404.

[0039] FIG. 5 is a flowchart showing an exemplary method that a processor can use to filter out false detections of checkpoints caused, for example, by a transport truck passing near a plant geop fence. For example, the transport truck may be in transit to a machine (e.g., a machine surrounded by machine geop fence 106), and the processor may use the received position signal to be close enough to another material plant such that the processor may erroneously determine that the transport truck has entered and exited the geop fence surrounding the other material plant.

[0040] Process 500 starts at 502. At 504, the processor finds a pair of entry / exit of a machine geop fence (such as machine geop fence 106). At 506, the processor finds the closest checkpoint of the transport truck and the plant geop fence.

[0041] At 508, the processor determines whether the in-plant time of the checkpoint found at 506 is shorter than the expected in-plant time. The in-plant time of the checkpoint may be, for example, the time difference between the entry of the transport truck into the plant geop fence and the exit of the transport truck from the plant geop fence. The expected in-plant time may be set to 2 minutes as a mere example, or may be set to 20% of the average time the transport truck spends within the plant geop fence. For example, when the transport truck passes by the plant geop fence, due to the inaccuracy of the position signal received by the processor, the position signal may inaccurately indicate that the transport truck has entered and then exited the geop fence surrounding the plant.

[0042] At 510, if it is determined that the plant checkpoint time input time is shorter than the predicted in-plant time, the current checkpoint is given the status "pass-through" so that it is not used in determining the cycle time of the transport truck. At 512, the next closest plant checkpoint for the same transport truck is found, and the processor makes a determination at 508.

[0043] At 514, if it is determined that the plant checkpoint time input time does not fall below the predicted in-plant time, the processor generates an association between the plant checkpoint and the machine checkpoint. At 516, the processor calculates the time from the exit of the plant defense to the entry into the machine defense. At 518, process 500 ends.

[0044] FIG. 6 is a flowchart showing an exemplary method that a processor may use to filter out false detections of checkpoints caused by, for example, a transport truck passing near a machine defense. For example, the transport truck may be in transit to a machine (e.g., a machine surrounded by machine defense 106), and the processor may use a position signal and approach another machine closely enough that it may incorrectly determine that the transport truck has entered and exited a defense surrounding another machine.

[0045] Process 600 starts at 602. At 604, the processor finds a pair of entry / exit of a machine defense (such as machine defense 106). At 606, the processor finds the closest checkpoint of the transport truck and the plant defense.

[0046] At 608, the processor determines whether the in-machine time of the checkpoint discovered at 606 is shorter than the expected in-machine time. The in-machine time of the checkpoint may be, for example, the time difference between the entry of the transport truck into the machine geofence and the exit of the transport truck from the machine geofence. The expected in-machine time may be set to 2 minutes, for example, or to 20% of the average time spent by the transport truck within the machine geofence. For example, when the transport truck passes by the machine geofence, due to the inaccuracy of the position signal received by the processor, the position signal may inaccurately indicate that the transport truck entered and then exited the geofence surrounding the machine.

[0047] At 610, if it is determined that the machine checkpoint time input time is shorter than the expected in-machine time, the current checkpoint is given the status "pass-through" so that it is not used in determining the cycle time of the transport truck. At 612, the next closest machine checkpoint for the same transport truck is found and the processor determines at 608.

[0048] At 614, if it is determined that the machine checkpoint time input time does not fall below the expected in-machine time, the processor generates an association between the plant checkpoint (604) and the machine checkpoint. At 616, the processor calculates the time from the exit of the machine geofence to the entry into the plant geofence. At 618, process 600 ends.

[0049] FIG. 7 schematically illustrates the components of an exemplary computing device 700 that may include a computing device for receiving and processing the transport truck position indication and for determining the transport truck cycle time. The exemplary computing device 700 may include any type of device such as a mobile phone or other mobile computing device (e.g., a tablet computing device), a personal computer such as a desktop computer or a laptop computer, a portable navigation device, a gaming device, a portable media player, a television, a set-top box, an automated teller machine, and the like. In some embodiments, the computing device 700 is a computing device that also performs functions of the transport truck other than those used in determining the cycle time of the transport truck. For example, the computing device 700 may be part of a navigation system of the transport truck, an engine control system of the transport truck, an entertainment system of the transport truck, or other systems of the vehicle. In some embodiments, the computing device 700 is a dedicated device specifically configured for the cycle time of the transport truck, and in other embodiments, the computing device 700 may also perform other functions.

[0050] As shown in FIG. 7, the exemplary computing device 700 may include at least one of a processing unit 702, a transceiver 704 (e.g., wireless, modem, etc.), a microphone 706, a speaker 707, a power unit 708, and a network interface 710. The network interface may be used to receive signals including position indications such as GPS signals. The processing unit 702 may include one or more processors 712 and a memory 714. The one or more processors 712 may include a microprocessor, a central processing unit, a graphics processing unit, or other processors capable of executing program instructions for implementing the functions described herein. Additionally, or alternatively, in some embodiments, some or all of the functions described may be performed in hardware, such as in an application specific integrated circuit (ASIC), a gate array, or other hardware-based logic device.

[0051] The transceiver 704 may comprise one or more hardware and / or software implemented radios to provide two-way RF communication with other devices within the network. The transceiver 704 may additionally or alternatively include a modem or other interface device to provide wired communication from the computing device 700 to other devices.

[0052] The microphone 706 may comprise physical hardware, although in some cases, instead, an audio input interface may be provided to interface with an external microphone or other audio receiving device. Similarly, the speaker 707 may comprise physical hardware, although in some cases, instead, an audio output interface may be provided to interface with an external speaker or other sound emitting device. The power unit 708 may supply power to the computing device 700. In some examples, the power unit 708 comprises a power connector coupled to an alternating current (AC) or direct current (DC) main power line. In other examples, such as where the computing device 700 is a mobile phone or other portable device, the power unit 708 may comprise a battery.

[0053] The memory 714 may include an operating system (OS) 716 and one or more applications 718 executable by one or more processors 712. The memory 714 may also store other information. For example, the memory 714 may store a location information data set 722 (which may include a data structure such as data structure 200), the contents of which may be processed to determine the cycle time of the haul truck.

[0054] Detailed examples of particular computing devices (e.g., examples of computing device 700) are described herein, but it should be understood that those computing devices may include other components and / or may be arranged differently. As noted above, in some examples, a computing device may include one or more processors and memory storing processor-executable instructions to implement the functions described as being performed by them. A particular computing device may additionally or alternatively include one or more hardware components (e.g., application specific integrated circuits, field programmable gate arrays, system on chips, etc.) to implement some or all of the functions described as being performed by them.

[0055] Aspects of the present disclosure have been particularly shown and described with reference to the above embodiments, but it will be understood that various additional embodiments are contemplated by modifications of the disclosed machines, systems, and methods without departing from the spirit and scope of the disclosed subject matter. Such embodiments are to be understood to fall within the scope of the present disclosure as determined based on the claims and any equivalents thereof.

Claims

1. A method for determining the cycle time of a device, comprising: Receiving first position information indicating a first material plant checkpoint at which the device first enters a first material plant diofense; Receiving second position information indicating a first machine checkpoint at which the device enters and / or exits a machine diofense; Receiving third position information indicating a second material plant checkpoint at which the device enters the first material plant diofense for the second time; Generating an association between the first material plant checkpoint and the second material plant checkpoint; Determining the cycle time of the device based at least in part on the time associated with the first material plant checkpoint and the time associated with the second material plant checkpoint; wherein the first position information and the third position information are determined by comparison with the boundary or area of the first material plant diofense, the second position information is determined by comparison with the boundary or area of the machine diofense, and the machine diofense is a dynamic diofense that changes according to the movement of the machine. A method.

2. Receiving fourth position information indicating a third material plant checkpoint at which the device enters a material plant diofense; Further comprising determining, based on the duration associated with the fourth position information, that the fourth position information does not actually indicate the third material plant checkpoint. The method according to claim 1.

3. Receiving fourth position information indicating a second machine checkpoint at which the device enters a second machine diofense; Further comprising determining, based on the duration associated with the fourth position information, that the fourth position information does not actually indicate the second machine checkpoint. The method according to claim 1.

4. Receiving fourth position information indicating a position erroneously determined to be the second entry of the device into the first material plant diofense; Further comprising integrating the fourth position information with the third position information based on the duration associated with the fourth position information. The method according to claim 1, wherein the time associated with the second material plant checkpoint is at least partially based on the third position information and the fourth position information.

5. The method according to claim 1, wherein the first position information, the second position information, and the third position information are each at least partially based on information of signals received from a global positioning system (GPS).

6. One or more processors; A memory coupled to the one or more processors, the memory comprising: Receiving first position information indicating a first material plant checkpoint at which the device first enters a first material plant di fence; Receiving second position information indicating a first mechanical checkpoint at which the device enters and / or exits a mechanical di fence; Receiving third position information indicating a second material plant checkpoint at which the device enters the first material plant di fence for the second time; Generating an association between the first material plant checkpoint and the second material plant checkpoint; Determining a cycle time of the device based at least in part on the time associated with the first material plant checkpoint and the time associated with the second material plant checkpoint, storing instructions executable by the one or more processors to perform operations including: The first position information and the third position information are determined by comparison with the boundary or area of the first material plant di fence, the second position information is determined by comparison with the boundary or area of the mechanical di fence, and the mechanical di fence is a dynamic di fence that changes according to the movement of the machine. Device.

7. The operations further include: Receiving fourth position information indicating a third material plant checkpoint at which the device enters a material plant di fence; Determining that the fourth position information does not actually indicate the third material plant checkpoint based on the duration associated with the fourth position information. The device according to claim 6.

8. The operations include: Receiving fourth position information indicating a second mechanical checkpoint at which the device enters a second mechanical di fence; The device according to claim 6, further comprising determining that the fourth position information does not actually indicate a second machine checkpoint based on a duration associated with the fourth position information. **Claim 9** The operation includes receiving fourth position information indicating a position erroneously determined as the second entry of the device into the first material plant defense, further comprising integrating the fourth position information with the third position information based on a duration associated with the fourth position information, The device according to claim 6, wherein the time associated with the second material plant checkpoint is at least partially based on the third position information and the fourth position information. **Claim 10** The device according to claim 6, wherein the first position information, the second position information, and the third position information are each at least partially based on information of signals received from a global positioning system (GPS).

Images