{"id":"https://openalex.org/W1980296184","doi":"https://doi.org/10.1109/icsmc.2011.6084092","title":"A fast path planning algorithm for route guidance system","display_name":"A fast path planning algorithm for route guidance system","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W1980296184","doi":"https://doi.org/10.1109/icsmc.2011.6084092","mag":"1980296184"},"language":"en","primary_location":{"id":"doi:10.1109/icsmc.2011.6084092","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2011.6084092","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Systems, Man, and Cybernetics","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/A5089742876","display_name":"Ali Selamat","orcid":"https://orcid.org/0000-0001-9746-8459"},"institutions":[{"id":"https://openalex.org/I4576418","display_name":"University of Technology Malaysia","ror":"https://ror.org/026w31v75","country_code":"MY","type":"education","lineage":["https://openalex.org/I4576418"]}],"countries":["MY"],"is_corresponding":true,"raw_author_name":"Ali Selamat","raw_affiliation_strings":["Faculty of Computer Science & Information Systems, Universiti Teknologi Malaysia, UTM, Skudai, Johor, Malaysia","Faculty of Computer Science and Information Systems, Universiti Teknologi Malaysia, 81310 UTM Skudai, Johor, Malaysia#TAB#"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science & Information Systems, Universiti Teknologi Malaysia, UTM, Skudai, Johor, Malaysia","institution_ids":["https://openalex.org/I4576418"]},{"raw_affiliation_string":"Faculty of Computer Science and Information Systems, Universiti Teknologi Malaysia, 81310 UTM Skudai, Johor, Malaysia#TAB#","institution_ids":["https://openalex.org/I4576418"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061504795","display_name":"Mortaza Zolfpour-Arokhlo","orcid":null},"institutions":[{"id":"https://openalex.org/I4576418","display_name":"University of Technology Malaysia","ror":"https://ror.org/026w31v75","country_code":"MY","type":"education","lineage":["https://openalex.org/I4576418"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Mortaza Zolfpour-Arokhlo","raw_affiliation_strings":["Faculty of Computer Science & Information Systems, Universiti Teknologi Malaysia, UTM, Skudai, Johor, Malaysia","Faculty of Computer Science and Information Systems, Universiti Teknologi Malaysia, 81310 UTM Skudai, Johor, Malaysia#TAB#"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science & Information Systems, Universiti Teknologi Malaysia, UTM, Skudai, Johor, Malaysia","institution_ids":["https://openalex.org/I4576418"]},{"raw_affiliation_string":"Faculty of Computer Science and Information Systems, Universiti Teknologi Malaysia, 81310 UTM Skudai, Johor, Malaysia#TAB#","institution_ids":["https://openalex.org/I4576418"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108032935","display_name":"Siti Zaiton Mohd Hashim","orcid":"https://orcid.org/0000-0001-5122-7166"},"institutions":[{"id":"https://openalex.org/I4576418","display_name":"University of Technology Malaysia","ror":"https://ror.org/026w31v75","country_code":"MY","type":"education","lineage":["https://openalex.org/I4576418"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Siti Zaiton Hashim","raw_affiliation_strings":["Faculty of Computer Science & Information Systems, Universiti Teknologi Malaysia, UTM, Skudai, Johor, Malaysia","Faculty of Computer Science and Information Systems, Universiti Teknologi Malaysia, 81310 UTM Skudai, Johor, Malaysia#TAB#"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science & Information Systems, Universiti Teknologi Malaysia, UTM, Skudai, Johor, Malaysia","institution_ids":["https://openalex.org/I4576418"]},{"raw_affiliation_string":"Faculty of Computer Science and Information Systems, Universiti Teknologi Malaysia, 81310 UTM Skudai, Johor, Malaysia#TAB#","institution_ids":["https://openalex.org/I4576418"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046408720","display_name":"Md. Hafiz Selamat","orcid":null},"institutions":[{"id":"https://openalex.org/I4576418","display_name":"University of Technology Malaysia","ror":"https://ror.org/026w31v75","country_code":"MY","type":"education","lineage":["https://openalex.org/I4576418"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Md Hafiz Selamat","raw_affiliation_strings":["Faculty of Computer Science & Information Systems, Universiti Teknologi Malaysia, UTM, Skudai, Johor, Malaysia","Faculty of Computer Science and Information Systems, Universiti Teknologi Malaysia, 81310 UTM Skudai, Johor, Malaysia#TAB#"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science & Information Systems, Universiti Teknologi Malaysia, UTM, Skudai, Johor, Malaysia","institution_ids":["https://openalex.org/I4576418"]},{"raw_affiliation_string":"Faculty of Computer Science and Information Systems, Universiti Teknologi Malaysia, 81310 UTM Skudai, Johor, Malaysia#TAB#","institution_ids":["https://openalex.org/I4576418"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5089742876"],"corresponding_institution_ids":["https://openalex.org/I4576418"],"apc_list":null,"apc_paid":null,"fwci":1.0302,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.78575491,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"7","issue":null,"first_page":"2773","last_page":"2778"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9970999956130981,"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.9970999956130981,"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/T10524","display_name":"Traffic control and management","score":0.9945999979972839,"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/T11106","display_name":"Data Management and Algorithms","score":0.9936000108718872,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8637120723724365},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7132568359375},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6617237329483032},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6450897455215454},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5889124274253845},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.5498025417327881},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5273714065551758},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.5098125338554382},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5061590075492859},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4918680191040039},{"id":"https://openalex.org/keywords/route-planning","display_name":"Route planning","score":0.44202157855033875},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.43419256806373596},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4244476556777954},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.4230087399482727},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.42054009437561035},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39000338315963745},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.23855486512184143},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.16563528776168823},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1560448408126831},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.11617115139961243},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10598486661911011},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08490580320358276}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8637120723724365},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7132568359375},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6617237329483032},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6450897455215454},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5889124274253845},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.5498025417327881},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5273714065551758},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.5098125338554382},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5061590075492859},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4918680191040039},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.44202157855033875},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.43419256806373596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4244476556777954},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.4230087399482727},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.42054009437561035},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39000338315963745},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.23855486512184143},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.16563528776168823},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1560448408126831},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.11617115139961243},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10598486661911011},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08490580320358276},{"id":"https://openalex.org/C43617362","wikidata":"https://www.wikidata.org/wiki/Q170050","display_name":"Chromatography","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icsmc.2011.6084092","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2011.6084092","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Systems, Man, and Cybernetics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.699999988079071,"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":8,"referenced_works":["https://openalex.org/W2064171242","https://openalex.org/W2101923813","https://openalex.org/W2110875888","https://openalex.org/W2131312799","https://openalex.org/W2167863223","https://openalex.org/W2169528473","https://openalex.org/W2319249537","https://openalex.org/W6700075049"],"related_works":["https://openalex.org/W2368964068","https://openalex.org/W2161960576","https://openalex.org/W1506649542","https://openalex.org/W4352982540","https://openalex.org/W2358094779","https://openalex.org/W2523719706","https://openalex.org/W2170980056","https://openalex.org/W2356132210","https://openalex.org/W2755818550","https://openalex.org/W2158422636"],"abstract_inverted_index":{"Path":[0,13],"planning":[1,14,139],"is":[2,44,72],"applied":[3],"in":[4,21,48,67,92],"a":[5,22,57,102],"variety":[6],"of":[7,29,40,104,125,133],"ways,":[8],"including":[9],"transportation,":[10],"telecommunications,":[11],"etc.":[12],"to":[15,18,35,74,94],"direct":[16],"vehicles":[17],"their":[19],"destination":[20,81],"dynamic":[23],"traffic":[24],"situation,":[25],"with":[26,88],"the":[27,31,45,63,68,78,89,96,116,123,131,137],"aim":[28],"reducing":[30],"motoring":[32],"time":[33],"and":[34,37,80,98,128],"ensure":[36],"efficient":[38],"use":[39],"available":[41],"road":[42,69,107],"resources":[43],"main":[46],"challenge":[47],"route":[49],"guidance":[50],"system.":[51],"In":[52],"this":[53],"paper":[54],"we":[55],"propose":[56],"fast":[58],"path":[59,138],"algorithm":[60,85,91,127],"for":[61],"finding":[62],"best":[64,97],"shortest":[65,99],"paths":[66,100],"network.":[70,108],"This":[71],"poised":[73],"minimize":[75],"costs":[76],"between":[77],"origin":[79],"nodes.":[82],"The":[83,119],"proposed":[84,117,126],"was":[86],"compared":[87],"Dijkstra":[90],"order":[93],"find":[95],"using":[101,115],"sample":[103],"Tehran":[105],"city":[106],"Three":[109],"cases":[110],"were":[111],"tested":[112],"through":[113],"simulation":[114],"algorithm.":[118],"results":[120],"show":[121],"that":[122],"efficiency":[124],"could":[129],"reduce":[130],"cost":[132],"vehicle":[134],"routing":[135],"on":[136],"problems.":[140]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}