运动规划
避障
路径(计算)
平滑度
移动机器人
计算机科学
机器人
障碍物
数学优化
任意角度路径规划
路径长度
工作区
实时计算
模拟
算法
人工智能
数学
地理
计算机网络
数学分析
考古
作者
Sakthitharan Subramanian,Sudha Rajesh,Preethika Immaculate Britto,Sakthivel Sankaran
标识
DOI:10.1080/01969722.2023.2177804
摘要
Mobile robot becomes more significant in human life and industry, whereas navigation of robot in the dynamic environment results a challenging problem and it need to be solved in an efficient way. Path planning gained more attention in recent decades and puts its practical usage in different industries. Path planning for the mobile robot is to determine feasible path to reach target location in workspace. A more challenging problem with mobile robot is solving path planning issue by avoiding obstacles in an optimize way. Various methods are designed to perform path planning mechanism, but it faced complexity in finding the solution to reach the target. Hence, an efficient Mayfly Deer Hunting Optimization (MDHO) algorithm is designed in this research to move the mobile robots to reach target location in the environment using multi-objective function. However, multi-objective function is designed by considering the factors, like path length, path smoothness, and the obstacle avoidance. The path that satisfies the objective constraints is selected as optimal path to reach the target of mobile robot. The proposed model attains minimum path length, maximal path smoothness, and maximum fitness as 1159.0 m, 0.913, and 3.5418 by considering fixed obstacles and multiple targets.
科研通智能强力驱动
Strongly Powered by AbleSci AI