Path planning for redundant manipulators using metaheuristic for bilevel optimization and maximum of manipulability

R. Menasri 1, 2 A. Nakib 2 H. Oulhadj 2 B. Daachi 1 P. Siarry 2 G. Hains 3
1 SIRIUS
LISSI - Laboratoire Images, Signaux et Systèmes Intelligents
2 SIMO
LISSI - Laboratoire Images, Signaux et Systèmes Intelligents
3 LACL - Laboratoire d'Algorithmique Complexité et Logique
Abstract : In this paper, we propose a novel path planning method for a robot manipulator in the case of several obstacles. The path is generated by steps. At each step, a new position of the end effector is found in the Cartesian space. The redundancy of the manipulator, imposes that this position can be found by an infinity of configurations in the joint space. Thus, we search the best configuration which allows to avoid obstacles and singularities of the robot. This method is based on using the bilevel genetic algorithm to solve this problem. Simulation results showed the effectiveness of the proposed approach.
Document type :
Conference papers
Liste complète des métadonnées
https://hal.archives-ouvertes.fr/hal-01539412
Contributor : Lab Lissi <>
Submitted on : Wednesday, June 14, 2017 - 5:47:05 PM
Last modification on : Monday, January 28, 2019 - 1:33:56 AM

Identifiers

  • HAL Id : hal-01539412, version 1

Collections

UPEC-UPEM | LISSI | INSMI | LACL | TDS-MACS

Citation

R. Menasri, A. Nakib, H. Oulhadj, B. Daachi, P. Siarry, et al.. Path planning for redundant manipulators using metaheuristic for bilevel optimization and maximum of manipulability. Proc. Of the IEEE Int. Conf. on Robotics and Biomimetics, ROBIO 2013, 2013, Shenzhen, China. pp.145-150, 2013. 〈hal-01539412〉

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

34

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD