Traversal Topology-Finding Method of Tensegrity Structure Based on Dynamic Programming

被引:5
作者
Lu, Jinyu [1 ]
Xu, Zhiyin [1 ]
Liu, Jilei [1 ]
机构
[1] Southeast Univ, Sch Civil Engn, 2 Southeast Univ Rd, Nanjing 211189, Peoples R China
基金
中国国家自然科学基金;
关键词
Tensegrity; Topology-finding; Ground structure; Traversal; Dynamic programming; DESIGN;
D O I
10.1061/JSENDH.STENG-13180
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
Tensegrity structures, which consist of tension cables and compression rods, are widely used in various fields. It is particularly important to find the tensegrity with definite geometric configuration for the following research and application. This paper presents a traversal topology-finding method for tensegrity structures based on dynamic programming algorithm and ground structure method. After the designer has given the cable topology, the dynamic programming is adopted to realize the traversal selection of the rod. In order to reduce the traversal space and realize the constraint of rod length type, the rod is classified according to length. Compared with existing topology-finding methods, the algorithm can not only output all feasible topologies but also incorporate structural constraints, such as rod length type and prestressed stability, into the calculation process. Four tensegrity numerical examples illustrate the feasibility and effectiveness of the topology-finding method.
引用
收藏
页数:10
相关论文
共 50 条
[21]   A New Method of RNA Secondary Structure Prediction Based on Convolutional Neural Network and Dynamic Programming [J].
Zhang, Hao ;
Zhang, Chunhe ;
Li, Zhi ;
Li, Cong ;
Wei, Xu ;
Zhang, Borui ;
Liu, Yuanning .
FRONTIERS IN GENETICS, 2019, 10
[22]   A dynamic programming based pruning method for decision trees [J].
Li, XB ;
Sweigart, J ;
Teng, J ;
Donohue, J ;
Thombs, L .
INFORMS JOURNAL ON COMPUTING, 2001, 13 (04) :332-344
[23]   A medical images segmentation method based on dynamic programming [J].
Lee, B ;
Yan, JY ;
Zhuang, TG .
CHINESE JOURNAL OF ELECTRONICS, 2002, 11 (04) :538-541
[24]   A novel method of contour extraction based on dynamic programming [J].
Yu, T ;
Luo, YP .
2002 6TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING PROCEEDINGS, VOLS I AND II, 2002, :817-820
[25]   A Method of Motif Mining Based on Backtracking and Dynamic Programming [J].
Song, Xiaoli ;
Zhou, Changjun ;
Wang, Bin ;
Zhang, Qiang .
MULTI-DISCIPLINARY TRENDS IN ARTIFICIAL INTELLIGENCE, MIWAI 2015, 2015, 9426 :317-328
[26]   Dynamic Investigation of a Rolling Locomotion System Based on a Tensegrity Structure with Spatially Curved Compressed Members [J].
Schorr, Philipp ;
Ebnet, Markus ;
Zimmermann, Klaus ;
Boehm, Valter .
PERSPECTIVES IN DYNAMICAL SYSTEMS I-APPLICATIONS, DSTA 2021, 2024, 453 :437-449
[27]   A numerical method for hybrid optimal control based on dynamic programming [J].
Rungger, Matthias ;
Stursberg, Olaf .
NONLINEAR ANALYSIS-HYBRID SYSTEMS, 2011, 5 (02) :254-274
[28]   Dynamic Programming Based Grouping Method for RO-PUFs [J].
Komurcu, Giray ;
Pusane, Ali Emre ;
Dundar, Gunhan .
2013 9TH CONFERENCE ON PH. D. RESEARCH IN MICROELECTRONICS AND ELECTRONICS (PRIME 2013), 2013, :329-332
[29]   A Method for Filtering Pages by Similarity Degree based on Dynamic Programming [J].
Deng, Ziyun ;
He, Tingqin .
FUTURE INTERNET, 2018, 10 (12)
[30]   AN AUTONOMOUS VEHICLE MOTION PLANNING METHOD BASED ON DYNAMIC PROGRAMMING [J].
Jia Changhao ;
Huang Miaohua ;
Sui Liyang .
2020 17TH INTERNATIONAL COMPUTER CONFERENCE ON WAVELET ACTIVE MEDIA TECHNOLOGY AND INFORMATION PROCESSING (ICCWAMTIP), 2020, :394-398