@InProceedings{Bercher2022TightHybridBounds,
  author                    = {Pascal Bercher and Songtuan Lin and Ron Alford},
  booktitle                 = {Proceedings of the 31st International Joint Conference on Artificial Intelligence and the 25th European Conference on Artificial Intelligence (IJCAI-ECAI 2022)},
  title                     = {Tight Bounds for Hybrid Planning},
  year                      = {2022},
  pages                     = {4597--4605},
  publisher                 = {IJCAI},
  abstract                  = {Several hierarchical planning systems feature a rich level of language features making them capable of expressing real-work problems. One such feature that's used by several current planning systems is causal links, which are used to track search progress. The formalism combining Hierarchical Task Network (HTN) planning with these links known from Partial Order Causal Link (POCL) planning is often referred to as hybrid planning. In this paper we study the computational complexity of such hybrid planning problems. More specifically, we provide missing membership results to existing hardness proofs and thereby provide tight complexity bounds for all known subclasses of hierarchical planning problems. We also re-visit and correct a result from the literature for plan verification showing that it remains NP-complete even in the absence of a task hierarchy.},
  doi                       = {10.24963/ijcai.2022/638},
  url_Paper                 = {https://bercher.net/publications/2022/Bercher2022TightHybridBounds.pdf},
  url_Poster                = {https://bercher.net/publications/2022/Bercher2022TightHybridBoundsPoster.pdf},
  url_Slides                = {https://bercher.net/publications/2022/Bercher2022TightHybridBoundsSlides.pdf},
  url_video_of_presentation = {https://www.ijcai.org/proceedings/2022/video/638},
  keywords                  = {conference}
}

{"_id":"2RPt5A5ucprEKydzi","bibbaseid":"bercher-lin-alford-tightboundsforhybridplanning-2022","author_short":["Bercher, P.","Lin, S.","Alford, R."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Pascal"],"propositions":[],"lastnames":["Bercher"],"suffixes":[]},{"firstnames":["Songtuan"],"propositions":[],"lastnames":["Lin"],"suffixes":[]},{"firstnames":["Ron"],"propositions":[],"lastnames":["Alford"],"suffixes":[]}],"booktitle":"Proceedings of the 31st International Joint Conference on Artificial Intelligence and the 25th European Conference on Artificial Intelligence (IJCAI-ECAI 2022)","title":"Tight Bounds for Hybrid Planning","year":"2022","pages":"4597–4605","publisher":"IJCAI","abstract":"Several hierarchical planning systems feature a rich level of language features making them capable of expressing real-work problems. One such feature that's used by several current planning systems is causal links, which are used to track search progress. The formalism combining Hierarchical Task Network (HTN) planning with these links known from Partial Order Causal Link (POCL) planning is often referred to as hybrid planning. In this paper we study the computational complexity of such hybrid planning problems. More specifically, we provide missing membership results to existing hardness proofs and thereby provide tight complexity bounds for all known subclasses of hierarchical planning problems. We also re-visit and correct a result from the literature for plan verification showing that it remains NP-complete even in the absence of a task hierarchy.","doi":"10.24963/ijcai.2022/638","url_paper":"https://bercher.net/publications/2022/Bercher2022TightHybridBounds.pdf","url_poster":"https://bercher.net/publications/2022/Bercher2022TightHybridBoundsPoster.pdf","url_slides":"https://bercher.net/publications/2022/Bercher2022TightHybridBoundsSlides.pdf","url_video_of_presentation":"https://www.ijcai.org/proceedings/2022/video/638","keywords":"conference","bibtex":"@InProceedings{Bercher2022TightHybridBounds,\n author = {Pascal Bercher and Songtuan Lin and Ron Alford},\n booktitle = {Proceedings of the 31st International Joint Conference on Artificial Intelligence and the 25th European Conference on Artificial Intelligence (IJCAI-ECAI 2022)},\n title = {Tight Bounds for Hybrid Planning},\n year = {2022},\n pages = {4597--4605},\n publisher = {IJCAI},\n abstract = {Several hierarchical planning systems feature a rich level of language features making them capable of expressing real-work problems. One such feature that's used by several current planning systems is causal links, which are used to track search progress. The formalism combining Hierarchical Task Network (HTN) planning with these links known from Partial Order Causal Link (POCL) planning is often referred to as hybrid planning. In this paper we study the computational complexity of such hybrid planning problems. More specifically, we provide missing membership results to existing hardness proofs and thereby provide tight complexity bounds for all known subclasses of hierarchical planning problems. We also re-visit and correct a result from the literature for plan verification showing that it remains NP-complete even in the absence of a task hierarchy.},\n doi = {10.24963/ijcai.2022/638},\n url_Paper = {https://bercher.net/publications/2022/Bercher2022TightHybridBounds.pdf},\n url_Poster = {https://bercher.net/publications/2022/Bercher2022TightHybridBoundsPoster.pdf},\n url_Slides = {https://bercher.net/publications/2022/Bercher2022TightHybridBoundsSlides.pdf},\n url_video_of_presentation = {https://www.ijcai.org/proceedings/2022/video/638},\n keywords = {conference}\n}\n\n","author_short":["Bercher, P.","Lin, S.","Alford, R."],"key":"Bercher2022TightHybridBounds","id":"Bercher2022TightHybridBounds","bibbaseid":"bercher-lin-alford-tightboundsforhybridplanning-2022","role":"author","urls":{" paper":"https://bercher.net/publications/2022/Bercher2022TightHybridBounds.pdf"," poster":"https://bercher.net/publications/2022/Bercher2022TightHybridBoundsPoster.pdf"," slides":"https://bercher.net/publications/2022/Bercher2022TightHybridBoundsSlides.pdf"," video of presentation":"https://www.ijcai.org/proceedings/2022/video/638"},"keyword":["conference"],"metadata":{"authorlinks":{}},"downloads":30},"bibtype":"inproceedings","biburl":"https://bercher.net/bibtex/bibliography.bib","dataSources":["zKgS72cAu6Ez7npdh","rta5EvLvgMEDFTyZk","bPpsmYWjffAy6QHP5","wYF8yPQT6a4TgShWe"],"keywords":["conference"],"search_terms":["tight","bounds","hybrid","planning","bercher","lin","alford"],"title":"Tight Bounds for Hybrid Planning","year":2022,"downloads":30}