{"id":"https://openalex.org/W1977752314","doi":"https://doi.org/10.1109/icar.2013.6766468","title":"A geometrical path planning heuristic inspired by elastic networks and C-Space Traversal approaches for mobile robots in unknown environments","display_name":"A geometrical path planning heuristic inspired by elastic networks and C-Space Traversal approaches for mobile robots in unknown environments","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W1977752314","doi":"https://doi.org/10.1109/icar.2013.6766468","mag":"1977752314"},"language":"en","primary_location":{"id":"doi:10.1109/icar.2013.6766468","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icar.2013.6766468","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 16th International Conference on Advanced Robotics (ICAR)","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/A5026008603","display_name":"Davi de Oliveira Caldas","orcid":null},"institutions":[{"id":"https://openalex.org/I190085865","display_name":"Universidade Federal de Sergipe","ror":"https://ror.org/028ka0n85","country_code":"BR","type":"education","lineage":["https://openalex.org/I190085865"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Davi de Oliveira Caldas","raw_affiliation_strings":["PROEE - Universidade Federal de Sergipe, Aracaju, Brazil","PROEE, Univ. Fed. de Sergipe, Aracaju, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PROEE - Universidade Federal de Sergipe, Aracaju, Brazil","institution_ids":["https://openalex.org/I190085865"]},{"raw_affiliation_string":"PROEE, Univ. Fed. de Sergipe, Aracaju, Brazil","institution_ids":["https://openalex.org/I190085865"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085055895","display_name":"Eduardo Oliveira Freire","orcid":"https://orcid.org/0000-0002-0357-8655"},"institutions":[{"id":"https://openalex.org/I190085865","display_name":"Universidade Federal de Sergipe","ror":"https://ror.org/028ka0n85","country_code":"BR","type":"education","lineage":["https://openalex.org/I190085865"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Eduardo Oliveira Freire","raw_affiliation_strings":["PROEE-Universidade Federal de Sergipe, Aracaju, Sergipe, Brazil","PROEE, Univ. Fed. de Sergipe, Aracaju, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PROEE-Universidade Federal de Sergipe, Aracaju, Sergipe, Brazil","institution_ids":["https://openalex.org/I190085865"]},{"raw_affiliation_string":"PROEE, Univ. Fed. de Sergipe, Aracaju, Brazil","institution_ids":["https://openalex.org/I190085865"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I190085865"],"apc_list":null,"apc_paid":null,"fwci":0.2763,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.57433168,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"52","issue":null,"first_page":"1","last_page":"6"},"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.9944000244140625,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/tree-traversal","display_name":"Tree traversal","score":0.8759663105010986},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7250315546989441},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6915158629417419},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.649224042892456},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6119229197502136},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6076208353042603},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5857038497924805},{"id":"https://openalex.org/keywords/perspective","display_name":"Perspective (graphical)","score":0.5702077150344849},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.5254358649253845},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5241977572441101},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47851693630218506},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.470905065536499},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4186887741088867},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3663420081138611},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2843875288963318},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2810424566268921},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10348907113075256}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8759663105010986},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7250315546989441},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6915158629417419},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.649224042892456},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6119229197502136},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6076208353042603},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5857038497924805},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.5702077150344849},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.5254358649253845},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5241977572441101},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47851693630218506},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.470905065536499},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4186887741088867},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3663420081138611},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2843875288963318},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2810424566268921},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10348907113075256}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icar.2013.6766468","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icar.2013.6766468","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 16th International Conference on Advanced Robotics (ICAR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6899999976158142,"id":"https://metadata.un.org/sdg/11"}],"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"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W76530103","https://openalex.org/W1594788495","https://openalex.org/W1597286183","https://openalex.org/W1924450708","https://openalex.org/W2017811812","https://openalex.org/W2049259612","https://openalex.org/W2051719061","https://openalex.org/W2084151718","https://openalex.org/W2107193169","https://openalex.org/W2171330332","https://openalex.org/W2340841877","https://openalex.org/W6704356574"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2990193004","https://openalex.org/W2212805002","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W3139139461","https://openalex.org/W2904203243","https://openalex.org/W2106119116","https://openalex.org/W2125569607"],"abstract_inverted_index":{"The":[0],"research":[1],"in":[2,17,33,61],"mobile":[3,59],"robotics":[4],"provided":[5],"some":[6],"heuristics,":[7],"such":[8],"as":[9],"elastic":[10,55],"networks":[11,56],"-":[12,20,24],"an":[13,25],"algorithm":[14,52],"originally":[15],"used":[16],"optimization":[18],"problems":[19],"or":[21],"geometrical":[22],"analysis":[23],"approach":[26],"that":[27],"solves":[28],"the":[29,54],"path":[30,45],"planning":[31,46],"problem":[32],"a":[34,43,50],"Cartesian":[35],"perspective.":[36],"In":[37],"this":[38],"paper,":[39],"it":[40],"is":[41],"proposed":[42],"new":[44],"method":[47],"inspired":[48],"by":[49],"traversal":[51],"and":[53],"theory":[57],"for":[58],"robots":[60],"unknown":[62],"environments.":[63]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}
