Relevant bibliographies by topics / Assembly sequence planning

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Assembly sequence planning'

Author: Grafiati
Published: 22 February 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Assembly sequence planning.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Assembly sequence planning"

1

Wan, Weiwei, Kensuke Harada, and Kazuyuki Nagata. "Assembly sequence planning for motion planning." Assembly Automation 38, no. 2 (April 3, 2018): 195–206. http://dx.doi.org/10.1108/aa-01-2017-009.

Full text
Abstract:
Purpose The purpose of this paper is to develop a planner for finding an optimal assembly sequence for robots to assemble objects. Each manipulated object in the optimal sequence is stable during assembly. They are easy to grasp and robust to motion uncertainty. Design/methodology/approach The input to the planner is the mesh models of the objects, the relative poses between the objects in the assembly and the final pose of the assembly. The output is an optimal assembly sequence, namely, in which order should one assemble the objects, from which directions should the objects be dropped and candidate grasps of each object. The proposed planner finds the optimal solution by automatically permuting, evaluating and searching the possible assembly sequences considering stability, graspability and assemblability qualities. Findings The proposed planner could plan an optimal sequence to guide robots to do assembly using translational motion. The sequence provides initial and goal configurations to motion planning algorithms and is ready to be used by robots. The usefulness of the proposed method is verified by both simulation and real-world executions. Originality/value The paper proposes an assembly planner which can find an optimal assembly sequence automatically without teaching of the assembly orders and directions by skilled human technicians. The planner is highly expected to improve teachingless robotic manufacturing.
APA, Harvard, Vancouver, ISO, and other styles
2

Proskurenko, D., O. Tretyak, M. Demchenko, and M. Filippova. "Filippova Automated planning of graduality assembly." Energy and automation, no. 5(57) (November 24, 2021): 28–44. http://dx.doi.org/10.31548/energiya2021.05.028.

Full text
Abstract:
Modern industrial production requires the improvement of assembly processes, and thus increase the level of automated intelligent sequence planning. Therefore, researches in the field of automation of the sequence of assembly of products in industries are relevant at this time. In today's world there is a need to develop complex, accurate products. Problems are created in industries due to the reduction of the life cycle of products. There is a need to study the problem of assembly planning to achieve the goal of practical implementation and standardization of assembly plans. Creating graphs of the addition process is one of the problems. The assembly planning system can reduce human intervention in the process and reduce computational effort. The finished assembly contains many components that can be assembled using many sequences. A review of the methods from the literature showed that although these methods increase the automation level, they still cannot be applied to actual production because they do not take into account the experience and knowledge that can play a major role in planning and are of great value. Assembly planning, relationship charts, priority charts. Improving the assembly planning system to create a communication schedule and an assembly priority schedule was proposed. The advanced system will be used to generate possible assembly sequences with subassembly identification. A system has been developed to create alternative possible assembly sequences that can be used by component part / product designers in the early stages. A system capable of generating assembly sequences for simultaneous assembly of multiple parts has been proposed. Conclusions and work results can be applied used and improved for more productive product development by designers in the early stages and faster assembly of products in enterprises. The paper did not consider practical limitations (gravity) and irreversible assembly operations, such as permanent fastening, welding etc. Кey words: assembly, blocking graph, relation graph, sequence
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Chunxi, and Wenjun Hou. "Assembly Sequence Planning Based on Hierarchical Model." Wireless Communications and Mobile Computing 2022 (February 9, 2022): 1–19. http://dx.doi.org/10.1155/2022/9461794.

Full text
Abstract:
With the rapid development of intelligent manufacturing technology and ultraprecision machining, assembly technology has attracted more and more attention. Assembly sequence is an important part of assembly process planning. However, assembly sequence is affected by many complex factors, such as the time required to assemble products, the geometric feasibility of assembly sequence, and other factors (tool replacement times and assembly direction change), so it is very challenging. In this paper, an assembly information model based on geometric features of parts is proposed. The model obtains the hierarchical information of the part through the segmentation and feature reconstruction of the part. Based on the influence of the contact surface between parts on the feasible motion domain and assembly domain, the assembly constraint relationship model is established. The objective function is constructed by changing the assembly direction, changing the assembly tools, and evaluating the assembly fit type. The geometrically feasible assembly sequence is optimized to obtain the optimal assembly sequence under the existing conditions. Taking a block, a secondary reducer spindle, and a cylinder as examples, the effectiveness of the method is verified.
APA, Harvard, Vancouver, ISO, and other styles
4

