Bounding optimal headings in the Dubins Touring Problem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F22%3A00359522" target="_blank" >RIV/68407700:21230/22:00359522 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1145/3477314.3507350" target="_blank" >https://doi.org/10.1145/3477314.3507350</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/3477314.3507350" target="_blank" >10.1145/3477314.3507350</a>
Alternative languages
Result language
angličtina
Original language name
Bounding optimal headings in the Dubins Touring Problem
Original language description
The Dubins Touring Problem (DTP) stands to find the shortest curvature-constrained multi-goal path connecting a prescribed sequence of locations. The problem is to determine the optimal vehicle heading angle at each location and thus find the shortest sequence of Dubins paths. The heading angles can be determined by iterative refinement of possible heading intervals for which finer resolution yields a shorter path at the cost of increased computational requirements. In this paper, we introduce a novel method to bound the optimal heading angles by eliminating unpromising intervals that cannot contribute to the optimal solution. The method is employed in the branch-and-bound solution of the DTP, where it significantly reduces the search space in finding the optimal solution.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing
ISBN
978-1-4503-8713-2
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
770-773
Publisher name
ACM
Place of publication
New York
Event location
Virtual
Event date
Apr 25, 2022
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000946564100103