{"id":"https://openalex.org/W2921715710","doi":"https://doi.org/10.1109/robio.2018.8665080","title":"OGPR: An Obstacle-Guided Path Refinement Approach for Mobile Robot Path Planning","display_name":"OGPR: An Obstacle-Guided Path Refinement Approach for Mobile Robot Path Planning","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W2921715710","doi":"https://doi.org/10.1109/robio.2018.8665080","mag":"2921715710"},"language":"en","primary_location":{"id":"doi:10.1109/robio.2018.8665080","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robio.2018.8665080","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 Robotics and Biomimetics (ROBIO)","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/A5083002085","display_name":"Mohamed G. B. Atia","orcid":"https://orcid.org/0000-0003-4258-326X"},"institutions":[{"id":"https://openalex.org/I4210120363","display_name":"Higher Institute of Engineering","ror":"https://ror.org/02pyw9g57","country_code":"EG","type":"education","lineage":["https://openalex.org/I4210120363"]}],"countries":["EG"],"is_corresponding":false,"raw_author_name":"Mohamed G. B. Atia","raw_affiliation_strings":["Department of Basic Sciences, Monofiya High Institute of Engineering and Technology, Monofiya, Egypt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Basic Sciences, Monofiya High Institute of Engineering and Technology, Monofiya, Egypt","institution_ids":["https://openalex.org/I4210120363"]}]},{"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/A5057260736","display_name":"Haitham Ei-Hussieny","orcid":null},"institutions":[{"id":"https://openalex.org/I207547235","display_name":"Benha University","ror":"https://ror.org/03tn5ee41","country_code":"EG","type":"education","lineage":["https://openalex.org/I207547235"]}],"countries":["EG"],"is_corresponding":false,"raw_author_name":"Haitham Ei-Hussieny","raw_affiliation_strings":["Department of Electrical Engineering, Benha University, Egypt"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Benha University, Egypt","institution_ids":["https://openalex.org/I207547235"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4563,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.76651771,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"96","issue":null,"first_page":"844","last_page":"849"},"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9850999712944031,"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"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9819999933242798,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.8277584314346313},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.7401424646377563},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.719515860080719},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.708954393863678},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6378931999206543},{"id":"https://openalex.org/keywords/plan","display_name":"Plan (archaeology)","score":0.5931518077850342},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5867772102355957},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5795591473579407},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.5567218065261841},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5112154483795166},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49286699295043945},{"id":"https://openalex.org/keywords/path-tracing","display_name":"Path tracing","score":0.487339586019516},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.4560049772262573},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.4468713700771332},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.43675482273101807},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.42770296335220337},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3745393455028534},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36837708950042725},{"id":"https://openalex.org/keywords/simulation","display_name":"Simulation","score":0.3503762483596802},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33708757162094116},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2446562945842743},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09995266795158386},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08364704251289368},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.07125559449195862}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8277584314346313},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.7401424646377563},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.719515860080719},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.708954393863678},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6378931999206543},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.5931518077850342},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5867772102355957},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5795591473579407},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.5567218065261841},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5112154483795166},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49286699295043945},{"id":"https://openalex.org/C110541219","wikidata":"https://www.wikidata.org/wiki/Q72948","display_name":"Path tracing","level":3,"score":0.487339586019516},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.4560049772262573},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.4468713700771332},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.43675482273101807},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.42770296335220337},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3745393455028534},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36837708950042725},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.3503762483596802},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33708757162094116},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2446562945842743},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09995266795158386},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08364704251289368},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.07125559449195862},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","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},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","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/C205711294","wikidata":"https://www.wikidata.org/wiki/Q176953","display_name":"Rendering (computer graphics)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/robio.2018.8665080","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robio.2018.8665080","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 Robotics and Biomimetics (ROBIO)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/b25d2e46-c00c-4b7e-9f04-6dafb442b602","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/b25d2e46-c00c-4b7e-9f04-6dafb442b602","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 & Ei-Hussieny, H 2018, OGPR: An Obstacle-Guided Path Refinement Approach for Mobile Robot Path Planning. in 2018 IEEE International Conference on Robotics and Biomimetics, ROBIO 2018. https://doi.org/10.1109/ROBIO.2018.8665080","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.75}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W123646622","https://openalex.org/W193081048","https://openalex.org/W1968628709","https://openalex.org/W1969472392","https://openalex.org/W1969483458","https://openalex.org/W1982696169","https://openalex.org/W1994461476","https://openalex.org/W1998364234","https://openalex.org/W2034801091","https://openalex.org/W2098656877","https://openalex.org/W2126269902","https://openalex.org/W2145089737","https://openalex.org/W2152679156","https://openalex.org/W2169528473","https://openalex.org/W2171938710","https://openalex.org/W2317744239","https://openalex.org/W2573137292","https://openalex.org/W2604760770","https://openalex.org/W2754178587","https://openalex.org/W2964273882","https://openalex.org/W4256073327","https://openalex.org/W6607863867","https://openalex.org/W6681425221"],"related_works":["https://openalex.org/W3119736302","https://openalex.org/W4400246438","https://openalex.org/W2576812951","https://openalex.org/W2368795992","https://openalex.org/W2908094156","https://openalex.org/W2990979393","https://openalex.org/W2966249567","https://openalex.org/W4308080200","https://openalex.org/W2914610299","https://openalex.org/W4210716962"],"abstract_inverted_index":{"Despite":[0],"the":[1,4,45,48,64,70,74,77,92,104,116],"emergence":[2],"of":[3,40,115],"available":[5],"path":[6,72],"planning":[7,99],"approaches":[8],"for":[9,51],"mobile":[10,52],"robots,":[11],"excessive":[12],"computation":[13],"time":[14],"have":[15],"remained":[16],"an":[17,28],"open":[18],"issue,":[19],"especially":[20],"in":[21,98,109,120,122],"time-critical":[22],"scenarios.":[23],"In":[24],"this":[25],"paper,":[26],"however,":[27],"Obstacle-Guided":[29],"Path":[30],"Refinement":[31],"(OGPR)":[32],"approach":[33,83,119],"is":[34],"developed":[35,81],"to":[36,62],"plan":[37],"a":[38,87],"set":[39],"short":[41],"collision-free":[42],"paths":[43,101],"between":[44],"start":[46,75],"and":[47,67,76,91],"target":[49,78],"points":[50],"robots.":[53],"A":[54],"particle":[55],"swarm":[56],"optimization":[57],"framework":[58],"has":[59,84],"been":[60],"adopted":[61],"retrieve":[63],"obstacles":[65],"geometry":[66],"subsequently":[68],"refine":[69],"line-of-sight":[71],"connecting":[73],"points.":[79],"The":[80],"OGPR":[82,118],"assessed":[85],"over":[86],"2D":[88],"simulation":[89],"environment":[90],"results":[93],"show":[94],"that":[95],"its":[96],"effectiveness":[97],"safe":[100],"shorter":[102],"than":[103],"state-of-the-art":[105],"A*":[106],"algorithm.":[107],"This,":[108],"fact,":[110],"could":[111],"encourage":[112],"further":[113],"application":[114],"proposed":[117],"future":[121],"3D":[123],"spatial":[124],"environments.":[125]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}