The Robotics Institute
Search the site
RI | Publications | Determining Near Optimal Interference-free Polyhedral Configurations for Stacking

Text only version of this site

Determining Near Optimal Interference-free Polyhedral Configurations for Stacking
V. Ayyadevara, D. Bourne, K. Shimada, and R.H. Sturges
Proceedings of IEEE International Symposium on Assembly and Task Planning, July, 1999, pp. 286-293.

Jump to: Download | Abstract | Text Reference | BibTeX Reference

Download [Help]

Adobe portable document format (pdf) [732 KB]

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

This paper uses a configuration space (c-space) approach to finding a satisfactory stack of polyhedral parts; we tested this method with industrial sheet metal parts. The optimal configuration for a new part, added to an existing stack, minimizes distance from a user-specified desired position, lies inside a given c-space region and, avoids interference with parts already in the stack. We present an iterative c-space based method that works with discrete orientations and yet produces interference-free configurations close to the desired part configuration. Two techniques are used to speed up the most computationally intensive step of c-space obstacle computation. An algorithm to compute orientation ranges within which connectivity graph topology of the obstacle stays constant is presented. For every discrete orientation, we construct only a portion of the c-space obstacle in order to compute an interference-free configuration.

Text Reference

V. Ayyadevara, D. Bourne, K. Shimada, and R.H. Sturges, "Determining Near Optimal Interference-free Polyhedral Configurations for Stacking," Proceedings of IEEE International Symposium on Assembly and Task Planning, July, 1999, pp. 286-293.

BibTeX Reference

@article{Ayyadevara_1999_3051,
   author = "Venkat Ayyadevara and David Bourne and Kenji Shimada and R. H. Sturges",
   title = "Determining Near Optimal Interference-free Polyhedral Configurations for Stacking",
   journal = "Proceedings of IEEE International Symposium on Assembly and Task Planning",
   month = "July",
   year = "1999",
   pages = "286-293"
}


The Robotics Institute is part of the School of Computer Science, Carnegie Mellon University.
For updates and comments, please see these instructions.
This page maintained by robotwebmaster@ri.cmu.edu