Shuan-Jun Song, Shuan-Jun Song, Cheng-Hong Qiu Shuan-Jun Song, Long-Guang Peng Cheng-Hong Qiu, and Sheng Hu Long-Guang Peng. "An Assembly Line Multi-Station Assembly Sequence Planning Method Based on Particle Swarm Optimization Algorithm." 電腦學刊 33, no. 1 (February 2022): 115–25. http://dx.doi.org/10.53106/199115992022023301011.

Full text
Abstract:
<p>Aiming at the problem that the existing assembly sequence planning methods are difficult to meet the multi-station assembly requirements of assembly line, an assembly sequence planning method of assembly line considering the constraints of station sequence and station capability is proposed. The multi-station assembly sequence model is established to describe the allocation scheme and assembly sequence of parts. The conditions and generating rules of feasible assembly sequence are given. The assembly time variance of each station is used as the fitness function, and the particle swarm optimization (PSO) algorithm is designed. Taking an engineering vehicle assembly as an example, the optimal integration solution of multi-station assembly sequence and job assignment is obtained by using this algorithm, and the validity of the model is verified.</p> <p>&nbsp;</p>
APA, Harvard, Vancouver, ISO, and other styles
5

Zhang, Yuan, Kai Fu Zhang, Jian Feng Yu, and Lei Zhao. "A Dynamic Assembly Modeling Method for Satellite Final Assembly Sequence Planning." Advanced Materials Research 156-157 (October 2010): 332–38. http://dx.doi.org/10.4028/www.scientific.net/amr.156-157.332.

Full text
Abstract:
To study the effect of assembly process information combining disassemble and assemble on satellite assembly sequence, this paper presents an object-oriented and assembly information integrated model, which is composed of static model and dynamic model. The feasibility determination based on Cut-set theory is presented and the construction algorithm of dynamic model is established by static model, the dynamic assembly model tree is obtained by analyzing in layers and verifying possible states using this algorithm, where the assembly model tree includes all the geometric feasible assembly sequences of satellite. Finally, this modeling method is verified by a satellite product.
APA, Harvard, Vancouver, ISO, and other styles
6

Murayama, Takeshi, Bungo Takemura, and Fuminori Oba. "Assembly Sequence Planning Using Inductive Learning." Journal of Robotics and Mechatronics 11, no. 4 (August 20, 1999): 315–20. http://dx.doi.org/10.20965/jrm.1999.p0315.

Full text
Abstract:
The authors propose acquiring heuristic rules automatically for generating assembly sequences efficiently. Heuristic rules are reduced from training examples by inductive learning. Additional training examples are made from information on assembly sequences and used for modifying heuristic rules. As the assembly sequence generation and modification of heuristic rules are executed more, heuristic rules are refined and assembly sequences are generated efficiently. An experiment demonstrated the effectiveness of the approach.
APA, Harvard, Vancouver, ISO, and other styles
7

Yokota, K., and D. R. Brough. "ASSEMBLY/DISASSEMBLY SEQUENCE PLANNING." Assembly Automation 12, no. 3 (March 1992): 31–38. http://dx.doi.org/10.1108/eb004372.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Guo, Jifeng, Chengchao Bai, and Cheng Chen. "Sequence planning for human and robot cooperative assembly of large space truss structures." Aircraft Engineering and Aerospace Technology 89, no. 6 (October 2, 2017): 804–8. http://dx.doi.org/10.1108/aeat-06-2014-0093.

