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
来源：
2017 18TH INTERNATIONAL CONFERENCE ON ADVANCED ROBOTICS (ICAR) | 2017年
关键词：
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 条
  • [21] Using the ε-Constraint Method to Solve the Multicriteria Path Planning Problem
    Hin, Saw Veekeong A. L. Saw
    Rahman, Amirah
    Ong, Wen Eng
    PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON MATHEMATICAL SCIENCES AND TECHNOLOGY 2018 (MATHTECH 2018): INNOVATIVE TECHNOLOGIES FOR MATHEMATICS & MATHEMATICS FOR TECHNOLOGICAL INNOVATION, 2019, 2184
  • [22] A multi-objective genetic algorithm to solve a real life travelling salesman problem
    AbdulSattar, Khadija
    Harrath, Youssef
    Kaabi, Jihene
    Mahjoub, Amine
    2017 9TH IEEE-GCC CONFERENCE AND EXHIBITION (GCCCE), 2018, : 817 - 822
  • [23] Comparison between Single and Multi-Objective Evolutionary Algorithms to Solve the Knapsack Problem and the Travelling Salesman Problem
    Mahrach, Mohammed
    Miranda, Gara
    Leon, Coromoto
    Segredo, Eduardo
    MATHEMATICS, 2020, 8 (11) : 1 - 23
  • [24] New hybrid genetic algorithms to solve dynamic berth allocation problem
    Bacalhau, Eduardo Tadeu
    Casacio, Luciana
    de Azevedo, Anibal Tavares
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 167
  • [25] A progressive hedging method for the multi-path travelling salesman problem with stochastic travel times
    Perboli, Guido
    Gobbato, Luca
    Maggioni, Francesca
    IMA JOURNAL OF MANAGEMENT MATHEMATICS, 2017, 28 (01) : 65 - 86
  • [26] Using Genetic Algorithms to Solve Discounted Generalized Transportation Problem
    Serban, Cristina
    Carp, Doina
    STUDIES IN INFORMATICS AND CONTROL, 2021, 30 (03): : 29 - 38
  • [27] USING GENETIC ALGORITHMS TO SOLVE A MULTIOBJECTIVE GROUNDWATER MONITORING PROBLEM
    CIENIAWSKI, SE
    EHEART, JW
    RANJITHAN, S
    WATER RESOURCES RESEARCH, 1995, 31 (02) : 399 - 409
  • [28] Mobile robot path planning using Genetic Algorithms
    Thomaz, CE
    Pacheco, MAC
    Vellasco, MMBR
    FOUNDATIONS AND TOOLS FOR NEURAL MODELING, PROCEEDINGS, VOL I, 1999, 1606 : 671 - 679
  • [29] Path planning for a mobile robot using genetic algorithms
    Nagib, G
    Gharieb, W
    ICEEC'04: 2004 INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONIC AND COMPUTER ENGINEERING, PROCEEDINGS, 2004, : 185 - 189
  • [30] USING GENETIC ALGORITHMS FOR MOBILE ROBOT PATH PLANNING
    Dvorak, Jiri
    Krek, Petr
    MENDEL 2008, 2008, : 32 - 37
12345