Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains. Lin, S., Grastien, A., & Bercher, P. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI 2023), pages 12022–12031, 2023. AAAI Press.
![Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains [pdf]](https://bibbase.org/img/filetypes/pdf.svg "pdf")
Paper Poster Slides ![Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains [link]](https://bibbase.org/img/filetypes/link.svg "link")
Zenodo doi abstract bibtex 59 downloads
Paper Poster Slides Zenodo doi abstract bibtex 59 downloads Designing a planning domain is a difficult task in AI planning. Assisting tools are thus required if we want planning to be used more broadly. In this paper, we are interested in automatically correcting a flawed domain. In particular, we are concerned with the scenario where a domain contradicts a plan that is known to be valid. Our goal is to repair the domain so as to turn the plan into a solution. Specifically, we consider both grounded and lifted representations support for negative preconditions and show how to explore the space of repairs to find the optimal one efficiently. As an evidence of the efficiency of our approach, the experiment results show that all flawed domains except one in the benchmark set can be repaired optimally by our approach within one second.
@InProceedings{Lin2023RepairingClassicalModels,
author = {Songtuan Lin and Alban Grastien and Pascal Bercher},
booktitle = {Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI 2023)},
title = {Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains},
year = {2023},
pages = {12022--12031},
publisher = {AAAI Press},
abstract = {Designing a planning domain is a difficult task in AI planning. Assisting tools are thus required if we want planning to be used more broadly. In this paper, we are interested in automatically correcting a flawed domain. In particular, we are concerned with the scenario where a domain contradicts a plan that is known to be valid. Our goal is to repair the domain so as to turn the plan into a solution. Specifically, we consider both grounded and lifted representations support for negative preconditions and show how to explore the space of repairs to find the optimal one efficiently. As an evidence of the efficiency of our approach, the experiment results show that all flawed domains except one in the benchmark set can be repaired optimally by our approach within one second.},
doi = {10.1609/aaai.v37i10.26418},
url_Paper = {https://bercher.net/publications/2023/Lin2023RepairingClassicalModels.pdf},
url_Poster = {https://bercher.net/publications/2023/Lin2023RepairingClassicalModelsPoster.pdf},
url_Slides = {https://bercher.net/publications/2023/Lin2023RepairingClassicalModelsSlides.pdf},
url_zenodo = {https://zenodo.org/records/7690016},
keywords = {conference}
}Downloads: 59
{"_id":"Gs9MQnMiL2GBjaqsN","bibbaseid":"lin-grastien-bercher-towardsautomatedmodelingassistanceanefficientapproachforrepairingflawedplanningdomains-2023","author_short":["Lin, S.","Grastien, A.","Bercher, P."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Songtuan"],"propositions":[],"lastnames":["Lin"],"suffixes":[]},{"firstnames":["Alban"],"propositions":[],"lastnames":["Grastien"],"suffixes":[]},{"firstnames":["Pascal"],"propositions":[],"lastnames":["Bercher"],"suffixes":[]}],"booktitle":"Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI 2023)","title":"Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains","year":"2023","pages":"12022–12031","publisher":"AAAI Press","abstract":"Designing a planning domain is a difficult task in AI planning. Assisting tools are thus required if we want planning to be used more broadly. In this paper, we are interested in automatically correcting a flawed domain. In particular, we are concerned with the scenario where a domain contradicts a plan that is known to be valid. Our goal is to repair the domain so as to turn the plan into a solution. Specifically, we consider both grounded and lifted representations support for negative preconditions and show how to explore the space of repairs to find the optimal one efficiently. As an evidence of the efficiency of our approach, the experiment results show that all flawed domains except one in the benchmark set can be repaired optimally by our approach within one second.","doi":"10.1609/aaai.v37i10.26418","url_paper":"https://bercher.net/publications/2023/Lin2023RepairingClassicalModels.pdf","url_poster":"https://bercher.net/publications/2023/Lin2023RepairingClassicalModelsPoster.pdf","url_slides":"https://bercher.net/publications/2023/Lin2023RepairingClassicalModelsSlides.pdf","url_zenodo":"https://zenodo.org/records/7690016","keywords":"conference","bibtex":"@InProceedings{Lin2023RepairingClassicalModels,\n author = {Songtuan Lin and Alban Grastien and Pascal Bercher},\n booktitle = {Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI 2023)},\n title = {Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains},\n year = {2023},\n pages = {12022--12031},\n publisher = {AAAI Press},\n abstract = {Designing a planning domain is a difficult task in AI planning. Assisting tools are thus required if we want planning to be used more broadly. In this paper, we are interested in automatically correcting a flawed domain. In particular, we are concerned with the scenario where a domain contradicts a plan that is known to be valid. Our goal is to repair the domain so as to turn the plan into a solution. Specifically, we consider both grounded and lifted representations support for negative preconditions and show how to explore the space of repairs to find the optimal one efficiently. As an evidence of the efficiency of our approach, the experiment results show that all flawed domains except one in the benchmark set can be repaired optimally by our approach within one second.},\n doi = {10.1609/aaai.v37i10.26418},\n url_Paper = {https://bercher.net/publications/2023/Lin2023RepairingClassicalModels.pdf},\n url_Poster = {https://bercher.net/publications/2023/Lin2023RepairingClassicalModelsPoster.pdf},\n url_Slides = {https://bercher.net/publications/2023/Lin2023RepairingClassicalModelsSlides.pdf},\n url_zenodo = {https://zenodo.org/records/7690016},\n keywords = {conference}\n}\n\n","author_short":["Lin, S.","Grastien, A.","Bercher, P."],"key":"Lin2023RepairingClassicalModels","id":"Lin2023RepairingClassicalModels","bibbaseid":"lin-grastien-bercher-towardsautomatedmodelingassistanceanefficientapproachforrepairingflawedplanningdomains-2023","role":"author","urls":{" paper":"https://bercher.net/publications/2023/Lin2023RepairingClassicalModels.pdf"," poster":"https://bercher.net/publications/2023/Lin2023RepairingClassicalModelsPoster.pdf"," slides":"https://bercher.net/publications/2023/Lin2023RepairingClassicalModelsSlides.pdf"," zenodo":"https://zenodo.org/records/7690016"},"keyword":["conference"],"metadata":{"authorlinks":{}},"downloads":59},"bibtype":"inproceedings","biburl":"https://bercher.net/bibtex/bibliography.bib","dataSources":["WvkzCyK6mKXCp2WFz","zKgS72cAu6Ez7npdh","rta5EvLvgMEDFTyZk","BLJPWpPi3hneTGaPF","bPpsmYWjffAy6QHP5","wYF8yPQT6a4TgShWe"],"keywords":["conference"],"search_terms":["towards","automated","modeling","assistance","efficient","approach","repairing","flawed","planning","domains","lin","grastien","bercher"],"title":"Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains","year":2023,"downloads":59}