Parallel, Asymptotically Optimal Algorithms for Moving Target Traveling Salesman Problems
IEEE Transactions on Robotics · 2026 · 42 · 2931-2951
DOI: 10.1109/tro.2026.3706565 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Robotics, 2026. Verfasst von Anoop Bhat und 5 weiteren Autor:innen. Die Arbeit nennt 65 Literaturangaben. Gefördert von: National Science Foundation.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Science Foundation
Zitieren
APA
Bhat, A., Gutow, G., Vundurthy, B., Ren, Z., Rathinam, S., & Choset, H. (2026). Parallel, Asymptotically Optimal Algorithms for Moving Target Traveling Salesman Problems. IEEE Transactions on Robotics, 42, 2931-2951. https://doi.org/10.1109/tro.2026.3706565
Vancouver
Bhat A, Gutow G, Vundurthy B, Ren Z, Rathinam S, Choset H. Parallel, Asymptotically Optimal Algorithms for Moving Target Traveling Salesman Problems. IEEE Transactions on Robotics. 2026;42:2931-2951. doi:10.1109/tro.2026.3706565
BibTeX
@article{Bhat2026,
author = {Bhat, Anoop and Gutow, Geordan and Vundurthy, Bhaskar and Ren, Zhongqiang and Rathinam, Sivakumar and Choset, Howie},
title = {Parallel, Asymptotically Optimal Algorithms for Moving Target Traveling Salesman Problems},
journal = {IEEE Transactions on Robotics},
year = {2026},
volume = {42},
pages = {2931--2951},
doi = {10.1109/tro.2026.3706565}
}
EUVIMED