Improved Modified Chaotic Invasive Weed Optimization Approach to Solve Multi-Target Assignment for Humanoid Robot
DOI:
https://doi.org/10.18196/jrc.2377Keywords:
Humanoid robot, Multiple target problem, Bezier curve, Modified Chaotic Invasive Weed OptimizationAbstract
The paper presents an improved modified chaotic invasive weed optimization (IMCIWO) approach for solving a multi-target assignment for humanoid robot navigation. MCIWO is improved by utilizing the Bezier curve for smoothing the path and replaces the conventional split lines. In order to efficiently determine subsequent locations of the robot from the present location on the provided terrain, such that the routes to be specifically generated for the robot are relatively small, with the shortest distance from the barriers that have been generated using the IMCIWO approach. The MCIWO approach designed the path based on obstacles and targets position which is further smoothened by the Bezier curve. Simulations are performed which is further validated by real-time experiments in WEBOT and NAO robot respectively. They show good effectiveness with each other with a deviation of under 5%. Ultimately, the superiority of the developed approach is examined with existing techniques for navigation, and findings are substantially improved.References
N. Bej, A. Pandey, A. K. Kashyap, and D. R. Parhi, “Optimum Navigation of Four-Wheeled Ground Robot in Stationary and Non-stationary Environments Using Wind-Driven Optimization Algorithm,” in Innovative Product Design and Intelligent Manufacturing Systems, Springer, 2020, pp. 931–941.
A. Pandey, A. K. Kashyap, D. R. Parhi, and B. K. Patle, “Autonomous mobile robot navigation between static and dynamic obstacles using multiple ANFIS architecture,” World J. Eng., vol. 16, no. 2, pp. 275–286, Apr. 2019.
A. K. Kashyap and A. Pandey, “Optimized Path Planning for Three-Wheeled Autonomous Robot Using Teaching–Learning-Based Optimization Technique,” in Advances in Materials and Manufacturing Engineering, 2020, pp. 49–57.
K. P. Lagaza, A. K. Kashyap, and A. Pandey, “Spider Monkey Optimization Algorithm Based Collision-Free Navigation and Path Optimization for a Mobile Robot in the Static Environment,” in Advances in Mechanical Engineering, no. Ic, 2020, pp. 1459–1473.
A. K. Kashyap, K. P. Lagaza, and A. Pandey, “Dynamic Path Planning for Autonomous Mobile Robot using Minimum Fuzzy Rule Based Controller with Avoidance of Moving Obstacles,” in 2018 International Conference on Recent Innovations in Electrical, Electronics & Communication Engineering (ICRIEECE), 2018, pp. 3330–3335.
A. K. Kashyap and A. Pandey, “Different Nature-Inspired Techniques Applied for Motion Planning of Wheeled Robot: A Critical Review,” Int. J. Adv. Robot. Autom., vol. 3, no. 2, pp. 1–10, Jul. 2018.
P. Karkowski, S. Oßwald, and M. Bennewitz, “Real-time footstep planning in 3D environments,” in 2016 IEEE-RAS 16th International Conference on Humanoid Robots (Humanoids), 2016, pp. 69–74.
J. Ido, Y. Shimizu, Y. Matsumoto, and T. Ogasawara, “Indoor navigation for a humanoid robot using a view sequence,” Int. J. Rob. Res., vol. 28, no. 2, pp. 315–325, 2009.
A. K. Kashyap, D. R. Parhi, and S. Kumar, “Dynamic Stabilization of NAO Humanoid Robot Based on Whole-Body Control with Simulated Annealing,” Int. J. Humanoid Robot., vol. 17, no. 03, p. 2050014, Jun. 2020.
A. K. Kashyap, A. Pandey, A. Chhotray, and D. R. Parhi, “Controlled Gait Planning of Humanoid Robot NAO Based on 3D-LIPM Model,” Available SSRN 3552498, 2020.
Y. Zhong and B. Ai, “A modified ant colony optimization algorithm for multi-objective assembly line balancing,” Soft Comput., vol. 21, no. 22, pp. 6881–6894, 2017.
N. Habib, D. Purwanto, and A. Soeprijanto, “Mobile robot motion planning by point to point based on modified ant colony optimization and Voronoi diagram,” in 2016 International Seminar on Intelligent Technology and Its Applications (ISITIA), 2016, pp. 613–618.
A. K. Kashyap, D. R. Parhi, M. K. Muni, and K. K. Pandey, “A hybrid technique for path planning of humanoid robot NAO in static and dynamic terrains,” Appl. Soft Comput., vol. 96, p. 106581, Nov. 2020.
P. B. Kumar, C. Sahu, and D. R. Parhi, “A hybridized regression-adaptive ant colony optimization approach for navigation of humanoids in a cluttered environment,” Appl. Soft Comput., vol. 68, pp. 565–585, Jul. 2018.
P. B. Kumar, M. K. Muni, and D. R. Parhi, “Navigational analysis of multiple humanoids using a hybrid regression-fuzzy logic control approach in complex terrains,” Appl. Soft Comput., vol. 89, p. 106088, Apr. 2020.
A. K. Rath, D. R. Parhi, H. C. Das, M. K. Muni, and P. B. Kumar, “Analysis and use of fuzzy intelligent technique for navigation of humanoid robot in obstacle prone zone,” Def. Technol., vol. 14, no. 6, pp. 677–682, 2018.
C. Sahu, D. R. Parhi, and P. B. Kumar, “An approach to optimize the path of humanoids using adaptive ant colony optimization,” J. Bionic Eng., vol. 15, no. 4, pp. 623–635, 2018.
N. Razmjooy and M. Khalilpour, “A new design for PID controller by considering the operating points changes in Hydro-Turbine Connected to the equivalent network by using Invasive Weed Optimization (IWO) Algorithm,” Int. J. Information, Secur. Syst. Manag., vol. 4, no. 2, pp. 468–475, 2015.
S. Karimkashi and A. A. Kishk, “Invasive weed optimization and its features in electromagnetics,” IEEE Trans. Antennas Propag., 2010.
Y. R. Naidu and A. K. Ojha, “A hybrid version of invasive weed optimization with quadratic approximation,” Soft Comput., 2015.
O. Abedinia, A. Akbari Foroud, N. Amjady, and H. A. Shayanfar, “Modified invasive weed optimization based on fuzzy PSS in multi-machine power system,” in Proceedings of the 2012 International Conference on Artificial Intelligence, ICAI 2012, 2012.
A. R. Mehrabian and C. Lucas, “A novel numerical optimization algorithm inspired from weed colonization,” Ecol. Inform., 2006.
F. Yamaguchi, Curves and surfaces in computer aided geometric design. Springer Science & Business Media, 2012.
M. A. Contreras-Cruz, V. Ayala-Ramirez, and U. H. Hernandez-Belmonte, “Mobile robot path planning using artificial bee colony and evolutionary programming,” Appl. Soft Comput., vol. 30, pp. 319–328, May 2015.
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
This journal is based on the work at https://journal.umy.ac.id/index.php/jrc under license from Creative Commons Attribution-ShareAlike 4.0 International License. You are free to:
- Share – copy and redistribute the material in any medium or format.
- Adapt – remix, transform, and build upon the material for any purpose, even comercially.
The licensor cannot revoke these freedoms as long as you follow the license terms, which include the following:
- Attribution. You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- ShareAlike. If you remix, transform, or build upon the material, you must distribute your contributions under the same license as the original.
- No additional restrictions. You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
• Creative Commons Attribution-ShareAlike (CC BY-SA)
JRC is licensed under an International License