{"id":"https://openalex.org/W2025673752","doi":"https://doi.org/10.1109/cscwd.2013.6581044","title":"An improved shortest path algorithm based on orientation rectangle for restricted searching area","display_name":"An improved shortest path algorithm based on orientation rectangle for restricted searching area","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2025673752","doi":"https://doi.org/10.1109/cscwd.2013.6581044","mag":"2025673752"},"language":"en","primary_location":{"id":"doi:10.1109/cscwd.2013.6581044","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cscwd.2013.6581044","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 IEEE 17th International Conference on Computer Supported Cooperative Work in Design (CSCWD)","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/A5008362876","display_name":"Wenyan Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I196699116","display_name":"Wuhan University of Technology","ror":"https://ror.org/03fe7t173","country_code":"CN","type":"education","lineage":["https://openalex.org/I196699116"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenyan Zhou","raw_affiliation_strings":["Department of Computer Science and Technology, Wuhan University of Technology, Wuhan, Hubei, China","Dept. of Comput. Sci. & Technol., Wuhan Univ. of Technol., Wuhan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, Wuhan University of Technology, Wuhan, Hubei, China","institution_ids":["https://openalex.org/I196699116"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Technol., Wuhan Univ. of Technol., Wuhan, China","institution_ids":["https://openalex.org/I196699116"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010518169","display_name":"Qizhi Qiu","orcid":null},"institutions":[{"id":"https://openalex.org/I196699116","display_name":"Wuhan University of Technology","ror":"https://ror.org/03fe7t173","country_code":"CN","type":"education","lineage":["https://openalex.org/I196699116"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qizhi Qiu","raw_affiliation_strings":["Department of Computer Science and Technology, Wuhan University of Technology, Wuhan, Hubei, China","Dept. of Comput. Sci. & Technol., Wuhan Univ. of Technol., Wuhan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, Wuhan University of Technology, Wuhan, Hubei, China","institution_ids":["https://openalex.org/I196699116"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Technol., Wuhan Univ. of Technol., Wuhan, China","institution_ids":["https://openalex.org/I196699116"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101474405","display_name":"Peng Luo","orcid":"https://orcid.org/0000-0003-3282-9887"},"institutions":[{"id":"https://openalex.org/I196699116","display_name":"Wuhan University of Technology","ror":"https://ror.org/03fe7t173","country_code":"CN","type":"education","lineage":["https://openalex.org/I196699116"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Peng Luo","raw_affiliation_strings":["Department of Computer Science and Technology, Wuhan University of Technology, Wuhan, Hubei, China","Dept. of Comput. Sci. & Technol., Wuhan Univ. of Technol., Wuhan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, Wuhan University of Technology, Wuhan, Hubei, China","institution_ids":["https://openalex.org/I196699116"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Technol., Wuhan Univ. of Technol., Wuhan, China","institution_ids":["https://openalex.org/I196699116"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064268436","display_name":"Pei Fang","orcid":"https://orcid.org/0009-0000-8559-962X"},"institutions":[{"id":"https://openalex.org/I196699116","display_name":"Wuhan University of Technology","ror":"https://ror.org/03fe7t173","country_code":"CN","type":"education","lineage":["https://openalex.org/I196699116"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Pei Fang","raw_affiliation_strings":["Department of Computer Science and Technology, Wuhan University of Technology, Wuhan, Hubei, China","Dept. of Comput. Sci. & Technol., Wuhan Univ. of Technol., Wuhan, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Technology, Wuhan University of Technology, Wuhan, Hubei, China","institution_ids":["https://openalex.org/I196699116"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Technol., Wuhan Univ. of Technol., Wuhan, China","institution_ids":["https://openalex.org/I196699116"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.09745958,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":null,"first_page":"692","last_page":"697"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12601","display_name":"Web Applications and Data Management","score":0.9876999855041504,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9872999787330627,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8086826801300049},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7944449186325073},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.7832311391830444},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7826410531997681},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.7815804481506348},{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.7546820044517517},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.7093867063522339},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.6643570065498352},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6460933089256287},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5887379050254822},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5516128540039062},{"id":"https://openalex.org/keywords/orientation","display_name":"Orientation (vector space)","score":0.5382703542709351},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.47587886452674866},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43792349100112915},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.4202789068222046},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.4133055508136749},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3644333481788635},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3403248190879822},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20796000957489014},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.11002016067504883},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09037545323371887},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.06926366686820984}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8086826801300049},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7944449186325073},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.7832311391830444},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7826410531997681},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.7815804481506348},{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.7546820044517517},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.7093867063522339},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.6643570065498352},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6460933089256287},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5887379050254822},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5516128540039062},{"id":"https://openalex.org/C16345878","wikidata":"https://www.wikidata.org/wiki/Q107472979","display_name":"Orientation (vector space)","level":2,"score":0.5382703542709351},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.47587886452674866},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43792349100112915},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.4202789068222046},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.4133055508136749},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3644333481788635},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3403248190879822},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20796000957489014},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.11002016067504883},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09037545323371887},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.06926366686820984},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cscwd.2013.6581044","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cscwd.2013.6581044","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2013 IEEE 17th International Conference on Computer Supported Cooperative Work in Design (CSCWD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7599999904632568,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W600200133","https://openalex.org/W1725252975","https://openalex.org/W2169528473","https://openalex.org/W2365115138","https://openalex.org/W2367667478","https://openalex.org/W2369403113","https://openalex.org/W2385603967","https://openalex.org/W6637751552","https://openalex.org/W6990804934"],"related_works":["https://openalex.org/W2161960576","https://openalex.org/W2597144308","https://openalex.org/W2368964068","https://openalex.org/W1617152041","https://openalex.org/W1990009669","https://openalex.org/W4310271105","https://openalex.org/W2369379323","https://openalex.org/W2170980056","https://openalex.org/W2900132856","https://openalex.org/W4386259575"],"abstract_inverted_index":{"High":[0],"complexity":[1],"of":[2,24,77,81,90,111],"Dijkstra":[3],"Algorithm":[4],"limits":[5],"its":[6,125],"application":[7],"in":[8,13,29],"searching":[9,25,39,69,112],"the":[10,22,26,33,56,68,78,91,103,109,113,119],"shortest":[11,27,42,114],"path":[12,28,43],"road":[14,30,83],"network.":[15,31],"Thus":[16],"it":[17],"is":[18,50],"necessary":[19],"to":[20,59,66,85],"improve":[21],"efficiency":[23,110],"Combining":[32],"existing":[34,129],"conventional":[35,130],"algorithms":[36],"for":[37],"restricted":[38],"area,":[40],"a":[41,87],"algorithm":[44,57,73,105],"based":[45],"on":[46,53],"cut-corner":[47],"orientation":[48,54],"rectangle":[49],"proposed.":[51],"Based":[52],"rectangle,":[55],"intends":[58],"cut":[60],"corresponding":[61],"corner":[62],"areas":[63],"so":[64],"as":[65],"shrink":[67],"area.":[70],"The":[71],"proposed":[72,104],"makes":[74],"full":[75],"use":[76],"statistical":[79],"parameter":[80],"urban":[82],"network":[84],"gain":[86],"reasonable":[88],"value":[89],"cut-angle.":[92],"Theoretical":[93],"calculation":[94],"and":[95],"experiment":[96],"results":[97],"are":[98],"presented.":[99],"All":[100],"show":[101],"that":[102],"can":[106,117],"apparently":[107],"enhance":[108],"path,":[115],"which":[116],"reduce":[118],"time-complexity":[120],"by":[121],"10-40%":[122],"without":[123],"influencing":[124],"reliability":[126],"compared":[127],"with":[128],"algorithms.":[131]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}