Pipe-Routing Algorithm for Pipelines with Branches

H.B. Feng; Y.L. Fu; R. Li

doi:10.4028/www.scientific.net/AMM.10-12.430

Paper Titles

Investigation of Grinding Process of Particle Reinforced Matrix Aluminium Composites (PRAMCs)
p.406

Petri Net Models for Assembly Sequences Planning
p.411

Conceptual Design and Simulating Research Based on Virtual Prototype Technology for Parallel Machine Tool (PMT)
p.416

Elevator Feel and Centering Unit Simulation Based on SimMechanics
p.424

Pipe-Routing Algorithm for Pipelines with Branches
p.430

Research on Knowledge-Based Virtual Assembly Planning
p.435

A New Man-Machine Interactive System for Virtual Assembly of Large-Scale Products
p.440

Virtual Assembly System for Large-Scale Complex Products
p.444

Off-Line Feed Rate Scheduling Using Virtual CNC
p.451

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 10-12Pipe-Routing Algorithm for Pipelines with Branches

Pipe-Routing Algorithm for Pipelines with Branches

Abstract:

This paper presents an automatic pipe-routing algorithm for pipelines with branches in an electromechanical product. The algorithm uses chaos theory to establish the chaos grid pre-processing model (CGPM) that can efficiently pick up solution space and reduce the search range. A novel particle swarm optimization (PSO) algorithm is developed to seek for an approximate optimal trajectory in the solution space. Experiments show that the modified PSO algorithm is effective and efficient. The examples demonstrate that the automatic pipe-routing algorithm is effective and practical for pipelines with branches.

You might also be interested in these eBooks

e-Engineering & Digital Enterprise Technology

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 10-12)

Pages:

430-434

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.10-12.430

Citation:

Cite this paper

Online since:

December 2007

Authors:

H.B. Feng, Y.L. Fu, R. Li

Keywords:

Chaos Grid Pre-Processing Model, Particle Swarm Optimization Algorithm (PSO), Pipe-Routing Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] D. Zhu, Jean-Claude and Latombe: Proceedings of the 1991 IEEE International Conference on Robotics and Automation Vol. 15 (1991), pp. (1940).

Google Scholar

[2] J. Park and R.L. Storch: Washington: Expert Systems with Application Vol. 23 (2002), p.299.

Google Scholar

[3] R. Guirardello and R.E. Swaney: Computers and Chemical Engineering Vol. 30 (2005), p.99.

Google Scholar

[4] K.E. Parsopoulos and M.N. Vrahatis: IEEE Trans. on Evolutionary Computation Vol. 8 (2004), p.211.

Google Scholar

[5] A. Ratnaweera, S.K. Halgamuge and H.C. Watson: IEEE Trans. on Evolutionary Computation Vol. 8 (2004), p.240.

Google Scholar

[6] N. Higashi and H. Iba: Proceedings of the IEEE Swarm Intelligence Symp Vol. 15 (2003), p.72.

Google Scholar

[7] J. Kennedy: Proceeding of the IEEE Swarm Intelligence Symp Vol. 15 (2003), p.53.

Google Scholar

[8] T. Krink, J.S. Vesterstrom and J. Riget: Proceedings of the IEEE Int'l Conf. on Evolutionary Computation Vol. 20 (2002), p.1474.

Google Scholar

[9] X.H. Hu and R.C. Eberhart: Proceedings of the IEEE Int'l Conf. on Evolutionary Computation Vol. 10 (2002), p.1666.

Google Scholar