Minimal curvature-constrained networks

DOI10.1007/S10898-018-0625-2MaRDI QIDQ1756754zbMATH OpenOpenAlexFDO

Authors K. G. Sirinanda, P. A. Grossman, David Kirszenblat, M. Brazil, J. Hyam Rubinstein, D. A. Thomas

Publication date 21 December 2018

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1606.02026

zbMATH Keywords

curvature constraintDubins pathnetwork optimisationoptimal mine designSteiner point

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

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 an iterative method for doing so in 3D space. Such a network will be referred to as a minimum Dubins network, since its edges are Dubins paths (or slight variants thereof). The problem of constructing a minimum Dubins network appears in the context of underground mining optimisation, where the aim is to construct a least-cost network of tunnels navigable by trucks with a minimum turning radius. The Dubins network problem is similar to the Steiner tree problem, except that 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, the Steiner point traces out a limac{c}on.

Recommendations

• Curvature-constrained directional-cost paths in the plane
• Optimal curvature-constrained paths for general directional-cost functions
• Minimal curvature-constrained paths in the plane with a constraint on arcs with opposite orientations
• Computing Steiner points for gradient-constrained minimum networks
• Gradient-constrained minimum networks. III: Fixed topology

Cites work

• A variational approach to the Steiner network problem
• GENERALIZED MELZAK'S CONSTRUCTION IN THE STEINER TREE PROBLEM
• Gradient-constrained minimum networks. I: Fundamentals.
• How to find Steiner minimal trees in Euclidean \(d\)-space
• scientific article; zbMATH DE number 3090127 (Why is no real title available?)
• On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents
• On the Problem of Steiner
• The Steiner tree problem

Cited in

(8)

• Exactly solvable and unsolvable shortest network problems in 3D-space
• Optimal curvature and gradient-constrained directional cost paths in 3-space
• Minimal curvature-constrained paths in the plane with a constraint on arcs with opposite orientations
• Optimal curvature-constrained paths for general directional-cost functions
• scientific article; zbMATH DE number 4003452 (Why is no real title available?)
• Curvature-constrained Steiner networks with three terminals
• Immersed flat ribbon knots
• Curvature-constrained directional-cost paths in the plane

This page was built for publication: Minimal curvature-constrained networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1756754)