{"id":"https://openalex.org/W2043053414","doi":"https://doi.org/10.1109/iros.2013.6696904","title":"Efficient target visiting path planning for multiple vehicles with bounded curvature","display_name":"Efficient target visiting path planning for multiple vehicles with bounded curvature","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W2043053414","doi":"https://doi.org/10.1109/iros.2013.6696904","mag":"2043053414"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2013.6696904","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2013.6696904","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-article"},"type":"conference-paper","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/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"]},{"id":"https://openalex.org/I3018999404","display_name":"Centro Universit\u00e1rio de Belo Horizonte","ror":"https://ror.org/04m3xd186","country_code":"BR","type":"education","lineage":["https://openalex.org/I3018999404"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Douglas G. Macharet","raw_affiliation_strings":["Computer Science Department, Universidade Federal de Minas Gerais, MG, Brazil","Comput. Sci. Dept., Univ. Fed. de Minas Gerais, Belo Horizonte, 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":"Comput. Sci. Dept., Univ. Fed. de Minas Gerais, Belo Horizonte, Brazil","institution_ids":["https://openalex.org/I3018999404"]}]},{"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/I166595947","display_name":"Federal University of S\u00e3o Jo\u00e3o del-Rei","ror":"https://ror.org/03vrj4p82","country_code":"BR","type":"education","lineage":["https://openalex.org/I166595947"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Armando Alves Neto","raw_affiliation_strings":["Telecommunication and Mechatronic Department, Universidade Federal de S\u00e4o Jo\u00e3o del-Rei, MG, Brazil","Telecommun. & Mechatron. Dept., Univ. Fed. de Sao Joao del-Rei, Sao Joao del-Rei, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Telecommunication and Mechatronic Department, Universidade Federal de S\u00e4o Jo\u00e3o del-Rei, MG, Brazil","institution_ids":["https://openalex.org/I166595947"]},{"raw_affiliation_string":"Telecommun. & Mechatron. Dept., Univ. Fed. de Sao Joao del-Rei, Sao Joao del-Rei, Brazil","institution_ids":["https://openalex.org/I166595947"]}]},{"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","Fundacao Centro de Anal., Pesquisa e Inovacao Tecnol. (FUCAPI, Manaus, 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":"Fundacao Centro de Anal., Pesquisa e Inovacao Tecnol. (FUCAPI, Manaus, 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"]},{"id":"https://openalex.org/I3018999404","display_name":"Centro Universit\u00e1rio de Belo Horizonte","ror":"https://ror.org/04m3xd186","country_code":"BR","type":"education","lineage":["https://openalex.org/I3018999404"]}],"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","Comput. Sci. Dept., Univ. Fed. de Minas Gerais, Belo Horizonte, 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":"Comput. Sci. Dept., Univ. Fed. de Minas Gerais, Belo Horizonte, Brazil","institution_ids":["https://openalex.org/I3018999404"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4551,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.85740081,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"3830","last_page":"3836"},"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.9897000193595886,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8279292583465576},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6597955226898193},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.656256914138794},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6261264085769653},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.622093677520752},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6107546091079712},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5615776181221008},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4850879907608032},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.463463693857193},{"id":"https://openalex.org/keywords/curvature","display_name":"Curvature","score":0.45327603816986084},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33250153064727783},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23785120248794556},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.1659035086631775}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8279292583465576},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6597955226898193},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.656256914138794},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6261264085769653},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.622093677520752},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6107546091079712},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5615776181221008},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4850879907608032},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.463463693857193},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.45327603816986084},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33250153064727783},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23785120248794556},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.1659035086631775},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros.2013.6696904","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2013.6696904","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.8100000023841858}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"},{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W18216792","https://openalex.org/W626292722","https://openalex.org/W1601649239","https://openalex.org/W1913397490","https://openalex.org/W1966048254","https://openalex.org/W1969481197","https://openalex.org/W2000018926","https://openalex.org/W2066873908","https://openalex.org/W2103209505","https://openalex.org/W2104642742","https://openalex.org/W2110824994","https://openalex.org/W2111563176","https://openalex.org/W2117257995","https://openalex.org/W2126135931","https://openalex.org/W2131569937","https://openalex.org/W2137812761","https://openalex.org/W2137880701","https://openalex.org/W2143987816","https://openalex.org/W2148761022","https://openalex.org/W2160222800","https://openalex.org/W2168990813","https://openalex.org/W2313274380","https://openalex.org/W2323709497","https://openalex.org/W2332499306","https://openalex.org/W2619389213","https://openalex.org/W3150899403","https://openalex.org/W6600754543","https://openalex.org/W6619920785","https://openalex.org/W6635893188","https://openalex.org/W6667331318","https://openalex.org/W6738712214"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2244079844","https://openalex.org/W2804769572","https://openalex.org/W4297427155","https://openalex.org/W2975368677","https://openalex.org/W3025823153","https://openalex.org/W3136451934","https://openalex.org/W3200006077","https://openalex.org/W2170228269"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,40,59],"introduce":[4],"the":[5,13,37,56,72,90,93,107],"k-Dubins":[6],"Traveling":[7],"Salesman":[8],"Problem":[9],"with":[10,25],"Neighborhoods":[11],"(k-DTSPN),":[12],"problem":[14,73],"of":[15,71,92,106],"planning":[16],"efficient":[17],"paths":[18],"among":[19],"target":[20],"regions":[21],"for":[22,36],"multiple":[23],"robots":[24],"bounded":[26],"curvature":[27],"constraints":[28],"(Dubins":[29],"vehicles).":[30],"This":[31],"paper":[32],"presents":[33],"two":[34,48],"approaches":[35],"problem.":[38],"Firstly,":[39],"present":[41],"a":[42,61,75],"heuristic":[43],"that":[44],"solves":[45],"it":[46],"in":[47,55,74,98],"steps,":[49],"based":[50],"on":[51],"classical":[52],"techniques":[53],"found":[54],"literature.":[57],"Secondly,":[58],"employ":[60],"Memetic":[62],"Algorithm":[63],"to":[64,89],"solve":[65],"both":[66,83],"combinatorial":[67],"and":[68],"continuous":[69],"phases":[70],"combined":[76],"manner.":[77],"We":[78],"provide":[79],"formal":[80],"analysis":[81],"about":[82],"proposed":[84],"techniques,":[85],"presenting":[86],"upper":[87],"bounds":[88],"length":[91],"longest":[94],"tour.":[95],"Numerous":[96],"trials":[97],"simulated":[99],"environments":[100],"were":[101],"executed,":[102],"providing":[103],"statistical":[104],"examination":[105],"final":[108],"results.":[109]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"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":6},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}