{"id":"https://openalex.org/W2799496429","doi":"https://doi.org/10.1109/icarsc.2018.8374182","title":"Finding a short path for mobile robot arm coverage of a point set","display_name":"Finding a short path for mobile robot arm coverage of a point set","publication_year":2018,"publication_date":"2018-04-01","ids":{"openalex":"https://openalex.org/W2799496429","doi":"https://doi.org/10.1109/icarsc.2018.8374182","mag":"2799496429"},"language":"en","primary_location":{"id":"doi:10.1109/icarsc.2018.8374182","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icarsc.2018.8374182","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Autonomous Robot Systems and Competitions (ICARSC)","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/A5102837455","display_name":"Francisco M. Campos","orcid":"https://orcid.org/0000-0002-1481-0042"},"institutions":[{"id":"https://openalex.org/I203847022","display_name":"Instituto Polit\u00e9cnico de Lisboa","ror":"https://ror.org/04ea70f07","country_code":"PT","type":"education","lineage":["https://openalex.org/I203847022"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Francisco M. Campos","raw_affiliation_strings":["ADEM-Area Departamental de Engenharia Mec\u00e2nica, Instituto Polit\u00e9cnico de Lisboa, Lisbon, Portugal"],"affiliations":[{"raw_affiliation_string":"ADEM-Area Departamental de Engenharia Mec\u00e2nica, Instituto Polit\u00e9cnico de Lisboa, Lisbon, Portugal","institution_ids":["https://openalex.org/I203847022"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072960236","display_name":"Fernando Carreira","orcid":"https://orcid.org/0000-0002-9873-5050"},"institutions":[{"id":"https://openalex.org/I203847022","display_name":"Instituto Polit\u00e9cnico de Lisboa","ror":"https://ror.org/04ea70f07","country_code":"PT","type":"education","lineage":["https://openalex.org/I203847022"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Fernando Carreira","raw_affiliation_strings":["ADEM-Area Departamental de Engenharia Mec\u00e2nica, Instituto Polit\u00e9cnico de Lisboa, Lisbon, Portugal"],"affiliations":[{"raw_affiliation_string":"ADEM-Area Departamental de Engenharia Mec\u00e2nica, Instituto Polit\u00e9cnico de Lisboa, Lisbon, Portugal","institution_ids":["https://openalex.org/I203847022"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006677057","display_name":"J. M. F. Calado","orcid":"https://orcid.org/0000-0001-6628-4657"},"institutions":[{"id":"https://openalex.org/I203847022","display_name":"Instituto Polit\u00e9cnico de Lisboa","ror":"https://ror.org/04ea70f07","country_code":"PT","type":"education","lineage":["https://openalex.org/I203847022"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"J. M. F. Calado","raw_affiliation_strings":["ADEM-Area Departamental de Engenharia Mec\u00e2nica, Instituto Polit\u00e9cnico de Lisboa, Lisbon, Portugal"],"affiliations":[{"raw_affiliation_string":"ADEM-Area Departamental de Engenharia Mec\u00e2nica, Instituto Polit\u00e9cnico de Lisboa, Lisbon, Portugal","institution_ids":["https://openalex.org/I203847022"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102837455"],"corresponding_institution_ids":["https://openalex.org/I203847022"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03204556,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"192","last_page":"198"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T12288","display_name":"Optimization and Search Problems","score":0.9965999722480774,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7985321879386902},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.609316885471344},{"id":"https://openalex.org/keywords/workspace","display_name":"Workspace","score":0.5982266664505005},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5768541693687439},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5724427103996277},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5717264413833618},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5340754985809326},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5306077599525452},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5226438045501709},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.5056142807006836},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.5006463527679443},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4945947825908661},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.47911715507507324},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32693275809288025},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31380796432495117},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.30929768085479736}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7985321879386902},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.609316885471344},{"id":"https://openalex.org/C58581272","wikidata":"https://www.wikidata.org/wiki/Q12741163","display_name":"Workspace","level":3,"score":0.5982266664505005},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5768541693687439},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5724427103996277},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5717264413833618},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5340754985809326},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5306077599525452},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5226438045501709},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.5056142807006836},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.5006463527679443},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4945947825908661},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.47911715507507324},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32693275809288025},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31380796432495117},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.30929768085479736},{"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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icarsc.2018.8374182","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icarsc.2018.8374182","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Autonomous Robot Systems and Competitions (ICARSC)","raw_type":"proceedings-article"},{"id":"pmh:oai:repositorio.ipl.pt:10400.21/8493","is_oa":false,"landing_page_url":"http://hdl.handle.net/10400.21/8493","pdf_url":null,"source":{"id":"https://openalex.org/S4306402433","display_name":"Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference object"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W27366642","https://openalex.org/W201105387","https://openalex.org/W1557201052","https://openalex.org/W1970499532","https://openalex.org/W1993336589","https://openalex.org/W2000115427","https://openalex.org/W2015312730","https://openalex.org/W2018702978","https://openalex.org/W2019738489","https://openalex.org/W2023947722","https://openalex.org/W2049752692","https://openalex.org/W2117364744","https://openalex.org/W2126939445","https://openalex.org/W2128786284","https://openalex.org/W2163428398","https://openalex.org/W2210838493","https://openalex.org/W2253899129","https://openalex.org/W2313008063","https://openalex.org/W2583155113","https://openalex.org/W2774671814","https://openalex.org/W3099083868"],"related_works":["https://openalex.org/W2163647484","https://openalex.org/W2244079844","https://openalex.org/W47248985","https://openalex.org/W2804769572","https://openalex.org/W2000270779","https://openalex.org/W2129486222","https://openalex.org/W3144175025","https://openalex.org/W2042716007","https://openalex.org/W1778024729","https://openalex.org/W1980841486"],"abstract_inverted_index":{"This":[0,62,137],"paper":[1,51],"introduces":[2],"the":[3,26,39,54,69,83,95,101,110,121,140,143,154,161],"problem":[4,55,86],"of":[5,29,46,56,60,79,142],"Mobile":[6,20],"Robot":[7,21],"Arm":[8,22],"Covering":[9,23],"(MRAC)":[10],"along":[11],"with":[12,34],"a":[13,30,35,43,58,66,76,90,125],"three-step":[14,67],"procedure":[15],"to":[16,129,166],"solve":[17,130,167],"it.":[18],"In":[19,49],"one":[24],"seeks":[25],"shortest":[27],"path":[28],"mobile":[31],"robot":[32,80],"equipped":[33],"manipulator":[36,40],"such":[37],"that":[38],"workspace":[41],"covers":[42],"given":[44,96],"set":[45,59,78],"geometric":[47],"entities.":[48],"this":[50],"we":[52],"consider":[53],"covering":[57],"points.":[61],"is":[63,72,87,98,135],"solved":[64,88],"by":[65,89],"procedure:":[68],"search":[70],"space":[71],"first":[73],"discretized":[74],"into":[75],"finite":[77],"poses;":[81],"then":[82],"resulting":[84],"combinatorial":[85],"memetic":[91,127],"algorithm":[92,128,138],"and,":[93],"finally,":[94],"solution":[97],"improved":[99],"in":[100,120,156],"continuous":[102],"space.":[103],"Two":[104],"popular":[105],"discretization":[106],"schemes":[107],"developed":[108],"for":[109],"related":[111],"Close":[112],"Enough":[113],"Traveling":[114,148],"Salesman":[115,149],"Problem":[116,150],"(CETSP)":[117],"are":[118],"evaluated":[119],"MRAC":[122,131],"context.":[123],"Furthermore,":[124],"new":[126],"and":[132,160],"CETSP":[133],"instances":[134],"developed.":[136],"overcomes":[139],"limitations":[141],"approaches":[144],"based":[145],"on":[146],"General":[147],"(GTSP)":[151],"solvers,":[152],"namely,":[153],"difficulty":[155],"handling":[157],"large":[158,162],"problems":[159],"computational":[163],"times":[164],"required":[165],"them.":[168]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}