基于LTL-PRM算法的分支管路自动布局方法

Jiangtao Ma; Jianhua Liu; Lianjie Xu; Hongchao Wu; Jinbao Xu

doi:10.3901/JME.2018.15.160

基于LTL-PRM算法的分支管路自动布局方法

Translated title of the contribution: Method of Automatic Branch-pipe Routing Based LTL-PRM Algorithm

Jiangtao Ma, Jianhua Liu^*, Lianjie Xu, Hongchao Wu, Jinbao Xu

^*Corresponding author for this work

School of Mechanical Engineering

Beijing Institute of Technology

Research output: Contribution to journal › Article › peer-review

11 Citations (Scopus)

Abstract

A local twice learning probabilistic roadmap method(LTL-PRM) for the problem of non-orthogonal branch pipe automatic layout is proposed. Firstly, a minimum Steiner tree between endpoints is calculated by the backtracking algorithm. After the optimization of Steiner points, the positions of branch points of the branch pipe are acquired. Then, based on the basic PRM, a roadmap is constructed by local twice learning and the DIJKSTRA algorithm is used to search out the shortest un-collision path of each branch. Finally, the layout of the branch pipe is obtained after optimizing the initial path. The method is implemented in a prototype system and demonstrated by typical cases.

Translated title of the contribution	Method of Automatic Branch-pipe Routing Based LTL-PRM Algorithm
Original language	Chinese (Traditional)
Pages (from-to)	160-170
Number of pages	11
Journal	Jixie Gongcheng Xuebao/Chinese Journal of Mechanical Engineering
Volume	54
Issue number	15
DOIs	https://doi.org/10.3901/JME.2018.15.160
Publication status	Published - 5 Aug 2018

Access to Document

10.3901/JME.2018.15.160

Cite this

@article{a537e9bf701346ae901fffc6ad92d639,

title = "基于LTL-PRM算法的分支管路自动布局方法",

abstract = "A local twice learning probabilistic roadmap method(LTL-PRM) for the problem of non-orthogonal branch pipe automatic layout is proposed. Firstly, a minimum Steiner tree between endpoints is calculated by the backtracking algorithm. After the optimization of Steiner points, the positions of branch points of the branch pipe are acquired. Then, based on the basic PRM, a roadmap is constructed by local twice learning and the DIJKSTRA algorithm is used to search out the shortest un-collision path of each branch. Finally, the layout of the branch pipe is obtained after optimizing the initial path. The method is implemented in a prototype system and demonstrated by typical cases.",

keywords = "Auto layout, Branch pipe, DIJKSTRA algorithm, LTL-PRM algorithm, Minimum Steiner tree",

author = "Jiangtao Ma and Jianhua Liu and Lianjie Xu and Hongchao Wu and Jinbao Xu",

note = "Publisher Copyright: {\textcopyright} 2018 Journal of Mechanical Engineering.",

year = "2018",

month = aug,

day = "5",

doi = "10.3901/JME.2018.15.160",

language = "繁体中文",

volume = "54",

pages = "160--170",

journal = "Jixie Gongcheng Xuebao/Chinese Journal of Mechanical Engineering",

issn = "0577-6686",

publisher = "Editorial Office of Chinese Journal of Mechanical Engineering",

number = "15",

}

TY - JOUR

T1 - 基于LTL-PRM算法的分支管路自动布局方法

AU - Ma, Jiangtao

AU - Liu, Jianhua

AU - Xu, Lianjie

AU - Wu, Hongchao

AU - Xu, Jinbao

PY - 2018/8/5

Y1 - 2018/8/5

N2 - A local twice learning probabilistic roadmap method(LTL-PRM) for the problem of non-orthogonal branch pipe automatic layout is proposed. Firstly, a minimum Steiner tree between endpoints is calculated by the backtracking algorithm. After the optimization of Steiner points, the positions of branch points of the branch pipe are acquired. Then, based on the basic PRM, a roadmap is constructed by local twice learning and the DIJKSTRA algorithm is used to search out the shortest un-collision path of each branch. Finally, the layout of the branch pipe is obtained after optimizing the initial path. The method is implemented in a prototype system and demonstrated by typical cases.

AB - A local twice learning probabilistic roadmap method(LTL-PRM) for the problem of non-orthogonal branch pipe automatic layout is proposed. Firstly, a minimum Steiner tree between endpoints is calculated by the backtracking algorithm. After the optimization of Steiner points, the positions of branch points of the branch pipe are acquired. Then, based on the basic PRM, a roadmap is constructed by local twice learning and the DIJKSTRA algorithm is used to search out the shortest un-collision path of each branch. Finally, the layout of the branch pipe is obtained after optimizing the initial path. The method is implemented in a prototype system and demonstrated by typical cases.

KW - Auto layout

KW - Branch pipe

KW - DIJKSTRA algorithm

KW - LTL-PRM algorithm

KW - Minimum Steiner tree

UR - https://www.scopus.com/pages/publications/85055536200

U2 - 10.3901/JME.2018.15.160

DO - 10.3901/JME.2018.15.160

M3 - 文章

AN - SCOPUS:85055536200

SN - 0577-6686

VL - 54

SP - 160

EP - 170

JO - Jixie Gongcheng Xuebao/Chinese Journal of Mechanical Engineering

JF - Jixie Gongcheng Xuebao/Chinese Journal of Mechanical Engineering

IS - 15

ER -

基于LTL-PRM算法的分支管路自动布局方法

Abstract

Access to Document

Other files and links

Fingerprint

Cite this