当前位置:主页 > 科技论文 > 路桥论文 >

三维管路自动敷设算法及干涉校验方法研究

发布时间:2018-04-27 13:48

  本文选题:三维管路敷设 + 人工鱼群算法 ; 参考:《哈尔滨工业大学》2015年硕士论文


【摘要】:管路敷设是指在具有约束的环境中,规划一条从起点位置到终点位置满足约束的最优或较优路径。随着工业化的高速发展,管路在许多领域得到广泛应用。但是由于三维管路敷设空间复杂,约束条件严格,早期敷设主要依靠经验丰富的工程师手工完成,效率低下。随着CAD技术的发展,三维管路自动敷设成为可能,出现了许多高效算法,提高了敷设效率。但各种算法在实用性、复杂度或优化结果等方面都有一定的局限性,还没有形成一套完整的理论体系。本文提出一种适于三维管路敷设的改进的人工鱼群算法,该算法可有效降低复杂度,提高实用性。在单管路敷设阶段,首先根据约束条件建立单管路敷设优化模型;为简化敷设空间,建立栅格空间预处理模型。之后提出改进的人工鱼群算法,该算法将优化过程分为初步优化和深度优化两个阶段。在初步优化过程中为避免人工鱼盲目搜索,设置主方向作为启发信息;为避免陷入局部最优解,针对栅格预处理模型的特点,对人工鱼群算法的基本参数和基本行为进行改进。在深度优化过程中提出人工鱼的繁殖行为和吞食行为,来进一步优化结果。在多管路敷设阶段,针对多管路敷设的特点,首先建立多管路敷设的优化模型。然后对单管路敷设算法的启发信息进行改进;并将单管路敷设算法与小生境技术相结合,实现多管路协同敷设。为使敷设结果更适用于实际工程,需对三维管路进行干涉校验。文中提出了一种向量法来求解干涉问题,总结了各类判别标准来判断管路间的干涉情况。该方法既避免了复杂的投影变换又易于程序实现,可快速实现管路的干涉校验。最后利用UG/Open API功能设计三维管路自动敷设系统,验证所研究算法的实用性。
[Abstract]:Pipeline laying refers to the planning of an optimal or optimal path from the starting point to the end to meet the constraints in a constrained environment. With the rapid development of industrialization, pipeline has been widely used in many fields. However, due to the complex space and strict constraints, the early laying is mainly accomplished by experienced engineers, and the efficiency is low. With the development of CAD technology, it is possible to lay three dimensional pipeline automatically, and many efficient algorithms have appeared, and the laying efficiency has been improved. However, various algorithms have some limitations in practicability, complexity or optimization results, and have not yet formed a complete theoretical system. In this paper, an improved artificial fish swarm algorithm suitable for three dimensional pipeline laying is proposed, which can effectively reduce the complexity and improve the practicability. In the stage of single pipeline laying, the optimization model of single pipe laying is established according to the constraint condition, and the preprocessing model of grid space is established to simplify the laying space. Then an improved artificial fish swarm algorithm is proposed, which divides the optimization process into two stages: initial optimization and depth optimization. In order to avoid the blind search of artificial fish, the main direction is set as heuristic information, and in order to avoid falling into local optimal solution, the basic parameters and basic behavior of artificial fish swarm algorithm are improved according to the characteristics of raster preprocessing model. In the process of depth optimization, breeding behavior and swallowing behavior of artificial fish were proposed to further optimize the results. In the stage of multi-pipeline laying, the optimization model of multi-pipeline laying is established according to the characteristics of multi-pipeline laying. Then the heuristic information of single pipeline laying algorithm is improved, and the single pipe laying algorithm is combined with niche technology to realize multi-pipeline cooperative laying. In order to make the laying result more suitable for practical engineering, the interference check of three-dimensional pipeline is needed. In this paper, a vector method is proposed to solve the interference problem, and various discriminant criteria are summarized to judge the interference between pipes. This method avoids the complex projection transformation and is easy to be realized by program, and it can realize the interference check of the pipeline quickly. Finally, UG/Open API function is used to design a three-dimensional automatic laying system, which verifies the practicability of the proposed algorithm.
【学位授予单位】:哈尔滨工业大学
【学位级别】:硕士
【学位授予年份】:2015
【分类号】:U173

【参考文献】

相关期刊论文 前5条

1 刘德全,滕弘飞;不规则多边形的干涉算法[J];大连理工大学学报;1999年05期

2 于国清,汤广发,郭骏,董珊;一种基于几何的空间管道碰撞检测算法[J];哈尔滨工业大学学报;2003年11期

3 林怡青;三类判别式及其在干涉问题中的应用[J];机器人;1989年02期

4 樊江,马枚,杨晓光;航空发动机外部管路自动敷设研究[J];机械设计;2003年07期

5 刘福敏;刘弘;;基于小生境技术的共享学习在协同设计中的应用[J];计算机应用与软件;2010年02期

相关博士学位论文 前2条

1 范小宁;船舶管路布局优化方法及应用研究[D];大连理工大学;2006年

2 封海波;机械设备管路自动敷设设计方法的研究[D];哈尔滨工业大学;2009年



本文编号:1810986

资料下载
论文发表

本文链接:https://www.wllwen.com/kejilunwen/daoluqiaoliang/1810986.html


Copyright(c)文论论文网All Rights Reserved | 网站地图 |

版权申明:资料由用户486f2***提供,本站仅收录摘要或目录,作者需要删除请E-mail邮箱bigeng88@qq.com