{"id":"https://openalex.org/W3106720895","doi":"https://doi.org/10.1109/icce-taiwan49838.2020.9258170","title":"An Improved Algorithm for Searching Maze Based on Depth-First Search","display_name":"An Improved Algorithm for Searching Maze Based on Depth-First Search","publication_year":2020,"publication_date":"2020-09-28","ids":{"openalex":"https://openalex.org/W3106720895","doi":"https://doi.org/10.1109/icce-taiwan49838.2020.9258170","mag":"3106720895"},"language":"en","primary_location":{"id":"doi:10.1109/icce-taiwan49838.2020.9258170","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icce-taiwan49838.2020.9258170","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Consumer Electronics - Taiwan (ICCE-Taiwan)","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/A5027172340","display_name":"Ying\u2010Hsuan Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I151221077","display_name":"Chung Yuan Christian University","ror":"https://ror.org/02w8ws377","country_code":"TW","type":"education","lineage":["https://openalex.org/I151221077"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Ying-Hsuan Chen","raw_affiliation_strings":["Dept. of Electronic Eng., Chung Yuan Christian University, Taiwan"],"affiliations":[{"raw_affiliation_string":"Dept. of Electronic Eng., Chung Yuan Christian University, Taiwan","institution_ids":["https://openalex.org/I151221077"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111623528","display_name":"Chang-Ming Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I151221077","display_name":"Chung Yuan Christian University","ror":"https://ror.org/02w8ws377","country_code":"TW","type":"education","lineage":["https://openalex.org/I151221077"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Chang-Ming Wu","raw_affiliation_strings":["Dept. of Electronic Eng., Chung Yuan Christian University, Taiwan"],"affiliations":[{"raw_affiliation_string":"Dept. of Electronic Eng., Chung Yuan Christian University, Taiwan","institution_ids":["https://openalex.org/I151221077"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5027172340"],"corresponding_institution_ids":["https://openalex.org/I151221077"],"apc_list":null,"apc_paid":null,"fwci":0.8793,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.76877059,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"2"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9908000230789185,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9908000230789185,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9854999780654907,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9785000085830688,"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/search-algorithm","display_name":"Search algorithm","score":0.6226229071617126},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6138138175010681},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.5703247785568237},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5525736808776855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5083081126213074},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.4833109378814697},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.45939111709594727},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4563392698764801},{"id":"https://openalex.org/keywords/linear-search","display_name":"Linear search","score":0.45352703332901},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.4421881139278412},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.43504461646080017},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.42197442054748535},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4207966923713684},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.39189469814300537},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26114171743392944}],"concepts":[{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.6226229071617126},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6138138175010681},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.5703247785568237},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5525736808776855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5083081126213074},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4833109378814697},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.45939111709594727},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4563392698764801},{"id":"https://openalex.org/C204259536","wikidata":"https://www.wikidata.org/wiki/Q787903","display_name":"Linear search","level":2,"score":0.45352703332901},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.4421881139278412},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.43504461646080017},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.42197442054748535},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4207966923713684},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.39189469814300537},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26114171743392944},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icce-taiwan49838.2020.9258170","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icce-taiwan49838.2020.9258170","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Conference on Consumer Electronics - Taiwan (ICCE-Taiwan)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1996126991","https://openalex.org/W2480950853","https://openalex.org/W2595900512","https://openalex.org/W2781095642","https://openalex.org/W2783028794"],"related_works":["https://openalex.org/W2166539025","https://openalex.org/W169590971","https://openalex.org/W2998661990","https://openalex.org/W2376570066","https://openalex.org/W2171053395","https://openalex.org/W4213195198","https://openalex.org/W2354057059","https://openalex.org/W2366590500","https://openalex.org/W2585326820","https://openalex.org/W205563547"],"abstract_inverted_index":{"In":[0,20,58],"this":[1],"paper,":[2],"we":[3,30,48,65,96],"propose":[4],"an":[5],"algorithm":[6],"based":[7],"on":[8],"depth-first":[9,68],"search":[10,12,69,75],"to":[11,22,33,54,60,74],"for":[13],"unknown":[14],"mazes":[15],"and":[16,37,47,83],"construct":[17],"the":[18,28,35,40,51,56,63,67,77,80,85,90,99,107],"maps.":[19],"order":[21,59],"obtain":[23],"a":[24],"complete":[25],"map":[26],"of":[27,39],"maze,":[29],"use":[31],"stacks":[32],"store":[34],"coordinates":[36],"directions":[38],"agents":[41,73,92],"that":[42],"have":[43],"not":[44],"been":[45],"searched,":[46],"must":[49],"leave":[50],"stack":[52],"empty":[53],"end":[55],"search.":[57],"speed":[61],"up":[62],"search,":[64],"improve":[66],"method,":[70],"using":[71],"two":[72,91,104],"in":[76,106],"maze":[78,87],"at":[79],"same":[81],"time,":[82],"exchange":[84],"searched":[86,108],"information":[88],"when":[89],"met.":[93],"After":[94],"searching,":[95],"can":[97],"find":[98],"shortest":[100],"path":[101],"between":[102],"any":[103],"points":[105],"maze.":[109]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}