TY - JOUR
T1 - Trustworthiness analysis of heuristic routing algorithm with special constraints for autonomous vehicles in surveillance and coverage operations
AU - Kılıç, Deniz Kenan
AU - Nielsen, Peter
AU - Miehe, Fabian
AU - El Yafrani, Mohamed
N1 - Publisher Copyright:
© 2025 The Author(s). Published by Informa UK Limited, trading as Taylor & Francis Group.
PY - 2025
Y1 - 2025
N2 - This article aims to develop a fast, trustworthy routing algorithm for autonomous vehicles without requiring learning data, where the routing problem with special constraints and features is an extended version of the orienteering problem. For this, firstly, the method for selecting trustworthiness requirements is discussed to map relevant trustworthiness methods to stages in the system lifecycle. Then, a heuristic approach is proposed to automate mission planning within a limited time. Routing is handled through a greedy algorithm that selects tasks based on their distance to a baseline path and score. B-spline path smoothing is implemented for smooth and continuous routes. The results are examined in terms of robustness, explainability, transparency, reproducibility, and non-technical requirements. Scenarios with extreme parameters are generated for validation and testing. The algorithm demonstrates promising performance and fulfils the selected trustworthiness requirements, indicating that classical techniques remain significant candidates for fast, reliable, and unsupervised routing solutions.
AB - This article aims to develop a fast, trustworthy routing algorithm for autonomous vehicles without requiring learning data, where the routing problem with special constraints and features is an extended version of the orienteering problem. For this, firstly, the method for selecting trustworthiness requirements is discussed to map relevant trustworthiness methods to stages in the system lifecycle. Then, a heuristic approach is proposed to automate mission planning within a limited time. Routing is handled through a greedy algorithm that selects tasks based on their distance to a baseline path and score. B-spline path smoothing is implemented for smooth and continuous routes. The results are examined in terms of robustness, explainability, transparency, reproducibility, and non-technical requirements. Scenarios with extreme parameters are generated for validation and testing. The algorithm demonstrates promising performance and fulfils the selected trustworthiness requirements, indicating that classical techniques remain significant candidates for fast, reliable, and unsupervised routing solutions.
KW - autonomous vehicles
KW - heuristic approach
KW - surveillance
KW - Systems engineering
KW - trustworthy routing algorithm
UR - http://www.scopus.com/inward/record.url?scp=85216237204&partnerID=8YFLogxK
U2 - 10.1080/00207721.2025.2455998
DO - 10.1080/00207721.2025.2455998
M3 - Journal article
AN - SCOPUS:85216237204
SN - 0020-7721
JO - International Journal of Systems Science
JF - International Journal of Systems Science
ER -