Abstract
Energy usage in robotic applications is rapidly increasing as industrial robot installations grow. This research introduces a novel approach, using the rapidly exploring random tree (RRT)-based scheme for optimizing the robot’s motion planning and minimizing energy consumption. Sampling-based algorithms for path planning, such as RRT and its many other variants, are widely used in robotic motion planning due to their efficiency in solving complex high-dimensional problems efficiently. However, standard versions of these algorithms cannot guarantee that the generated trajectories are always optimum and mostly ignore the energy consumption in robotic applications. This paper proposes an energy-efficient industrial robotics motion planning approach using the novel flight cost-based RRT (FC-RRT*) algorithm in pick-and-place operation to generate nodes in a predetermined direction and then calculate energy consumption using the circle point method. After optimizing the motion trajectory, power consumption is computed for the rotary axes of a six degree of freedom (6DOF) serial type of industrial robot using the work–energy hypothesis for the rotational motion of a rigid body. The results are compared to the traditional RRT and RRT* (RRT-star) algorithm as well as the kinematic solutions. The experimental results of axis indexing tests indicate that by employing the sampling-based FC-RRT* algorithm, the robot joints consume less energy (1.6% to 16.5% less) compared to both the kinematic solution and the conventional RRT* algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.