{"id":"https://openalex.org/W2000018926","doi":"https://doi.org/10.1109/cec.2012.6256477","title":"Data gathering tour optimization for Dubins' vehicles","display_name":"Data gathering tour optimization for Dubins' vehicles","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2000018926","doi":"https://doi.org/10.1109/cec.2012.6256477","mag":"2000018926"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2012.6256477","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6256477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://zenodo.org/record/1266135","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074933369","display_name":"Douglas G. Macharet","orcid":"https://orcid.org/0000-0002-1781-7186"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Douglas G. Macharet","raw_affiliation_strings":["Computer Science Department, Universidade Federal de Minas Gerais, MG, Brazil","Computer Vision and Robotics Laboratory (VeRLab), Computer Science Department, Universidade Federal de Minas Gerais, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Universidade Federal de Minas Gerais, MG, Brazil","institution_ids":["https://openalex.org/I110200422"]},{"raw_affiliation_string":"Computer Vision and Robotics Laboratory (VeRLab), Computer Science Department, Universidade Federal de Minas Gerais, Brazil","institution_ids":["https://openalex.org/I110200422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083656237","display_name":"Armando Alves Neto","orcid":"https://orcid.org/0000-0002-4940-0377"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Armando Alves Neto","raw_affiliation_strings":["Computer Science Department, Universidade Federal de Minas Gerais, MG, Brazil","Computer Vision and Robotics Laboratory (VeRLab), Computer Science Department, Universidade Federal de Minas Gerais, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Universidade Federal de Minas Gerais, MG, Brazil","institution_ids":["https://openalex.org/I110200422"]},{"raw_affiliation_string":"Computer Vision and Robotics Laboratory (VeRLab), Computer Science Department, Universidade Federal de Minas Gerais, Brazil","institution_ids":["https://openalex.org/I110200422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112645356","display_name":"Vilar F. da Camara Neto","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vilar F. da Camara Neto","raw_affiliation_strings":["Pesquisa e Inova\u00e7\u00e3o Tecnol\u00f3gica (FUCAPI), Funda\u00e7\u00e3o Centro de An\u00e1lise, Manaus, AM, Brazil","Funda\u00e7\u00e3o Centro de An\u00e1lise, Pesquisa e Inova\u00e7\u00e3o Tecnol\u00f3gica (FUCAPI), Manaus, AM, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Pesquisa e Inova\u00e7\u00e3o Tecnol\u00f3gica (FUCAPI), Funda\u00e7\u00e3o Centro de An\u00e1lise, Manaus, AM, Brazil","institution_ids":[]},{"raw_affiliation_string":"Funda\u00e7\u00e3o Centro de An\u00e1lise, Pesquisa e Inova\u00e7\u00e3o Tecnol\u00f3gica (FUCAPI), Manaus, AM, Brazil","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015111328","display_name":"M\u00e1rio F. M. Campos","orcid":"https://orcid.org/0000-0002-8336-9190"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Mario F. M. Campos","raw_affiliation_strings":["Computer Science Department, Universidade Federal de Minas Gerais, MG, Brazil","Computer Vision and Robotics Laboratory (VeRLab), Computer Science Department, Universidade Federal de Minas Gerais, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Universidade Federal de Minas Gerais, MG, Brazil","institution_ids":["https://openalex.org/I110200422"]},{"raw_affiliation_string":"Computer Vision and Robotics Laboratory (VeRLab), Computer Science Department, Universidade Federal de Minas Gerais, Brazil","institution_ids":["https://openalex.org/I110200422"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1279,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.79821522,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.7004167437553406},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.6104881763458252},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5935565829277039},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5817574858665466},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.5703771114349365},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5632216930389404},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4965525269508362},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4866205155849457},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47816401720046997},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.47630131244659424},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4734080731868744},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42425405979156494},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.393453985452652},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3764731287956238},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29145389795303345},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.20467033982276917},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.17305636405944824},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.16429635882377625},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1506597399711609},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13263913989067078}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7004167437553406},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.6104881763458252},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5935565829277039},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5817574858665466},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.5703771114349365},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5632216930389404},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4965525269508362},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4866205155849457},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47816401720046997},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.47630131244659424},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4734080731868744},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42425405979156494},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.393453985452652},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3764731287956238},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29145389795303345},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.20467033982276917},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.17305636405944824},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.16429635882377625},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1506597399711609},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13263913989067078},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2012.6256477","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2012.6256477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:zenodo.org:1266135","is_oa":true,"landing_page_url":"https://zenodo.org/record/1266135","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"pmh:oai:zenodo.org:1266135","is_oa":true,"landing_page_url":"https://zenodo.org/record/1266135","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"},"sustainable_development_goals":[{"score":0.699999988079071,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1492170047","https://openalex.org/W1544478599","https://openalex.org/W1992370839","https://openalex.org/W2064598375","https://openalex.org/W2088150073","https://openalex.org/W2090275183","https://openalex.org/W2104642742","https://openalex.org/W2110824994","https://openalex.org/W2112069732","https://openalex.org/W2117257995","https://openalex.org/W2131569937","https://openalex.org/W2143775806","https://openalex.org/W2145128369","https://openalex.org/W2146763661","https://openalex.org/W2148761022","https://openalex.org/W2162764137","https://openalex.org/W2168990813","https://openalex.org/W2170239483","https://openalex.org/W2313274380","https://openalex.org/W2323709497","https://openalex.org/W2332499306","https://openalex.org/W2997776631","https://openalex.org/W3121675905","https://openalex.org/W3150899403","https://openalex.org/W4242361212"],"related_works":["https://openalex.org/W2115200209","https://openalex.org/W2570822356","https://openalex.org/W2387306531","https://openalex.org/W3136847847","https://openalex.org/W2170088869","https://openalex.org/W2797562266","https://openalex.org/W3206639029","https://openalex.org/W2109642567","https://openalex.org/W3175646847","https://openalex.org/W2045032773"],"abstract_inverted_index":{"A":[0],"Wireless":[1],"Sensor":[2],"Network":[3],"consists":[4],"of":[5,52,79,91,95],"several":[6],"sensor":[7,24],"nodes":[8,40,83],"deployed":[9],"in":[10,104,183],"an":[11,73],"environment":[12],"having":[13],"as":[14,64],"primary":[15],"goal":[16],"to":[17,22,31,41,76,102,106,114,122,135,156,170],"collect":[18,107],"data.":[19,46,109],"However,":[20],"due":[21],"limited":[23],"communication":[25],"range,":[26],"oftentimes":[27],"it":[28],"is":[29,120,147,154,168],"necessary":[30],"use":[32],"a":[33,60,65,92,111,145,158,165,184],"mobile":[34,61,143],"node":[35,62],"that":[36,127],"will":[37,87],"visit":[38],"other":[39],"gather":[42],"up":[43],"their":[44],"collected":[45],"This":[47],"work":[48],"addresses":[49],"the":[50,82,89,99,115,124,137,142,162,172,176,190,195],"problem":[51],"planning":[53],"efficient":[54,74],"paths":[55],"for":[56,141,161],"data":[57],"collection":[58],"by":[59],"modeled":[63],"nonholonomic":[66],"vehicle":[67,100,163],"with":[68],"curvature":[69],"constraints.":[70],"We":[71],"propose":[72],"algorithm":[75],"identify":[77],"areas":[78],"intersection":[80],"among":[81],"RF":[84],"footprints":[85],"which":[86,98],"guide":[88],"identification":[90],"smaller":[93],"set":[94],"waypoints":[96],"through":[97],"needs":[101],"traverse":[103],"order":[105,134],"available":[108],"Then,":[110],"metric":[112],"similar":[113],"classical":[116,150,191],"Traveling":[117],"Salesman":[118],"Problem":[119],"used":[121,169],"determine":[123],"best":[125,196],"circuit":[126],"includes":[128],"all":[129],"these":[130],"collecting":[131,177],"points.":[132,178],"In":[133],"reduce":[136],"total":[138],"path":[139,152],"length":[140],"node,":[144],"meta-heuristic":[146],"used.":[148],"The":[149,179],"Dubins'":[151],"technique":[153],"employed":[155],"generate":[157,171],"feasible":[159],"tour":[160],"and":[164,194],"new":[166],"heuristic":[167],"required":[173],"orientation":[174],"at":[175],"methodology":[180,188],"was":[181],"validated":[182],"simulated":[185],"environment.":[186],"Our":[187],"outperforms":[189],"Alternating":[192],"Algorithm":[193],"performing":[197],"state-of-the-art":[198],"algorithm.":[199]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}