TY - GEN
T1 - Energy efficient trajectory planning by a robot arm using invasive weed optimization technique
AU - Sengupta, Abhronil
AU - Chakraborti, Tathagata
AU - Konar, Amit
AU - Nagar, Atulya
PY - 2011
Y1 - 2011
N2 - In this paper we propose an energy efficient method for path planning by a robot arm. First we have developed a cost function that provides a set of via points determining a suitable path according to the obstacles present in the surroundings and other restrictions in its motion. Then we fit a suitable polynomial to this set of interior points to ensure that the journey is smooth and takes place with the consumption of minimum energy. The set of via-points as well as the minimum energy path have been determined using IWO (Invasive Weed Optimization) which is a new search heuristic based on the colonizing property of weeds. Application of such evolutionary algorithms in trajectory planning is advantageous because the exact solution to the path planning problem is not always available beforehand and must be determined dynamically. The entire procedure has been demonstrated through simulations. The above formulation is very simple and versatile and can be effectively applied to a variety of situations.
AB - In this paper we propose an energy efficient method for path planning by a robot arm. First we have developed a cost function that provides a set of via points determining a suitable path according to the obstacles present in the surroundings and other restrictions in its motion. Then we fit a suitable polynomial to this set of interior points to ensure that the journey is smooth and takes place with the consumption of minimum energy. The set of via-points as well as the minimum energy path have been determined using IWO (Invasive Weed Optimization) which is a new search heuristic based on the colonizing property of weeds. Application of such evolutionary algorithms in trajectory planning is advantageous because the exact solution to the path planning problem is not always available beforehand and must be determined dynamically. The entire procedure has been demonstrated through simulations. The above formulation is very simple and versatile and can be effectively applied to a variety of situations.
UR - https://www.scopus.com/pages/publications/83755173913
UR - https://www.scopus.com/pages/publications/83755173913#tab=citedBy
U2 - 10.1109/NaBIC.2011.6089465
DO - 10.1109/NaBIC.2011.6089465
M3 - Conference contribution
AN - SCOPUS:83755173913
SN - 9781457711237
T3 - Proceedings of the 2011 3rd World Congress on Nature and Biologically Inspired Computing, NaBIC 2011
SP - 311
EP - 316
BT - Proceedings of the 2011 3rd World Congress on Nature and Biologically Inspired Computing, NaBIC 2011
T2 - 2011 3rd World Congress on Nature and Biologically Inspired Computing, NaBIC 2011
Y2 - 19 October 2011 through 21 October 2011
ER -