z-logo
open-access-imgOpen Access
Path optimization for robots in a constrained workspace
Author(s) -
Doaa Mahmood Badr,
Abbas Fadhal Mahdi
Publication year - 2019
Publication title -
international journal of robotics and automation (ijra)/iaes international journal of robotics and automation
Language(s) - English
Resource type - Journals
eISSN - 2722-2586
pISSN - 2089-4856
DOI - 10.11591/ijra.v8i2.pp89-93
Subject(s) - path (computing) , workspace , motion planning , robot , computer science , any angle path planning , topology (electrical circuits) , configuration space , sequence (biology) , cartesian coordinate system , planner , control theory (sociology) , space (punctuation) , mathematical optimization , mathematics , artificial intelligence , physics , geometry , control (management) , combinatorics , quantum mechanics , biology , genetics , programming language , operating system
In this work, the classical A* algorithm serves as path planner to generate the optimum path that would avoid collisions and take the start, collisions, and goal as an input and give the optimal path as an output. The work was done in a static environment, so the coordinates of the obstacles are predefined for the planner. The obtained path is just a sequence of points in space, and this path may be considered later the task space and the first step for another sequential operation like mapping from Cartesian space to joint space, topology optimization, dimensional synthesis, etc. The case study was Lab-Volt 5150 manipulator; it is an accurate educational five degree of freedom 5DOF stationary robot driven by five stepper motors.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here