Dynamic region visit routing problem for vehicles with minimum turning radius
| dc.creator | Douglas Guimarães Macharet | |
| dc.creator | Armando Alves Neto | |
| dc.creator | Vilar Fiuza da Câmara Neto | |
| dc.creator | Mário Fernando Montenegro Campos | |
| dc.date.accessioned | 2025-04-24T18:23:58Z | |
| dc.date.accessioned | 2025-09-09T00:40:07Z | |
| dc.date.available | 2025-04-24T18:23:58Z | |
| dc.date.issued | 2018 | |
| dc.identifier.doi | https:doi.org/10.1007/s10732-017-9359-4 | |
| dc.identifier.issn | 1572-9397 | |
| dc.identifier.uri | https://hdl.handle.net/1843/81822 | |
| dc.language | eng | |
| dc.publisher | Universidade Federal de Minas Gerais | |
| dc.relation.ispartof | Journal of heuristics | |
| dc.rights | Acesso Restrito | |
| dc.subject | Veículos autônomos | |
| dc.subject | Teoria do controle | |
| dc.subject.other | Dynamic vehicle routing problem | |
| dc.subject.other | Dubins vehicle | |
| dc.subject.other | Traveling salesman problem with neighborhoods | |
| dc.title | Dynamic region visit routing problem for vehicles with minimum turning radius | |
| dc.type | Artigo de periódico | |
| local.citation.epage | 109 | |
| local.citation.issue | 1 | |
| local.citation.spage | 83 | |
| local.citation.volume | 24 | |
| local.description.resumo | In this paper we address the problem of planning optimized routes among dynamically selected target regions for vehicles with a turning radius motion constraint, hereinafter called dynamic Dubins traveling salesman problem with neighborhoods (DDTSPN). Initially, we present a heuristic to solve a simpler version of this problem, called off-line step, where only previously given targets are concerned. We further extend this approach for the more complex case of dynamic scenarios, called on-line step, addressing the inclusion of new targets during the execution of the initial route, whilst minimizing the impact on the total traveled distance. Formal analyzes of our techniques are provided, presenting upper bounds for the total length of the final tour. Results with statistical investigation over a large number of trials in a simulated environment are also provided. Finally, to demonstrate the applicability of our technique in solving the DDTSPN at real-world scenarios, we also report on results of an experiment performed with a real car-like robot. | |
| local.publisher.country | Brasil | |
| local.publisher.department | ENG - DEPARTAMENTO DE ENGENHARIA ELETRÔNICA | |
| local.publisher.department | ICX - DEPARTAMENTO DE CIÊNCIA DA COMPUTAÇÃO | |
| local.publisher.initials | UFMG | |
| local.url.externa | https://link.springer.com/article/10.1007/s10732-017-9359-4 |
Arquivos
Licença do pacote
1 - 1 de 1