Design for Additive Manufacturing: Optimization of Piping Network in Compact System With Enhanced Path-Finding Approach

作者: Robert Gao , Zhaoyan Fan , Pei Cao , Jiong Tang

DOI: 10.1115/1.4040320

关键词:

摘要: This research aims at unleashing the potential of additive manufacturing technology in industrial design that can produce structures/devices with irregular component geometries to reduce sizes/weights. We explore, by means path-finding, length minimization freeform hydraulic piping network compact space under given constraints. Previous studies on path-finding have mainly focused enhancing computational efficiency due need rapid results such as navigation and video-game applications. In this research, we develop a new Focal Any-Angle A* approach combines merits grid-based method visibility graph-based method. Specifically, formulate pruned graphs preserving only useful portion vertices, then find optimal path based candidate vertices using A*. The reduced enable us outperform approximations maintain optimality exact algorithms more efficient manner. algorithm proposed is compared traditional Grids, Theta* Visibility Graphs terms length, number nodes evaluated, well time. As demonstrated validated through case studies, capable finding shortest tractable cost, which provides viable tool for systems.

参考文章(33)
Steven M. LaValle, Planning Algorithms ,(2006)
Martin Müller, Adi Botea, Jonathan Schaeffer, Near Optimal Hierarchical Path-Finding. J. Game Dev.. ,vol. 1, pp. 1- 30 ,(2004)
Neil Burch, Rob Holte, Jonathan Schaeffer, Peter Yap, Block A*: database-driven search with applications in any-angle path-planning national conference on artificial intelligence. pp. 120- 125 ,(2011)
Nathan R. Sturtevant, Robert Geisberger, A comparison of high-level approaches for speeding up pathfinding national conference on artificial intelligence. pp. 76- 82 ,(2010)
Hod Lipson, Melba Kurman, Fabricated: The New World of 3D Printing John Wiley & Sons. ,(2013)
Yun-Hui Liu, Suguru Arimoto, Path planning using a tangent graph for mobile robots among polygonal and curved obstacles The International Journal of Robotics Research. ,vol. 11, pp. 376- 382 ,(1992) , 10.1177/027836499201100409
John Amanatides, Andrew Woo, A Fast Voxel Traversal Algorithm for Ray Tracing eurographics. ,(1987) , 10.2312/EGTP.19871000
Ariel Felner, Kenny Daniel, Sven Koenig, Alex Nash, Theta*: any-angle path planning on grids Journal of Artificial Intelligence Research. ,vol. 39, pp. 533- 579 ,(2010) , 10.1613/JAIR.2994
Peter Hart, Nils Nilsson, Bertram Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths IEEE Transactions on Systems Science and Cybernetics. ,vol. 4, pp. 100- 107 ,(1968) , 10.1109/TSSC.1968.300136