{"id":"https://openalex.org/W2587264754","doi":"https://doi.org/10.1109/smc.2016.7844586","title":"Dynamic heuristic planner selection","display_name":"Dynamic heuristic planner selection","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2587264754","doi":"https://doi.org/10.1109/smc.2016.7844586","mag":"2587264754"},"language":"en","primary_location":{"id":"doi:10.1109/smc.2016.7844586","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2016.7844586","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5034944843","display_name":"Brian Cook","orcid":null},"institutions":[{"id":"https://openalex.org/I189196454","display_name":"The University of Texas at Arlington","ror":"https://ror.org/019kgqr73","country_code":"US","type":"education","lineage":["https://openalex.org/I189196454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brian Cook","raw_affiliation_strings":["Dept. of Computer Science and Engineering, University of Texas at Arlington"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, University of Texas at Arlington","institution_ids":["https://openalex.org/I189196454"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047174917","display_name":"Manfred Huber","orcid":"https://orcid.org/0009-0007-0294-9147"},"institutions":[{"id":"https://openalex.org/I189196454","display_name":"The University of Texas at Arlington","ror":"https://ror.org/019kgqr73","country_code":"US","type":"education","lineage":["https://openalex.org/I189196454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Manfred Huber","raw_affiliation_strings":["Dept. of Computer Science and Engineering, University of Texas at Arlington"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, University of Texas at Arlington","institution_ids":["https://openalex.org/I189196454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I189196454"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"002329","last_page":"002334"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9998999834060669,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9998999834060669,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9930999875068665,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.989300012588501,"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/heuristics","display_name":"Heuristics","score":0.8824315667152405},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.8395633697509766},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7857683897018433},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6941961646080017},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.5982796549797058},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5671880841255188},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5193535089492798},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5185402035713196},{"id":"https://openalex.org/keywords/null-move-heuristic","display_name":"Null-move heuristic","score":0.5105965733528137},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5038589835166931},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.5025732517242432},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.28006571531295776},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.2507973909378052},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14292210340499878},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.10167783498764038}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8824315667152405},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.8395633697509766},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7857683897018433},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6941961646080017},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.5982796549797058},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5671880841255188},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5193535089492798},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5185402035713196},{"id":"https://openalex.org/C114290370","wikidata":"https://www.wikidata.org/wiki/Q1415915","display_name":"Null-move heuristic","level":3,"score":0.5105965733528137},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5038589835166931},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.5025732517242432},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28006571531295776},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.2507973909378052},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14292210340499878},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.10167783498764038},{"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/C188888258","wikidata":"https://www.wikidata.org/wiki/Q7353390","display_name":"Robot learning","level":4,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smc.2016.7844586","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc.2016.7844586","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7799999713897705,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W134535133","https://openalex.org/W1503705371","https://openalex.org/W1545688112","https://openalex.org/W1578352991","https://openalex.org/W1589681292","https://openalex.org/W1602957907","https://openalex.org/W2122054842","https://openalex.org/W2161414194","https://openalex.org/W2163854321","https://openalex.org/W2183334968","https://openalex.org/W2403257327","https://openalex.org/W2403395836","https://openalex.org/W3101355526","https://openalex.org/W3106271432","https://openalex.org/W6605464159","https://openalex.org/W6630094177","https://openalex.org/W6634723679","https://openalex.org/W6713227295"],"related_works":["https://openalex.org/W1568835640","https://openalex.org/W1628567638","https://openalex.org/W2109775141","https://openalex.org/W3186374002","https://openalex.org/W2521454154","https://openalex.org/W2107678394","https://openalex.org/W2521049309","https://openalex.org/W2020754965","https://openalex.org/W3083497736","https://openalex.org/W4297052805"],"abstract_inverted_index":{"Heuristic":[0],"search":[1,12,60],"is":[2,24,33,75,114],"considered":[3],"state-of-the-art":[4],"for":[5,44,55],"classical":[6],"planning.":[7],"However,":[8],"the":[9,40,59,73,92],"performance":[10],"of":[11,62,88,120],"heuristics":[13],"varies":[14],"significantly":[15],"from":[16,85],"problem":[17,19],"to":[18,26,36,70,100],"and":[20,38],"no":[21],"single":[22],"heuristic":[23,43,64,89],"superior":[25],"all":[27],"others.":[28],"As":[29],"a":[30,45,52,63,79,86,132],"result,":[31],"it":[32],"highly":[34],"desirable":[35],"identify":[37],"utilize":[39],"best":[41],"available":[42],"particular":[46],"planning":[47,56,93],"problem.":[48],"This":[49],"paper":[50],"presents":[51],"novel":[53],"approach":[54,113],"that":[57,96,98],"monitors":[58],"dynamics":[61],"planner":[65,74,131],"over":[66],"time":[67,123],"in":[68],"order":[69],"recognize":[71],"whether":[72],"making":[76,102],"progress":[77,103],"toward":[78],"solution.":[80],"It":[81],"then":[82],"dynamically":[83],"selects":[84],"set":[87],"planners":[90,97,126],"during":[91],"process":[94],"so":[95],"appear":[99],"be":[101],"are":[104],"allocated":[105],"more":[106,115],"processor":[107,122],"time.":[108],"Experimental":[109],"results":[110],"show":[111],"this":[112],"effective":[116],"than":[117],"static":[118],"approaches":[119],"dividing":[121],"equally":[124],"between":[125],"or":[127],"selecting":[128],"any":[129],"one":[130],"priori.":[133]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}