{"id":"https://openalex.org/W1986610326","doi":"https://doi.org/10.1002/net.3230220404","title":"Paths through a maze of rectangles","display_name":"Paths through a maze of rectangles","publication_year":1992,"publication_date":"1992-07-01","ids":{"openalex":"https://openalex.org/W1986610326","doi":"https://doi.org/10.1002/net.3230220404","mag":"1986610326"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230220404","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220404","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5110463438","display_name":"E. G. Coffman","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"E. G. Coffman","raw_affiliation_strings":["AT&T Bell Laboratories Murray Hill, New Jersey 07974"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories Murray Hill, New Jersey 07974","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111902878","display_name":"E. N. Gilbert","orcid":null},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. N. Gilbert","raw_affiliation_strings":["AT&T Bell Laboratories Murray Hill, New Jersey 07974"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Bell Laboratories Murray Hill, New Jersey 07974","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110463438"],"corresponding_institution_ids":["https://openalex.org/I1283103587"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.12086022,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":"4","first_page":"349","last_page":"367"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9979000091552734,"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.9979000091552734,"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.9975000023841858,"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/T12176","display_name":"Optimization and Packing Problems","score":0.98580002784729,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/heuristics","display_name":"Heuristics","score":0.7997302412986755},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7186557054519653},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5849583148956299},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5636622309684753},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5583982467651367},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5199490785598755},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47697386145591736},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.42481276392936707},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40081554651260376},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39308035373687744},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3043333888053894},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2766052186489105},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.23605501651763916},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.0998847484588623}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7997302412986755},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7186557054519653},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5849583148956299},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5636622309684753},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5583982467651367},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5199490785598755},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47697386145591736},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.42481276392936707},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40081554651260376},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39308035373687744},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3043333888053894},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2766052186489105},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.23605501651763916},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0998847484588623},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230220404","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230220404","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1538209031","https://openalex.org/W1979832172","https://openalex.org/W1992320342","https://openalex.org/W1992876208","https://openalex.org/W2049808842","https://openalex.org/W2050185335","https://openalex.org/W2062367161","https://openalex.org/W2160517890"],"related_works":["https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W3143937874","https://openalex.org/W2067280619","https://openalex.org/W4251343851","https://openalex.org/W4352977312","https://openalex.org/W2041180560"],"abstract_inverted_index":{"Abstract":[0],"Finding":[1],"short":[2,24,106],"paths":[3,57,103],"through":[4],"mazes":[5,68,83],"of":[6,51,54,61,66,78],"rectangles":[7,36],"has":[8],"applications":[9],"in":[10],"VLSI":[11],"wire\u2010routing":[12],"and":[13,18,94],"robotics.":[14],"This":[15],"paper":[16],"introduces":[17],"analyzes":[19],"heuristic":[20,87],"algorithms":[21,31,88],"for":[22,48,71],"finding":[23],"paths,":[25,92],"under":[26],"the":[27,30,49,52,59,73,86,98],"assumption":[28],"that":[29,97],"have":[32],"no":[33],"information":[34],"about":[35],"not":[37],"already":[38],"encountered":[39],"along":[40],"a":[41],"path.":[42],"Tight":[43],"worst\u2010case":[44],"bounds":[45],"are":[46],"derived":[47],"ratio":[50],"length":[53],"these":[55],"algorithms'":[56],"to":[58,89],"lengths":[60],"shortest":[62],"paths.":[63],"A":[64],"model":[65],"random":[67],"is":[69],"defined":[70],"testing":[72],"typical":[74],"or":[75],"average\u2010case":[76],"behavior":[77],"algorithms.":[79],"Although":[80],"specially":[81],"designed":[82],"can":[84],"force":[85],"give":[90,102],"long":[91],"simulations":[93],"analysis":[95],"show":[96],"better":[99],"heuristics":[100],"usually":[101],"nearly":[104],"as":[105,107],"possible.":[108]},"counts_by_year":[],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}