{"id":"https://openalex.org/W3197928220","doi":"https://doi.org/10.1109/tsp52935.2021.9522682","title":"A Collision-Free Path Planning Algorithm for Non-Complex ASRS Using Heuristic Functions","display_name":"A Collision-Free Path Planning Algorithm for Non-Complex ASRS Using Heuristic Functions","publication_year":2021,"publication_date":"2021-07-26","ids":{"openalex":"https://openalex.org/W3197928220","doi":"https://doi.org/10.1109/tsp52935.2021.9522682","mag":"3197928220"},"language":"en","primary_location":{"id":"doi:10.1109/tsp52935.2021.9522682","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp52935.2021.9522682","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 44th International Conference on Telecommunications and Signal Processing (TSP)","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/A5054878481","display_name":"Pierre E. Abi-Char","orcid":"https://orcid.org/0000-0001-9722-2571"},"institutions":[{"id":"https://openalex.org/I2803079837","display_name":"American University of the Middle East","ror":"https://ror.org/02gqgne03","country_code":"KW","type":"education","lineage":["https://openalex.org/I2803079837"]}],"countries":["KW"],"is_corresponding":true,"raw_author_name":"Pierre E. Abi-Char","raw_affiliation_strings":["College of Engineering and Technology, American University of the Middle East, Kuwait"],"affiliations":[{"raw_affiliation_string":"College of Engineering and Technology, American University of the Middle East, Kuwait","institution_ids":["https://openalex.org/I2803079837"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006748346","display_name":"Chadi Fouad Riman","orcid":"https://orcid.org/0000-0002-1442-3915"},"institutions":[{"id":"https://openalex.org/I2803079837","display_name":"American University of the Middle East","ror":"https://ror.org/02gqgne03","country_code":"KW","type":"education","lineage":["https://openalex.org/I2803079837"]}],"countries":["KW"],"is_corresponding":false,"raw_author_name":"Chadi Riman","raw_affiliation_strings":["College of Engineering and Technology, American University of the Middle East, Kuwait"],"affiliations":[{"raw_affiliation_string":"College of Engineering and Technology, American University of the Middle East, Kuwait","institution_ids":["https://openalex.org/I2803079837"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054878481"],"corresponding_institution_ids":["https://openalex.org/I2803079837"],"apc_list":null,"apc_paid":null,"fwci":0.2965,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.64575633,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"4","issue":null,"first_page":"52","last_page":"57"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9980000257492065,"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"}},"topics":[{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9980000257492065,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9965000152587891,"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/T12288","display_name":"Optimization and Search Problems","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.6762389540672302},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6574916243553162},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6341789960861206},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6083877682685852},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5894075632095337},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5621605515480042},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4770302474498749},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3536815047264099},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.3160480260848999},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3107905983924866},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.28288906812667847},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11259371042251587},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09607920050621033}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6762389540672302},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6574916243553162},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6341789960861206},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6083877682685852},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5894075632095337},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5621605515480042},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4770302474498749},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3536815047264099},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3160480260848999},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3107905983924866},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28288906812667847},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11259371042251587},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09607920050621033},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tsp52935.2021.9522682","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tsp52935.2021.9522682","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 44th International Conference on Telecommunications and Signal Processing (TSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W2021937206","https://openalex.org/W2073305658","https://openalex.org/W2103597368","https://openalex.org/W2105060405","https://openalex.org/W2108666666","https://openalex.org/W2132049110","https://openalex.org/W2144050074","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2407477329","https://openalex.org/W2579775309","https://openalex.org/W2734981231","https://openalex.org/W2883350701","https://openalex.org/W2970488181","https://openalex.org/W3005383506"],"related_works":["https://openalex.org/W3049557657","https://openalex.org/W3150915502","https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W3138952546","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3197207153","https://openalex.org/W2411838016"],"abstract_inverted_index":{"Automated":[0],"storage":[1,10,101],"and":[2,11,15,34,36,88,140,171],"retrieval":[3,12],"systems":[4,26,43,102],"(ASRS)":[5],"are":[6,44,175],"designed":[7],"for":[8,40,98],"automated":[9,100],"of":[13,47,108,156,166,168,173,183],"parts":[14],"items":[16],"in":[17,164],"specific":[18],"locations":[19,49],"within":[20],"manufacturing,":[21],"warehouses,":[22],"institutions,":[23],"etc.":[24,82],"ASRS":[25],"offer":[27],"many":[28],"advantages,":[29],"including":[30],"improved":[31],"accuracy,":[32],"efficiency":[33,182],"productivity,":[35],"reduced":[37],"safety":[38],"risks":[39],"employees.":[41],"These":[42],"usually":[45],"comprised":[46],"predefined":[48],"where":[50],"machines":[51],"can":[52,68],"follow":[53],"established":[54],"routes":[55],"to":[56,63,91,116,125,152],"get":[57],"items.":[58],"The":[59],"Path":[60],"planning":[61,95,188],"belongs":[62],"shortest":[64,119],"path":[65,94,120,187],"problem.":[66],"It":[67],"be":[69],"solved":[70],"via":[71],"various":[72],"algorithms":[73],"such":[74],"as":[75],"graph":[76],"theory,":[77],"dynamic":[78],"programming,":[79],"neural":[80],"network,":[81],"In":[83],"this":[84],"paper,":[85],"a":[86,122,126,149],"simple":[87],"efficient":[89],"algorithm":[90,113],"find":[92,117],"the":[93,118,154,181,184],"with":[96],"collision-free":[97,186],"non-complex":[99],"is":[103,114],"developed.":[104],"An":[105],"enhanced":[106],"version":[107],"A":[109],"<sup":[110],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[111,138,143],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">*</sup>":[112],"proposed":[115,131,158,185],"from":[121],"source":[123],"node":[124],"destination":[127],"node.":[128],"Moreover,":[129],"we":[130,147],"two":[132],"heuristic":[133],"functions,":[134],"namely":[135],"H":[136,141],"<inf":[137,142],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">1</inf>":[139],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</inf>":[144],".":[145],"Finally,":[146],"developed":[148],"simulation":[150],"model":[151],"evaluate":[153],"performance":[155],"our":[157],"scheme.":[159],"Therefore,":[160],"different":[161],"simulations":[162],"scenarios,":[163],"terms":[165],"number":[167],"robots,":[169],"types":[170],"numbers":[172],"obstacles":[174],"carried":[176],"out.":[177],"Simulation":[178],"results":[179],"show":[180],"algorithm.":[189]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}