Full text
Abstract:
Purpose In the future, large space truss structures will be likely to require on-orbit assembly. One of the several proposed methods includes cooperative assembly performed by pressure-suited astronauts during extravehicular activity (EVA) and space robots. An intelligent planning method was presented to generate optimal assembly tasks. Design/methodology/approach Firstly, the inherent hierarchical nature of truss structures allows assembly sequences to be considered from strut level and structural volume element (SVE) level. Then, a serial assembly strategy in human-robot environment was applied. Furthermore, a two-level planning algorithm was presented. At the first-level planning, one ant colony algorithm for assembly sequence planning was improved to adopt assembly direction and time as heuristic information and did not consider assembly tasks. And, at the second-level planning, another novel colony algorithm for assembly task planning mainly considered results of the first-level planning, human-robot interactive information, serial assembly strategy and assembly task distributions. Findings The proposed two-level planning algorithm is very effective for solving the human and robot cooperative assembly of large space truss structures. Research limitations/implications In this paper, the case study is based on the following assumptions: each tetrahedron is assembled by two astronauts; each pentahedron is assembled by three astronauts. Practical implications A case illustrates the results of the two-level planning. From this case study, because of geometrical symmetry nature of large space truss structures, the optimal assembly sequences are not only one. Originality/value The improved ant colony algorithm can deal with the assembly sequence and task planning in human-robot environment more effectively.
APA, Harvard, Vancouver, ISO, and other styles
9

Xing, Yan Feng, Yan Song Wang, and Xiao Yu Zhao. "A Particle Swarm Algorithm for Assembly Sequence Planning." Advanced Materials Research 97-101 (March 2010): 3243–46. http://dx.doi.org/10.4028/www.scientific.net/amr.97-101.3243.

Full text
Abstract:
A particle swarm algorithm is proposed to generate optimal assembly sequences for compliant assemblies. Firstly, the liaison graph and the adjacency matrix describe the geometry of the compliant assemblies. An assembly sequence is represented by a character string, whose length is the number of all parts. The conceptual tolerance analysis is used to evaluate feasible sequences. Thereafter, the particle swarm algorithm is presented to generate assembly sequences, in which the elite ratio is applied to improve optimization results. Finally a fender assembly is used to illustrate the algorithm of assembly sequence generation and optimization.
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, Jing, Yun Sheng Yang, and Shao Wei Feng. "Method of Assembly Sequence Planning Based on Simulated Evolution Algorithm." Advanced Materials Research 490-495 (March 2012): 1171–75. http://dx.doi.org/10.4028/www.scientific.net/amr.490-495.1171.

Full text
Abstract:
It is important for assemble industry to generate an optimized assembly sequences. In order to solve this problem, firstly an oriented mating graph model is proposed with the related mating matrix. Therefore an improved simulated evolution algorithm is proposed, which can compute an energy function of the assembly cost associated with the assembly sequence deduced by the graph model. The energy function can be optimized iteratively and perturbed occasionally by the simulated evolution until no further change in the energy occurs. Finally, the validity of the method is proved by a typical case.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Assembly sequence planning"

1

Marehalli, Jayavardhan N. "Assembly Sequence Optimization and Assembly Path Planning." Thesis, Virginia Tech, 1999. http://hdl.handle.net/10919/44837.

Full text
Abstract:
This thesis addresses two important aspects of automatic assembly viz., assembly sequence planning and assembly path planning. These issues are addressed separately starting with sequence planning followed by assembly path planning. For efficient assembly without feedback systems (or, passive assembly), an assembler should know the ideal orientation of each component and the order in which to put the parts together (or, assembly sequence). A heuristic is presented to find the optimal assembly sequence and prescribe the orientation of the components for a minimum set of grippers = ideally one. The heuristic utilizes an index of difficulty (ID) that quantifies assembly. The ID for each task in the assembly process is computed on the basis of a number of geometrical and operational properties. The objective of the optimization problem here is to minimize the assembly ID and categorize parts/subassemblies based on their preferred direction of assembly while allowing re-orientation of the base part. It is assumed that the preferred direction of assembly is vertically downward, consistent with manual as well as most automatic assembly protocols. Our attempt is to minimize the number of degrees of freedom required in a re-orienting fixture and derive the requirements for such a fixture. The assembly of a small engine is used as an example in this study due to the variety of ideally rigid parts involved. In high precision assembly tasks, contact motion is common and often desirable. This entails a careful study of contact states of the parts being assembled. Recognition of contact states is crucial in planning and executing contact motion plans due to inevitable uncertainties. Dr. Jing Xiao of UNCC introduced the concept of principal contacts (PC) and contact formation (CF) for contact state recognition. The concept of using CFs (as sets of PCs) has the inherent advantage that a change of CF is often coincident with a discontinuity of the general contact force (force and torque). Previous work in contact motion planning has shown that contact information at the level of PCs along with the sensed location and force information is often sufficient for planning high precision assembly operations. In this thesis, we present results from experiments involving planned contact motions to validate the notion of PCs and CFs -- an abrupt change in general contact force often accompanies a change between CFs. We are only concerned with solving the 2D peg-in-corner problem.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
2

