@inproceedings{katz_delfi:_nodate,
	title = {Delfi: {Online} {Planner} {Selection} for {Cost}-{Optimal} {Planning}},
	abstract = {Cost-optimal planning has not seen many successful approaches that work well across all domains. Some costoptimal planners excel on some domains, while exhibiting less exciting performance on others. For a particular domain, however, there is often a cost-optimal planner that works extremely well. For that reason, portfolio-based techniques have recently become popular. These either decide offline on a particular resource allocation scheme for a given collection of planners or try to perform an online classification of a given planning task to select a planner to be applied to solving the task at hand.},
	language = {en},
	booktitle = {Planner {Abstracts} of the 9th {International} {Planning} {Competition} ({IPC})},
	author = {Katz, Michael and Sohrabi, Shirin and Samulowitz, Horst and Sievers, Silvan},
	pages = {12}
}

{"_id":"77hY2gm93QtCxHq96","bibbaseid":"katz-sohrabi-samulowitz-sievers-delfionlineplannerselectionforcostoptimalplanning","authorIDs":[],"author_short":["Katz, M.","Sohrabi, S.","Samulowitz, H.","Sievers, S."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Delfi: Online Planner Selection for Cost-Optimal Planning","abstract":"Cost-optimal planning has not seen many successful approaches that work well across all domains. Some costoptimal planners excel on some domains, while exhibiting less exciting performance on others. For a particular domain, however, there is often a cost-optimal planner that works extremely well. For that reason, portfolio-based techniques have recently become popular. These either decide offline on a particular resource allocation scheme for a given collection of planners or try to perform an online classification of a given planning task to select a planner to be applied to solving the task at hand.","language":"en","booktitle":"Planner Abstracts of the 9th International Planning Competition (IPC)","author":[{"propositions":[],"lastnames":["Katz"],"firstnames":["Michael"],"suffixes":[]},{"propositions":[],"lastnames":["Sohrabi"],"firstnames":["Shirin"],"suffixes":[]},{"propositions":[],"lastnames":["Samulowitz"],"firstnames":["Horst"],"suffixes":[]},{"propositions":[],"lastnames":["Sievers"],"firstnames":["Silvan"],"suffixes":[]}],"pages":"12","bibtex":"@inproceedings{katz_delfi:_nodate,\n\ttitle = {Delfi: {Online} {Planner} {Selection} for {Cost}-{Optimal} {Planning}},\n\tabstract = {Cost-optimal planning has not seen many successful approaches that work well across all domains. Some costoptimal planners excel on some domains, while exhibiting less exciting performance on others. For a particular domain, however, there is often a cost-optimal planner that works extremely well. For that reason, portfolio-based techniques have recently become popular. These either decide offline on a particular resource allocation scheme for a given collection of planners or try to perform an online classification of a given planning task to select a planner to be applied to solving the task at hand.},\n\tlanguage = {en},\n\tbooktitle = {Planner {Abstracts} of the 9th {International} {Planning} {Competition} ({IPC})},\n\tauthor = {Katz, Michael and Sohrabi, Shirin and Samulowitz, Horst and Sievers, Silvan},\n\tpages = {12}\n}\n\n","author_short":["Katz, M.","Sohrabi, S.","Samulowitz, H.","Sievers, S."],"key":"katz_delfi:_nodate","id":"katz_delfi:_nodate","bibbaseid":"katz-sohrabi-samulowitz-sievers-delfionlineplannerselectionforcostoptimalplanning","role":"author","urls":{},"downloads":0},"bibtype":"inproceedings","biburl":"https://bibbase.org/zotero/tillhofmann","creationDate":"2019-12-09T14:42:18.085Z","downloads":0,"keywords":[],"search_terms":["delfi","online","planner","selection","cost","optimal","planning","katz","sohrabi","samulowitz","sievers"],"title":"Delfi: Online Planner Selection for Cost-Optimal Planning","year":null,"dataSources":["9pYjFWPBodPyDyb7N"]}