{"id":"https://openalex.org/W7225751517","doi":"https://doi.org/10.1007/s44443-026-01370-6","title":"PPO-HAHH: a proximal policy optimization-based hierarchical adaptive hyper-heuristic for mobile robot path planning","display_name":"PPO-HAHH: a proximal policy optimization-based hierarchical adaptive hyper-heuristic for mobile robot path planning","publication_year":2026,"publication_date":"2026-11-01","ids":{"openalex":"https://openalex.org/W7225751517","doi":"https://doi.org/10.1007/s44443-026-01370-6"},"language":"en","primary_location":{"id":"doi:10.1007/s44443-026-01370-6","doi":"https://doi.org/10.1007/s44443-026-01370-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s44443-026-01370-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s44443-026-01370-6.pdf","source":{"id":"https://openalex.org/S2764955546","display_name":"Journal of King Saud University - Computer and Information Sciences","issn_l":"1319-1578","issn":["1319-1578","2213-1248"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","dongbi-c","jufo-1","norway-1","oarl","poland-100"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"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":"Journal of King Saud University Computer and Information Sciences","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W7225751517"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://link.springer.com/content/pdf/10.1007/s44443-026-01370-6.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5161409498","display_name":"Yadong Bai","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I178232147","display_name":"Guizhou University","ror":"https://ror.org/02wmsc916","country_code":"CN","type":"education","lineage":["https://openalex.org/I178232147"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yadong Bai","raw_affiliation_strings":["Guizhou University, Guiyang, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Guizhou University, Guiyang, China","institution_ids":["https://openalex.org/I178232147"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000519928","display_name":"Qingni Yuan","orcid":"https://orcid.org/0000-0001-6747-7864","observed_orcids":["https://orcid.org/0000-0001-6747-7864"]},"institutions":[{"id":"https://openalex.org/I178232147","display_name":"Guizhou University","ror":"https://ror.org/02wmsc916","country_code":"CN","type":"education","lineage":["https://openalex.org/I178232147"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Qingni Yuan","raw_affiliation_strings":["Guizhou University, Guiyang, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Guizhou University, Guiyang, China","institution_ids":["https://openalex.org/I178232147"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5161410848","display_name":"Wei Zhang","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I178232147","display_name":"Guizhou University","ror":"https://ror.org/02wmsc916","country_code":"CN","type":"education","lineage":["https://openalex.org/I178232147"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wei Zhang","raw_affiliation_strings":["Guizhou University, Guiyang, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Guizhou University, Guiyang, China","institution_ids":["https://openalex.org/I178232147"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076889837","display_name":"Pengju Qu","orcid":"https://orcid.org/0000-0002-3180-1105","observed_orcids":["https://orcid.org/0000-0002-3180-1105"]},"institutions":[{"id":"https://openalex.org/I178232147","display_name":"Guizhou University","ror":"https://ror.org/02wmsc916","country_code":"CN","type":"education","lineage":["https://openalex.org/I178232147"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Pengju Qu","raw_affiliation_strings":["Guizhou University, Guiyang, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Guizhou University, Guiyang, China","institution_ids":["https://openalex.org/I178232147"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5000519928"],"corresponding_institution_ids":["https://openalex.org/I178232147"],"apc_list":{"value":1990,"currency":"USD","value_usd":1990},"apc_paid":{"value":1990,"currency":"USD","value_usd":1990},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"38","issue":"9","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.490200012922287,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.490200012922287,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.49000000953674316,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.009499999694526196,"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/mobile-robot-path-planning","display_name":"mobile robot path planning","score":0.8740000128746033},{"id":"https://openalex.org/keywords/hyper-heuristics","display_name":"hyper-heuristics","score":0.8140000104904175},{"id":"https://openalex.org/keywords/proximal-policy-optimization","display_name":"proximal policy optimization","score":0.9380000233650208},{"id":"https://openalex.org/keywords/operator-scheduling","display_name":"operator scheduling","score":0.515999972820282},{"id":"https://openalex.org/keywords/exploration-exploitation-trade-off","display_name":"exploration-exploitation balance","score":0.75},{"id":"https://openalex.org/keywords/grid-map","display_name":"grid map","score":0.5649999976158142},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"obstacle avoidance","score":0.5220000147819519},{"id":"https://openalex.org/keywords/cec-2017-benchmark","display_name":"CEC2017 benchmark","score":0.7919999957084656},{"id":"https://openalex.org/keywords/reinforcement-learning-for-scheduling","display_name":"reinforcement learning scheduling","score":0.5690000057220459}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.637499988079071},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5202999711036682},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5073000192642212},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5058000087738037},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.47699999809265137},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.46950000524520874},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45980000495910645},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.45879998803138733},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.42289999127388},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.37310001254081726},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.3698999881744385},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.36169999837875366},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.35839998722076416},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.3492000102996826},{"id":"https://openalex.org/C166955791","wikidata":"https://www.wikidata.org/wiki/Q629579","display_name":"Macro","level":2,"score":0.3416000008583069},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.34130001068115234},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.33320000767707825},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.32440000772476196},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3151000142097473},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3149999976158142},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.30790001153945923},{"id":"https://openalex.org/C105339364","wikidata":"https://www.wikidata.org/wiki/Q2297740","display_name":"Software deployment","level":2,"score":0.29840001463890076},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.28940001130104065},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.2838999927043915},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.27630001306533813},{"id":"https://openalex.org/C52970973","wikidata":"https://www.wikidata.org/wiki/Q2497134","display_name":"Adaptive system","level":2,"score":0.2513999938964844}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s44443-026-01370-6","doi":"https://doi.org/10.1007/s44443-026-01370-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s44443-026-01370-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s44443-026-01370-6.pdf","source":{"id":"https://openalex.org/S2764955546","display_name":"Journal of King Saud University - Computer and Information Sciences","issn_l":"1319-1578","issn":["1319-1578","2213-1248"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","dongbi-c","jufo-1","norway-1","oarl","poland-100"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"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":"Journal of King Saud University Computer and Information Sciences","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s44443-026-01370-6","doi":"https://doi.org/10.1007/s44443-026-01370-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s44443-026-01370-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s44443-026-01370-6.pdf","source":{"id":"https://openalex.org/S2764955546","display_name":"Journal of King Saud University - Computer and Information Sciences","issn_l":"1319-1578","issn":["1319-1578","2213-1248"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","dongbi-c","jufo-1","norway-1","oarl","poland-100"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"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":"Journal of King Saud University Computer and Information Sciences","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G3776940148","display_name":null,"funder_award_id":"52565031","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"},{"id":"https://openalex.org/F4320321927","display_name":"Guizhou University","ror":"https://ror.org/02wmsc916"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7225751517.pdf","grobid_xml":"https://content.openalex.org/works/W7225751517.grobid-xml"},"referenced_works_count":48,"referenced_works":["https://openalex.org/W1595159159","https://openalex.org/W1814515812","https://openalex.org/W1997600725","https://openalex.org/W2061438946","https://openalex.org/W2072441740","https://openalex.org/W2119717200","https://openalex.org/W2131613989","https://openalex.org/W2152195021","https://openalex.org/W2155529731","https://openalex.org/W2736601468","https://openalex.org/W2746553466","https://openalex.org/W3132655884","https://openalex.org/W4300851297","https://openalex.org/W4324116578","https://openalex.org/W4387369436","https://openalex.org/W4389038549","https://openalex.org/W4391290222","https://openalex.org/W4391917176","https://openalex.org/W4392132386","https://openalex.org/W4394672593","https://openalex.org/W4399465146","https://openalex.org/W4400412075","https://openalex.org/W4401354861","https://openalex.org/W4407087207","https://openalex.org/W4407143365","https://openalex.org/W4409415236","https://openalex.org/W4409561964","https://openalex.org/W4409593380","https://openalex.org/W4411196858","https://openalex.org/W4412517378","https://openalex.org/W4412539563","https://openalex.org/W4413492640","https://openalex.org/W4413905197","https://openalex.org/W4414229804","https://openalex.org/W4416588282","https://openalex.org/W4416952478","https://openalex.org/W7083575613","https://openalex.org/W7101440613","https://openalex.org/W7117488803","https://openalex.org/W7118487493","https://openalex.org/W7128586950","https://openalex.org/W7131400591","https://openalex.org/W7138395422","https://openalex.org/W7138924139","https://openalex.org/W7138932332","https://openalex.org/W7140049307","https://openalex.org/W7143312851","https://openalex.org/W7153334697"],"related_works":["https://openalex.org/W7154508894","https://openalex.org/W7203671817","https://openalex.org/W3209901790","https://openalex.org/W571818863","https://openalex.org/W4414800266","https://openalex.org/W7171537873","https://openalex.org/W7213262099","https://openalex.org/W7225450701","https://openalex.org/W7156940459","https://openalex.org/W7172434873"],"abstract_inverted_index":{"Mobile":[0],"robot":[1],"path":[2,158],"planning":[3],"in":[4,152],"complex":[5,31],"grid":[6,141],"environments":[7],"is":[8,113,146],"often":[9],"hampered":[10],"by":[11],"obstacle":[12,185],"constraints":[13],"and":[14,22,58,76,85,93,106,137,139,163,184],"fragmented":[15],"feasible":[16],"regions,":[17],"leading":[18],"to":[19,79,89,115],"local":[20,94],"optima":[21],"unstable":[23],"convergence.":[24],"To":[25],"enhance":[26],"adaptive":[27],"search":[28,126,180],"scheduling":[29,70],"under":[30,127],"constraints,":[32],"this":[33],"paper":[34],"proposes":[35],"a":[36,50,55,67],"Proximal":[37],"Policy":[38],"Optimization":[39],"(PPO)-based":[40],"Hierarchical":[41],"Adaptive":[42],"Hyper-Heuristic":[43],"algorithm,":[44],"termed":[45],"PPO-HAHH.":[46],"The":[47],"algorithm":[48],"adopts":[49],"two-level":[51],"framework":[52],"consisting":[53],"of":[54,82,154,168],"high-level":[56],"policy":[57,169],"low-level":[59],"heuristics.":[60],"At":[61,96],"the":[62,97,133,149,174],"high":[63],"level,":[64,99],"PPO":[65],"produces":[66],"one-dimensional":[68],"continuous":[69],"signal":[71],"from":[72],"population":[73],"statistical":[74],"features":[75],"maps":[77,142],"it":[78],"dynamic":[80],"weights":[81,178],"exploration-oriented,":[83],"balance-oriented,":[84],"exploitation-oriented":[86],"operator":[87,118],"pools":[88],"balance":[90],"global":[91],"exploration":[92],"exploitation.":[95],"low":[98],"ten":[100],"complementary":[101],"heuristic":[102],"operators":[103],"are":[104],"constructed,":[105],"an":[107],"Individual-level":[108],"Strategy":[109],"Preference":[110],"(ISP)":[111],"mechanism":[112],"introduced":[114],"jointly":[116],"determine":[117],"selection":[119],"probabilities":[120],"with":[121,148,179],"operator-pool":[122,177],"weights,":[123],"enabling":[124],"individualized":[125],"unified":[128],"macro":[129],"scheduling.":[130],"Experiments":[131],"on":[132],"CEC2017":[134],"benchmark":[135],"suite":[136],"fixed":[138],"random":[140],"show":[143],"that":[144,173],"PPO-HAHH":[145],"competitive":[147],"selected":[150],"baselines":[151],"terms":[153],"overall":[155],"optimization":[156],"rank,":[157],"length,":[159],"effective":[160],"turn":[161],"count,":[162],"feasible-path":[164],"success":[165],"rate.":[166],"Analysis":[167],"behavior":[170],"further":[171],"shows":[172],"scheduler":[175],"adjusts":[176],"progress,":[181],"map":[182],"scale,":[183],"coverage.":[186]},"counts_by_year":[],"updated_date":"2026-11-13T13:42:25.865203","created_date":"2026-11-11T00:00:00"}