{"id":"https://openalex.org/W4288057857","doi":"https://doi.org/10.1145/3531224","title":"Coordinated Path Planning through Local Search and Simulated Annealing","display_name":"Coordinated Path Planning through Local Search and Simulated Annealing","publication_year":2022,"publication_date":"2022-04-23","ids":{"openalex":"https://openalex.org/W4288057857","doi":"https://doi.org/10.1145/3531224"},"language":"en","primary_location":{"id":"doi:10.1145/3531224","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3531224","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031297713","display_name":"Hyeyun Yang","orcid":"https://orcid.org/0000-0001-5949-8673"},"institutions":[{"id":"https://openalex.org/I48566637","display_name":"Ulsan National Institute of Science and Technology","ror":"https://ror.org/017cjz748","country_code":"KR","type":"education","lineage":["https://openalex.org/I48566637"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyeyun Yang","raw_affiliation_strings":["Department of Computer Science and Engineering, Ulsan National Institute of Science and Technology, Ulsan, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Ulsan National Institute of Science and Technology, Ulsan, Republic of Korea","institution_ids":["https://openalex.org/I48566637"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019937157","display_name":"Antoine Vigneron","orcid":"https://orcid.org/0000-0003-3586-3431"},"institutions":[{"id":"https://openalex.org/I48566637","display_name":"Ulsan National Institute of Science and Technology","ror":"https://ror.org/017cjz748","country_code":"KR","type":"education","lineage":["https://openalex.org/I48566637"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Antoine Vigneron","raw_affiliation_strings":["Department of Computer Science and Engineering, Ulsan National Institute of Science and Technology, Ulsan, Republic of Korea"],"raw_orcid":"https://orcid.org/0000-0003-3586-3431","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Ulsan National Institute of Science and Technology, Ulsan, Republic of Korea","institution_ids":["https://openalex.org/I48566637"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2031,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.47345399,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"27","issue":null,"first_page":"1","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.7763826251029968},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7325344681739807},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6734973192214966},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5705874562263489},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5503076314926147},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5164187550544739},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.48312899470329285},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.46457207202911377},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.4636456072330475},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4523407816886902},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4462965130805969},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4462489187717438},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4458174407482147},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32392749190330505},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.265511155128479},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09870263934135437}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7763826251029968},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7325344681739807},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6734973192214966},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5705874562263489},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5503076314926147},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5164187550544739},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.48312899470329285},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.46457207202911377},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.4636456072330475},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4523407816886902},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4462965130805969},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4462489187717438},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4458174407482147},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32392749190330505},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.265511155128479},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09870263934135437},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3531224","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3531224","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},{"id":"pmh:oai:scholarworks.unist.ac.kr:201301/65019","is_oa":false,"landing_page_url":"https://scholarworks.unist.ac.kr/handle/201301/65019","pdf_url":null,"source":{"id":"https://openalex.org/S4306401118","display_name":"Scholarworks@UNIST (Ulsan National Institute of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I48566637","host_organization_name":"Ulsan National Institute of Science and Technology","host_organization_lineage":["https://openalex.org/I48566637"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"ARTICLE"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.800000011920929,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2991436668","https://openalex.org/W3137496123","https://openalex.org/W3175107636","https://openalex.org/W3177206551"],"related_works":["https://openalex.org/W1965569281","https://openalex.org/W2546046681","https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2363850205","https://openalex.org/W1904098742","https://openalex.org/W3158921809","https://openalex.org/W2908094156","https://openalex.org/W1980828932","https://openalex.org/W2389896347"],"abstract_inverted_index":{"The":[0],"third":[1,179],"computational":[2],"geometry":[3],"challenge":[4],"was":[5],"on":[6,22],"a":[7,14,44,61,96,101,113,163,178],"coordinated":[8],"path":[9],"planning":[10],"problem":[11],"in":[12],"which":[13],"collection":[15],"of":[16,46,68,73,124,154,162],"square":[17],"robots":[18,42,129],"need":[19,132],"to":[20,31,91,133,143],"move":[21,176],"the":[23,69,74,77,81,122,125,128,136,159,174],"integer":[24],"grid,":[25],"from":[26,87],"their":[27,32],"given":[28],"starting":[29,75,89],"points":[30,171],"target":[33,78,93],"points,":[34],"and":[35,43,51,80,83,110],"without":[36],"collision":[37],"between":[38,41,169],"robots,":[39],"or":[40,165],"set":[45],"input":[47],"obstacles.":[48],"We":[49,149,156],"designed":[50],"implemented":[52],"three":[53],"algorithms":[54],"for":[55],"this":[56,146],"problem.":[57],"First,":[58],"we":[59,99,107,139,166],"computed":[60],"feasible":[62,147],"solution":[63],"by":[64,172],"placing":[65],"middle-points":[66],"outside":[67],"minimum":[70],"bounding":[71],"box":[72],"positions,":[76],"positions":[79],"obstacles,":[82],"moving":[84],"each":[85],"robot":[86,115,175],"its":[88,92],"point":[90,94,181],"through":[95,116,135,177],"middle-point.":[97],"Second,":[98],"applied":[100],"simple":[102],"local":[103],"search":[104],"approach":[105],"where":[106],"repeatedly":[108],"delete":[109],"insert":[111],"again":[112],"random":[114],"an":[117],"optimal":[118],"path.":[119],"It":[120],"improves":[121],"quality":[123],"solution,":[126],"as":[127],"no":[130],"longer":[131],"go":[134],"middle-points.":[137],"Finally,":[138],"used":[140,150],"simulated":[141],"annealing":[142],"further":[144],"improve":[145],"solution.":[148],"two":[151,170],"different":[152],"types":[153],"moves:":[155],"either":[157],"tightened":[158],"whole":[160],"trajectory":[161],"robot,":[164],"stretched":[167],"it":[168],"making":[173],"intermediate":[180],"generated":[182],"at":[183],"random.":[184]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}