{"id":"https://openalex.org/W3108469301","doi":"https://doi.org/10.1109/cisp-bmei51763.2020.9263589","title":"Anytime Dynamic Heuristic Search for Suboptimal Solution on Path Search","display_name":"Anytime Dynamic Heuristic Search for Suboptimal Solution on Path Search","publication_year":2020,"publication_date":"2020-10-17","ids":{"openalex":"https://openalex.org/W3108469301","doi":"https://doi.org/10.1109/cisp-bmei51763.2020.9263589","mag":"3108469301"},"language":"en","primary_location":{"id":"doi:10.1109/cisp-bmei51763.2020.9263589","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cisp-bmei51763.2020.9263589","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 13th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI)","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/A5089408972","display_name":"Ru Kong","orcid":"https://orcid.org/0000-0002-7576-6049"},"institutions":[{"id":"https://openalex.org/I18452120","display_name":"Yantai University","ror":"https://ror.org/01rp41m56","country_code":"CN","type":"education","lineage":["https://openalex.org/I18452120"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Ru Kong","raw_affiliation_strings":["Yantai University,School of Computer and Control Engineering,Yantai,China","School of Computer and Control Engineering, Yantai University, Yantai, China"],"affiliations":[{"raw_affiliation_string":"Yantai University,School of Computer and Control Engineering,Yantai,China","institution_ids":["https://openalex.org/I18452120"]},{"raw_affiliation_string":"School of Computer and Control Engineering, Yantai University, Yantai, China","institution_ids":["https://openalex.org/I18452120"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072895530","display_name":"Xiangrong Tong","orcid":"https://orcid.org/0000-0003-4855-3723"},"institutions":[{"id":"https://openalex.org/I18452120","display_name":"Yantai University","ror":"https://ror.org/01rp41m56","country_code":"CN","type":"education","lineage":["https://openalex.org/I18452120"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiangrong Tong","raw_affiliation_strings":["Yantai University,School of Computer and Control Engineering,Yantai,China","School of Computer and Control Engineering, Yantai University, Yantai, China"],"affiliations":[{"raw_affiliation_string":"Yantai University,School of Computer and Control Engineering,Yantai,China","institution_ids":["https://openalex.org/I18452120"]},{"raw_affiliation_string":"School of Computer and Control Engineering, Yantai University, Yantai, China","institution_ids":["https://openalex.org/I18452120"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5089408972"],"corresponding_institution_ids":["https://openalex.org/I18452120"],"apc_list":null,"apc_paid":null,"fwci":0.1954,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.51218324,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"267","issue":null,"first_page":"1070","last_page":"1074"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"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.9994000196456909,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9941999912261963,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9897000193595886,"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/path","display_name":"Path (computing)","score":0.7281115651130676},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.717237651348114},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.7016410231590271},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6225162744522095},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5826445817947388},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5400354266166687},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.48603421449661255},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.48120859265327454},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46396151185035706},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.4503747224807739},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4473777711391449},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4452122151851654},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.430787056684494},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.38120248913764954},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28953075408935547}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7281115651130676},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.717237651348114},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.7016410231590271},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6225162744522095},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5826445817947388},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5400354266166687},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.48603421449661255},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.48120859265327454},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46396151185035706},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4503747224807739},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4473777711391449},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4452122151851654},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.430787056684494},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.38120248913764954},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28953075408935547},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cisp-bmei51763.2020.9263589","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cisp-bmei51763.2020.9263589","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 13th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W122154553","https://openalex.org/W187834424","https://openalex.org/W1622225657","https://openalex.org/W1969483458","https://openalex.org/W2035601288","https://openalex.org/W2042872950","https://openalex.org/W2126113409","https://openalex.org/W2135125135","https://openalex.org/W2161076907","https://openalex.org/W2318981918","https://openalex.org/W2414134329","https://openalex.org/W2747118187","https://openalex.org/W2808540770","https://openalex.org/W2885402535","https://openalex.org/W2898297778","https://openalex.org/W2900115573","https://openalex.org/W2905338005","https://openalex.org/W3002701705","https://openalex.org/W3135383444","https://openalex.org/W6604968138","https://openalex.org/W6607689546","https://openalex.org/W6683620479","https://openalex.org/W6753140372"],"related_works":["https://openalex.org/W2081821176","https://openalex.org/W1622225657","https://openalex.org/W2064794194","https://openalex.org/W4200104947","https://openalex.org/W2402589461","https://openalex.org/W2885402535","https://openalex.org/W2224555876","https://openalex.org/W58921990","https://openalex.org/W4390091683","https://openalex.org/W2358427436"],"abstract_inverted_index":{"Path":[0],"search":[1,79,141],"is":[2,71,82,125,156,159,177,184],"designed":[3],"to":[4,17,40,59,99,144],"find":[5,31,55,86,100],"a":[6,56,74,87],"path":[7],"by":[8],"traversing":[9],"the":[10,14,18,27,51,62,68,94,97,101,105,115,123,129,139,145,148,151,162,165,170,181,188,191,194,198,202,205],"state":[11,16],"spaces":[12],"from":[13],"initial":[15],"target":[19],"state.":[20],"Given":[21],"enough":[22],"memory":[23],"and":[24,73,90,169,180,197],"run":[25],"time,":[26],"A*":[28,52,69],"algorithm":[29,53,70,80],"can":[30,85],"an":[32,119],"optimal":[33],"solution,":[34,150],"but":[35],"it":[36],"expends":[37],"much":[38],"time":[39],"distinguish":[41],"similar":[42],"paths.":[43],"Therefore,":[44],"many":[45],"scholars":[46],"have":[47],"proposed":[48],"variants":[49],"of":[50,96,107,147,161,190,204],"that":[54,201],"suboptimal":[57,102,182],"solution":[58,88,98,103,124,183],"speed":[60],"up":[61],"searching":[63],"efficiency.":[64],"In":[65],"this":[66],"paper,":[67],"improved":[72],"new":[75],"anytime":[76],"dynamic":[77,152],"heuristic":[78],"(ADHS)":[81],"proposed.":[83],"It":[84],"quickly":[89,126],"then":[91],"continuously":[92],"optimize":[93],"quality":[95],"until":[104],"end":[106],"time.":[108],"The":[109,173],"ADHS":[110,192,206],"includes":[111],"two":[112],"stages,":[113],"in":[114,128],"exploration":[116],"stage,":[117,131],"given":[118],"arbitrary":[120],"cost":[121,146,167,175],"bound,":[122],"obtained;":[127],"update":[130],"where":[132],"no":[133],"setting":[134],"parameters":[135],"are":[136],"required,":[137],"reuses":[138],"previous":[140],"results.":[142],"According":[143],"latest":[149],"weight":[153],"factor":[154],"w":[155],"introduced,":[157],"which":[158],"half":[160],"error":[163],"between":[164],"current":[166,171],"bound":[168,176],"solution.":[172],"next":[174],"dynamically":[178],"adjusted,":[179],"output.":[185],"We":[186],"tested":[187],"performance":[189,203],"on":[193],"grid":[195],"maps,":[196],"experiments":[199],"demonstrated":[200],"was":[207],"better":[208],"than":[209],"other":[210],"algorithms.":[211]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}