Humanoid path planning on even and uneven terrains using an efficient memory-based gravitational search algorithm and evolutionary learning strategy

Author:

Vikas 1ORCID,Parhi Dayal R1

Affiliation:

1. Department of Mechanical Engineering, Robotics Laboratory, National Institute of Technology, Rourkela, Odisha, India

Abstract

The increasing demand for automation and material transportation has shown an incline toward optimal path navigation. The present work implements an intelligent Memory-based gravitational search algorithm (MGSA) with an evolutionary learning strategy to achieve a globally optimal collision-free path. The Evolutionary learning strategy helps improve the diversity among the Gravitational masses/agents, hence improving the overall exploration capability of the model. While the other approaches focus more on an evolutionary strategy based on mutation and cross-overs, the present technique implements the evolutionary strategy based on the position of the fit agents to improve the position of the unfit agents in the population. It ensures a fast-converging path planning result with an improved trajectory. Further, adding a memory-based approach helps the model remember the location of the best agent within the population. The controller is tested with multiple Humanoids on even and uneven terrains and showed a minimal improvement of more than 4% in path length with a minimum 5% deviation in the simulation and experimental results. The proposed approach showed a further improvement of more than 6% compared to the different intelligent path-planning approaches in a similar environment.

Publisher

SAGE Publications

Subject

Mechanical Engineering

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3