有三个终端的曲率受限斯坦纳网络

IF 1.8 3区数学 Q1 Mathematics

Journal of Global Optimization Pub Date : 2024-06-17 DOI:10.1007/s10898-024-01414-z

Peter A. Grossman, David Kirszenblat, Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas

{"title":"有三个终端的曲率受限斯坦纳网络","authors":"Peter A. Grossman, David Kirszenblat, Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas","doi":"10.1007/s10898-024-01414-z","DOIUrl":null,"url":null,"abstract":"<p>A procedure is presented for finding the shortest network connecting three given undirected points, subject to a curvature constraint on both the path joining two of the points and the path that connects to the third point. The problem is a generalisation of the Fermat–Torricelli problem and is related to a shortest curvature-constrained path problem that was solved by Dubins. The procedure has the potential to be applied to the optimal design of decline networks in underground mines.</p>","PeriodicalId":15961,"journal":{"name":"Journal of Global Optimization","volume":"35 1","pages":""},"PeriodicalIF":1.8000,"publicationDate":"2024-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Curvature-constrained Steiner networks with three terminals\",\"authors\":\"Peter A. Grossman, David Kirszenblat, Marcus Brazil, J. Hyam Rubinstein, Doreen A. Thomas\",\"doi\":\"10.1007/s10898-024-01414-z\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>A procedure is presented for finding the shortest network connecting three given undirected points, subject to a curvature constraint on both the path joining two of the points and the path that connects to the third point. The problem is a generalisation of the Fermat–Torricelli problem and is related to a shortest curvature-constrained path problem that was solved by Dubins. The procedure has the potential to be applied to the optimal design of decline networks in underground mines.</p>\",\"PeriodicalId\":15961,\"journal\":{\"name\":\"Journal of Global Optimization\",\"volume\":\"35 1\",\"pages\":\"\"},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2024-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Global Optimization\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10898-024-01414-z\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Global Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10898-024-01414-z","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 0

摘要

本文提出了一个程序，用于寻找连接三个给定无向点的最短网络，该程序对连接其中两点的路径和连接第三点的路径都有曲率约束。该问题是费马-托里切利问题的一般化，与杜宾斯解决的最短曲率约束路径问题有关。该程序有望应用于地下矿井巷道网络的优化设计。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

Curvature-constrained Steiner networks with three terminals

查看原文本刊更多论文

Curvature-constrained Steiner networks with three terminals

A procedure is presented for finding the shortest network connecting three given undirected points, subject to a curvature constraint on both the path joining two of the points and the path that connects to the third point. The problem is a generalisation of the Fermat–Torricelli problem and is related to a shortest curvature-constrained path problem that was solved by Dubins. The procedure has the potential to be applied to the optimal design of decline networks in underground mines.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Global Optimization 数学-应用数学

CiteScore

0.10

自引率

5.60%

发文量

137

审稿时长

6 months

期刊介绍： The Journal of Global Optimization publishes carefully refereed papers that encompass theoretical, computational, and applied aspects of global optimization. While the focus is on original research contributions dealing with the search for global optima of non-convex, multi-extremal problems, the journal’s scope covers optimization in the widest sense, including nonlinear, mixed integer, combinatorial, stochastic, robust, multi-objective optimization, computational geometry, and equilibrium problems. Relevant works on data-driven methods and optimization-based data mining are of special interest. In addition to papers covering theory and algorithms of global optimization, the journal publishes significant papers on numerical experiments, new testbeds, and applications in engineering, management, and the sciences. Applications of particular interest include healthcare, computational biochemistry, energy systems, telecommunications, and finance. Apart from full-length articles, the journal features short communications on both open and solved global optimization problems. It also offers reviews of relevant books and publishes special issues.