{"id":"https://openalex.org/W4205813181","doi":"https://doi.org/10.1109/icsai53574.2021.9664215","title":"Dynamic Weighted Anytime Bounded Cost Search Algorithm","display_name":"Dynamic Weighted Anytime Bounded Cost Search Algorithm","publication_year":2021,"publication_date":"2021-11-13","ids":{"openalex":"https://openalex.org/W4205813181","doi":"https://doi.org/10.1109/icsai53574.2021.9664215"},"language":"en","primary_location":{"id":"doi:10.1109/icsai53574.2021.9664215","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsai53574.2021.9664215","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 7th International Conference on Systems and Informatics (ICSAI)","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/A5073078216","display_name":"Jiaying Che","orcid":"https://orcid.org/0000-0001-5524-2902"},"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":"Jiaying Che","raw_affiliation_strings":["Yantai University,School Computer and Control Engineering,Yantai,Shandong,China,264005"],"affiliations":[{"raw_affiliation_string":"Yantai University,School Computer and Control Engineering,Yantai,Shandong,China,264005","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 Computer and Control Engineering,Yantai,Shandong,China,264005"],"affiliations":[{"raw_affiliation_string":"Yantai University,School Computer and Control Engineering,Yantai,Shandong,China,264005","institution_ids":["https://openalex.org/I18452120"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073078216"],"corresponding_institution_ids":["https://openalex.org/I18452120"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17678105,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"214","issue":null,"first_page":"1","last_page":"6"},"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.9987999796867371,"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.9987999796867371,"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.9980999827384949,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9884999990463257,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6365991234779358},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6165854930877686},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5872530341148376},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5681312680244446},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5258634090423584},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.49412277340888977},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.489534467458725},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4783156216144562},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4725213646888733},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4687502682209015},{"id":"https://openalex.org/keywords/bidirectional-search","display_name":"Bidirectional search","score":0.4520816206932068},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28282812237739563},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.2646362781524658}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6365991234779358},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6165854930877686},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5872530341148376},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5681312680244446},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5258634090423584},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.49412277340888977},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.489534467458725},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4783156216144562},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4725213646888733},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4687502682209015},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.4520816206932068},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28282812237739563},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.2646362781524658},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icsai53574.2021.9664215","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsai53574.2021.9664215","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 7th International Conference on Systems and Informatics (ICSAI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3218083905","display_name":null,"funder_award_id":"62072392,61972360","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W187834424","https://openalex.org/W1969483458","https://openalex.org/W2035601288","https://openalex.org/W2042872950","https://openalex.org/W2126113409","https://openalex.org/W2135125135","https://openalex.org/W2268708260","https://openalex.org/W2787583263","https://openalex.org/W2808540770","https://openalex.org/W3082876197","https://openalex.org/W3108469301","https://openalex.org/W3205217150","https://openalex.org/W6607689546"],"related_works":["https://openalex.org/W2376570066","https://openalex.org/W1622225657","https://openalex.org/W2081821176","https://openalex.org/W2354057059","https://openalex.org/W2885402535","https://openalex.org/W4200104947","https://openalex.org/W4214503203","https://openalex.org/W2064794194","https://openalex.org/W2747118187","https://openalex.org/W2224555876"],"abstract_inverted_index":{"The":[0,224],"best":[1],"first":[2],"algorithm":[3,38,114,144,168,183,210,241],"like":[4],"A*":[5],"can":[6,184,211,242],"find":[7,40,90,172,186],"the":[8,12,41,45,56,73,78,84,94,101,109,117,122,127,133,141,151,158,164,182,196,203,209,214,232,245],"optimal":[9,42,57,102,215],"path":[10,189],"if":[11,93],"time":[13,35,204,207],"and":[14,82,138,140,148,193],"memory":[15],"is":[16,20,31,98,169],"enough.":[17],"However,":[18],"it":[19,25,201],"usually":[21,49],"difficult":[22],"to":[23,36,39,107,171,199,213,230],"do":[24],"in":[26,105,126,176,248],"many":[27],"cases.":[28],"Moreover,":[29],"there":[30],"always":[32],"not":[33,89],"enough":[34],"support":[37],"solution.":[43,58,103,216],"On":[44],"other":[46],"hand,":[47],"users":[48],"need":[50],"an":[51],"available":[52],"solution":[53,92,175,247],"rather":[54],"than":[55,100],"Based":[59],"on":[60],"this,":[61],"we":[62,218],"propose":[63],"Dynamic":[64],"weighted":[65],"Anytime":[66],"Bounded":[67,74,79],"Cost":[68],"Search(DW-ABCS)":[69],"algorithm.":[70],"It":[71],"combines":[72],"sub-optimal":[75,188,197,246],"search(BSS)":[76],"with":[77],"cost":[80,95,118],"search(BCS)":[81],"improves":[83,157],"problem":[85],"that":[86,239],"BCS":[87],"may":[88],"a":[91,173,187,220],"bound":[96,119,198],"set":[97],"less":[99,137,139],"Furthermore,":[104],"order":[106],"improve":[108],"efficiency":[110,160],"of":[111,124,143,153,166,234],"search,":[112],"DW-ABCS":[113,240],"dynamically":[115],"modify":[116],"by":[120],"considering":[121],"depth":[123,152],"nodes":[125,134],"search":[128,154,159],"process.":[129],"In":[130,162,179],"this":[131,180],"way,":[132,181],"considered":[135],"become":[136],"complexity":[142],"will":[145],"be":[146],"lower":[147,149],"along":[150],"increasing,":[155],"which":[156],"significantly.":[161],"addition,":[163],"idea":[165],"anytime":[167],"used":[170,229],"better":[174],"every":[177],"iteration.":[178],"quickly":[185],"within":[190],"suboptimal":[191],"bound,":[192],"then":[194],"reducing":[195],"optimize":[200],"until":[202],"out.":[205],"If":[206],"permitted,":[208],"converge":[212],"Specially,":[217],"conducted":[219],"rigorous":[221],"theoretical":[222],"analysis.":[223],"various":[225],"gird":[226],"maps":[227],"are":[228],"verify":[231],"performance":[233],"DW-ABCS.":[235],"Experimental":[236],"results":[237],"show":[238],"effectively":[243],"identify":[244],"different":[249],"scenes.":[250]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}