Motion planning for multi-link robots with artificial potential fields and modified simulated annealing

In this thesis we present a hybrid control methodology using Artificial Potential Fields (APF) integrated with a modified Simulated Annealing (SA) optimization algorithm for motion planning of a multi-link robots team. The principle of this work is based on the locomotion of a snake where subsequent links follow the trace of the head. The proposed algorithm uses the APF method which provides simple, efficient and effective path planning and the modified SA is applied in order for the robots to recover from a local minima. Modifications to the SA algorithm improve the performance of the algorithm and reduce convergence time. Validation on a three-link snake robot shows that the derived control laws from the motion planning algorithm that combine APF and SA can successfully navigate the robot to reach its destination, while avoiding collisions with multiple obstacles and other robots in its path as well as recover from local minima. To improve the performance of the algorithm, the gradient descent method is replaced by Newton’s method which helps in reducing the zigzagging phenomenon in gradient descent method while the robot moves in the vicinity of an obstacle.

Name thesis:degree_name

Master of Applied Science (MASc)

Discipline thesis:degree_discipline

Electrical and Computer Engineering

Grantor

University of Ontario Institute of Technology

Year dc:date.issued

2010

Author dc:creator

• Yagnik, Deval

Advisors dc:contributor.advisor

• Ren, Jing
• Liscano, Ramiro

• Artificial potential fields
• Motion planning
• Multiple link robot
• Simulated annealing
• Snake robot

Language dc:language.iso

en

Handle dc:identifier.uri

https://hdl.handle.net/10155/132

OAI identifier oai:identifier

oai:ontariotechu.scholaris.ca:10155/132