{"id":"https://openalex.org/W4414223335","doi":"https://doi.org/10.1609/icaps.v35i1.36115","title":"Alternation-Based Novelty Search","display_name":"Alternation-Based Novelty Search","publication_year":2025,"publication_date":"2025-09-16","ids":{"openalex":"https://openalex.org/W4414223335","doi":"https://doi.org/10.1609/icaps.v35i1.36115"},"language":"en","primary_location":{"id":"doi:10.1609/icaps.v35i1.36115","is_oa":true,"landing_page_url":"https://doi.org/10.1609/icaps.v35i1.36115","pdf_url":null,"source":{"id":"https://openalex.org/S4387283601","display_name":"Proceedings of the International Conference on Automated Planning and Scheduling","issn_l":"2334-0835","issn":["2334-0835","2334-0843"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Automated Planning and Scheduling","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1609/icaps.v35i1.36115","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041513457","display_name":"Augusto B. Corr\u00eaa","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Augusto B. Corr\u00eaa","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5031089257","display_name":"Jendrik Seipp","orcid":"https://orcid.org/0000-0002-2498-8020"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jendrik Seipp","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3138763,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"35","issue":"1","first_page":"178","last_page":"182"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11719","display_name":"Data Quality and Management","score":0.9196000099182129,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11719","display_name":"Data Quality and Management","score":0.9196000099182129,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7746999859809875},{"id":"https://openalex.org/keywords/novelty","display_name":"Novelty","score":0.7741000056266785},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5371000170707703},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.49639999866485596},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.41359999775886536},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.38260000944137573}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7746999859809875},{"id":"https://openalex.org/C2778738651","wikidata":"https://www.wikidata.org/wiki/Q16546687","display_name":"Novelty","level":2,"score":0.7741000056266785},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.6172999739646912},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5371000170707703},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5353000164031982},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.49639999866485596},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4336000084877014},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.41359999775886536},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.38260000944137573},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.3630000054836273},{"id":"https://openalex.org/C26826806","wikidata":"https://www.wikidata.org/wiki/Q438358","display_name":"Alternation (linguistics)","level":2,"score":0.33379998803138733},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.31439998745918274},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2928999960422516},{"id":"https://openalex.org/C2776372474","wikidata":"https://www.wikidata.org/wiki/Q508291","display_name":"Simplicity","level":2,"score":0.27309998869895935},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.2540000081062317},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2533000111579895},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.250900000333786}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/icaps.v35i1.36115","is_oa":true,"landing_page_url":"https://doi.org/10.1609/icaps.v35i1.36115","pdf_url":null,"source":{"id":"https://openalex.org/S4387283601","display_name":"Proceedings of the International Conference on Automated Planning and Scheduling","issn_l":"2334-0835","issn":["2334-0835","2334-0843"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Automated Planning and Scheduling","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1609/icaps.v35i1.36115","is_oa":true,"landing_page_url":"https://doi.org/10.1609/icaps.v35i1.36115","pdf_url":null,"source":{"id":"https://openalex.org/S4387283601","display_name":"Proceedings of the International Conference on Automated Planning and Scheduling","issn_l":"2334-0835","issn":["2334-0835","2334-0843"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Automated Planning and Scheduling","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"One":[0],"key":[1],"decision":[2],"for":[3,21,117],"heuristic":[4],"search":[5,63],"algorithms":[6,59],"is":[7,43,131],"how":[8],"to":[9,25,31,82,95,129],"balance":[10],"exploration":[11],"and":[12,30],"exploitation.":[13],"In":[14,102],"classical":[15],"planning,":[16],"the":[17,99,107,125],"two":[18,85],"strongest":[19,57,126],"approaches":[20],"this":[22,103],"problem":[23],"are":[24,51],"alternate":[26],"between":[27,47],"different":[28,48,54],"heuristics":[29,33],"enhance":[32],"with":[34],"novelty":[35],"measures.":[36],"The":[37,56],"most":[38],"well-known":[39],"planner":[40],"using":[41,53,111],"alternation":[42],"LAMA,":[44],"which":[45,65],"cycles":[46],"open-lists":[49],"that":[50,68,122],"ordered":[52],"heuristics.":[55],"novelty-based":[58],"use":[60],"best-first":[61],"width":[62],"(BFWS),":[64],"prefers":[66],"states":[67],"contain":[69],"previously":[70],"unseen":[71],"combinations":[72],"of":[73,110,137],"atoms.":[74],"Considerable":[75],"effort":[76],"has":[77,92],"been":[78,93],"put":[79],"into":[80],"trying":[81],"combine":[83],"these":[84],"approaches,":[86],"but":[87],"so":[88],"far,":[89],"no":[90],"combination":[91],"able":[94],"significantly":[96],"improve":[97],"over":[98],"individual":[100],"planners.":[101],"paper,":[104],"we":[105],"explore":[106],"simple":[108],"idea":[109],"BFWS":[112,127],"as":[113],"just":[114],"another":[115],"open-list":[116],"LAMA.":[118],"Our":[119],"results":[120],"show":[121],"adding":[123],"even":[124],"version":[128],"LAMA":[130],"detrimental.":[132],"However,":[133],"combining":[134],"only":[135],"parts":[136],"each":[138],"approach":[139],"yields":[140],"a":[141],"new":[142],"state-of-the-art":[143],"agile":[144],"planner.":[145]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}