{"type":"ScholarlyArticle","title":"The Fewer the Merrier: Pruning Preferred Operators with Novelty","authors":[{"name":"Alexander Tuisov","slug":"alexander-tuisov","given":"Alexander","family":"Tuisov","affiliation":""},{"name":"Michael Katz","slug":"michael-katz","given":"Michael","family":"Katz","affiliation":""}],"abstract":"Heuristic search is among the best performing approaches to classical satisficing planning, with its performance heavily relying on informative and fast heuristics, as well as search-boosting and pruning techniques. While both heuristics and pruning techniques have gained much attention recently, search-boosting techniques in general, and preferred operators in particular have received less attention in the last decade.  \r\nOur work aims at bringing the light back to preferred operators research, with the introduction of preferred operators pruning technique, based on the concept of novelty. Continuing the research on novelty with respect to an underlying heuristic, we present the definition of preferred operators for such novelty heuristics. For that, we extend the previously defined concepts to operators, allowing us to reason about the novelty of the preferred operators.\r\n\r\nOur experimental evaluation shows the practical benefit of our suggested\r\napproach, compared to the currently used methods.","doi":"10.24963/ijcai.2021/576","url":"https://ijcai.org/proceedings/2021/576","pdf":"https://ijcai.org/proceedings/2021/0576.pdf","markdown":"https://ijcai.org/proceedings/2021/576.md","bibtex":"https://ijcai.org/proceedings/2021/bibtex/576","volume":{"slug":"2021","title":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2021","url":"https://ijcai.org/proceedings/2021/","year":2021,"location":"Montreal","dates":"19-27 August 2021","editors":"Prof. Zhi-Hua Zhou","isbn":"978-0-9992411-9-6","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2021"},"section":"Planning and Scheduling","track":"Main Track","number":576,"pages":{"first":4190,"last":4196},"keywords":["Planning and Scheduling: Planning and Scheduling","Planning and Scheduling: Search in Planning and Scheduling"],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}