Skip to main content
Log in

Cooperation Requirements Planning (CRP) for multiprocessors: Optimal assignment and execution planning

  • Published:
Journal of Intelligent and Robotic Systems Aims and scope Submit manuscript

Abstract

Cooperation is considered an essential attribute of intelligent multi-machine systems. It enhances their flexibility and reliability. Cooperation Requirement Planning (CRP) is the process of generating a consistent and coordinated global execution plan for a set of tasks to be completed by a multi-machine system based on the task cooperation requirements and interactions. CRP is divided into two steps: CRP-I which matches the task requirements to machine and system capabilities to generate cooperation requirements. It also generates task precedence, machine operation, and system resource constraints. CRP-II uses the cooperation requirements and various constraints to generate a task assignment and coordinated and consistent global execution plan. The global execution plan specifies an ordered sequence of actions and the machine sets that execute them such that the assigned tasks are successfully completed, all the constraints are resolved, and the desired performance measure optimized.

In this paper, we describe the CRP-II methodology based on the concepts of planning for multiple goals with interactions. Each task is considered to be a goal, and the CRP-I process is viewed as generating alternate plans and associated costs to accomplish each goal. Five different interactions are specified between the various plans: action combination, precedence relation, resource sharing, cooperative action, and independent action. The CRP-II process is viewed as selecting a plan to satisfy each goal and resolving the interactions between them. A planning strategy is proposed which performs plan selection and interaction resolution simultaneously using a best-first search process to generate the optimal global plan.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. NofS. Y. and HannaD.: Operational characteristics of multi-robot systems with cooperation, Int. J. Production Res. 27(3) (1989), 477–492.

    Google Scholar 

  2. RajanV. N. and NofS. Y.: A game-theoretic approach for co-operation control in multi-machine workstations, Int. J. Computer Integrated Manufacturing 3(1) (1990), 47–59.

    Google Scholar 

  3. ChryssolourisG. and ChanS.: An integrated approach to process planning and scheduling, Annals CIRP 34(1) (1985), 413–417.

    Google Scholar 

  4. Rajan, V. N.: Cooperation requirement planning for multi-robot assembly cells, Ph.D. Dissertation, Purdue University, W. Lafayette, IN 47907, 1993.

  5. NofS. Y. and RajanV. N.: Automatic generation of assembly constraints and cooperation task planning, Annals CIRP 42(1), (1993), 13–16.

    Google Scholar 

  6. YangQ., NauD. S., and HendlerJ.: Merging Separately Generated Plans with Restricted Interactions, Technical Report No. UMIACS-TR-91-73, University of Maryland Institute for Advanced Computer Studies, University of Maryland, College Park, MD, 20742, May 1991.

    Google Scholar 

  7. NilssonN. J.: Principles of Artificial Intelligence, Tioga Publishing Company, Palo Alto, CA, 1980.

    Google Scholar 

  8. BlazewiczJ., DrabowskiM., and WeglarzJ.: Scheduling multiprocessor tasks to minimize schedule length, IEEE Trans. Computers, C-35(5) (May 1986), 389–393.

    Google Scholar 

  9. RajanV. N. and NofS. Y.: Logic and communication issues in cooperation planning for multi-machine workstations, Int. J. Systems Automation: Research and Applications 2(3) (1992), 193–212.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rajan, V.N., Nof, S.Y. Cooperation Requirements Planning (CRP) for multiprocessors: Optimal assignment and execution planning. J Intell Robot Syst 15, 419–435 (1996). https://doi.org/10.1007/BF00437605

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00437605

Key words

Navigation