Gu, Yunqing. "Graphical integration of robot programming and sequence planning for mechanical assembly." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape10/PQDD_0019/MQ54893.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ab, Rashid Mohd Fadzil Faisae. "Integrated multi-objective optimisation of assembly sequence planning and assembly line balancing using particle swarm optimisation." Thesis, Cranfield University, 2013. http://dspace.lib.cranfield.ac.uk/handle/1826/8257.

Full text
Abstract:
In assembly optimisation, Assembly Sequence Planning (ASP) and Assembly Line Balancing (ALB) optimisations currently performed in serial, present an opportunity for integration, allowing benefits such as larger search space leading to better solution quality, reduced error rate in planning and fast time-to-market for a product. The literature survey highlights the research gaps, where the existing integrated ASP and ALB optimisation is limited to a Genetic Algorithm (GA) based approach, while Particle Swarm Optimisation (PSO) demonstrates better performance in individual ASP and ALB optimisation compared to GA. In addition, the existing works are limited to simple assembly line problems which run a homogeneous model on an assembly line. The aim of this research is to establish a methodology and algorithm for integrating ASP and ALB optimisation using Particle Swarm Optimisation. This research extends the problem type to integrated mixed-model ASP and ALB in order to generalise the problem. This research proposes Multi-Objective Discrete Particle Swarm Optimisation (MODPSO), to optimise integrated ASP and ALB. The MODPSO uses the Pareto-based approach to deal with the multi-objective problem and adopts a discrete procedure instead of standard mathematical operators to update its position and velocity. The MODPSO algorithm is tested with a wide range of problem difficulties for integrated single-model and mixed-model ASP and ALB problems. In order to supply sufficient test problems that cover a range of problem difficulties, a tuneable test problem generator is developed. Statistical tests on the algorithms’ performance indicates that the proposed MODPSO algorithm presents significant improvement in terms of larger non-dominated solution numbers in Pareto optimal, compared to comparable algorithms including GA based algorithms in both single-model and mixed-model ASP and ALB problems. The performance of the MODPSO algorithm is finally validated using artificial problems from the literature and real-world problems from assembly products.
APA, Harvard, Vancouver, ISO, and other styles
4

Nguyen, Dang Tan. "Entwicklung eines effizienten Montageplanungssystems auf Basis von Funktionsfolgen." Universitätsverlag Chemnitz, 2018. https://monarch.qucosa.de/id/qucosa%3A33551.

