Skip to main content

2018 | OriginalPaper | Buchkapitel

Robot Path Planning Based on Ant Colony Optimization Algorithm for Environments with Obstacles

verfasst von : Rudolf Neydorf, Orhan Yarakhmedov, Victor Polyakh, Ivan Chernogorov, Dean Vucinic

Erschienen in: Improved Performance of Materials

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In modern industrial processes, robotic equipment is widely used, and one of the most pressing problems is to have to have navigation available for mobile robots. In this paper, the ant algorithm for laying and optimizing the robots paths in 2-dimensional environments with obstacles, is described and shown on construction site examples. The most important requirement is to be able to plan the shortest or permissible robot navigation route in such a complex environment with obstacles. It is well known that one of the most effective solutions to resolve such optimization problems of route seals is provided by the ant colony optimization (ACO) algorithm. The exploratory nature of the ant colony behaviour requires a classical partition of the search space, which is incomparably smaller, when compared to the obstacles fragments, as considered within this paper. The ant’s agents use the traditional logic of selecting the transition from fragment to fragment: the memory of the most popular routes based on pheromone are investigated, and formulated within the task elements, adopting appropriate tactics and situational awareness, and based on the random decisions. In addition, the new elements of the decision-making tactics are formulated for each task. For example, “feeling” of targeted routes by laying points is added to the algorithm. The natural analogue of this mechanism is similar to sensing the odors by the mustaches of real ants. The special software tool “Path Planning Optimization with Obstacle Avoidances by Ant Algorithm” is designed as the research test bed. A comprehensive study of the proposed algorithm, which shows superior performance, is done by utilizing the developed software. The examples, of the construction site with different complexity, are provided to explain the finding of the suboptimal routes for the specially designed test tracks, with defined obstacles in the simulated construction site landscape. The analysis of the results confirms the relevance and effectiveness of the developed software, which is based on the ant algorithm for the robot path planning, and validated for the environments containing complex obstacles.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput. doi:10.1109/4235.585892 Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput. doi:10.​1109/​4235.​585892
3.
Zurück zum Zitat Kazharov AA, Kurejchik VM (2010) Muravinye algoritmy dlja reshenija transportnyh zadach (Ant algorithms to solve transport problems). Teorija i sistemy upravlenija (Theory and control systems), No 1, pp 30–43. ISSN: 0002-3388 Kazharov AA, Kurejchik VM (2010) Muravinye algoritmy dlja reshenija transportnyh zadach (Ant algorithms to solve transport problems). Teorija i sistemy upravlenija (Theory and control systems), No 1, pp 30–43. ISSN: 0002-3388
6.
Zurück zum Zitat Neydorf RA, Yarakhmedov OT (2015) Razrabotka, optimizacija i analiz parametrov klassicheskogo muravinogo algoritma pri reshenii zadachi kommivojazhera v polno-svjaznom grafe (Design, optimization and analysis of the parameters of classical ant algorithm for solving the traveling salesman problem in a fully-connected graph). Mezhdunarodnyj nauchnyj zhurnal «Nauka. Tehnologii. Proizvodstvo» (International scientific journal “Science. Technologies. Production”). 3/2:18–22 Neydorf RA, Yarakhmedov OT (2015) Razrabotka, optimizacija i analiz parametrov klassicheskogo muravinogo algoritma pri reshenii zadachi kommivojazhera v polno-svjaznom grafe (Design, optimization and analysis of the parameters of classical ant algorithm for solving the traveling salesman problem in a fully-connected graph). Mezhdunarodnyj nauchnyj zhurnal «Nauka. Tehnologii. Proizvodstvo» (International scientific journal “Science. Technologies. Production”). 3/2:18–22
7.
Zurück zum Zitat Neydorf RA, Yarakhmedov OT (2015) Issledovanie vozmozhnostej optimalnogo reshenija zadachi kommivojazhera parametricheski optimizirovannym muravinym algoritmom (Analysis of abilities of optimal solution of the travelling salesman problem by parametrically optimized ant algorithm). Trudy XXVIII Mezhdunarodnoj nauchnoj konferencii «Matematicheskie metody v tehnike i tehnologijah» (Proceedings of the XXVIII International Scientific Conference “Mathematical Methods in Engineering and Technology”). MMTT-28, vol 6, p 108 Neydorf RA, Yarakhmedov OT (2015) Issledovanie vozmozhnostej optimalnogo reshenija zadachi kommivojazhera parametricheski optimizirovannym muravinym algoritmom (Analysis of abilities of optimal solution of the travelling salesman problem by parametrically optimized ant algorithm). Trudy XXVIII Mezhdunarodnoj nauchnoj konferencii «Matematicheskie metody v tehnike i tehnologijah» (Proceedings of the XXVIII International Scientific Conference “Mathematical Methods in Engineering and Technology”). MMTT-28, vol 6, p 108
8.
Zurück zum Zitat Fatemeh KP, Fardad F, Reza SN (2013) Comparing the performance of genetic algorithm and ant colony optimization algorithm for mobile robot path planning in the dynamic environments with different complexities. J Acad Appl Stud 3(2):29–44 Fatemeh KP, Fardad F, Reza SN (2013) Comparing the performance of genetic algorithm and ant colony optimization algorithm for mobile robot path planning in the dynamic environments with different complexities. J Acad Appl Stud 3(2):29–44
10.
Zurück zum Zitat Dorigo M (1992) Optimization, learning and natural algorithms. Politecnico di Milano, Italy Dorigo M (1992) Optimization, learning and natural algorithms. Politecnico di Milano, Italy
11.
Zurück zum Zitat Neydorf RA, Chernogorov IV, Polyakh VV, Iarakhmedov OT (2015) Solving possibilities of multiextremal optimization tasks by heuristic methods. Her Don State Tech Univ. doi:10.12737/issn.1992-5980 Neydorf RA, Chernogorov IV, Polyakh VV, Iarakhmedov OT (2015) Solving possibilities of multiextremal optimization tasks by heuristic methods. Her Don State Tech Univ. doi:10.​12737/​issn.​1992-5980
12.
Zurück zum Zitat Neydorf RA, Chernogorov IV, Polyakh VV, Iarakhmedov OT (2016) Detection and estimation of extremal characteristics of the search space by heuristic algorithms, H&ES Research. 2/8:16–25 Neydorf RA, Chernogorov IV, Polyakh VV, Iarakhmedov OT (2016) Detection and estimation of extremal characteristics of the search space by heuristic algorithms, H&ES Research. 2/8:16–25
13.
Zurück zum Zitat Adler JP, Markova EV, Grankovsky YV (1976) Planirovanie jeksperimenta pri poiske optimal’nyh uslovij (Experiment planning in the search for optimal conditions). M.:Nauka Adler JP, Markova EV, Grankovsky YV (1976) Planirovanie jeksperimenta pri poiske optimal’nyh uslovij (Experiment planning in the search for optimal conditions). M.:Nauka
Metadaten
Titel
Robot Path Planning Based on Ant Colony Optimization Algorithm for Environments with Obstacles
verfasst von
Rudolf Neydorf
Orhan Yarakhmedov
Victor Polyakh
Ivan Chernogorov
Dean Vucinic
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-319-59590-0_14

    Marktübersichten

    Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen.