Path Planning and Following using Genetic Algorithms to Solve the Multi-Travel Salesman Problem in Dynamic Scenarios

被引:0
|
作者
Sanchez O, Nelson Andres [1 ]
De la Rosa R, Fernando [1 ]
机构
[1] Univ Los Andes, Syst & Comp Engn Dept, Bogota, Colombia
关键词
Multi-travel salesman problem; mobile robotics; genetic algorithms; path planning; path following; dynamic scenarios;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper presents an implementation of a technique to solve the Multi-Travel Salesman Problem (MTSP) when applied to mobile robots in dynamic scenarios. Given that the MTSP is an NP-Complete problem, we used genetic algorithms to solve it efficiently. Once we obtained a theoretical solution for the MTSP, we applied it in simulated and experimental scenarios. In addition, we implemented path planning algorithms to generate the path for each of the robots, and evasion algorithms to manage dynamic scenarios. With those main challenges clear, we tested these implementations in simulation and laboratory environments in order to measure the quality of the proposed solution.
引用
收藏
页码:204 / 209
页数:6
相关论文
共 50 条
  • [1] Fuzzy dynamic path planning using genetic algorithms
    Juidette, H
    Youlal, H
    ELECTRONICS LETTERS, 2000, 36 (04) : 374 - 376
  • [2] Multi Robot Path Planning and Path Coordination Using Genetic Algorithms
    Muthiah, Muthumeena
    Saad, Ashraf
    PROCEEDINGS OF THE SOUTHEAST CONFERENCE ACM SE'17, 2017, : 112 - 119
  • [3] Improved Genetic and Simulating Annealing Algorithms to Solve the Traveling Salesman Problem Using Constraint Programming
    Alameen, Mamoon
    Abdul-Niby, Mohammed
    Salhieh, Ayad
    Radhi, Ali
    ENGINEERING TECHNOLOGY & APPLIED SCIENCE RESEARCH, 2016, 6 (02) : 927 - 930
  • [4] Integrated Genetic Algorithms and Cloud Technology to Solve Travelling Salesman Problem on Hadoop
    Shen, Yi-Chich
    Hsu, Chi-Hang
    Hsieh, Sung-Huai
    2012 IEEE 4TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING TECHNOLOGY AND SCIENCE (CLOUDCOM), 2012,
  • [5] Genetic algorithms to solve the power system restoration planning problem
    Adelmo L. Cechin
    José V. Canto dos Santos
    Carlos A. Mendel
    Arthur T. Gómez
    Engineering with Computers, 2009, 25 : 261 - 268
  • [6] Genetic algorithms to solve the power system restoration planning problem
    Cechin, Adelmo L.
    Canto dos Santos, Jose V.
    Mendel, Carlos A.
    Gomez, Arthur T.
    ENGINEERING WITH COMPUTERS, 2009, 25 (03) : 261 - 268
  • [7] Analysis of Path Planning Algorithms based on Travelling Salesman Problem embedded in UAVs
    Bandeira, Thiago Werlley
    Brito, Alisson V.
    Subramanian, Anand
    Coutinho, Walton P.
    2015 BRAZILIAN SYMPOSIUM ON COMPUTING SYSTEMS ENGINEERING (SBESC), 2015, : 70 - 75
  • [8] Travelling Salesman Problem for UAV Path Planning with Two Parallel Optimization Algorithms
    Chen, Jie
    Ye, Fang
    Li, Yibing
    2017 PROGRESS IN ELECTROMAGNETICS RESEARCH SYMPOSIUM - FALL (PIERS - FALL), 2017, : 832 - 837
  • [9] Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms
    Albayrak, Murat
    Allahverdi, Novruz
    EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (03) : 1313 - 1320
  • [10] A Hybrid Method of Genetic Algorithms and Ant Colony Optimization to Solve the Traveling Salesman Problem
    Takahashi, Ryouei
    EIGHTH INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND APPLICATIONS, PROCEEDINGS, 2009, : 81 - 88