{"id":"https://openalex.org/W3090581846","doi":"https://doi.org/10.1109/icra40945.2020.9196920","title":"Improved C-Space Exploration and Path Planning for Robotic Manipulators Using Distance Information","display_name":"Improved C-Space Exploration and Path Planning for Robotic Manipulators Using Distance Information","publication_year":2020,"publication_date":"2020-05-01","ids":{"openalex":"https://openalex.org/W3090581846","doi":"https://doi.org/10.1109/icra40945.2020.9196920","mag":"3090581846"},"language":"en","primary_location":{"id":"doi:10.1109/icra40945.2020.9196920","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra40945.2020.9196920","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Robotics and Automation (ICRA)","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/A5047120390","display_name":"Bakir La\u010devi\u0107","orcid":"https://orcid.org/0000-0002-9781-9500"},"institutions":[{"id":"https://openalex.org/I104817121","display_name":"University of Sarajevo","ror":"https://ror.org/02hhwgd43","country_code":"BA","type":"education","lineage":["https://openalex.org/I104817121"]}],"countries":["BA"],"is_corresponding":true,"raw_author_name":"Bakir Lacevic","raw_affiliation_strings":["Faculty of Electrical Engineering, University of Sarajevo, Sarajevo, Bosnia and Herzegovina"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, University of Sarajevo, Sarajevo, Bosnia and Herzegovina","institution_ids":["https://openalex.org/I104817121"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011598939","display_name":"Dinko Osmankovi\u0107","orcid":"https://orcid.org/0000-0002-7206-9651"},"institutions":[{"id":"https://openalex.org/I104817121","display_name":"University of Sarajevo","ror":"https://ror.org/02hhwgd43","country_code":"BA","type":"education","lineage":["https://openalex.org/I104817121"]}],"countries":["BA"],"is_corresponding":false,"raw_author_name":"Dinko Osmankovic","raw_affiliation_strings":["Faculty of Electrical Engineering, University of Sarajevo, Sarajevo, Bosnia and Herzegovina"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, University of Sarajevo, Sarajevo, Bosnia and Herzegovina","institution_ids":["https://openalex.org/I104817121"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047120390"],"corresponding_institution_ids":["https://openalex.org/I104817121"],"apc_list":null,"apc_paid":null,"fwci":0.8793,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.76567856,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1176","last_page":"1182"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9830999970436096,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/workspace","display_name":"Workspace","score":0.9063895344734192},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7774218320846558},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6315445899963379},{"id":"https://openalex.org/keywords/kinematics","display_name":"Kinematics","score":0.6016108989715576},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5902608036994934},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5772591829299927},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5169095993041992},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4722011983394623},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.46210914850234985},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4542631506919861},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.45375820994377136},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44109973311424255},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.4113112986087799},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4056476354598999},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3135441541671753},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.3042800724506378},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24844372272491455},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.16149166226387024},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.15610110759735107},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.097148597240448}],"concepts":[{"id":"https://openalex.org/C58581272","wikidata":"https://www.wikidata.org/wiki/Q12741163","display_name":"Workspace","level":3,"score":0.9063895344734192},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7774218320846558},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6315445899963379},{"id":"https://openalex.org/C39920418","wikidata":"https://www.wikidata.org/wiki/Q11476","display_name":"Kinematics","level":2,"score":0.6016108989715576},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5902608036994934},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5772591829299927},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5169095993041992},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4722011983394623},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.46210914850234985},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4542631506919861},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.45375820994377136},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44109973311424255},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.4113112986087799},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4056476354598999},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3135441541671753},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.3042800724506378},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24844372272491455},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.16149166226387024},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.15610110759735107},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.097148597240448},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra40945.2020.9196920","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra40945.2020.9196920","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Robotics and Automation (ICRA)","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.5}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W121974122","https://openalex.org/W240493022","https://openalex.org/W282686812","https://openalex.org/W835717832","https://openalex.org/W1627400044","https://openalex.org/W1643513940","https://openalex.org/W1971086298","https://openalex.org/W1983687767","https://openalex.org/W1999579943","https://openalex.org/W2004139909","https://openalex.org/W2043510487","https://openalex.org/W2086993435","https://openalex.org/W2110762409","https://openalex.org/W2112624395","https://openalex.org/W2115698958","https://openalex.org/W2116341587","https://openalex.org/W2124666713","https://openalex.org/W2125041002","https://openalex.org/W2128990851","https://openalex.org/W2141664020","https://openalex.org/W2338205278","https://openalex.org/W2412909029","https://openalex.org/W2734730481","https://openalex.org/W2774715208","https://openalex.org/W2789941543","https://openalex.org/W2891969900","https://openalex.org/W2892094733","https://openalex.org/W3104753760","https://openalex.org/W3181488183","https://openalex.org/W6636759986","https://openalex.org/W6636841669","https://openalex.org/W6703214588","https://openalex.org/W6741008896"],"related_works":["https://openalex.org/W2910483300","https://openalex.org/W4288640859","https://openalex.org/W3204036718","https://openalex.org/W2300145982","https://openalex.org/W2578380588","https://openalex.org/W2375652826","https://openalex.org/W2403377281","https://openalex.org/W2951573408","https://openalex.org/W2363904277","https://openalex.org/W2580512045"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,22,31,36,80,91],"simple":[3,58],"method":[4,18],"to":[5,76],"quickly":[6],"explore":[7],"C-spaces":[8],"of":[9,46,66,83],"robotic":[10],"manipulators":[11],"and":[12,57],"thus":[13],"facilitate":[14],"path":[15],"planning.":[16],"The":[17,72],"is":[19,30,74],"based":[20],"on":[21],"novel":[23],"geometrical":[24],"structure":[25],"called":[26],"generalized":[27,96],"bur.":[28],"It":[29],"star-like":[32],"tree,":[33],"rooted":[34],"at":[35,103],"given":[37],"point":[38],"in":[39,90],"free":[40,67],"C-space,":[41,68],"with":[42],"an":[43],"arbitrary":[44],"number":[45],"guaranteed":[47],"collision-free":[48,109],"edges":[49],"computed":[50],"using":[51],"distance":[52],"information":[53],"from":[54],"the":[55,104],"workspace":[56,73],"forward":[59],"kinematics.":[60],"Generalized":[61],"bur":[62],"captures":[63],"large":[64],"portions":[65],"enabling":[69,107],"accelerated":[70],"exploration.":[71],"assumed":[75],"be":[77],"decomposable":[78],"into":[79],"finite":[81],"set":[82],"(possibly":[84],"overlapping)":[85],"convex":[86],"obstacles.":[87],"When":[88],"plugged":[89],"suitable":[92],"RRT-like":[93],"planning":[94],"algorithm,":[95],"burs":[97],"enable":[98],"significant":[99],"performance":[100],"improvements,":[101],"while":[102],"same":[105],"time":[106],"exact":[108],"paths.":[110]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}