{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T06:11:48Z","timestamp":1760508708033,"version":"build-2065373602"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T00:00:00Z","timestamp":1750723200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T00:00:00Z","timestamp":1750723200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,24]]},"DOI":"10.23919\/ecc65951.2025.11187225","type":"proceedings-article","created":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T17:38:09Z","timestamp":1760463489000},"page":"3269-3274","source":"Crossref","is-referenced-by-count":0,"title":["A Visibility-Based Near-Optimal Planner for Robotic Inspection in Ultra High Voltage Centers"],"prefix":"10.23919","author":[{"given":"Andreas","family":"Vatistas","sequence":"first","affiliation":[{"name":"National Technical University of Athens,School of Electrical & Computer Engineering,Greece"}]},{"given":"George P.","family":"Moustris","sequence":"additional","affiliation":[{"name":"National Technical University of Athens,School of Electrical & Computer Engineering,Greece"}]},{"given":"Costas S.","family":"Tzafestas","sequence":"additional","affiliation":[{"name":"National Technical University of Athens,School of Electrical & Computer Engineering,Greece"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.05.010"},{"key":"ref2","article-title":"The record balancing problem: A dynamic programming solution of a generalized traveling salesman problem rairo","author":"Henry-Labordere","year":"1969","journal-title":"The record balancing problem: A dynamic programming solution of a generalized traveling salesman problem RAIRO vol"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3390\/ijgi7030115"},{"key":"ref4","first-page":"97","article-title":"Generalized travelling salesman problem through n sets of nodes","volume":"7","author":"Srivastava","year":"1969","journal-title":"Can. Oper. Res. Soc."},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.1983.11731885"},{"issue":"2","key":"ref6","first-page":"144","article-title":"Generalized traveling salesman problem reduction algorithms","volume":"4","author":"Gutin","year":"2009","journal-title":"Algorithmic Operations Research"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-015-0080-8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2022.100029"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2023.07.022"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0135"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.3.378"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MED61351.2024.10566151"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MED64031.2025.11073348"}],"event":{"name":"2025 European Control Conference (ECC)","start":{"date-parts":[[2025,6,24]]},"location":"Thessaloniki, Greece","end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 European Control Conference (ECC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11186289\/11186290\/11187225.pdf?arnumber=11187225","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T05:50:10Z","timestamp":1760507410000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11187225\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,24]]},"references-count":13,"URL":"https:\/\/doi.org\/10.23919\/ecc65951.2025.11187225","relation":{},"subject":[],"published":{"date-parts":[[2025,6,24]]}}}