System and method for real-time guidance and mapping of a tunnel boring machine and tunnel
20170234129 · 2017-08-17
Assignee
Inventors
- Dan Alan Preston (Bainbridge Island, WA)
- Marc Aaron Derenburger (Bremerton, WA, US)
- Carin Louise Douglass (Silverdale, WA, US)
- Joseph Preston (Bainbridge Island, WA)
- Paul Milton Peterson (Bremerton, WA, US)
- Kyle Alan Yeats (Bremerton, WA, US)
Cpc classification
E21D9/1093
FIXED CONSTRUCTIONS
E21D9/108
FIXED CONSTRUCTIONS
E21D9/004
FIXED CONSTRUCTIONS
International classification
G01C21/16
PHYSICS
Abstract
A system and methods are disclosed for providing the location of a tunnel boring machine (TBM) by establishing of a plurality of known locations or “monuments”; from these monuments located at least on, over or within the TBM's start point, known in the art as a “pit”. The present invention provides among other things an integrated navigation system that provides real-time parametric guidance information to the TBM, relative to the tunnel origin, past course and current trajectory, while simultaneously employing a non-contact measuring system in concert with said origin and course information for the final provision of an as-built map of tunnel dimensions and centerline.
Claims
1. A dual purpose geo-location and dynamic mapping system for a tunnel boring machine (TBM), the system comprising: a TBM; a first Inertial Navigation System (INS) mounted on a vehicle, wherein the vehicle is separate from the TBM; a position determining system for determining an accurate position of the vehicle; a first computer located on the vehicle, wherein the first computer is configured to collect data from a ranging device as the vehicle traverses the tunnel and store the data in a first memory; a second INS located on the TBM connected to a second computer and a second memory, wherein the second INS position data is updated by the first INS.
2. The system of claim 1, wherein the ranging device is mounted on the vehicle to make measurements orthogonal to the geometric centerline of the tunnel.
3. The system of claim 1, wherein the first memory is located on the vehicle.
4. The system of claim 1, wherein the stored data from the first memory is transmitted to the second memory when the vehicle arrives at a known and predetermined location with the TBM.
5. The system of claim 1, wherein the first INS is connected to the first computer.
6. The system of claim 1, wherein the second computer is configured to receive the stored data from the first computer.
7. The system of claim 1, wherein the second computer is configured to receive an updated position of the first INS.
8. The system of claim 1, wherein the second computer is configured to translate the first INS position to the second INS as a position update.
9. The system of claim 1, wherein the second computer is configured to determine real-time parametric guidance information for the TBM.
10. The system of claim 9, wherein the real-time parametric guidance information causes the TBM to at least one of maintain a current path and course correct to the design centerline of the tunnel.
11. A dual purpose geo-location and dynamic mapping method for a tunnel boring machine (TBM), the method comprising: operating a TBM; operating a first Inertial Navigation System (INS) mounted on a vehicle, wherein the vehicle is separate from the TBM; using a position determining system to determine an accurate position of the vehicle; operating a first computer located on the vehicle, wherein the first computer is configured to collect data from a ranging device as the vehicle traverses the tunnel and store the data in a first memory; using a second INS located on the TBM connected to a second computer and a second memory, wherein the second INS position data is updated by the first INS.
12. The method of claim 11, wherein the ranging device is mounted on the vehicle to make measurements orthogonal to the geometric centerline of the tunnel.
13. The method of claim 11, wherein the first memory is located on the vehicle.
14. The method of claim 11, wherein the stored data from the first memory is transmitted to the second memory when the vehicle arrives at a known and predetermined location with the TBM.
15. The method of claim 11, wherein the first INS is connected to the first computer.
16. The method of claim 11, wherein the second computer is configured to receive the stored data from the first computer.
17. The method of claim 11, wherein the second computer is configured to receive an updated position of the first INS.
18. The method of claim 11, wherein the second computer is configured to translate the first INS position to the second INS as a position update.
19. The method of claim 11, wherein the second computer is configured to determine real-time parametric guidance information for the TBM.
20. The method of claim 19, wherein the real-time parametric guidance information causes the TBM to at least one of maintain a current path and course correct to the design centerline of the tunnel.
Description
BRIEF DESCRIPTION OF THE DRAWINGS
[0031] A more complete understanding of the present invention may be derived by referring to the detailed description when considered in connection with the following illustrative figures. In the figures, like-reference numbers refer to like-elements or acts throughout the figures. The presently preferred embodiments of the invention are illustrated in the accompanying drawings, in which:
[0032]
[0033]
[0034]
[0035]
[0036]
[0037]
[0038]
[0039]
[0040]
[0041]
[0042]
[0043]
[0044]
[0045]
[0046]
[0047]
[0048]
DETAILED DESCRIPTION
[0049] In the following description, and for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the various aspects of the invention. It will be understood, however, by those skilled in the relevant arts, that the present invention may be practiced without these specific details. In other instances, known structures and devices are shown or discussed more generally in order to avoid obscuring the invention. In many cases, a description of the operation is sufficient to enable one to implement the various forms of the invention, particularly when the operation is to be implemented in software. It should be noted that there are many different and alternative configurations, devices and technologies to which the disclosed inventions may be applied. The full scope of the inventions is not limited to the examples that are described below.
[0050] In the following examples of the illustrated embodiments, references are made to the accompanying drawings which form a part hereof, and in which is shown by way of illustration various embodiments in which the invention may be practiced. It is to be understood that other embodiments may be utilized and structural and functional changes may be made without departing from the scope of the invention.
[0051]
[0052]
[0053] These commercially available systems utilize two positioning and navigation systems in a single unit, the first is used within sight of earth-orbiting Global Navigation Satellite System (GNSS) satellites and the second in less than optimal GNSS locations. The locomotive 100 (
[0054] Another embodiment of the present invention, illustrated in
[0055] According to yet another embodiment of the present invention, illustrated in
[0056] A less technical yet viable alternative embodiment of the present invention is illustrated in
[0057] Referring now to
[0058] Referring now to
[0059]
[0060] Two processes occur as the locomotive 100 (
[0061] Within these two processes, whether simultaneous or separate, information from FTINS1 1515 (
[0062] Referring now to
[0063]
[0064]
[0065] Referring now to
[0066]
Multi-Sensor Data Fusion:
[0067] Those skilled in the art of state estimation, robotics, and advanced defense avionics understand academically that sensor-fusion is the art of combining sensory data or data derived from disparate sources such that the resulting information is in some sense “better” than would be possible when these sources were used individually. This process is predicated on the covariance (or the measure of how much two variables vary together) of non-independent sources. The term “better” in the case above can mean more accurate, more complete, more dependable, or refer to the result of an emerging view or state estimation.
[0068] The data sources for a fusion process are not specified to originate from identical sources or sensors which may or may not be spatially and temporally aligned. Further one can distinguish direct fusion, indirect fusion, and fusion of the outputs of the former two. Direct fusion is the fusion of sensor data from a set of heterogeneous or homogeneous sensors, soft sensors, and history values of sensor data, while indirect fusion uses information sources like a prior knowledge about the environment and human input. Sensor fusion is also known as “multi-sensor data fusion” and is a subset of information fusion through an implementation of the probability theory.
[0069] Probability theory is the mathematical study of phenomena characterized by randomness or uncertainty. More precisely, probability is used for modeling situations when the result of a measurement, realized under the same circumstances, produces different results. Mathematicians and actuaries think of probabilities as numbers in the closed interval from 0 to 1 assigned to “events” whose occurrence or failure to occur is random. Two crucial concepts in the theory of probability are those of a random variable and of the probability distribution of a random variable.
[0070] Implementing the features described above with affordable instruments requires reliable real-time estimates of system state. Unfortunately, the complete state is not always observable. State Estimation takes all the data obtained and uses it to determine the underlying behavior of the system at any point in time. It includes fault detection, isolation and continuous system state estimation.
[0071] There are two parts to state estimation: modeling and algorithms. The overall approach is to use a model to predict the behavior of the system in a particular state, and then compare that behavior with the actual measurements from the instruments to determine which state or states is the most likely to produce the observed system behavior.
[0072] This is not well understood or currently implemented in the construction industry; the approach understood and practiced is logical decisions in linear and deterministic systems. If use cases require higher confidences in measurements, instrument specifications are tightened resulting in the undesired effect of cost and schedule increases. The environment we live and operate in is neither linear nor deterministic; use cases are infinite; and the perverse variability of the systems and potential errors cannot be modeled. The variability of the problem identified above includes aspects other than just spatial (i.e. precise location of the tunnel boring machine); temporal relationships are part of the fundamental intellectual structure (together with space and number) within which events must be sequenced, quantify the duration of events, quantify the intervals between them, and compare the kinematics of objects.
[0073] In any of the embodiments listed above; the use of Fusion Engine (FE) and Kalman filters in the guidance system of the TBM, will greatly improve position accuracy and reduce instrument costs. The FE continuously receives measurements from multiple sources and generates a state estimate and covariance (confidence) of the current position of the TBM; all updated position data measurements received are used to ensure the measurement data is within the FE estimates.
[0074] In order to continuously and accurately estimate the position of the TBM the Kalman filters in the preferred embodiment are implemented as an asynchronous n-scalable Interacting Multiple Model (IMM) estimation Filter. The IMM comprises multiple models of drift from position in order to accurately match the maneuvering and drift expectations.
[0075] Since the drift or progression of the gyros in either FTINS is not known ahead of time, an accurate model cannot be designed, so errors in the position estimation will occur. Adding process noise to model the TBM maneuvers or using a maneuver detector to adapt the filter has been used in the art, but detection delays and large estimation errors during maneuvers are still a problem. It is generally accepted that the Interacting Multiple Model (IMM) estimator provides superior tracking performance compared to a single Kalman Filter.
[0076] The IMM is based on using several models in parallel to estimate the maneuvering TBM's states. Each Kalman Filter, uses a different model for each maneuver, one models a constant state of the TBM, another models a position change in the longitudinal axis while another models a position change in the lateral axis and vertical axis. Switching between these models during each sample period is determined probabilistically. Unlike maneuver detection systems where only one filter model is used at a time, the IMM uses all filters. The overall state estimate output is a weighted combination of the estimates from the individual filters. The weighting is based on the likelihood that a filter model is the correct maneuvering TBM model.
[0077] The IMM estimator is a state estimation algorithm that uses Markovian switching coefficients. A system with these coefficients is described by r models, M.sup.1, M.sup.2, . . . , M.sup.r, and given probabilities of switching between these models. M.sup.j(k) denotes that model j (M.sup.j) is in effect during the sampling period ending at time t.sub.k, [t.sub.k-1, t.sub.k]. The dynamics and measurement for a linear system are given by
x(k)=Φ.sup.j(k,k−1)x(k−1)+G.sup.j(k,k−1)w.sup.j(k−1), (1)
and
z(k)=H.sup.j(k)x(k)+v.sup.j(k), (2)
[0078] where x(k) is the system state at time t.sub.k, z(k) is the measurement vector at time t.sub.k, Φ.sup.j(k,k−1) is the state-transition matrix from time t.sub.k-1 to time t.sub.k for M.sup.j(k), G.sup.j(k,k−1) is the noise input matrix, and H.sup.j(k) is the observation matrix for M.sup.j(k). The process noise vector w.sup.j(k−1) and the measurement noise vector v.sup.j(k) are mutually uncorrelated zero-mean white Gaussian processes with covariance matrices Q.sup.j(k−1) and R.sup.j(k) respectively.
[0079] The initial conditions for the system state under each model j are Gaussian random variables with mean
[0080] The model switching is governed by a finite-state Markov chain according to the probability π.sub.ij=Pr{M.sup.j(k)|M.sup.i(k−1)} of switching from M.sup.i(k−1) to M.sup.j(k). The model switching probabilities, π.sub.ij, are assumed known and an example is
[0081] A block diagram of the IMM estimator with only two models, for simplicity, is shown in
[0082] The inputs to the IMM estimator are {circumflex over (x)}.sup.1(k−1|k−1), {circumflex over (x)}.sup.2(k−1|k−1), P.sup.1(k−1|k−1), P.sup.2(k−1|k−1), and μ.sup.i|j(k−1|k−1), all from the sampling period ending at t.sub.k-1. Where {circumflex over (x)}.sup.1(k−1|k−1) is the state estimate from filter 1 at time t.sub.k-1 using measurements from time t.sub.k-1 and P.sup.1(k−1|k−1) is the corresponding state covariance matrix. Each of the filters use a different mixture of {circumflex over (x)}.sup.1(k−1|k−1) and {circumflex over (x)}.sup.2(k−1|k−1) for their input, For r models, this mixing allows the model-conditioned estimates in the current cycle to be computed using r filters rather than r.sup.2 filters, which greatly decreases the computational burden. The inputs to the filters, {circumflex over (x)}.sup.01(k−1|k−1), {circumflex over (x)}.sup.02(k−1|k−1), and the corresponding covariance matrices are computed in the Interaction (Mixing) block.
[0083] For the filter matched to M.sup.j(k), the inputs are
where the conditional model probability is
and the predicted model probability is
[0084] Using the measurements, z(k), for the filter matched to M.sup.j(k), the updates are computed using the familiar Kalman Filter equations
{circumflex over (x)}.sup.j(k|k−1)=Φ.sup.j(k,k−1){circumflex over (x)}.sup.01(k|k−1), (8)
P.sup.j(k|k−1)=Φ(k,k−1)P.sup.0j(k|k−1)[Φ.sup.j(k,k−1)].sup.T+G.sup.j(k,k−1)Q.sup.j(k−1)[G.sup.j(k,k−1)].sup.T (9)
v.sup.j(k)=z(k)−H(k){circumflex over (x)}.sup.j(k|k−1), (10)
S.sup.j(k)=H.sup.j(k)P.sup.j(k|k−1)[H.sup.j(k)].sup.T+R.sup.j(k), (11)
K.sup.j(k)=P.sup.j(k|k−1)[H.sup.j(k)].sup.T[S.sup.j(k)].sup.−1, (12)
{circumflex over (x)}.sup.j(k|k)={circumflex over (x)}.sup.j(k|k−1)+K.sup.j(k)v.sup.j(k), (13)
P.sup.j(k|k)=[I−K.sup.j(k)H.sup.j(k)]P.sup.j(k|k−1), (14)
where {circumflex over (x)}.sup.j(k|k−1) is the predicted state estimate under M.sup.j(k), P.sup.j(k|k−1) is the corresponding prediction covariance, v.sup.j(k) is the residual, S.sup.j(k) is the residual covariance matrix, K.sup.j(k) is the Kalman gain matrix, {circumflex over (x)}.sup.j(k|k) is the updated state estimate under M.sup.j(k), and P.sup.j(k|k) is the updated covariance matrix.
[0085] The likelihood of the filter matched to M.sup.j(k) is defined by Λ.sup.j(k)=f[z(k)|M.sup.j(k), Z.sub.1.sup.k-1], where f[|] denotes a conditional density. Using the assumption of Gaussian statistics, the filter residual and the residual covariance, the likelihood is
The probability for M.sup.j(k) is
where the normalization factor c is
[0086] These computations are performed in the Model Probability Update block. Finally the combined state estimate {circumflex over (x)}(k|k) and the corresponding state error covariance for the IMM are given by
[0087] The final state estimate, {circumflex over (x)}(k|k), is the best estimate of the TBM state and P(k|k) is the error covariance matrix for this optimal state estimate.
[0088] For the sake of convenience, the operations are described as various interconnected functional blocks or distinct software modules. This is not necessary, however, and there may be cases where these functional blocks or modules are equivalently aggregated into a single logic device, program or operation with unclear boundaries. In any event, the functional blocks and software modules or described features can be implemented by themselves, or in combination with other operations in either hardware or software.
[0089] Having described and illustrated the principles of the invention in a preferred embodiment thereof, it should be apparent that the invention may be modified in arrangement and detail without departing from such principles. Claim is made to all modifications and variation coming within the spirit and scope of the following claims.