Full text
Abstract:
Die gängige Methodik zum Konzipieren automatisierter Montagesysteme umfasst die Planung der Montage und die physische Entwicklung der technischen Gesamtlösung. Zur Abbildung der konkreten Aufgabe werden standardisierte Symbole in einem Ablaufplan miteinander verknüpft. Die Hauptaufgabe des Konstrukteurs ist die Auswahl und die Zusammenstellung einer optimalen Konfiguration der Funktionsträger sowie deren Implementierung in einer Gesamtlösung unter Berücksichtigung der vorgegebenen Randbedingungen. Das Problem ist der fehlende Informationsgehalt der bisher eingesetzten Handhabungssymbole und Symbole zur Ermittlung der Funktionsträger zur Beschreibung der Montage- und Handhabungsplanung sowie die fehlende Vorgehensweise zur Auswahl der Funktionsträger aus den verschiedenen Varianten nach minimaler Taktzeit und Gesamtanschaffungskosten. Zur Realisierung eines effizienten Montageplanungssystems leitet sich daher die Zielstellung ab, den Informationsgehalt der standardisierten Symbole zu erweitern und mit logischen Schnittstellen für eine automatisierte Verknüpfung in der Funktionsfolge auszustatten. Diese neuen Symbole beinhalten die Definition der Funktionen sowie alle Randbedingungen und Parameter zur eindeutigen Beschreibung der Handhabungsaufgabe. Mithilfe dieser Parameter werden Anforderungslisten erstellt und nach passenden Anlagenkomponenten gesucht. Zur Auswahl der optimalen Komponenten des Montagesystems wird das lineare Optimierungsproblem hinsichtlich der Kombination aus Taktzeit und Gesamtanschaffungskosten gelöst.
The common methodology for designing automated assembly systems involves the assembly planning and the physical development of overall technical solution. To illustrate the concrete task, standardized symbols are connected together in a flowchart. The designer's main task is the selection and the composition of an optimal configuration of the functional carriers as well as their implementation in an overall solution in consideration of the predetermined boundary conditions. One problem is the lack of information content of the previously used handling symbols and the symbols for determining the functional carriers, which describe the assembly and handling planning. The other is the insufficient methods for selecting the functional carriers from the different variants based on minimum cycle time and total acquisition cost. In order to realize an efficient assembly planning system, the objective is therefore to expand the information content of the standardized symbols and equip them with logical interfaces for automated connection in the functional sequence. These new symbols contain the definition of the functions as well as all boundary conditions and parameters for the unambiguous description of the handling task. These parameters are utilised to create requirement lists and search for suitable plant components. In order to select the optimal components of the assembly system, the linear optimization problem regarding the combination of cycle time and total acquisition costs is solved.
APA, Harvard, Vancouver, ISO, and other styles
5

Elhoud, Anass. "Artificial intelligence-based approach for acceleration & optimization of hybrid production line preliminary design in the automotive industry." Electronic Thesis or Diss., Bourgogne Franche-Comté, 2024. http://indexation.univ-fcomte.fr/nuxeo/site/esupversions/d3a97160-65a3-48c3-b8c5-c431847fc587.

Full text
Abstract:
Dans l’industrie automobile compétitive, l’optimisation des lignes de production est essentielle pour améliorer l’efficacité et la rentabilité. Cette thèse propose une solution complète développée en collaboration avec un acteur majeur du secteur automobile, s’attaquant à trois défis principaux : la planification des séquences d’assemblage, l’équilibrage des ressources et l’évaluation dynamique des performances. La première solution optimise les séquences d’assemblage pour minimiser l’utilisation des ressources et les coûts de production en utilisant l’apprentissage par renforcement et le regroupement hiérarchique. La deuxième solution traite de l’équilibrage des lignes d’assemblage en utilisant des algorithmes métaheuristiques pour réduire le temps de cycle sans augmenter les ressources. La troisième solution améliore les performances dynamiques des lignes de production en cas d’événements stochastiques, tels que les pannes et les retards, grâce à la gestion des stocks et aux stratégies de contrôle optimal. Chaque solution a été validée dans des environnements industriels réels, démontrant des améliorations significatives en termes d’efficacité et de performance des lignes de production
In the competitive automotive industry, optimizing production lines is crucial for enhancing efficiency and profitability. This thesis presents a comprehensive solution developed in collaboration with a leading automotive company, tackling three key challenges: assembly sequence planning, resource balancing, and dynamic performance evaluation. The first solution optimizes assembly sequences to minimize resource usage and production costs using reinforcement learning and hierarchical clustering. The second solution addresses assembly line balancing, employing metaheuristic algorithms to reduce cycle time without increasing resources. The third solution improves dynamic production line performance under stochastic events, such as breakdowns and delays, through inventory management and optimal control strategies. Each solution was validated in real industrial environments, demonstrating substantial improvements in production line efficiency and performance
APA, Harvard, Vancouver, ISO, and other styles
6

Wu, Song-Dar, and 吳松達. "Subassembly Extraction in Assembly Sequence Planning." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/22814477819154410863.

