A review on metaheuristic algorithms of Ant colony, Genetic and Particle swarm in robot’s routing
Publish Year: 1399
نوع سند: مقاله کنفرانسی
زبان: English
View: 426
This Paper With 9 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
این Paper در بخشهای موضوعی زیر دسته بندی شده است:
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ECMM03_014
تاریخ نمایه سازی: 16 آبان 1399
Abstract:
In this Research using four important metaheuristic methods of optimization including Ant colony, particle swarm, genetic and metal cooling simulation, robot’s motion route has been investigated. Metaheuristic optimization methods are smart and considerably are very powerful in finding high quality answers in complicated problems. Here in, four methods such as ant colony, particle swarm and genetic algorithm are used for robot’s movement routing instead of other old methods. First the problem is examined, the current location (origin) and robot’s destination are studied, as well as location of the obstacles in the robot. Afterwards, in order to explain the machanisms of the four aforementioned algorithms and to understand the differences and similarities and also to develop them, optimizing the robot's movement routing is taken into consideration.
Keywords:
Authors
Zahra Abdoli
Masters student, Faculty of Mechanical Engineering, Iran University of Science and Technology, Tehran,IRAN
Ehsan Anbarzadeh
PhD student, Faculty of Mechanical Engineering, Iran University of Science and Technology, Tehran, IRAN