Abstract
This paper presents a model based on pomsets (partially ordered multisets) for estimating the minimum number of setups in the workcells in Assembly Sequence Planning. This problem is focused through the minimization of the makespan (total assembly time) in a multirobot system. The planning model considers, apart from the durations and resources needed for the assembly tasks, the delays due to the setups in the workcells. An A* algorithm is used to meet the optimal solution. It uses the And/Or graph for the product to assemble, that corresponds to a compressed representation of all feasible assembly plans. Two basic admissible heuristic functions can be defined from relaxed models of the problem, considering the precedence constraints and the use of resources separately. The pomset-based model presented in this paper takes into account the precedence constraints in order to obtain a better estimation for the second heuristic function, so that the performance of the algorithm could be improved.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R.H. Wilson, L. Kavraki, T. Lozano-Pérez and J.C. Latombe. Two-Handed Assembly Sequencing. Int. Jour. of Robotic Research. Vol. 14, pp. 335–350, 1995.
L.S. Homem de Mello and A.C. Sanderson. A Correct and Complete Algorithm for the Generation of Mechanical Assembly Sequences. IEEE Trans. Robotic and Automation.Vol 7(2), 1991, pp. 228–240.
T. L. Calton. Advancing design-for-assembly. The next generation in assembly planning. Proc. 1999 IEEE International Symposium on Assembly and Task Planning, pp. 57–62, Porto, Portugal, July 1999.
M. H. Goldwasser and R. Motwani. Complexity measures for assembly sequences. Int. Journal of Computational Geometry and Applications, 9:371–418, 1999.
C. Del Valle and E.F. Camacho. Automatic Assembly Task Assignment for a Multirobot Environment. Control Eng. Practice, Vol. 4, No. 7, 1996, pp. 915–921.
L.S. Homem de Mello and A.C. Sanderson. And/Or Graph Representation of Assembly Plans. IEEE Trans. Rob. Automation. Vol. 6, No. 2, pp. 188–199, 1990.
J. Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Reading, MA, Addison-Wesley, 1984.
V.R. Pratt. Modeling Concurrency with Partial Orders. Int. Journal of Parallel Programming. Vol. 15, No. 1, pp. 33–71, Feb 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Del Valle, C., Toro, M., Ceballos, R., Aguilar-Ruiz, J.S. (2002). A Pomset-Based Model for Estimating Workcells’ Setups in Assembly Sequence Planning. In: Garijo, F.J., Riquelme, J.C., Toro, M. (eds) Advances in Artificial Intelligence — IBERAMIA 2002. IBERAMIA 2002. Lecture Notes in Computer Science(), vol 2527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36131-6_85
Download citation
DOI: https://doi.org/10.1007/3-540-36131-6_85
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00131-7
Online ISBN: 978-3-540-36131-2
eBook Packages: Springer Book Archive