Full text
Abstract:
碩士
大葉大學
事業經營研究所
81
Subassembly approach has been applied by today''s industry to reduce the complexity of assembly sequencing for complex assemblies. By analyzing assembly mating conditions, a connection-contact graph is constructed to identify the key components for subassembly extraction. After removing the connection between key components, independent and stable subassemblies can be obtained. In c addition, assembly time is applied to evaluate different subassembly combinations for the selection of better subassembly extraction. Matrix representation and algorithm areproposed for computerization. Finally, an example is presented for the study.
APA, Harvard, Vancouver, ISO, and other styles
7

Chiang, Yu-Cheng, and 蔣佑政. "Considering Bevel Assembly in Intelligent Robot of Assembly Sequence Planning." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/qet475.

Full text
Abstract:
碩士
國立臺北科技大學
工業工程與管理系
106
Nowadays, Industry 4.0 is the trend of global automation technology. It derives a new type of manufacturing. In Industry 4.0, the Cyber-Physical System (CPS) is an important core, which makes the manufacturing process more intelligent. Because the assembly operation has a considerable influence on the manufacturing cost and time, intelligent assembly becomes one of the important keys in CPS intelligent manufacturing. In order to implement intelligent assembly, the cooperation between assembly robot and Assembly Sequence Planning (ASP) must be considered, but the manual coding the robot program is time consuming and requires specialization knowledge and experience. In the past research on intelligent assembly, interference checking often does not consider the components own Local Coordinate System (LCS). If the component has an inclined interference and only use the global coordinate system (GCS) to generate the ASP, it will generate wrong ASP. Because the GCS moves in the direction of the orthogonal axis, it is not possible to check the interference relationship in the direction of the non-orthogonal axis. This study proposes a Local Coordinate Cyber-Physical Intelligent Assembly System (LCCPIAS). The user only needs to input the CAD image file and generate the assembly sequence through the proposed method. The robot assembly can be modularized and the robot grammar can be automatically generated to achieve intelligent assembly. The method proposed in this study not only solves the problems that cannot be solved by the previous literature, but also leads to a more suitable assembly sequence for the robot than the previous method, and at the same time can solve the problems of assembly and automation of the inclined assembly. The method proposed in this study is great help to achieve intelligent assembly.
APA, Harvard, Vancouver, ISO, and other styles
8

LYU, Shao-Ren, and 呂紹任. "Intelligent KBE system for assembly sequence planning." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/28379050088160941570.

Full text
Abstract:
碩士
中華大學
機械工程學系碩士班
97
The purposed research is to build an intelligent KBE system for assembly sequence planning (ASP) .The knowledge-driven concept of product design is a novel trend of current computer aided design (CAD) system, knowledge-based engineering (KBE) can be an integrated processing technology, which merges the original engineering design experiences, design achievements and domain know-how, fulfills the connections with CAX (CAD/CAM/CAE/CAPP/CAI) system via the knowledge reuse, and further reduces the workloads of product development and promptly boosts the design efficiencies. Therefore, the purposed research joins back-propagation neural network (BPNN) algorithm and UG NX/KF second development module to create feasible assembly sequences. System user can easily access the volume, weight and feature number through NX system, and input the related parameters such as contact relationship number and total penalty value, and predict the feasible assembly sequence via a robust BPNN engine. In addition, the existing system can demonstrate the explosion views and vivid assembly simulations, save the entire assembly information, and setup a splendid knowledge base. Finally, the study apply the toy car model as a learning (training) sample and toy motorbike model, real-world brushless DC fan as testing and verified samples. The results show that the proposed model can efficiently generate BPNN engines, facilitate assembly sequence optimization and allow the designers to recognize the contact relationships, assembly difficulties and assembly constraints of three-dimensional (3D) components in a virtual environment type.
APA, Harvard, Vancouver, ISO, and other styles
9

Pan, Chunxia. "Integrating CAD files and automatic assembly sequence planning /." 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Shih, Wei-Feng, and 石豐維. "Computer-Aided Assembly Sequence Planning Using Simulated Annealing." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/87028953120959661768.

Full text
Abstract:
碩士
大葉大學
工業工程研究所
89
The purpose of this project is to establish a computer -aided model for assembly sequence planning using simulated annealing approach. Four evaluation criteria such as directionality, fixture complexity, direction change and tool change are developed for systematic evaluation of the assembly sequences. Then, simulated annealing algorithm have been adopted for solution procedure for assembly sequence planning. In addition, the solution quality and solving efficiency are tested for the computer-aided model being developed. Finally, real-world examples are adopted for illustrating and validating the performance of the computer-aided SA model for assembly sequence planning.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Assembly sequence planning"

1

United States. National Aeronautics and Space Administration., ed. Knowledge-based decision support for space station assembley sequence planning: Final report. Westlake Village, CA: ISX Corporation, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

United States. National Aeronautics and Space Administration., ed. Knowledge-based decision support for space station assembley sequence planning: Final report. Westlake Village, CA: ISX Corporation, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

United States. National Aeronautics and Space Administration., ed. Knowledge-based decision support for space station assembley sequence planning: Final report. Westlake Village, CA: ISX Corporation, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Assembly sequence planning"

1

van Holland, Winfried, and Willem F. Bronsvoort. "Assembly features and sequence planning." In Product Modeling for Computer Integrated Design and Manufacture, 275–84. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-0-387-35187-2_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Rong, and Ying Tian. "Assembly Sequence Planning Based on Assembly Knowledge Database." In Lecture Notes in Electrical Engineering, 857–64. London: Springer London, 2013. http://dx.doi.org/10.1007/978-1-4471-4850-0_109.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hoffman, Richard. "A common sense approach to assembly sequence planning." In Computer-Aided Mechanical Assembly Planning, 289–313. Boston, MA: Springer US, 1991. http://dx.doi.org/10.1007/978-1-4615-4038-0_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kärcher, Susann, and Thomas Bauernhansl. "Method for Data-Driven Assembly Sequence Planning." In Advances in Automotive Production Technology – Theory and Application, 71–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2021. http://dx.doi.org/10.1007/978-3-662-62962-8_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Valle, Carmelo Del, Rafael M. Gasca, Miguel Toro, and Eduardo F. Camacho. "A Genetic Algorithm for Assembly Sequence Planning." In Artificial Neural Nets Problem Solving Methods, 337–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44869-1_43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Youhui, Liu, Liu Xinhua, and Li Qi. "Assembly Sequence Planning Based on Ant Colony Algorithm." In Lecture Notes in Electrical Engineering, 397–404. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-27311-7_53.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bala Murali, G., B. B. V. L. Deepak, M. V. A. Raju Bahubalendruni, and B. B. Biswal. "Optimal Assembly Sequence Planning Towards Design for Assembly Using Simulated Annealing Technique." In Research into Design for Communities, Volume 1, 397–407. Singapore: Springer Singapore, 2017. http://dx.doi.org/10.1007/978-981-10-3518-0_35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hsu, Y. Y., W. C. Chen, P. H. Tai, and Y. T. Tsai. "A Knowledge-Based Engineering System for Assembly Sequence Planning." In Proceedings of the 36th International MATADOR Conference, 123–26. London: Springer London, 2010. http://dx.doi.org/10.1007/978-1-84996-432-6_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Röhrdanz, F., H. Mosemann, and F. M. Wahl. "Geometrical and Physical Reasoning for Stable Assembly Sequence Planning." In Geometric Modeling: Theory and Practice, 416–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-642-60607-6_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gunji, Balamurali, B. B. V. L. Deepak, Amruta Rout, Golak Bihari Mohanta, and B. B. Biswal. "Hybridized Cuckoo–Bat Algorithm for Optimal Assembly Sequence Planning." In Advances in Intelligent Systems and Computing, 627–38. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-1592-3_49.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Assembly sequence planning"

1

