A trajectory planning of redundant manipulators based on bilevel optimization

R. Menasri, A. Nakib, B. Daachi, H. Oulhadj and P. Siarry

Applied Mathematics and Computation, 2015, vol. 250, issue C, 934-947

Abstract: In this paper, a novel trajectory planning approach is proposed for redundant manipulators in the case of several obstacles. The trajectory is discretized and at each step, we search for a new position of the end effector in the Cartesian space to reach the final position. Because of the redundancy, this position can be achieved by an infinity of configurations in the joint space. Thus, we use this property to find the best configuration that allows to avoid obstacles and singularities of the robot. The proposed method is based on a bilevel optimization formulation of the problem and bi-genetic algorithm to solve it. In order to avoid obstacles, we also proposed to manage constraints of the problem dynamically. This technique adapts the number of constraints in the formulation of the problem with the position of the obstacles. Simulation results showed the effectiveness of the proposed method.

Keywords: Redundant manipulators; Bilevel optimization; Bi-genetic algorithm; Trajectory planning (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300314014763
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:250:y:2015:i:c:p:934-947

DOI: 10.1016/j.amc.2014.10.101

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().