We study the path planning of submarine cable systems with trunk-and-branch tree topology on the surface of the earth. Existing work on path planning represents the earth's surface by triangulated manifolds and takes account of laying cost of the cable including material, labor, alternative protection levels, terrain slope and survivability of the cable. Survivability issues include the risk of future cable break associated with laying the cable through sensitive and risky areas, such as, in particular, earthquake-prone regions. The key novelty of this paper is an examination and solution of the path planning of submarine cable systems with trunk-and-branch tree topology. We formulate the problem as a Steiner minimal tree problem on irregular 2D manifolds in R3 . For a given Steiner topology, we propose a polynomial time computational complexity numerical method based on the dynamic programming principle. If the topology is unknown, a branch and bound algorithm is adopted. Simulations are performed on real-world three-dimensional geographical data.

中文翻译：

---

最优海底光缆路径规划与干支树形网络拓扑设计


我们研究地球表面主干和分支树形拓扑的海底电缆系统的路径规划。现有的路径规划工作通过三角流形表示地球表面，并考虑了电缆的铺设成本，包括材料、劳动力、替代保护水平、地形坡度和电缆的生存能力。生存性问题包括未来电缆断裂的风险，该风险与通过敏感和危险区域（例如特别是地震多发区域）铺设电缆相关。本文的主要新颖之处在于对具有主干和分支树形拓扑的海底电缆系统的路径规划进行了检查和解决。我们将该问题表述为 R3 中不规则二维流形上的 Steiner 最小树问题。对于给定的斯坦纳拓扑，我们提出了一种基于动态规划原理的多项式时间计算复杂度数值方法。如果拓扑未知，则采用分支定界算法。对现实世界的三维地理数据进行模拟。