Abstract
This paper deals with a complete and correct method to compute how many plans exist for an assembly or processing task. Planning is a NP-hard problem and then, in some situations, the application of time consuming search methods must be avoided. However, up to now the computation of the exact number of alternative plans for any situation was not reported elsewhere. Notice that the complexity of the problem does not depend on the number of involved operations, components or parts. The complexity of the problem depends on the topology of the precedences between operations. With the method presented in this paper, it will be easy to decide the search method to use, since we know how many possible plans could exist before applying the search method.
Readers interested in a classification of Assembly and Task Planning may consult reference
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Gottschlich, C. Ramos, D. Lyons: Assembly and Task Planning: A Taxonomy. IEEE Robotics and Automation Magazine, 1(3): 4–12, September 1994
J. Rocha, C. Ramos: Plan Representation and Heuristic Generation of Operation Sequences for Manufacturing Tasks. In International Conference on Data and Knowledge Systems for Manufacturing and Engineering-DKSME'96, pages 223–242, 1996
J. Rocha, C. Ramos: Plan Representation and Generation for Manufacturing Tasks. In First IEEE International Symposium on Assembly and Task Planning, pages 22–27, 1995
J. Rocha, C. Ramos: Task Planning for Flexible and Agile Manufacturing Systems. In IEEE/RSJ International Conference on Intelligent Robots and Systems-IROS'94, 1994
L. Homem de Mello: Task sequence planning for robotic assembly. PhD Dissertation, Carnegie Mellon University, 1989
S. Gupta, D. Nau: Optimal Block's World Solutions are N-P. Technical Report, Computer Science Department, University of Maryland, 1990.
J. Wolter: A Combinatorial Analysis of Enumerative Data Structures for Assembly Planning. Journal of Design and Manufacturing, 2(2): 93–104, 1992
C. C. Hayes: MACHINIST: A Process Planner for Manufacturability Analysis, 1995
J. Tulkoff. CAPP. Computer Aided Process Planning. Computer and Automated Systems Association of SME, 1985
L. Figueiredo: Conversion and Execution of Process Plans (in portuguese). Master Thesis, University of Porto, 1996
A. Kusiak: Intelligent Manufacturing Systems. Prentice-Hall International Series in Industrial and Systems Engineering, 1990
D. Das, S. Gupta, and D. Nau: Reducing cost set-up by automated generation of redesign suggestions. In ASME Computers in Engineering Conference, 1994
C. Ramos, A. Almeida, Z. Vale: Scheduling Manufacturing Orders with Due Dates acting as real deadlines. Advanced Summer Institute of Network of Excellence in Intelligent Control and Integrated Manufacturing System, ASI'95, 1995
C. Ramos: An Architecture and a Negotiation Protocol for the Dynamic Scheduling of Manufacturing Systems. In IEEE Int. Conference on Robotics and Automation-ICRA'94, pages 3161–3166, 1994
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag
About this paper
Cite this paper
Rocha, J., Ramos, C., Vale, Z. (1998). Complexity of precedence graphs for assembly and task planning. In: Mira, J., del Pobil, A.P., Ali, M. (eds) Methodology and Tools in Knowledge-Based Systems. IEA/AIE 1998. Lecture Notes in Computer Science, vol 1415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-64582-9_744
Download citation
DOI: https://doi.org/10.1007/3-540-64582-9_744
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64582-5
Online ISBN: 978-3-540-69348-2
eBook Packages: Springer Book Archive