{"id":"https://openalex.org/W7124728111","doi":"https://doi.org/10.1145/3785706.3785950","title":"An Improved Fast Search Algorithm Based on A* Algorithm","display_name":"An Improved Fast Search Algorithm Based on A* Algorithm","alternate_titles":[],"publication_year":2025,"publication_date":"2025-10-17","ids":{"openalex":"https://openalex.org/W7124728111","doi":"https://doi.org/10.1145/3785706.3785950"},"language":"en","primary_location":{"id":"doi:10.1145/3785706.3785950","doi":"https://doi.org/10.1145/3785706.3785950","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3785706.3785950","pdf_url":null,"source":{"id":"https://openalex.org/S7407096932","display_name":"International Conference on Digital Economy and Computer Science (DECS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 2nd International Conference on Digital Economy and Computer Science","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W7124728111"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1145/3785706.3785950","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123293496","display_name":"Xuan Wang","orcid":"https://orcid.org/0009-0007-2962-3980","observed_orcids":["https://orcid.org/0009-0007-2962-3980"]},"institutions":[{"id":"https://openalex.org/I4210148107","display_name":"Space Engineering University","ror":"https://ror.org/04rj1td02","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210148107"]}],"countries":["CN"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Xuan Wang","raw_affiliation_strings":["Space Engineering University, Beijing, China"],"raw_orcid":"https://orcid.org/0009-0007-2962-3980","affiliations":[{"raw_affiliation_string":"Space Engineering University, Beijing, China","institution_ids":["https://openalex.org/I4210148107"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5123332422","display_name":"Fan Yang","orcid":"https://orcid.org/0000-0001-7965-7184","observed_orcids":["https://orcid.org/0000-0001-7965-7184","https://orcid.org/0009-0008-6965-2177"]},"institutions":[{"id":"https://openalex.org/I4210148107","display_name":"Space Engineering University","ror":"https://ror.org/04rj1td02","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210148107"]}],"countries":["CN"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Fan Yang","raw_affiliation_strings":["Space Engineering University, Beijing, China"],"raw_orcid":"https://orcid.org/0009-0008-6965-2177","affiliations":[{"raw_affiliation_string":"Space Engineering University, Beijing, China","institution_ids":["https://openalex.org/I4210148107"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210148107"],"apc_list":null,"apc_paid":null,"fwci":1.3119,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.84099532,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1559","last_page":"1568"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":9.999999747378752e-05,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.0,"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/a-algorithm","display_name":"A* algorithm","score":0.9020000100135803},{"id":"https://openalex.org/keywords/path-planning","display_name":"path planning","score":0.8870000243186951},{"id":"https://openalex.org/keywords/heuristic-function","display_name":"heuristic function","score":0.7419999837875366},{"id":"https://openalex.org/keywords/dynamic-weights","display_name":"dynamic weights","score":0.5040000081062317},{"id":"https://openalex.org/keywords/real-time-path-planning","display_name":"real-time path planning","score":0.8679999709129333},{"id":"https://openalex.org/keywords/search-efficiency","display_name":"search efficiency","score":0.9459999799728394},{"id":"https://openalex.org/keywords/complex-environments","display_name":"complex environments","score":0.48500001430511475}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.664900004863739},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6470999717712402},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5568000078201294},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.5532000064849854},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5385000109672546},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5091000199317932},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5077000260353088},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.48170000314712524},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.36800000071525574},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.3562999963760376},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.3531000018119812},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.3418000042438507},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.31700000166893005},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.3158999979496002},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.3109999895095825},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.303600013256073},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.29319998621940613},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2897999882698059},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.2791999876499176},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25540000200271606},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.2540000081062317},{"id":"https://openalex.org/C3561768","wikidata":"https://www.wikidata.org/wiki/Q5275267","display_name":"Difference-map algorithm","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3785706.3785950","doi":"https://doi.org/10.1145/3785706.3785950","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3785706.3785950","pdf_url":null,"source":{"id":"https://openalex.org/S7407096932","display_name":"International Conference on Digital Economy and Computer Science (DECS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 2nd International Conference on Digital Economy and Computer Science","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3785706.3785950","doi":"https://doi.org/10.1145/3785706.3785950","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3785706.3785950","pdf_url":null,"source":{"id":"https://openalex.org/S7407096932","display_name":"International Conference on Digital Economy and Computer Science (DECS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 2nd International Conference on Digital Economy and Computer Science","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2003708116","https://openalex.org/W2353801546","https://openalex.org/W3125055412","https://openalex.org/W4402051821","https://openalex.org/W6960177906"],"related_works":["https://openalex.org/W3018412685","https://openalex.org/W1968682974","https://openalex.org/W4415003425","https://openalex.org/W4411143932","https://openalex.org/W4407476511","https://openalex.org/W2353801546","https://openalex.org/W4409238613","https://openalex.org/W4292148852","https://openalex.org/W3005047719","https://openalex.org/W4417472304"],"abstract_inverted_index":{"A*":[0,41,51,106,111,134,144],"algorithm":[1,6,52,107,112,148],"is":[2,123,164],"a":[3],"path":[4,22,56,171,180],"planning":[5,48,181],"widely":[7],"used":[8],"in":[9,14,23,182],"various":[10],"traffic":[11],"carriers.":[12],"However,":[13],"complex":[15,183],"environment,":[16],"it":[17],"needs":[18],"to":[19,64,89,98,127,166],"plan":[20],"the":[21,31,34,47,55,66,70,74,78,85,90,95,101,104,109,120,129,132,142,146,153,168,176],"real":[24,91,121],"time,":[25],"which":[26,43,163],"puts":[27],"higher":[28,160],"requirements":[29,177],"on":[30],"efficiency":[32,49,169],"of":[33,50,69,131,170,178],"algorithm.":[35,135],"This":[36],"paper":[37],"presents":[38],"an":[39],"improved":[40,110,133,147],"algorithm,":[42,145],"can":[44,149,174],"greatly":[45],"improve":[46,73],"without":[53],"increasing":[54],"step":[57],"size.":[58],"First,":[59],"allow":[60],"and":[61,81,93,108,115,119,125,173],"give":[62],"priority":[63],"search":[65,161],"diagonal":[67,82],"direction":[68],"region,":[71],"then":[72],"heuristic":[75],"function,":[76],"combine":[77],"linear":[79],"distance":[80],"distance,":[83,92],"make":[84],"cost":[86],"value":[87],"close":[88],"use":[94],"dynamic":[96],"weight":[97],"adjust.":[99],"Under":[100],"same":[102],"conditions,":[103],"traditional":[105,143],"are":[113],"simulated":[114,124],"compared":[116,140],"by":[117],"Matlab,":[118],"scene":[122],"tested":[126],"verify":[128],"effectiveness":[130],"Simulation":[136],"results":[137],"show":[138],"that":[139],"with":[141],"not":[150],"only":[151],"find":[152],"optimal":[154],"global":[155],"path,":[156],"but":[157],"also":[158],"has":[159],"efficiency,":[162],"conducive":[165],"improving":[167],"planning,":[172],"meet":[175],"real-time":[179],"scenarios.":[184]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7124728111","counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2026-01-20T00:00:00"}
