Open Access Open Access  Restricted Access Subscription or Fee Access

An Algorithm to Test Feasibility Predicate for Robotic Assemblies

M. V. A. Raju Bahubalendruni, B. B Biswal

Abstract


Selection of a feasible assembly sequence is an essential element to achieve cost effective manufacturing process. Test for feasibility predicate is a key segment in assembly sequence planning, which is generally carried by a skilled industrial engineer. The feasibility predicate test is involved in checking possibility of disassembling a component from the assembled product through a collision free path. To attain economic assembly process, the feasibility predicate test must also results the optimal disassembly direction. In the current paper a novel method called “modified bounding box method” to obtain the optimal feasible directions for a component is illustrated with examples. An algorithm to integrate the methodology with 3D CAD environment to automate the process is also well described.

 


Keywords


Modified bounding box method, robotic assemblies, feasibility testing

Full Text:

PDF

References


Bourjault A. Contribution a une Approche Methodologique de L’ Assemblage Automatise: Elaboration Automatique des Sequences Operatoires (“Contribution to the Methodology of Automated Assembly: Automatic Generation of Operations Sequences”). [PhD Thesis]. Université de Franche-Comté, Besançon, France. 1984.

De Fazio, Thomas. Daniel E Whitney. Simplified Generation of all Mechanical Assembly Sequences. IEEE J. Robot. Autom. 1987; 3(6): 640–58p.

Homem de Mello, Sanderson AC. Automatic Generation of Mechanical Assembly Sequences. Technical Report, CMU-RI-TR-88-19. The Robotics Inst., Carnegie-Mellon Univ. 1988.

Homem de Mello, Sanderson AC. Task Sequence Planning for Assembly. In IMACS World Congress '88 on Scientific Computation. Paris. 1988.

MVA Raju Bahubalendruni. BB Biswal. Computer Aid for Automatic Liaisons Extraction from Cad Based Robotic Assembly, Proceedings of the 8th International Conference on Intelligent Systems and Control (ISCO), 2014, 42–5p.

Bahubalendruni MVA Raju, Biswal BB. An Intelligent Method to Test Feasibility Predicate for Robotic Assembly Sequence Generation. In Proceedings of the International Conference on Intelligent Computing, Communication & Devices (ICCD). 2014.

Fu LC., Liu DY. An Efficient Algorithm for Finding a Collision-free Path among Polyhedral Obstacles. J. Robotic Syst. 1990; 7(1): 129–37p.

Ponamgi Madhav, Dinesh Manocha, Ming C Lin. Incremental Algorithms for Collision Detection between Solid Models. Proceedings of the Third ACM Symposium on Solid Modeling and Applications. 1995; 293–304p.

Hubbard, Philip M. Interactive Collision Detection. Proceedings of IEEE Symposium on Research Frontiers in Virtual Reality. 1993, 24–31p.

EG Gilbert, CP Foo. Computing the Distance between General Convex Objects in Three-Dimensional Space. IEEE T. Robot. Autom. 1990; 6(1): 53–61p.

Zeghloul, Rambeaud S. P., Lallem JP. A Fast Distance Calculation between Convex Objects by Optimization Approach. IEEE Proceedings on International Conference on Robotics and Automation, 1994; 2520–25p.

Cohen JD., Lin MC., Manocha D, et al. I-COLLIDE: An Interactive and Exact Collision Detection System for Large-Scale Environments. Proceedings of ACM International 3D Graphics Conference. 1995, 189–96p.




DOI: https://doi.org/10.37591/joma.v1i2.7293

Refbacks

  • There are currently no refbacks.