AND/OR Graph Representation of Assembly Plans.

Abstract

This report presents a compact representation of all possible assembly plans of a given product usng AND/OR graphs. Such a representation forms the basis for efficient planning algorithms which enable an increase in assembly system flexibility by allowing an intelligent robot to pick a course of action according to instantaneous conditions. Two applications are discussed: the selection of the best assembly plan (off-line planning), land opportunistic scheduling (on-line planning). An example of an assembly with four parts illustrates the use of the AND/OR graph representation to find the best assembly plan based on weighing of operations according to complexity of manipulation and stability of subassemblies. In practice, a generic search algorithm, such as the AO may be used to fine this plan. The scheduling efficiency using this representation is compared to fixed sequence and precedence graph representations. The AND/OR graph consistently reduces the average number of operations.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1986
Accession Number
ADA168036

Entities

People

  • Arthur C. Sanderson
  • Luiz S. H. De Mello

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Autonomy

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Artificial Intelligence
  • Assembly
  • Assembly Lines
  • Disassembly
  • Efficiency
  • Engineering
  • Fabrication
  • Gantt Charts
  • Job Shop Scheduling
  • Management Engineering
  • Management Planning And Control
  • Manufacturing
  • Mathematical Programming
  • Scheduling (Production)
  • Sequences

Readers

  • Aerospace Test and Evaluation
  • Graph Algorithms and Convex Optimization.
  • Robotics and Automation.

Technology Areas

  • AI & ML
  • AI & ML - Autonomous Systems
  • AI & ML - Machine Learning Algorithms
  • Autonomy
  • Autonomy - UAVs