{"id":"https://openalex.org/W2912771349","doi":"https://doi.org/10.1145/3297097.3297099","title":"On Unsupervised Learning based Multi-Goal Path Planning for Visiting 3D Regions","display_name":"On Unsupervised Learning based Multi-Goal Path Planning for Visiting 3D Regions","publication_year":2018,"publication_date":"2018-11-17","ids":{"openalex":"https://openalex.org/W2912771349","doi":"https://doi.org/10.1145/3297097.3297099","mag":"2912771349"},"language":"en","primary_location":{"id":"doi:10.1145/3297097.3297099","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3297097.3297099","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 4th International Conference on Robotics and Artificial Intelligence","raw_type":"proceedings-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/A5073496345","display_name":"Jan Faigl","orcid":"https://orcid.org/0000-0002-6193-0792"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jan Faigl","raw_affiliation_strings":["Computational Robotics Laboratory, Czech Technical University in Prague (CTU), Prague Czechia"],"affiliations":[{"raw_affiliation_string":"Computational Robotics Laboratory, Czech Technical University in Prague (CTU), Prague Czechia","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083616309","display_name":"Jind\u0159i\u0161ka Deckerov\u00e1","orcid":"https://orcid.org/0000-0001-7182-8698"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jind\u0159i\u0161ka Deckerov\u00e1","raw_affiliation_strings":["Computational Robotics Laboratory, Czech Technical University in Prague (CTU), Prague Czechia"],"affiliations":[{"raw_affiliation_string":"Computational Robotics Laboratory, Czech Technical University in Prague (CTU), Prague Czechia","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073496345"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.17673595,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"45","last_page":"50"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9846000075340271,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7874313592910767},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7375960350036621},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6851217746734619},{"id":"https://openalex.org/keywords/unsupervised-learning","display_name":"Unsupervised learning","score":0.6050244569778442},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5807777047157288},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5608312487602234},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5540600419044495},{"id":"https://openalex.org/keywords/competitive-learning","display_name":"Competitive learning","score":0.5460964441299438},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5407500267028809},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.49904632568359375},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.49726322293281555},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49536359310150146},{"id":"https://openalex.org/keywords/supervised-learning","display_name":"Supervised learning","score":0.458172082901001},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4272226095199585},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.40734192728996277},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4025152921676636},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.2736327648162842},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2346915602684021},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2279438078403473},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18591803312301636}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7874313592910767},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7375960350036621},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6851217746734619},{"id":"https://openalex.org/C8038995","wikidata":"https://www.wikidata.org/wiki/Q1152135","display_name":"Unsupervised learning","level":2,"score":0.6050244569778442},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5807777047157288},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5608312487602234},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5540600419044495},{"id":"https://openalex.org/C120822770","wikidata":"https://www.wikidata.org/wiki/Q5156355","display_name":"Competitive learning","level":3,"score":0.5460964441299438},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5407500267028809},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.49904632568359375},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.49726322293281555},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49536359310150146},{"id":"https://openalex.org/C136389625","wikidata":"https://www.wikidata.org/wiki/Q334384","display_name":"Supervised learning","level":3,"score":0.458172082901001},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4272226095199585},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.40734192728996277},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4025152921676636},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.2736327648162842},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2346915602684021},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2279438078403473},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18591803312301636},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3297097.3297099","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3297097.3297099","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 4th International Conference on Robotics and Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.4099999964237213,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W33566489","https://openalex.org/W125240472","https://openalex.org/W605243474","https://openalex.org/W626292722","https://openalex.org/W1571087346","https://openalex.org/W1823091789","https://openalex.org/W1989307874","https://openalex.org/W2013457645","https://openalex.org/W2021281857","https://openalex.org/W2072931689","https://openalex.org/W2095428110","https://openalex.org/W2106378689","https://openalex.org/W2113076619","https://openalex.org/W2117257995","https://openalex.org/W2168990813","https://openalex.org/W2253899129","https://openalex.org/W2563497056","https://openalex.org/W2600765363","https://openalex.org/W2774281622","https://openalex.org/W2803452670"],"related_works":["https://openalex.org/W2590565095","https://openalex.org/W2160366419","https://openalex.org/W2163389298","https://openalex.org/W2057778272","https://openalex.org/W3080681248","https://openalex.org/W2986085304","https://openalex.org/W4287685660","https://openalex.org/W2898814882","https://openalex.org/W2164966738","https://openalex.org/W2135065299"],"abstract_inverted_index":{"In":[0,96],"this":[1],"paper,":[2],"we":[3],"report":[4],"on":[5,9,119,162,180],"our":[6],"early":[7],"results":[8,174],"deploying":[10],"unsupervised":[11,143],"learning":[12,144,159],"technique":[13,123],"for":[14,136],"solving":[15],"a":[16,23,28,45,52,103,133,148,155],"multi-goal":[17],"path":[18,25],"planning":[19],"problem":[20,36,99],"to":[21,26,50,56,71,146],"determine":[22,147],"shortest":[24],"visit":[27,51],"given":[29],"set":[30,53],"of":[31,54,61,64,93,106,150,158],"3D":[32,104],"regions.":[33],"The":[34,130],"addressed":[35],"is":[37,48,69,100,117,132,140],"motivated":[38],"by":[39,88],"data":[40],"collection":[41],"missions":[42],"in":[43,154],"which":[44],"robotic":[46],"vehicle":[47],"requested":[49],"locations":[55],"perform":[57],"particular":[58],"measurements.":[59],"Instead":[60],"precise":[62],"visitation":[63],"the":[65,73,76,80,85,94,98,107,114,120,125,151,163,166,181,186],"specified":[66],"locations,":[67,81],"it":[68],"allowed":[70],"take":[72],"measurements":[74],"at":[75],"respective":[77],"distance":[78],"from":[79],"and":[82,113],"thus":[83],"save":[84],"travel":[86],"cost":[87],"exploiting":[89],"non-zero":[90],"sensing":[91],"radius":[92],"vehicle.":[95],"particular,":[97],"formulated":[101],"as":[102],"variant":[105],"Close-Enough":[108],"Traveling":[109],"Salesman":[110],"Problem":[111],"(CETSP),":[112],"proposed":[115,167],"approach":[116,169],"based":[118,179],"recently":[121],"introduced":[122],"called":[124],"Growing":[126],"Self-Organizing":[127],"Array":[128],"(GSOA).":[129],"GSOA":[131],"neural":[134],"network":[135],"routing":[137],"problems":[138,153],"that":[139],"accompanied":[141],"with":[142],"procedure":[145],"solution":[149],"TSP-like":[152],"finite":[156],"number":[157],"epochs.":[160],"Based":[161],"reported":[164],"results,":[165],"GSOA-based":[168],"provides":[170],"competitive":[171],"or":[172],"better":[173],"than":[175],"existing":[176],"combinatorial":[177],"heuristics":[178],"so-called":[182],"Steiner":[183],"zones,":[184],"while":[185],"computational":[187],"requirements":[188],"are":[189],"significantly":[190],"lower.":[191]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}