Tian, Yunsheng, Karl D. D. Willis, Bassel Al Omari, Jieliang Luo, Pingchuan Ma, Yichen Li, Farhad Javid, et al. "ASAP: Automated Sequence Planning for Complex Robotic Assembly with Physical Feasibility." In 2024 IEEE International Conference on Robotics and Automation (ICRA), 4380–86. IEEE, 2024. http://dx.doi.org/10.1109/icra57147.2024.10611595.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Parzeller, Rafael, Elisa Schuster, Axel Busboom, and Detlef Gerhard. "Assembly Sequence Planning by Reinforcement Learning and Accessibility Checking using RRT*." In 2024 IEEE 29th International Conference on Emerging Technologies and Factory Automation (ETFA), 1–8. IEEE, 2024. http://dx.doi.org/10.1109/etfa61755.2024.10710703.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kiyokawa, Takuya, Ismael Rodriguez, Korbinian Nottensteiner, Peter Lehner, Thomas Eiband, Maximo A. Roa, and Kensuke Harada. "CAD-Informed Uncertainty-Aware Sequence and Motion Planning for Robotic Assembly." In 2024 IEEE 20th International Conference on Automation Science and Engineering (CASE), 418–25. IEEE, 2024. http://dx.doi.org/10.1109/case59546.2024.10711666.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Nagpal, Kartik, and Negar Mehr. "Optimal Robotic Assembly Sequence Planning (ORASP): A Sequential Decision-Making Approach." In 2024 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 9847–54. IEEE, 2024. https://doi.org/10.1109/iros58592.2024.10802475.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Liu, Yu, Gang Chen, Zeyuan Huang, Zixuan Hao, Qingxuan Jia, and Yifan Wang. "Truss Assembly Sequence Planning Under Multiple Constraints Based on Ant Colony Algorithm." In 2024 IEEE 19th Conference on Industrial Electronics and Applications (ICIEA), 1–6. IEEE, 2024. http://dx.doi.org/10.1109/iciea61579.2024.10665035.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ab. Rashid, Mohd Fadzil Faisae, Wasif Ullah, and Muhammad Ammar Nik Mutasim. "Assessment of Integrated Assembly Sequence Planning and Line Balancing Optimization Using Metaheuristic Algorithms." In 2024 IEEE 6th Symposium on Computers & Informatics (ISCI), 55–59. IEEE, 2024. http://dx.doi.org/10.1109/isci62787.2024.10668162.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jiang, Youwen, Ke Li, Haoxiang Jiang, Linxun Li, and Junwen Huang. "Research and Implementation of Assembly Sequence Planning for Array Antennas Based on a Hybrid Algorithm." In 2024 International Conference on Industrial IoT, Big Data and Supply Chain (IIoTBDSC), 380–84. IEEE, 2024. https://doi.org/10.1109/iiotbdsc64371.2024.00075.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Morato, Carlos, Krishnanand Kaipa, and Satyandra K. Gupta. "Assembly Sequence Planning by Using Multiple Random Trees Based Motion Planning." In ASME 2012 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/detc2012-71243.

Full text
Abstract:
In this paper, we introduce multiple random trees based motion planning to perform assembly sequence planning for complex assemblies. Initially, given an assembly model, our technique performs disassembly sequence planning. This approach dynamically reduces the size and complexity of the assembly based on a hierarchical exploration structure that keeps information about the completion of the disassembly. Next, the disassembly information is used to generate feasible assembly sequences, along with precedence constraints, to assemble each part into the current subassembly. The motion planning system chooses part order by detecting geometrical interferences and analyzing feasible part movements. Results from tests on a variety of complex assemblies validate the efficiency of our approach.
APA, Harvard, Vancouver, ISO, and other styles
9

Zhang, Nan, Zhenyu Liu, Chan Qiu, and Jianrong Tan. "A Novel Assembly Sequence Design Mechanism for Assembly Sequence Planning." In 2020 IEEE 7th International Conference on Industrial Engineering and Applications (ICIEA). IEEE, 2020. http://dx.doi.org/10.1109/iciea49774.2020.9102101.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, Nan, Zhenyu Liu, Chan Qiu, and Jianrong Tan. "A Novel Assembly Sequence Design Mechanism for Assembly Sequence Planning." In ICIEA 2021-Europe: 2021 The 8th International Conference on Industrial Engineering and Applications. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3463858.3463874.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Assembly sequence planning' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography