Non-uniform rational B-spline-based minimum cost trajectory planning for autonomous robots
by R. Saravanan, S. Ramabalan, P. Sriram, C. Balamurugan
International Journal of Intelligent Systems Technologies and Applications (IJISTA), Vol. 9, No. 2, 2010

Abstract: This paper proposes a new novel trajectory planning method by using two evolutionary algorithms namely Elitist non-dominated sorting genetic algorithm (NSGA-II) and differential evolution (DE) for an autonomous robot manipulator (STANFORD robot) whose workspace includes several obstacles. The aim of the problem is to minimise a multicriterion cost function with actuator constraints, joint limits and obstacle avoidance constraints by considering dynamic equations of motion. Trajectories are defined by non uniform rational B-spline (NURBS) functions. This is a nonlinear constrained optimisation problem with 6 objective functions, 32 constraints and 288 variables. The multicriterion cost function is a weighted balance of transfer time, mechanical energy of the actuators, singularity avoidance, penalty function to guarantee the collision free motion, joint jerks and joint accelerations. All types of obstacles (fixed, moving and oscillating obstacles) are present in the workspace of the robot. The results obtained from NSGA-II and DE are compared and analysed.

Online publication date: Sat, 31-Jul-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Systems Technologies and Applications (IJISTA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com