Time-of-Flight Calculation in Complex Structures

  • F. Raddatz
  • M. SinapiusEmail author
Part of the Research Topics in Aerospace book series (RTA)


Applying existing methods for damage localization using Lamb waves to complex composite structures requires a method for calculating the time-of-flight in consideration of the properties of the structure. While the time-of-flight can be calculated easily and analytically in flat isotropic structures, a much higher effort is required in complex structures. This section describes the requirements for a time-of-flight calculation and the aspects of the structural complexity to be considered. Based on these aspects different existing methods and their applicability are analysed. A suitable algorithm is derived from these methods and explained in detail. The concept of time-of-flight maps is introduced in order to assign a time-of-flight to each point on the structure, starting from one or multiple sources.

The following discussion is not limited to the time-of-flight calculation in complex structures, but of a more general nature. The time-of-flight can also be considered as a cost for traveling between different points. Therefore it will be regarded without units. However, in order to maintain the context of wave propagation, the accumulated cost for traveling across the structure will be denoted the time-of-flight.


  1. 1.
    Cheng S-W et al (2008) Approximate shortest paths in anisotropic regions. SIAM J Comput 38(3):802–824MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1:269–271MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Dolinskaya I et al (2008) Obstacle-avoiding fastest paths in anisotropic media. Technical Report 08–04, University of MichiganGoogle Scholar
  4. 4.
    Dolinskaya I et al (2013) Fastest-path planning for direction-dependent speed functions. J Optim Theory Appl 158:480–497MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Flinsenberg I (2004) Route planning algorithms for car navigation. PhD thesis, Technische Universiteit EindhovenGoogle Scholar
  6. 6.
    Floyd R (1962) Algorithm 97: shortest path. Commun ACM 5:345CrossRefGoogle Scholar
  7. 7.
    Höhne C et al (2013) SAFT imaging of transverse cracks in austenitic and dissimilar welds. J Nondestruct Eval 32:51–66CrossRefGoogle Scholar
  8. 8.
    Hwang FK et al (1992) Steiner tree problems. Networks 22(1):55–89MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Magzhan K (2013) A review and evaluations of shortest path algorithms. Int J Sci Technol Res 2(6):99–104Google Scholar
  10. 10.
    Mirebeau J-M (2014) Anisotropic fast-marching on Cartesian grids using lattice basis reduction. SIAM J Numer Anal 52(4):1573–1599MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Mitchell J et al (1991) The weighted region problem: finding shortest paths through a weighted planar subdivision. J Assoc Comput Mach 38(1):18–73MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Moser T (1992) The Shortest Path Method for Seismic Ray Tracing in Complicated Media. Geol Ultraiect 83:1–180Google Scholar
  13. 13.
    Othman M et al (2013) An analysis of least-cost routing using Bellmann Ford and Dijkstra algorithms in wireless routing network. Int J Adv Comput Technol 5:109–116Google Scholar
  14. 14.
    Sethian JA (1996) Level set methods: evolving interfaces in geometry, fluid mechanics, computer vision and materials sciences. Cambridge University Press, CambridgezbMATHGoogle Scholar
  15. 15.
    Sethian JA (1998) Fast marching methods and level set methods for propagating interfaces. In: von Karman Institute lecture series, computational fluid mechanics, unpublished lecture notesGoogle Scholar
  16. 16.
    Sethian JA (2001) Evolution, implementation, and application of level set and fast marching methods for advancing fronts. J Comput Phys 169:503–555MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Sethian JA (2003) Ordered upwind methods for static Hamilton-Jacobi equations - Theory and algorithms. SIAM J Numer Anal 41(1):325–363MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Storandt S (2012) Algorithms for vehicle navigation. PhD thesis, Universität StuttgartGoogle Scholar
  19. 19.
    Tsitsiklis J (1995) Efficient algorithms for globally optimal trajectories. IEEE Trans Autom Control 40(9):1528–1538MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Valtr P et al (2005) Tropospheric refraction modeling using ray-tracing and parabolic equation. Radioengineering 14(4):98–104Google Scholar
  21. 21.
    Yen JY (1970) An algorithm for finding shortest routes from all source nodes to a given destination in general networks. Quart Appl Math 27:526–530MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Zenker B (2013) Approximation minimaler Steinerbäume in Straßennetzwerken zur Bestimmung von Treffbäumen für Gruppennavigationssysteme. PhD thesis, Friedrich-Alexander-Universität Erlangen-NürnbergGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.German Aerospace Center (DLR)Institute of Composite Structures and Adaptive SystemsBraunschweigGermany
  2. 2.Institute of Adaptronics and Function IntegrationBraunschweig University of TechnologyBraunschweigGermany

Personalised recommendations