{"id":"https://openalex.org/W2735803263","doi":"https://doi.org/10.30684/etj.28.24.13","title":"Developing Backtracking Algorithm to Find the Optimal Solution Path","display_name":"Developing Backtracking Algorithm to Find the Optimal Solution Path","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W2735803263","doi":"https://doi.org/10.30684/etj.28.24.13","mag":"2735803263"},"language":"en","primary_location":{"id":"doi:10.30684/etj.28.24.13","doi":"https://doi.org/10.30684/etj.28.24.13","is_oa":true,"landing_page_url":"http://dx.doi.org/10.30684/etj.28.24.13","pdf_url":"https://etj.uotechnology.edu.iq/article_41761_b0b259ee8a780f25c21fe174a1dbc5e8.pdf","source":{"id":"https://openalex.org/S4210202959","display_name":"Engineering and Technology Journal","issn_l":"1681-6900","issn":["1681-6900","2412-0758"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","norway-1"],"host_organization":"https://openalex.org/P4310319165","host_organization_name":"University of Technology, Iraq","host_organization_lineage":["https://openalex.org/P4310319165"],"host_organization_lineage_names":["University of Technology, Iraq"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Engineering and Technology Journal","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://etj.uotechnology.edu.iq/article_41761_b0b259ee8a780f25c21fe174a1dbc5e8.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032268284","display_name":"Suhad M. Kadhum","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I171256487","display_name":"University of Technology - Iraq","ror":"https://ror.org/01w1ehb86","country_code":"IQ","type":"education","lineage":["https://openalex.org/I171256487"]}],"countries":["IQ"],"is_corresponding":false,"raw_author_name":"Suhad M. Kadhum","raw_affiliation_strings":["Computer Science Department, University of Technology/ Baghdad 6995"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Technology/ Baghdad 6995","institution_ids":["https://openalex.org/I171256487"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003348193","display_name":"Isra\u2019a Abdul-Ameer Abdul-Jabbar","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I171256487","display_name":"University of Technology - Iraq","ror":"https://ror.org/01w1ehb86","country_code":"IQ","type":"education","lineage":["https://openalex.org/I171256487"]}],"countries":["IQ"],"is_corresponding":false,"raw_author_name":"Israa Abdul-Jabbar","raw_affiliation_strings":["Computer Science Department, University of Technology/ Baghdad"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Technology/ Baghdad","institution_ids":["https://openalex.org/I171256487"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I171256487"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"28","issue":"24","first_page":"6995","last_page":"7003"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.8901000022888184,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.8901000022888184,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11574","display_name":"Artificial Intelligence in Games","score":0.05889999866485596,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.016599999740719795,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/backtracking","display_name":"backtracking","score":0.9919999837875366},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.8040000200271606},{"id":"https://openalex.org/keywords/heuristic-function","display_name":"heuristic function","score":0.7429999709129333},{"id":"https://openalex.org/keywords/state-space-search","display_name":"state space search","score":0.7609999775886536},{"id":"https://openalex.org/keywords/search-time-reduction","display_name":"search time reduction","score":0.6539999842643738},{"id":"https://openalex.org/keywords/tree-search","display_name":"tree search","score":0.7559999823570251},{"id":"https://openalex.org/keywords/visual-prolog","display_name":"Visual Prolog","score":0.8420000076293945}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.8281336426734924},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7279399037361145},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.7042670249938965},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6330778002738953},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6276611089706421},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.608718991279602},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.51628178358078},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5144784450531006},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4586889445781708},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.4475760757923126},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4425101578235626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43032246828079224},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4277746081352234},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.42618003487586975},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4187658429145813},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3916597366333008},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37694427371025085},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.34411877393722534},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.26401853561401367},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.24521011114120483},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.1934870481491089},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12734922766685486},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.11863577365875244},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06654587388038635},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.30684/etj.28.24.13","doi":"https://doi.org/10.30684/etj.28.24.13","is_oa":true,"landing_page_url":"http://dx.doi.org/10.30684/etj.28.24.13","pdf_url":"https://etj.uotechnology.edu.iq/article_41761_b0b259ee8a780f25c21fe174a1dbc5e8.pdf","source":{"id":"https://openalex.org/S4210202959","display_name":"Engineering and Technology Journal","issn_l":"1681-6900","issn":["1681-6900","2412-0758"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","norway-1"],"host_organization":"https://openalex.org/P4310319165","host_organization_name":"University of Technology, Iraq","host_organization_lineage":["https://openalex.org/P4310319165"],"host_organization_lineage_names":["University of Technology, Iraq"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Engineering and Technology Journal","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:c9822f2a483d41938fd40dcaeb9f39cc","doi":null,"is_oa":false,"landing_page_url":"https://doaj.org/article/c9822f2a483d41938fd40dcaeb9f39cc","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Engineering and Technology Journal, Vol 28, Iss 24, Pp 6995-7003 (2010)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.30684/etj.28.24.13","doi":"https://doi.org/10.30684/etj.28.24.13","is_oa":true,"landing_page_url":"http://dx.doi.org/10.30684/etj.28.24.13","pdf_url":"https://etj.uotechnology.edu.iq/article_41761_b0b259ee8a780f25c21fe174a1dbc5e8.pdf","source":{"id":"https://openalex.org/S4210202959","display_name":"Engineering and Technology Journal","issn_l":"1681-6900","issn":["1681-6900","2412-0758"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","norway-1"],"host_organization":"https://openalex.org/P4310319165","host_organization_name":"University of Technology, Iraq","host_organization_lineage":["https://openalex.org/P4310319165"],"host_organization_lineage_names":["University of Technology, Iraq"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Engineering and Technology Journal","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2735803263.pdf","grobid_xml":"https://content.openalex.org/works/W2735803263.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W2122410182"],"related_works":["https://openalex.org/W2940367488","https://openalex.org/W1492791789","https://openalex.org/W59445306","https://openalex.org/W2380792227","https://openalex.org/W2374583081","https://openalex.org/W1510637526","https://openalex.org/W4230126017","https://openalex.org/W6960009439","https://openalex.org/W1924795515","https://openalex.org/W2105179478"],"abstract_inverted_index":{"There":[0],"are":[1],"numerous":[2],"search":[3,122,165],"methods":[4],"in":[5,72,117,133,157,174],"A.I":[6],"used":[7],"to":[8,13,40,49,74,89,114,119,168],"find":[9,41,75],"the":[10,30,46,50,57,69,76,85,91,106,121,135,153,159],"solution":[11,23,65,93,137,161],"path":[12,24,44,59,94,127,162],"a":[14,42,101],"subjected":[15],"problem,":[16],"but":[17],"many":[18],"of":[19,36,84,109],"them":[20],"return":[21],"one":[22,112],"with":[25,60],"no":[26],"consider":[27],"it":[28,55,129],"is":[29,39,56,130],"optimal":[31,64,77,92,136,160],"or":[32],"not.":[33],"The":[34],"aim":[35],"this":[37],"work":[38],"direct":[43],"from":[45,111],"start":[47],"state":[48,52,113],"goal":[51],"such":[53,79],"that":[54,80,87,128],"shortest":[58],"minimum":[61],"cost":[62,108],"(the":[63],"path).":[66],"We":[67],"develop":[68],"backtracking":[70],"algorithm":[71,140],"order":[73,118],"solutionpath,":[78],"all":[81],"possible":[82],"paths":[83],"problem":[86],"expected":[88],"contain":[90],"can":[95],"be":[96],"checked,":[97],"also":[98],"we":[99,124],"use":[100],"heuristic":[102],"function":[103],"depends":[104],"on":[105,149],"actual":[107],"transition":[110],"another.":[115],"And":[116],"reduce":[120],"time":[123,166],"discard":[125],"any":[126],"not":[131],"useful":[132],"finding":[134,158],"path.The":[138],"proposed":[139],"was":[141,155],"implemented":[142],"using":[143],"visual":[144],"prolog":[145],"5.1":[146],"and":[147,152,170],"tested":[148],"tree":[150],"diagram":[151],"result":[154],"good":[156],"(with":[163],"efficient":[164],"equivalent":[167],"O(bd/2)":[169],"space":[171],"complexity":[172],"O(bd)":[173],"worst":[175],"cases).":[176]},"counts_by_year":[],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2017-07-21T00:00:00"}