{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T05:51:53Z","timestamp":1777009913076,"version":"3.51.4"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3556230","type":"journal-article","created":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T23:45:26Z","timestamp":1743464726000},"page":"56682-56698","source":"Crossref","is-referenced-by-count":1,"title":["Vehicle Painting Robot Path Planning Using Hierarchical Optimization"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-3681-582X","authenticated-orcid":false,"given":"Yuya","family":"Nagai","sequence":"first","affiliation":[{"name":"Department of Information Science and Biomedical Engineering, Graduate School of Science and Engineering, Kagoshima University, Kagoshima, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiromitsu","family":"Nakamura","sequence":"additional","affiliation":[{"name":"TOYOTA AUTO BODY Research & Development Co., Ltd., Kirishima, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narito","family":"Shinmachi","sequence":"additional","affiliation":[{"name":"TOYOTA AUTO BODY Research & Development Co., Ltd., Kirishima, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuta","family":"Higashizono","sequence":"additional","affiliation":[{"name":"TOYOTA AUTO BODY Research & Development Co., Ltd., Kirishima, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9500-3068","authenticated-orcid":false,"given":"Satoshi","family":"Ono","sequence":"additional","affiliation":[{"name":"Department of Information Science and Biomedical Engineering, Graduate School of Science and Engineering, Kagoshima University, Kagoshima, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2020.12.2136"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s43154-021-00043-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2432746"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2014.12.003"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3057011"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3144631"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-55684-5_21"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.4236\/iim.2012.43010"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2015.12.007"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-021-09574-x"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1243\/09596518jsce949"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2949271"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2023.3313228"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2022.3142919"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CoASE.2013.6654032"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/978-3-319-32552-1_7","article-title":"Motion planning","volume-title":"Springer Handbook of Robotics","author":"Kavraki","year":"2016"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2016.08.006"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1080\/16864360.2005.10738324"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1997.619061"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-1273-0_32"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008958800904"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/308\/1\/012044"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1108\/01439910110382738"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-006-0746-5"},{"issue":"9","key":"ref25","doi-asserted-by":"crossref","first-page":"2287","DOI":"10.1007\/s00170-018-2382-2","article-title":"A new path-constrained trajectory planning strategy for spray painting robots\u2013rev.1","volume":"98","author":"Trigatti","year":"2018","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/70.611308"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1115\/detc2015-46587"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0127139"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2022.3156803"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.80"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(03)00158-8"},{"issue":"5","key":"ref32","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1016\/S0305-0548(02)00051-5","article-title":"A genetic algorithm for the vehicle routing problem","volume":"30","author":"Baker","year":"2003","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"ref33","doi-asserted-by":"crossref","first-page":"2110","DOI":"10.1016\/j.apm.2011.08.010","article-title":"Optimised crossover genetic algorithm for capacitated vehicle routing problem","volume":"36","author":"Nazif","year":"2012","journal-title":"Appl. Math. Model."},{"key":"ref34","volume-title":"An Introduction to Genetic Algorithms","author":"Mitchell","year":"1998"},{"issue":"2","key":"ref35","first-page":"143","article-title":"Fine-grained tournament selection operator in genetic algorithms","volume":"22","author":"Filipovi\u0107","year":"2003","journal-title":"Comput. Informat."},{"key":"ref36","first-page":"162","article-title":"Applying adaptive algorithms to epistatic domains","volume-title":"Proc. IJCAI","author":"Davis"},{"issue":"1","key":"ref37","first-page":"2","article-title":"New variations of order crossover for travelling salesman problem","volume":"2","author":"Deep","year":"2011","journal-title":"Int. J. Combinat. Optim. Problems Informat."},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(01)00085-5"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/10945826.pdf?arnumber=10945826","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T04:14:33Z","timestamp":1743912873000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10945826\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3556230","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}