{"id":"https://openalex.org/W2979360970","doi":"https://doi.org/10.23919/sice.2019.8859846","title":"Path Planning for Robot Manipulator based on Obstacle-Guided Path Refinement","display_name":"Path Planning for Robot Manipulator based on Obstacle-Guided Path Refinement","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2979360970","doi":"https://doi.org/10.23919/sice.2019.8859846","mag":"2979360970"},"language":"en","primary_location":{"id":"doi:10.23919/sice.2019.8859846","is_oa":false,"landing_page_url":"https://doi.org/10.23919/sice.2019.8859846","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 58th Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE)","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/A5083002085","display_name":"Mohamed G. B. Atia","orcid":"https://orcid.org/0000-0003-4258-326X"},"institutions":[{"id":"https://openalex.org/I32619867","display_name":"Egypt-Japan University of Science and Technology","ror":"https://ror.org/02x66tk73","country_code":"EG","type":"education","lineage":["https://openalex.org/I32619867"]}],"countries":["EG"],"is_corresponding":false,"raw_author_name":"Mohamed G. B. Atia","raw_affiliation_strings":["Department of Mechatronics and Robotics Engineering, Egypt-Japan University of Science and Technology, Egypt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechatronics and Robotics Engineering, Egypt-Japan University of Science and Technology, Egypt","institution_ids":["https://openalex.org/I32619867"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041076367","display_name":"Omar Salah","orcid":"https://orcid.org/0000-0003-4888-3933"},"institutions":[{"id":"https://openalex.org/I91041137","display_name":"Assiut University","ror":"https://ror.org/01jaj8n65","country_code":"EG","type":"education","lineage":["https://openalex.org/I91041137"]}],"countries":["EG"],"is_corresponding":false,"raw_author_name":"Omar Salah","raw_affiliation_strings":["Department of Mechanical Engineering, Assiut University, Egypt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Assiut University, Egypt","institution_ids":["https://openalex.org/I91041137"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085721647","display_name":"Ahmed Fouly","orcid":"https://orcid.org/0000-0002-0358-0392"},"institutions":[{"id":"https://openalex.org/I89466785","display_name":"Minia University","ror":"https://ror.org/02hcv4z63","country_code":"EG","type":"education","lineage":["https://openalex.org/I89466785"]}],"countries":["EG"],"is_corresponding":false,"raw_author_name":"Ahmed Fouly","raw_affiliation_strings":["Department of Production Engineering and Mechanical Design, Minia University, Egypt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Production Engineering and Mechanical Design, Minia University, Egypt","institution_ids":["https://openalex.org/I89466785"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1017,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.45158801,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"437","last_page":"442"},"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.9977999925613403,"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/motion-planning","display_name":"Motion planning","score":0.8291463255882263},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.7156274318695068},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7034870386123657},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6480629444122314},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6245534420013428},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5494486689567566},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.5387126207351685},{"id":"https://openalex.org/keywords/scara","display_name":"SCARA","score":0.5274976491928101},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.5101538300514221},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.47702547907829285},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43793290853500366},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.43428415060043335},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.43131282925605774},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3597715198993683},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.31955960392951965},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17187494039535522},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12217655777931213}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8291463255882263},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.7156274318695068},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7034870386123657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6480629444122314},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6245534420013428},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5494486689567566},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.5387126207351685},{"id":"https://openalex.org/C158732272","wikidata":"https://www.wikidata.org/wiki/Q1484792","display_name":"SCARA","level":3,"score":0.5274976491928101},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.5101538300514221},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.47702547907829285},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43793290853500366},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.43428415060043335},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.43131282925605774},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3597715198993683},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.31955960392951965},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17187494039535522},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12217655777931213},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.23919/sice.2019.8859846","is_oa":false,"landing_page_url":"https://doi.org/10.23919/sice.2019.8859846","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 58th Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/217c6d1b-570e-49fd-a1cd-df2a8b1e379b","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/217c6d1b-570e-49fd-a1cd-df2a8b1e379b","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Atia, M G B, Salah, O & Fouly, A 2019, Path Planning for Robot Manipulator based on Obstacle-Guided Path Refinement. in 2019 58th Annual Conference of the Society of Instrument and Control Engineers of Japan, SICE 2019. https://doi.org/10.23919/SICE.2019.8859846","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W264030051","https://openalex.org/W1564897360","https://openalex.org/W1608780526","https://openalex.org/W1968628709","https://openalex.org/W1969472392","https://openalex.org/W1969483458","https://openalex.org/W2027823427","https://openalex.org/W2079399633","https://openalex.org/W2122032069","https://openalex.org/W2141664020","https://openalex.org/W2145089737","https://openalex.org/W2171938710","https://openalex.org/W2271568210","https://openalex.org/W2341882575","https://openalex.org/W2513934213","https://openalex.org/W2572302336","https://openalex.org/W2573137292","https://openalex.org/W2604760770","https://openalex.org/W2743231766","https://openalex.org/W2754852261","https://openalex.org/W2766220844","https://openalex.org/W2921715710","https://openalex.org/W6681425221","https://openalex.org/W6726443415","https://openalex.org/W6759970515"],"related_works":["https://openalex.org/W2946941768","https://openalex.org/W2315143898","https://openalex.org/W3119736302","https://openalex.org/W3046207687","https://openalex.org/W2995673330","https://openalex.org/W2604760770","https://openalex.org/W2490317825","https://openalex.org/W3184816460","https://openalex.org/W2035333155","https://openalex.org/W4400246438"],"abstract_inverted_index":{"The":[0,75],"Path":[1,43],"planning":[2,38],"is":[3,58],"essential":[4],"in":[5,87],"the":[6,20,48,53,68,90,94],"field":[7],"of":[8,26,52,67,77,89],"robotics":[9],"as":[10],"robots":[11],"require":[12],"a":[13,35,56],"fast":[14],"algorithm":[15,39,83],"to":[16],"develop":[17],"not":[18],"only":[19],"shortest":[21],"path":[22,37,91],"but":[23],"also":[24],"free":[25],"collision":[27],"with":[28,71],"any":[29],"obstacles.":[30],"Therefore,":[31],"this":[32,78],"paper":[33],"describes":[34],"novel":[36],"based":[40,64],"on":[41,65],"Obstacle-Guided":[42],"Refinement":[44],"(OGPR).":[45],"To":[46],"illustrate":[47],"benefits":[49],"and":[50,62,93],"performance":[51],"new":[54],"algorithm,":[55],"comparison":[57,79],"established":[59],"between":[60],"OGPR":[61,82],"A*":[63,86],"implementation":[66],"two":[69],"algorithms":[70],"SCARA":[72],"robot":[73],"model.":[74],"results":[76],"show":[80],"that":[81],"over":[84],"advantage":[85],"terms":[88],"length":[92],"computational":[95],"time.":[96]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}