{"id":"https://openalex.org/W7140029431","doi":"https://doi.org/10.1007/s44163-026-01100-x","title":"Path planning for construction site inspection robots based on the hybrid optimization of improved APF and improved ACO","display_name":"Path planning for construction site inspection robots based on the hybrid optimization of improved APF and improved ACO","publication_year":2026,"publication_date":"2026-03-22","ids":{"openalex":"https://openalex.org/W7140029431","doi":"https://doi.org/10.1007/s44163-026-01100-x"},"language":"en","primary_location":{"id":"doi:10.1007/s44163-026-01100-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s44163-026-01100-x","pdf_url":null,"source":{"id":"https://openalex.org/S4210220416","display_name":"Discover Artificial Intelligence","issn_l":"2731-0809","issn":["2731-0809"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discover Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1007/s44163-026-01100-x","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5130300237","display_name":"Yu Hu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210101171","display_name":"Zhejiang Industry Polytechnic College","ror":"https://ror.org/0192j7z55","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210101171"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yu Hu","raw_affiliation_strings":["School of Architectural Engineering, Chongqing Industry & Trade Polytechnic, Chongqing, 408000, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Architectural Engineering, Chongqing Industry & Trade Polytechnic, Chongqing, 408000, China","institution_ids":["https://openalex.org/I4210101171"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5130300237"],"corresponding_institution_ids":["https://openalex.org/I4210101171"],"apc_list":{"value":1340,"currency":"USD","value_usd":1340},"apc_paid":{"value":1340,"currency":"USD","value_usd":1340},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34362698,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.6520000100135803,"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.6520000100135803,"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/T11006","display_name":"BIM and Construction Integration","score":0.027499999850988388,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T12644","display_name":"Wildlife-Road Interactions and Conservation","score":0.021400000900030136,"subfield":{"id":"https://openalex.org/subfields/2303","display_name":"Ecology"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7857999801635742},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7031000256538391},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.7027000188827515},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.5702999830245972},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5220999717712402},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5199999809265137},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.49480000138282776},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4629000127315521},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4440000057220459},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.4068000018596649}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7857999801635742},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7031000256538391},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.7027000188827515},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.5702999830245972},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5485000014305115},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5220999717712402},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5199999809265137},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5149000287055969},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.49480000138282776},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4629000127315521},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4440000057220459},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.4068000018596649},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.37549999356269836},{"id":"https://openalex.org/C91370436","wikidata":"https://www.wikidata.org/wiki/Q5608616","display_name":"Grid method multiplication","level":3,"score":0.36000001430511475},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3447999954223633},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.3425000011920929},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.33799999952316284},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.335099995136261},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3334999978542328},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.31869998574256897},{"id":"https://openalex.org/C2986897749","wikidata":"https://www.wikidata.org/wiki/Q231761","display_name":"Potential field","level":2,"score":0.3181000053882599},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.31220000982284546},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.3046000003814697},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.2971999943256378},{"id":"https://openalex.org/C131806220","wikidata":"https://www.wikidata.org/wiki/Q852705","display_name":"Evaluation function","level":2,"score":0.2937999963760376},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.29089999198913574},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.2903999984264374},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.2840000092983246},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.27720001339912415},{"id":"https://openalex.org/C50897621","wikidata":"https://www.wikidata.org/wiki/Q2665508","display_name":"Hybrid system","level":2,"score":0.26510000228881836},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2549000084400177},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.2540000081062317},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.25270000100135803},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.25209999084472656},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.25029999017715454},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s44163-026-01100-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s44163-026-01100-x","pdf_url":null,"source":{"id":"https://openalex.org/S4210220416","display_name":"Discover Artificial Intelligence","issn_l":"2731-0809","issn":["2731-0809"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discover Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:f855128d39cd4807b7bf9157c2214477","is_oa":true,"landing_page_url":"https://doaj.org/article/f855128d39cd4807b7bf9157c2214477","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,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discover Artificial Intelligence, Vol 6, Iss 1 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s44163-026-01100-x","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s44163-026-01100-x","pdf_url":null,"source":{"id":"https://openalex.org/S4210220416","display_name":"Discover Artificial Intelligence","issn_l":"2731-0809","issn":["2731-0809"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discover Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W4210400141","https://openalex.org/W4296961226","https://openalex.org/W4297493126","https://openalex.org/W4310416670","https://openalex.org/W4312858604","https://openalex.org/W4319775609","https://openalex.org/W4320496753","https://openalex.org/W4321496558","https://openalex.org/W4323795212","https://openalex.org/W4361767702","https://openalex.org/W4384341432","https://openalex.org/W4386038298","https://openalex.org/W4390492394","https://openalex.org/W4390745875","https://openalex.org/W4392469836","https://openalex.org/W4392726962","https://openalex.org/W4397042089","https://openalex.org/W4399014819","https://openalex.org/W4399525678","https://openalex.org/W4401908372","https://openalex.org/W4413061894","https://openalex.org/W4413132174"],"related_works":[],"abstract_inverted_index":{"In":[0,209,247],"response":[1],"to":[2,43,58,92,135,144],"the":[3,15,40,45,51,60,63,67,76,85,101,105,111,120,124,138,159,181,193,199,215,229,248,269,276,289,306],"dual":[4],"challenges":[5],"of":[6,66,218,237,245,273,280,298,309],"complex":[7],"static":[8,30,49,169],"obstacles":[9],"and":[10,32,75,128,143,188,195,198,206,239,262,275,295],"frequent":[11],"dynamic":[12,34,99,147,212],"disturbances":[13],"in":[14,166,251],"construction":[16,253,310],"site":[17,254,311],"environment,":[18,170,214],"this":[19],"paper":[20],"proposes":[21],"a":[22,115,151,210,234,302],"hybrid":[23,161],"path":[24,172,182,235,299],"planning":[25,31,153,173],"strategy":[26],"that":[27,87,158],"integrates":[28,268],"global":[29,48,270],"local":[33,95,98,219,277],"re-planning.":[35],"The":[36],"research":[37],"first":[38],"adopts":[39,129],"grid":[41],"method":[42,72],"model":[44],"environment.":[46],"For":[47,97],"programming,":[50,100],"deterministic":[52],"annealing":[53,126],"(DA)":[54],"algorithm":[55,102,134,162,230],"is":[56,73,81,90,176,184,202],"introduced":[57],"control":[59],"temperature":[61],"parameters,":[62],"potential":[64,69,79],"function":[65,80],"artificial":[68],"field":[70],"(APF)":[71],"improved,":[74],"free":[77],"energy":[78],"constructed,":[82],"effectively":[83,267],"solving":[84],"problem":[86,113],"traditional":[88],"APF":[89],"prone":[91],"fall":[93],"into":[94,107,114],"minima.":[96],"adaptively":[103],"divides":[104],"environment":[106],"multiple":[108],"sub-regions,":[109],"transforms":[110],"traversal":[112,121],"traveling":[116],"salesman":[117],"problem,":[118],"optimizes":[119],"sequence":[122],"using":[123],"simulated":[125],"algorithm,":[127],"an":[130,167,240],"improved":[131],"ant":[132],"colony":[133],"search":[136],"for":[137,305],"shortest":[139],"paths":[140],"between":[141],"sub-regions":[142],"deal":[145],"with":[146,192],"obstacles,":[148],"thereby":[149],"forming":[150],"collaborative":[152],"system.":[154],"Simulation":[155],"experiments":[156],"show":[157],"proposed":[160],"significantly":[163,287],"improves":[164],"performance:":[165],"ultra-complex":[168],"its":[171],"success":[174,216,243],"rate":[175,217,244],"as":[177,179],"high":[178,211,226],"81.3%,":[180],"length":[183],"reduced":[185,203],"by":[186,204],"11.1%":[187],"14.7%":[189],"respectively":[190],"compared":[191],"A*":[194],"Dijkstra":[196],"algorithms,":[197],"computing":[200],"time":[201],"27.4%":[205],"37.9%":[207],"respectively.":[208],"obstacle":[213,227,241,292],"re-planning":[220],"remains":[221],"at":[222],"89.0%.":[223],"Under":[224],"extremely":[225],"density,":[228],"can":[231],"still":[232],"maintain":[233],"stability":[236],"77.6%":[238],"avoidance":[242,293],"80.2%.":[246],"tests":[249],"conducted":[250],"actual":[252],"scenarios,":[255],"it":[256],"has":[257],"also":[258],"demonstrated":[259],"excellent":[260],"adaptability":[261],"optimization":[263,271],"effects.":[264],"This":[265],"study":[266],"ability":[272,279],"DA-APF":[274],"adaptive":[278],"Simulated":[281],"Annealing-Ant":[282],"Colony":[283],"Optimization":[284],"(SA-ACO)":[285],"Algorithm,":[286],"improving":[288],"real-time":[290],"performance,":[291],"accuracy":[294],"overall":[296],"robustness":[297],"planning,":[300],"providing":[301],"better":[303],"solution":[304],"autonomous":[307],"navigation":[308],"inspection":[312],"robots.":[313]},"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2026-03-23T00:00:00"}