{"id":"https://openalex.org/W1908729903","doi":"https://doi.org/10.1142/s0218126615501121","title":"Constant Time Algorithm for Computing a Collision-Free Path on R-Mesh with Path Quality Analysis","display_name":"Constant Time Algorithm for Computing a Collision-Free Path on R-Mesh with Path Quality Analysis","publication_year":2015,"publication_date":"2015-05-22","ids":{"openalex":"https://openalex.org/W1908729903","doi":"https://doi.org/10.1142/s0218126615501121","mag":"1908729903"},"language":"en","primary_location":{"id":"doi:10.1142/s0218126615501121","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218126615501121","pdf_url":null,"source":{"id":"https://openalex.org/S167602672","display_name":"Journal of Circuits Systems and Computers","issn_l":"0218-1266","issn":["0218-1266","1793-6454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Circuits, Systems and Computers","raw_type":"journal-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/A5040880458","display_name":"Hatem M. El-Boghdadi","orcid":null},"institutions":[{"id":"https://openalex.org/I145487455","display_name":"Cairo University","ror":"https://ror.org/03q21mh05","country_code":"EG","type":"education","lineage":["https://openalex.org/I145487455"]}],"countries":["EG"],"is_corresponding":true,"raw_author_name":"Hatem M. El-Boghdadi","raw_affiliation_strings":["Department of Computer Engineering, Cairo University, Giza, Egypt","[Department of Computer Engineering, Cairo University, Giza, Egypt]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Cairo University, Giza, Egypt","institution_ids":["https://openalex.org/I145487455"]},{"raw_affiliation_string":"[Department of Computer Engineering, Cairo University, Giza, Egypt]","institution_ids":["https://openalex.org/I145487455"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5040880458"],"corresponding_institution_ids":["https://openalex.org/I145487455"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04395795,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"24","issue":"08","first_page":"1550112","last_page":"1550112"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9940999746322632,"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"}},"topics":[{"id":"https://openalex.org/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9940999746322632,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9937000274658203,"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.9919000267982483,"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/path","display_name":"Path (computing)","score":0.6976815462112427},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5850791335105896},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.5613843202590942},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5426471829414368},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4873860478401184},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.47428470849990845},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4640457034111023},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4590829908847809},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44161611795425415},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4374130070209503},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.43352752923965454},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3812366724014282},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.15283915400505066},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12139159440994263},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0825265645980835}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6976815462112427},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5850791335105896},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.5613843202590942},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5426471829414368},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4873860478401184},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.47428470849990845},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4640457034111023},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4590829908847809},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44161611795425415},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4374130070209503},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.43352752923965454},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3812366724014282},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.15283915400505066},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12139159440994263},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0825265645980835},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218126615501121","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218126615501121","pdf_url":null,"source":{"id":"https://openalex.org/S167602672","display_name":"Journal of Circuits Systems and Computers","issn_l":"0218-1266","issn":["0218-1266","1793-6454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Circuits, Systems and Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1965554877","https://openalex.org/W2012097778","https://openalex.org/W2026497097","https://openalex.org/W2030370175","https://openalex.org/W2052565631","https://openalex.org/W2068020155","https://openalex.org/W2138132024","https://openalex.org/W2138807194","https://openalex.org/W2139391815","https://openalex.org/W2153057609","https://openalex.org/W2537301297","https://openalex.org/W4210890186","https://openalex.org/W4249068116"],"related_works":["https://openalex.org/W2576812951","https://openalex.org/W4210716962","https://openalex.org/W2591763881","https://openalex.org/W2966249567","https://openalex.org/W4327773932","https://openalex.org/W2559356576","https://openalex.org/W2096195085","https://openalex.org/W2914610299","https://openalex.org/W1997369033","https://openalex.org/W1660309994"],"abstract_inverted_index":{"The":[0,35],"reconfigurable":[1],"mesh":[2],"(R-Mesh)":[3],"was":[4,38],"shown":[5,39],"to":[6,17,40,43,58,112,139],"be":[7,41],"a":[8,22,60,65,68,136,177,191,202],"very":[9,49],"powerful":[10],"model":[11],"capable":[12],"of":[13,25,76,79,82,105,130,143,154,157,165,172,184,197,204],"extremely":[14],"fast":[15],"solutions":[16],"many":[18],"problems.":[19],"R-Mesh":[20,37],"has":[21],"wide":[23],"range":[24],"applications":[26],"such":[27],"as":[28,214],"arithmetic":[29],"problems,":[30],"image":[31],"processing":[32],"and":[33,67,92,146],"robotics.":[34],"2D":[36],"able":[42],"solve":[44],"the":[45,74,80,85,103,106,113,121,128,131,141,144,148,155,163,181,187,195,208],"path":[46,145,150,188],"planning":[47],"problem":[48],"fast.":[50],"In":[51],"this":[52],"paper,":[53],"we":[54],"propose":[55],"an":[56,71],"algorithm":[57,87],"compute":[59],"collision-free":[61],"path,":[62],"P,":[63,189],"between":[64],"source":[66],"destination":[69],"in":[70,89,110,152,159,167,186],"environment":[72],"with":[73,120],"existence":[75],"obstacles.":[77,173],"Independent":[78],"number":[81,156,164,183,196],"obstacles,":[83],"k,":[84],"proposed":[86],"runs":[88],"constant":[90],"time":[91,99,119],"requires":[93,117],"O(":[94],"log":[95],"2":[96],"N)":[97],"pre-processing":[98,123],"where":[100],"N":[101],"is":[102,109,212],"size":[104],"R-Mesh.":[107],"This":[108],"contrast":[111],"previous":[114],"work":[115],"that":[116],"O(k)":[118],"same":[122],"time.":[124],"We":[125,134,161,174,199],"then":[126],"consider":[127],"quality":[129],"generated":[132,149],"path.":[133],"present":[135],"constant-time":[137],"modification":[138],"enhance":[140],"length":[142],"analyze":[147],"P":[151,168],"terms":[153],"bends":[158,166,185],"P.":[160],"derive":[162,176],"for":[169,180,206],"any":[170],"set":[171],"also":[175],"necessary":[178,210],"condition":[179,211],"minimum":[182],"i.e.,":[190],"lower":[192],"bound":[193],"on":[194],"bends.":[198],"finally":[200],"identify":[201],"class":[203],"obstacles":[205],"which":[207],"above":[209],"sufficient":[213],"well":[215],"(tight":[216],"bound).":[217]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}