ROBOTIC MOTION PLANNING USING CONVEX OPTIMIZATION METHODS

Authors

  • Thaker Nayl University of Information Technology and Communications (UOITC)

DOI:

https://doi.org/10.25195/ijci.v45i2.49

Keywords:

Path planning, collision avoidance, convex optimization

Abstract

Collision avoidance techniques tend to derive the robot away of the obstacles in minimal total travel distance. Most of
the collision avoidance algorithms have trouble get stuck in a local minimum. A new technique is to avoid local minimum in convex
optimization-based path planning. Obstacle avoidance problem is considered as a convex optimization problem under system state and
control constraints. The idea is by considering the obstacles as a convex set of points which represents the obstacle that encloses in
minimum volume ellipsoid, also the addition of the necessary offset distance and the modified motion path is presented. In the analysis,
the results demonstrated the effectiveness of the suggested motion planning by using the convex optimization technique.

Downloads

Download data is not yet available.

Author Biography

Thaker Nayl, University of Information Technology and Communications (UOITC)

College of Engineering

Downloads

Published

2019-12-01