Minimal curvature-constrained networks | Journal of Global Optimization Skip to main content
Springer Nature Link
Log in

Minimal curvature-constrained networks

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

This paper introduces an exact algorithm for the construction of a shortest curvature-constrained network interconnecting a given set of directed points in the plane and a gradient descent method for doing so in 3D space. Such a network will be referred to as a minimum Dubins tree, since its edges are Dubins paths (or slight variants thereof). The problem of constructing a minimum Dubins tree appears in the context of underground mining optimisation, where the objective is to construct a least-cost network of tunnels navigable by trucks with a minimum turning radius. The Dubins tree problem is similar to the Steiner tree problem, except the terminals are directed and there is a curvature constraint. We propose the minimum curvature-constrained Steiner point algorithm for determining the optimal location of the Steiner point in a 3-terminal network. We show that when two terminals are fixed and the third varied in the planar version of the problem, the Steiner point traces out a limaçon.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Ayala Hoffmann, J., Brazil, M., Rubinstein, J.H., Thomas, D.: Extendibility and path components of admissible paths for the Dubins problem. In: Australian Control Conference, pp. 440–444 (2011)

  2. Brazil, M., Rubinstein, J.H., Thomas, D.A., Weng, J.F., Wormald, N.C.: Gradient-constrained minimum networks. I. Fundamentals. J. Glob. Optim. 21(2), 139–155 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brazil, M., Grossman, P.A., Lee, D.H., Rubinstein, J.H., Thomas, D.A., Wormald, N.C.: Constrained path optimisation for underground mine layout. In: The 2007 International Conference of Applied and Engineering Mathematics (ICAEM07). London, pp. 856–861 (2007)

  4. Dubins, L.E.: On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents. Am. J. Math. 79(3), 497–516 (1957)

    Article  MathSciNet  MATH  Google Scholar 

  5. Gilbert, E.N.: Minimum cost communication networks. Bell Syst. Tech. J. 46, 2209–2227 (1967)

    Article  Google Scholar 

  6. Hwang, F., Richards, D., Winter, P.: The Steiner Tree Problem. North-Holland, Amsterdam (1992)

    MATH  Google Scholar 

  7. Melzak, Z.A.: On the problem of Steiner. Can. Math. Bull. 4(2), 143–148 (1961)

    Article  MATH  Google Scholar 

  8. Pólya, G.: Induction and Analogy in Mathematics. Princeton University Press, Princeton (1954)

    MATH  Google Scholar 

  9. Rubinstein, J.H., Thomas, D.A.: A variational approach to the steiner network problem. Ann. Oper. Res. 33(6), 481–499 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  10. Smith, W.D.: How to find Steiner minimal trees in Euclidean \(d\)-space. Algorithmica 7(2-3), 137–177 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  11. Weng, J.F.: Generalized Melzak’s construction in the Steiner tree problem. Int. J. Comput. Geom. Appl. 12(6), 481–488 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanical Engineering, The University of Melbourne, Melbourne, VIC, 3010, Australia

    K. G. Sirinanda, P. A. Grossman & D. A. Thomas

  2. Department of Electrical and Electronic Engineering, The University of Melbourne, Melbourne, VIC, 3010, Australia

    M. Brazil

  3. School of Mathematics and Statistics, The University of Melbourne, Melbourne, VIC, 3010, Australia

    D. Kirszenblat & J. H. Rubinstein

Authors
  1. D. Kirszenblat
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. G. Sirinanda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Brazil
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. P. A. Grossman
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. J. H. Rubinstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. D. A. Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D. Kirszenblat.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kirszenblat, D., Sirinanda, K.G., Brazil, M. et al. Minimal curvature-constrained networks. J Glob Optim 72, 71–87 (2018). https://doi.org/10.1007/s10898-018-0625-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-018-0625-2

Keywords

Search

Navigation