On the maximum dynamic stress search problem for robot manipulators

A. Khoukhi*, A. Ghoul

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

6 Scopus citations

Abstract

This paper deals with the problem of the dynamic stress optimisation for manipulator robots. The maximum dynamic stress search is a challenging problem, insofar the dynamic stresses change in a very complex manner and they are strongly influenced by the payload, internal parameters of the robot, and instantaneous values of the articular variables (positions, velocities, and accelerations). This problem is solved using a hybrid simplex-genetic algorithm. This algorithm allows solving the dilemma of exploration vs. exploitation in the search space. A simulation study shows the greater performance of the proposed approach as compared to a classical approach of the configuration space inverse sweeping.

Original languageEnglish
Pages (from-to)513-522
Number of pages10
JournalRobotica
Volume22
Issue number5
DOIs
StatePublished - Sep 2004

Keywords

  • Dynamic stress
  • Genetic programming
  • Hybrid programming
  • Robot manipulator
  • Simplex programming
  • Sweeping

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Software
  • Computational Mechanics
  • General Mathematics
  • Modeling and Simulation
  • Rehabilitation
  • Mechanical Engineering
  • Computer Vision and Pattern Recognition
  • Computer Science Applications
  • Control and Optimization
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'On the maximum dynamic stress search problem for robot manipulators'. Together they form a unique fingerprint.

Cite this