var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=bercher.net/bibtex/various.bib&theme=default&fullnames=1&jsonp=1&hidemenu=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=bercher.net/bibtex/various.bib&theme=default&fullnames=1&jsonp=1&hidemenu=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=bercher.net/bibtex/various.bib&theme=default&fullnames=1&jsonp=1&hidemenu=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2023\n \n \n (8)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n Experimental Results for the SoCS 2023 Paper ``A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements''.\n \n \n \n\n\n \n Conny Olz; and Pascal Bercher.\n\n\n \n\n\n\n 2023.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Misc{Olz2023ExperimentalData,\n  author       = {Conny Olz and Pascal Bercher},\n  title        = {Experimental Results for the SoCS 2023 Paper ``A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements''},\n  year         = {2023},\n  copyright    = {Creative Commons Attribution 4.0 International},\n  doi          = {10.5281/zenodo.7900414},\n  publisher    = {Zenodo}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Experimental Results for the PRICAI 2023 Paper ``Detecting AI Planning Modelling Mistakes – Potential Errors and Benchmark Domains''.\n \n \n \n\n\n \n Kayleigh Sleath; and Pascal Bercher.\n\n\n \n\n\n\n 2023.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Misc{Sleath2023ExperimentalData,\n  author       = {Kayleigh Sleath and Pascal Bercher},\n  title        = {Experimental Results for the PRICAI 2023 Paper ``Detecting AI Planning Modelling Mistakes -- Potential Errors and Benchmark Domains''},\n  year         = {2023},\n  copyright    = {Creative Commons Attribution 4.0 International},\n  doi          = {10.5281/zenodo.8249689},\n  publisher    = {Zenodo}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Experimental Results for the AAAI 2023 Paper ``Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains''.\n \n \n \n\n\n \n Songtuan Lin; Alban Grastien; and Pascal Bercher.\n\n\n \n\n\n\n 2023.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Misc{Lin2023RepairingClassicalModelsExperimentalResults,\n  author       = {Songtuan Lin and Alban Grastien and Pascal Bercher},\n  title        = {Experimental Results for the AAAI 2023 Paper ``Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains''},\n  year         = {2023},\n  copyright    = {Creative Commons Attribution 4.0 International},\n  doi          = {10.5281/zenodo.7690016},\n  publisher    = {Zenodo}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n Experimental Results for the AAAI 2023 Paper ``On Total-Order HTN Plan Verification with Method Preconditions – An Extension of the CYK Parsing Algorithm''.\n \n \n \n\n\n \n Songtuan Lin; Gregor Behnke; Simona Ondrčková; Roman Barták; and Pascal Bercher.\n\n\n \n\n\n\n 2023.\n \n\n\n\n
\n\n\n\n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Misc{Lin2023ExperimentalResultsTOVerification,\n  author       = {Songtuan Lin and Gregor Behnke and Simona Ondr\\v{c}kov{\\'{a}} and Roman Bart{\\'{a}}k and Pascal Bercher},\n  title        = {Experimental Results for the AAAI 2023 Paper ``On Total-Order HTN Plan Verification with Method Preconditions -- An Extension of the CYK Parsing Algorithm''},\n  year         = {2023},\n  copyright    = {Creative Commons Attribution 4.0 International},\n  doi          = {10.5281/zenodo.7704558},\n  publisher    = {Zenodo},\n}\n\n\n\n% PROCEEDINGS OF VARIOUS KINDS\n\n%% ICAPS DOCTORAL CONSORTIUM\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Proceedings of the 6th ICAPS Workshop on Hierarchical Planning (HPlan 2023).\n \n \n \n \n\n\n \n Pascal Bercher; Daniel Höller; Julia Wichlacz; and Ron Alford.,\n editors.\n \n\n\n \n\n\n\n 2023.\n \n\n\n\n
\n\n\n\n \n \n \"Proceedings website\n  \n \n \n \"Proceedings proceedings\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 26 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Proceedings{HPlan2023proceedings,\n  editor          = {Pascal Bercher and Daniel H\\"oller and Julia Wichlacz and Ron Alford},\n  title           = {Proceedings of the 6th ICAPS Workshop on Hierarchical Planning (HPlan 2023)},\n  year            = {2023},\n  url_website     = {http://hplan2023.hierarchical-task.net},\n  url_proceedings = {https://icaps23.icaps-conference.org/papers/hplan/HPlanProceedings-2023.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Grounded (Lifted) Linearizer at the IPC 2023: Solving Partial Order HTN Problems by Linearizing Them.\n \n \n \n \n\n\n \n Ying Xian Wu; Conny Olz; Songtuan Lin; and Pascal Bercher.\n\n\n \n\n\n\n In Proceedings of the 11th International Planning Competition: Planner Abstracts – Hierarchical Task Network (HTN) Planning Track, IPC 2023, 2023. \n \n\n\n\n
\n\n\n\n \n \n \"Grounded paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 5 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{Wu2023IPCLinearizer,\n  title     = {Grounded (Lifted) Linearizer at the IPC 2023: Solving Partial Order HTN Problems by Linearizing Them},\n  author    = {Ying Xian Wu and Conny Olz and Songtuan Lin and Pascal Bercher},\n  booktitle = {Proceedings of the 11th {I}nternational {P}lanning {C}ompetition: Planner Abstracts -- Hierarchical Task Network (HTN) Planning Track, {IPC} 2023},\n  year      = {2023},\n  abstrac   = {In this paper, we would like to present Grounded (Lifted) Linearizer, a hierarchical task network (HTN) planning system which won the Partial Order (PO) Agile and Satisficing tracks of the International Planning Competition 2023 on Hierarchical Task Network (HTN) Planning. This system consists of two parts. The first part is a preprocessor developed in house which transforms a POHTN problem into a total order (TO) one and which is the main contribution of this paper. The second part is an existing HTN planner. The outstanding performance of our assembled planning system thus serves as an evidence for how our preprocessor can enhance the efficiency of other existing planners.},\n  url_Paper = {https://bercher.net/publications/2023/Wu2023IPCLinearizer.pdf}\n} \n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The PANDADealer System for Totally Ordered HTN Planning in the 2023 IPC.\n \n \n \n \n\n\n \n Conny Olz; Daniel Höller; and Pascal Bercher.\n\n\n \n\n\n\n In Proceedings of the 11th International Planning Competition: Planner Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC), 2023. \n \n\n\n\n
\n\n\n\n \n \n \"The paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{Olz2023IPCPANDADealer,\n  title     = {The PANDADealer System for Totally Ordered HTN Planning in the 2023 IPC},\n  author    = {Conny Olz and Daniel H{\\"o}ller and Pascal Bercher},\n  booktitle = {Proceedings of the 11th {I}nternational {P}lanning {C}ompetition: Planner Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC)},\n  year      = {2023},\n  abstract  = {The PANDADealer system is an HTN planning system for solving totally ordered HTN planning problems. It builds on the heuristic progression search of the PANDApro system, and extends it with a look-ahead technique to detect dead-ends and inevitable refinement choices. The technique is based on inferred preconditions and effects of tasks, or more precisely, their decomposition methods.},\n  url_Paper = {https://bercher.net/publications/2023/Olz2023IPCPANDADealer.pdf}\n}\n\n
\n
\n\n\n
\n The PANDADealer system is an HTN planning system for solving totally ordered HTN planning problems. It builds on the heuristic progression search of the PANDApro system, and extends it with a look-ahead technique to detect dead-ends and inevitable refinement choices. The technique is based on inferred preconditions and effects of tasks, or more precisely, their decomposition methods.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Hierarchical Planning and Reasoning about Partially Ordered Plans – From Theory to Practice (extended abstract).\n \n \n \n \n\n\n \n Pascal Bercher.\n\n\n \n\n\n\n Interactive AI Magazine. 2023.\n \n\n\n\n
\n\n\n\n \n \n \"Hierarchical paper-aimag\n  \n \n \n \"Hierarchical paper\n  \n \n \n \"Hierarchical video of presentation\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Bercher2023SurveyOfOwnWorkAbstract,\n  author    = {Pascal Bercher},\n  title     = {Hierarchical Planning and Reasoning about Partially Ordered Plans -- From Theory to Practice (extended abstract)},\n  journal   = {Interactive AI Magazine},\n  year      = {2023},\n  abstract  = {This is an invited paper and part of the New Faculty Highlights Invited Speaker Program of AAAI'21. It surveys some of my work done until today in hierarchical task network (HTN) planning as well as partial order causal link (POCL) planning. Lines or research outlined include complexity investigations, heuristic search, as well as practical application for planning-based assistants.},\n  url_Paper-AIMag = {https://interactiveaimag.org/columns/articles/hierarchical-planning-and-reasoning-about-partially-ordered-plans-from-theory-to-practice-new-faculty-highlights-extended-abstract/},\n  url_Paper = {https://bercher.net/publications/2023/Bercher2023SurveyOfOwnWorkAbstract.pdf},\n  url_video_of_presentation = {https://slideslive.com/38952027/hierarchical-planning-and-reasoning-about-partially-ordered-plans-from-theory-to-practice}\n}\n\n
\n
\n\n\n
\n This is an invited paper and part of the New Faculty Highlights Invited Speaker Program of AAAI'21. It surveys some of my work done until today in hierarchical task network (HTN) planning as well as partial order causal link (POCL) planning. Lines or research outlined include complexity investigations, heuristic search, as well as practical application for planning-based assistants.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2022\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Proceedings of the 20th ICAPS Doctoral Consortium (ICAPS DC 2022).\n \n \n \n \n\n\n \n Pascal Bercher; and Sara Bernardini.,\n editors.\n \n\n\n \n\n\n\n 2022.\n \n\n\n\n
\n\n\n\n \n \n \"Proceedings website\n  \n \n \n \"Proceedings proceedings\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 12 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Proceedings{ICAPS-DC-2022,\n  title           = {Proceedings of the 20th ICAPS Doctoral Consortium (ICAPS DC 2022)},\n  year            = {2022},\n  editor          = {Pascal Bercher and Sara Bernardini},\n  abstract        = {This is the proceedings of the ICAPS Doctoral Consortium 2022.},\n  url_website     = {https://icaps22.icaps-conference.org/dc-2022},\n  url_proceedings = {https://icaps22.icaps-conference.org/dc/DC-Proceedings-2022.pdf}\n}\n\n%% IPC Booklet\n\n
\n
\n\n\n
\n This is the proceedings of the ICAPS Doctoral Consortium 2022.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Proceedings of the 5th ICAPS Workshop on Hierarchical Planning (HPlan 2022).\n \n \n \n \n\n\n \n Pascal Bercher; Jane Jean Kiam; Arthur Bit-Monnot; and Ron Alford.,\n editors.\n \n\n\n \n\n\n\n 2022.\n \n\n\n\n
\n\n\n\n \n \n \"Proceedings website\n  \n \n \n \"Proceedings proceedings\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 27 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Proceedings{HPlan2022proceedings,\n  editor          = {Pascal Bercher and Jane Jean Kiam and Arthur Bit-Monnot and Ron Alford},\n  title           = {Proceedings of the 5th ICAPS Workshop on Hierarchical Planning (HPlan 2022)},\n  year            = {2022},\n  url_website     = {http://hplan2022.hierarchical-task.net},\n  url_proceedings = {https://icaps22.icaps-conference.org/workshops/HPlan/papers/HPlanProceedings-2022.pdf}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (6)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Proceedings of 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020).\n \n \n \n \n\n\n \n Gregor Behnke; Daniel Höller; and Pascal Bercher.,\n editors.\n \n\n\n \n\n\n\n 2021.\n \n\n\n\n
\n\n\n\n \n \n \"Proceedings ipc-booklet\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{IPC2020Booklet,\n  title                    = {Proceedings of 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n  year                     = {2021},\n  editor                   = {Gregor Behnke and Daniel H{\\"o}ller and Pascal Bercher},\n  url_IPC-Booklet          = {https://bercher.net/publications/2021/Behnke2021IPC-Booklet.pdf},\n  abstract                 = {<p>Since its first edition in 1998, the International Planning Competition (IPC) has been an integral event of the planning community. For more than 20 years, it established unified input languages for planners, enabled an objective comparison between them based on an accessible benchmark set. The IPC drove the development of planners and fostered research. Thus, the IPC enabled planning researchers to compare their own work against the work of others -- not only within the competition, but also outside of it. Due to the IPC almost all contemporary planners understand (some form of) PDDL, which allows for using IPC benchmarks across a multitude of planners.</p>\n\n<p>The first two IPCs had -- in addition to the regular track -- a track on hand-tailored planners in which the planners could be provided with additional information or select their algorithms based on the input domain. Among these planners, some used Hierarchical Planning -- most notably SHOP. Following the second IPC in 2000 the hand-tailored track was discontinued. Hierarchical planning was thereafter not part of the IPC any more. Research in the field however continued.</p>\n\n<p>The International Planning Competition 2020 features for the first time a track dedicated to hierarchical planning. In contrast to the previous track on hand-tailored planners we don't want to evaluate how good planners can become given any possible additional knowledge, but ask how well planners can exploit a given hierarchical refinement structure. We therefore faced several unique challenges. We had to establish a common input language for all planners such that all of them operate on the very same model. We also had to specify a plan-output format and provide a verifier, since we had to ensure that the found plans satisfy the decompositional structure of the given task hierarchy. Further, we had to gather a comprehensive set of benchmark domains, since no such set existed before. We hope that this first competition for Hierarchical Task Network planners will foster future research into hierarchical planning and provide a common basis for many researchers -- by establishing a unified input language, a common benchmark set, and an evaluation of the state of the art in HTN planning. We hope that many future editions of this competition will follow.</p>\n\nGregor, Daniel, and Pascal<br/>\nOrganizers of the IPC 2020,<br/>\nMay 2021}\n}\n\n%% WIPC WORKSHOP\n\n
\n
\n\n\n
\n

Since its first edition in 1998, the International Planning Competition (IPC) has been an integral event of the planning community. For more than 20 years, it established unified input languages for planners, enabled an objective comparison between them based on an accessible benchmark set. The IPC drove the development of planners and fostered research. Thus, the IPC enabled planning researchers to compare their own work against the work of others – not only within the competition, but also outside of it. Due to the IPC almost all contemporary planners understand (some form of) PDDL, which allows for using IPC benchmarks across a multitude of planners.

The first two IPCs had – in addition to the regular track – a track on hand-tailored planners in which the planners could be provided with additional information or select their algorithms based on the input domain. Among these planners, some used Hierarchical Planning – most notably SHOP. Following the second IPC in 2000 the hand-tailored track was discontinued. Hierarchical planning was thereafter not part of the IPC any more. Research in the field however continued.

The International Planning Competition 2020 features for the first time a track dedicated to hierarchical planning. In contrast to the previous track on hand-tailored planners we don't want to evaluate how good planners can become given any possible additional knowledge, but ask how well planners can exploit a given hierarchical refinement structure. We therefore faced several unique challenges. We had to establish a common input language for all planners such that all of them operate on the very same model. We also had to specify a plan-output format and provide a verifier, since we had to ensure that the found plans satisfy the decompositional structure of the given task hierarchy. Further, we had to gather a comprehensive set of benchmark domains, since no such set existed before. We hope that this first competition for Hierarchical Task Network planners will foster future research into hierarchical planning and provide a common basis for many researchers – by establishing a unified input language, a common benchmark set, and an evaluation of the state of the art in HTN planning. We hope that many future editions of this competition will follow.

Gregor, Daniel, and Pascal
Organizers of the IPC 2020,
May 2021\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Proceedings of the Workshop on the International Planning Competition (WIPC 2021).\n \n \n \n \n\n\n \n Gregor Behnke; Daniel Höller; and Pascal Bercher.,\n editors.\n \n\n\n \n\n\n\n 2021.\n \n\n\n\n
\n\n\n\n \n \n \"Proceedings proceedings\n  \n \n \n \"Proceedings workshop\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{WIPC2021Proceedings,\n  Title           = {Proceedings of the Workshop on the International Planning Competition (WIPC 2021)},\n  editor          = {Gregor Behnke and Daniel H{\\"o}ller and Pascal Bercher},\n  Year            = {2021},\n  url_Proceedings = {https://bercher.net/publications/2021/WIPC2021Proceedings.pdf},\n  url_Workshop    = {https://icaps21.icaps-conference.org/workshops/WIPC/}\n}\n\n%% HPLAN WORKSHOP\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Proceedings of the 4thd ICAPS Workshop on Hierarchical Planning (HPlan 2021).\n \n \n \n \n\n\n \n Pascal Bercher; Jane Jean Kiam; Zhanhao Xiao; and Ron Alford.,\n editors.\n \n\n\n \n\n\n\n 2021.\n \n\n\n\n
\n\n\n\n \n \n \"Proceedings proceedings\n  \n \n \n \"Proceedings workshop\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{HPlan2021proceedings,\n  Title           = {Proceedings of the 4thd ICAPS Workshop on Hierarchical Planning (HPlan 2021)},\n  editor          = {Pascal Bercher and Jane Jean Kiam and Zhanhao Xiao and Ron Alford},\n  Year            = {2021},\n  url_Proceedings = {https://hierarchical-task.net/publications/hplan/HPlanProceedings-2021.pdf},\n  url_Workshop    = {http://hplan2021.hierarchical-task.net}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Hierarchical Woodworking Domain.\n \n \n \n \n\n\n \n Bernd Schattenberg; and Pascal Bercher.\n\n\n \n\n\n\n In Proceedings of 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 43–44, 2021. \n \n\n\n\n
\n\n\n\n \n \n \"The paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 6 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{Schattenberg2021Woodworking,\n  title                    = {The Hierarchical Woodworking Domain},\n  author                   = {Bernd Schattenberg and Pascal Bercher},\n  booktitle                = {Proceedings of 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n  year                     = {2021},\n  pages                    = {43--44},\n  abstract                 = {The Woodworking domain is one of the classical benchmark domains in the canon of the International Planning Competition. This paper describes our hierarchical take on it.},\n  url_Paper                = {https://bercher.net/publications/2021/Schattenberg2021Woodworking.pdf}\n}\n\n
\n
\n\n\n
\n The Woodworking domain is one of the classical benchmark domains in the canon of the International Planning Competition. This paper describes our hierarchical take on it.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n The Smartphone Domain.\n \n \n \n \n\n\n \n Pascal Bercher; Susanne Biundo; and Bernd Schattenberg.\n\n\n \n\n\n\n In Proceedings of 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 47–47, 2021. \n \n\n\n\n
\n\n\n\n \n \n \"The paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{Bercher2021Smartphone,\n  title                    = {The Smartphone Domain},\n  author                   = {Pascal Bercher and Susanne Biundo and Bernd Schattenberg},\n  booktitle                = {Proceedings of 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n  year                     = {2021},\n  pages                    = {47--47},\n  abstract                 = {This extended abstract is about the Smartphone domain, submitted as a benchmark domain to the IPC 2020.},\n  url_Paper                = {https://bercher.net/publications/2021/Bercher2021Smartphone.pdf}\n}\n\n
\n
\n\n\n
\n This extended abstract is about the Smartphone domain, submitted as a benchmark domain to the IPC 2020.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n From PCP to HTN Planning Through CFGs.\n \n \n \n \n\n\n \n Daniel Höller; Songtuan Lin; Kutluhan Erol; and Pascal Bercher.\n\n\n \n\n\n\n In Proceedings of 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 24–25, 2021. \n \n\n\n\n
\n\n\n\n \n \n \"From paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 8 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{Hoeller2021PCP,\n  title                    = {From PCP to HTN Planning Through CFGs},\n  author                   = {Daniel H\\"oller and Songtuan Lin and Kutluhan Erol and Pascal Bercher},\n  booktitle                = {Proceedings of 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n  year                     = {2021},\n  pages                    = {24--25},\n  abstract                 = {The International Planning Competition in 2020 was the first one for a long time to host tracks on HTN planning. The used benchmark set included a domain describing the undecidable Post Correspondence Problem (PCP). In this paper we describe the two-step process applied to generate HTN problems based on PCP instances. It translates the PCP into a grammar intersection problem of two context-free languages, which is then encoded into an HTN problem.},\n  url_Paper                = {https://bercher.net/publications/2021/Hoeller2021PCP.pdf}\n}\n\n
\n
\n\n\n
\n The International Planning Competition in 2020 was the first one for a long time to host tracks on HTN planning. The used benchmark set included a domain describing the undecidable Post Correspondence Problem (PCP). In this paper we describe the two-step process applied to generate HTN problems based on PCP instances. It translates the PCP into a grammar intersection problem of two context-free languages, which is then encoded into an HTN problem.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2020\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Proceedings of the 3rd ICAPS Workshop on Hierarchical Planning (HPlan 2020).\n \n \n \n \n\n\n \n Pascal Bercher; Daniel Höller; Roman Barták; and Ron Alford.,\n editors.\n \n\n\n \n\n\n\n 2020.\n \n\n\n\n
\n\n\n\n \n \n \"Proceedings proceedings\n  \n \n \n \"Proceedings workshop\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{HPlan2020proceedings,\n  Title           = {Proceedings of the 3rd ICAPS Workshop on Hierarchical Planning (HPlan 2020)},\n  editor          = {Pascal Bercher and Daniel H{\\"o}ller and Roman Bart{\\'a}k and Ron Alford},\n  Year            = {2020},\n  url_Proceedings = {https://hierarchical-task.net/publications/hplan/HPlanProceedings-2020.pdf},\n  url_Workshop    = {http://hplan2020.hierarchical-task.net}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Proceedings of the 2nd ICAPS Workshop on Hierarchical Planning (HPlan 2019).\n \n \n \n \n\n\n \n Pascal Bercher; Gregor Behnke; Vikas Shivashankar; and Ron Alford.,\n editors.\n \n\n\n \n\n\n\n 2019.\n \n\n\n\n
\n\n\n\n \n \n \"Proceedings proceedings\n  \n \n \n \"Proceedings workshop\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{HPlan2019proceedings,\n  Title           = {Proceedings of the 2nd ICAPS Workshop on Hierarchical Planning (HPlan 2019)},\n  editor          = {Pascal Bercher and Gregor Behnke and Vikas Shivashankar and Ron Alford},\n  Year            = {2019},\n  url_Proceedings = {https://hierarchical-task.net/publications/hplan/HPlanProceedings-2019.pdf},\n  url_Workshop    = {http://hplan2019.hierarchical-task.net}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (4)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Proceedings of the 1st ICAPS Workshop on Hierarchical Planning (HPlan 2018).\n \n \n \n \n\n\n \n Pascal Bercher; Daniel Höller; Susanne Biundo; and Ron Alford.,\n editors.\n \n\n\n \n\n\n\n 2018.\n \n\n\n\n
\n\n\n\n \n \n \"Proceedings proceedings\n  \n \n \n \"Proceedings workshop\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@proceedings{HPlan2018proceedings,\n  Title           = {Proceedings of the 1st ICAPS Workshop on Hierarchical Planning (HPlan 2018)},\n  editor          = {Pascal Bercher and Daniel H{\\"o}ller and Susanne Biundo and Ron Alford},\n  Year            = {2018},\n  url_Proceedings = {https://hierarchical-task.net/publications/hplan/HPlanProceedings-2018.pdf},\n  url_Workshop    = {http://hplan2018.hierarchical-task.net}\n}\n\n\n\n% NORMAL PAPERS (of various kind)\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n A Companion-System Architecture for Realizing Individualized and Situation-Adaptive User Assistance.\n \n \n \n \n\n\n \n Pascal Bercher; Felix Richter; Frank Honold; Florian Nielsen; Felix Schüssel; Thomas Geier; Thilo Hörnle; Stephan Reuter; Daniel Höller; Gregor Behnke; Klaus Dietmayer; Wolfgang Minker; Michael Weber; and Susanne Biundo.\n\n\n \n\n\n\n Technical Report Ulm University, 2018.\n \n\n\n\n
\n\n\n\n \n \n \"A paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@TechReport{Bercher2018AssemblyAssistant,\n  author                   = {Pascal Bercher and Felix Richter and Frank Honold and Florian Nielsen and Felix Schüssel and Thomas Geier and Thilo Hörnle and Stephan Reuter and Daniel H{\\"o}ller and Gregor Behnke and Klaus Dietmayer and Wolfgang Minker and Michael Weber and Susanne Biundo},\n  title                    = {A Companion-System Architecture for Realizing Individualized and Situation-Adaptive User Assistance},\n  institution              = {Ulm University},\n  year                     = {2018},\n  doi                      = {10.18725/OPARU-11023},\n  pages                    = {1--48},\n  abstract                 = {We show how techniques from various research areas -- most notably hierarchical planning, dialog management, and interaction management -- can be employed to realize individualized and situation-adaptive user assistance. We introduce a modular system architecture that is composed of domain-independent components implementing techniques from the respective areas. Systems based on this architecture -- so-called \\emph{Companion}-Systems -- can provide intelligent assistance in a broad variety of tasks. They provide a user- and situation-adapted sequence of instructions that show how achieve the respective task. Additional explanations are, like the instructions themselves, automatically derived based on a declarative model of the current task. These systems can react to unforeseen execution failures repairing their underlying plans if required. We introduce a prototype system that assists with setting up a home theater and use it as a running example as well as for an empirical evaluation with test subjects that shows the usefulness of our approach. We summarize the work of more than half a decade of research and development done by various research groups from different disciplines. Here, for the first time, we explain the full integration of all components thereby showing ``the complete picture'' of our approach to provide individualized and situation-adaptive user assistance.},\n  url_Paper                = {https://bercher.net/publications/2018/Bercher2018AssemblyAssistant.pdf}\n}\n\n
\n
\n\n\n
\n We show how techniques from various research areas – most notably hierarchical planning, dialog management, and interaction management – can be employed to realize individualized and situation-adaptive user assistance. We introduce a modular system architecture that is composed of domain-independent components implementing techniques from the respective areas. Systems based on this architecture – so-called \\emphCompanion-Systems – can provide intelligent assistance in a broad variety of tasks. They provide a user- and situation-adapted sequence of instructions that show how achieve the respective task. Additional explanations are, like the instructions themselves, automatically derived based on a declarative model of the current task. These systems can react to unforeseen execution failures repairing their underlying plans if required. We introduce a prototype system that assists with setting up a home theater and use it as a running example as well as for an empirical evaluation with test subjects that shows the usefulness of our approach. We summarize the work of more than half a decade of research and development done by various research groups from different disciplines. Here, for the first time, we explain the full integration of all components thereby showing ``the complete picture'' of our approach to provide individualized and situation-adaptive user assistance.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Hybrides Planen — Von der Theorie zur Praxis.\n \n \n \n \n\n\n \n Pascal Bercher.\n\n\n \n\n\n\n In Ausgezeichnete Informatikdissertationen 2017, pages 21–30, 2018. Gesellschaft für Informatik\n This dissertation abstract (in German) was written as part of being nominated for the GI (Gesellschaft für Informatik, eng.: Society for Computer Science) Best Dissertation Award 2017.\n\n\n\n
\n\n\n\n \n \n \"Hybrides paper\n  \n \n \n \"Hybrides slides\n  \n \n \n \"Hybrides proceedings\n  \n \n \n \"Hybrides papers-of-nominated-theses\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Bercher2018DissertationAbstract,\n  Title                    = {Hybrides Planen --- Von der Theorie zur Praxis},\n  Author                   = {Pascal Bercher},\n  Booktitle                = {Ausgezeichnete Informatikdissertationen 2017},\n  Year                     = {2018},\n  pages                    = {21--30},\n  Publisher                = {Gesellschaft für Informatik},\n  abstract                 = {Die Dissertation legt Grundlagen, die es erlauben, Planungstechnologie der Künstlichen Intelligenz als Basis für flexible Assistenzsysteme einzusetzen. Die Aufgabe der automatischen Handlungsplanung ist es hierbei, selbständig einen Plan zu entwickeln, der dem Nutzer Schritt für Schritt präsentiert wird und ihn oder sie bei der Bearbeitung einer entsprechenden Aufgabe anleitet. Durch die starke Miteinbeziehung eines menschlichen Nutzers ergeben sich viele neue Herausforde- rungen: Pläne müssen schnell gefunden werden; und sie sollen nicht nur korrekt sein, sondern auch kostengünstig und dem Nutzer plausibel erscheinen; und sie sollen erklärbar sein, um Transparenz zu schaffen. Aus diesem Grund wurde das hybride Planen gewählt, ein hierarchischer, nicht-linearer Planungsansatz. Es wurden neue Komplexitätsergebnisse für das Planexistenz- und das Planverifikationsproblem erzielt; die ersten zulässigen Heuristiken erforscht, welche das Finden optimaler Pläne garantieren; und es wurde ein prototypisches Assistenzsystem realisiert, das seinen Nutzer bei dem Aufbau einer komplexen Heimkinoanlage unterstützt.},\n  note                     = {This dissertation abstract (in German) was written as part of being nominated for the GI (Gesellschaft für Informatik, eng.: Society for Computer Science) Best Dissertation Award 2017.},\n  url_Paper                = {https://bercher.net/publications/2018/Bercher2018DissertationAbstract.pdf},\n  url_Slides               = {https://bercher.net/publications/2018/Bercher2018DissertationAbstractSlides.pdf},\n  url_Proceedings          = {https://dl.gi.de/bitstream/handle/20.500.12116/19479/lni-d-18-komplet.pdf},\n  url_Papers-of-Nominated-Theses = {https://dl.gi.de/handle/20.500.12116/19456}\n}\n\n
\n
\n\n\n
\n Die Dissertation legt Grundlagen, die es erlauben, Planungstechnologie der Künstlichen Intelligenz als Basis für flexible Assistenzsysteme einzusetzen. Die Aufgabe der automatischen Handlungsplanung ist es hierbei, selbständig einen Plan zu entwickeln, der dem Nutzer Schritt für Schritt präsentiert wird und ihn oder sie bei der Bearbeitung einer entsprechenden Aufgabe anleitet. Durch die starke Miteinbeziehung eines menschlichen Nutzers ergeben sich viele neue Herausforde- rungen: Pläne müssen schnell gefunden werden; und sie sollen nicht nur korrekt sein, sondern auch kostengünstig und dem Nutzer plausibel erscheinen; und sie sollen erklärbar sein, um Transparenz zu schaffen. Aus diesem Grund wurde das hybride Planen gewählt, ein hierarchischer, nicht-linearer Planungsansatz. Es wurden neue Komplexitätsergebnisse für das Planexistenz- und das Planverifikationsproblem erzielt; die ersten zulässigen Heuristiken erforscht, welche das Finden optimaler Pläne garantieren; und es wurde ein prototypisches Assistenzsystem realisiert, das seinen Nutzer bei dem Aufbau einer komplexen Heimkinoanlage unterstützt.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Hybrid Planning — From Theory to Practice.\n \n \n \n \n\n\n \n Pascal Bercher.\n\n\n \n\n\n\n Ph.D. Thesis, Ulm University, 2018.\n This work won the ICAPS Best Dissertation Award 2019.\n\n\n\n
\n\n\n\n \n \n \"Hybrid dissertation\n  \n \n \n \"Hybrid slides-from-icaps-award\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 11 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@PhdThesis{Bercher2017PhDThesis,\n  Title                    = {Hybrid Planning --- From Theory to Practice},\n  Author                   = {Pascal Bercher},\n  School                   = {Ulm University},\n  Year                     = {2018},\n  doi                      = {10.18725/OPARU-5242},\n  abstract                 = {This work lays fundamental groundwork for the development of so-called Companion Systems - cognitive technical systems that are capable to reason about themselves, their users and environment, and to plan a course of action to achieve their users' goals. They are intelligent devices that assist their users in operating them: instead of the user having to learn how to operate the respective system, the system is intelligent and flexible enough to provide its functionality in a truly user-friendly way. \n\nTo fully meet a user's demands, Companion Systems rely on a multi-facet of capabilities that stem from different disciplines, such as Artificial Intelligence (AI) planning, knowledge representation and reasoning, dialog management, and user interaction management, to name just a few. This thesis focuses on the relevant aspects of AI planning technology that are of importance for such systems. AI planning is the central technology for many Companion Systems as it allows to compute a course of action that, if followed by its user, achieves his or her goals and therefore serves as a basis of providing advanced user assistance. This thesis is concerned with hybrid planning - a hierarchical planning formalism that is especially suited for the basis of providing assistance to human users. Based on this formalism we will investigate the full endeavor of developing Companion Systems - from theory to practice. \n\nThe thesis presents a novel formalization for hierarchical planning problems, which has become a standard in the field. We present a categorization of different problem classes into which hybrid planning as well as other well-known problem classes fall. This formalization allowed to prove a series of novel complexity results that are of interest both for theoretical and practical considerations. For many of the identified classes we introduce novel heuristics that are used to speed up the solution generation process. Some of them are the very first for the respective problem class, and some are the first admissible ones, thereby allowing to find optimal solutions -- which is especially important when plans are generated for human users. We apply hybrid planning in a prototypical Companion System. It assists a user in the task of setting up a complex home entertainment system. Based on a declarative (planning) model of the available hardware and its functionality, the assistant computes a sequence of actions that the user simply needs to follow to complete the setup task. Several so-called user-centered planning capabilities are applied in this system, such as a technique for generating user-friendly linearizations of non-linear plans or the capability to answer questions about the necessity of actions - an essential property to ensure transparency of the system's behavior. In conclusion: Most modern technical devices are still lacking true intelligence - since no research such as AI planning is sufficiently applied, so there is still huge potential in making such devices really smart by implementing them as cognitive systems that effectively assist their human users. Applying the research presented in this thesis is one step towards achieving this goal.},\n  note                        = {This work won the ICAPS Best Dissertation Award 2019.},\n  url_Dissertation            = {https://bercher.net/publications/2017/Bercher2017Dissertation.pdf},\n  url_Slides-from-ICAPS-Award = {https://bercher.net/publications/2017/Bercher2019ICAPSDissertationTalk.pdf}\n}\n\n
\n
\n\n\n
\n This work lays fundamental groundwork for the development of so-called Companion Systems - cognitive technical systems that are capable to reason about themselves, their users and environment, and to plan a course of action to achieve their users' goals. They are intelligent devices that assist their users in operating them: instead of the user having to learn how to operate the respective system, the system is intelligent and flexible enough to provide its functionality in a truly user-friendly way. To fully meet a user's demands, Companion Systems rely on a multi-facet of capabilities that stem from different disciplines, such as Artificial Intelligence (AI) planning, knowledge representation and reasoning, dialog management, and user interaction management, to name just a few. This thesis focuses on the relevant aspects of AI planning technology that are of importance for such systems. AI planning is the central technology for many Companion Systems as it allows to compute a course of action that, if followed by its user, achieves his or her goals and therefore serves as a basis of providing advanced user assistance. This thesis is concerned with hybrid planning - a hierarchical planning formalism that is especially suited for the basis of providing assistance to human users. Based on this formalism we will investigate the full endeavor of developing Companion Systems - from theory to practice. The thesis presents a novel formalization for hierarchical planning problems, which has become a standard in the field. We present a categorization of different problem classes into which hybrid planning as well as other well-known problem classes fall. This formalization allowed to prove a series of novel complexity results that are of interest both for theoretical and practical considerations. For many of the identified classes we introduce novel heuristics that are used to speed up the solution generation process. Some of them are the very first for the respective problem class, and some are the first admissible ones, thereby allowing to find optimal solutions – which is especially important when plans are generated for human users. We apply hybrid planning in a prototypical Companion System. It assists a user in the task of setting up a complex home entertainment system. Based on a declarative (planning) model of the available hardware and its functionality, the assistant computes a sequence of actions that the user simply needs to follow to complete the setup task. Several so-called user-centered planning capabilities are applied in this system, such as a technique for generating user-friendly linearizations of non-linear plans or the capability to answer questions about the necessity of actions - an essential property to ensure transparency of the system's behavior. In conclusion: Most modern technical devices are still lacking true intelligence - since no research such as AI planning is sufficiently applied, so there is still huge potential in making such devices really smart by implementing them as cognitive systems that effectively assist their human users. Applying the research presented in this thesis is one step towards achieving this goal.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Interview with David E. Smith.\n \n \n \n \n\n\n \n Pascal Bercher; and Daniel Höller.\n\n\n \n\n\n\n Künstliche Intelligenz, 30(1): 101–105. 2016.\n Special Issue on Companion Technologies\n\n\n\n
\n\n\n\n \n \n \"Interview paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Bercher2016SmithInterview,\n  Title                    = {Interview with {David E. Smith}},\n  Author                   = {Pascal Bercher and Daniel H\\"oller},\n  Journal                  = {K{\\"u}nstliche Intelligenz},\n  Year                     = {2016},\n  Note                     = {Special Issue on Companion Technologies},\n  Number                   = {1},\n  Pages                    = {101--105},\n  Volume                   = {30},\n  Doi                      = {10.1007/s13218-015-0403-y},\n  abstract                 = {David E. Smith is a senior Researcher in the Intelligent Systems Division at NASA Ames Research Center. He received his Ph.D. in 1985 from Stanford University, and spent time as a Research Associate at Stanford, a Scientist at the Rockwell Palo Alto Science Center, and a Visiting Scholar at the University of Washington before joining NASA in 1997. Beginning in 1999, he served as the lead of the 18 member planning and scheduling group at NASA Ames for 6 years before abdicating to devote more time to research. Much of his research has focused on pushing the boundaries of AI planning technology to handle richer models of time, concurrency, exogenous events, uncertainty, and oversubscription. Smith served as an Associate Editor for the Journal of Artificial Intelligence Research (JAIR) from 2001–2004, and as Guest Editor for the JAIR Special Issue and Special Track on the 3rd and 4th International Planning Competitions. He served on the JAIR Advisory Board 2004–2007. Smith was recognized as a AAAI Fellow in 2005, and served on the AAAI Executive Council 2007–2010.},\n  url_Paper                = {https://bercher.net/publications/2016/Bercher2016SmithInterview.pdf}\n}\n\n
\n
\n\n\n
\n David E. Smith is a senior Researcher in the Intelligent Systems Division at NASA Ames Research Center. He received his Ph.D. in 1985 from Stanford University, and spent time as a Research Associate at Stanford, a Scientist at the Rockwell Palo Alto Science Center, and a Visiting Scholar at the University of Washington before joining NASA in 1997. Beginning in 1999, he served as the lead of the 18 member planning and scheduling group at NASA Ames for 6 years before abdicating to devote more time to research. Much of his research has focused on pushing the boundaries of AI planning technology to handle richer models of time, concurrency, exogenous events, uncertainty, and oversubscription. Smith served as an Associate Editor for the Journal of Artificial Intelligence Research (JAIR) from 2001–2004, and as Guest Editor for the JAIR Special Issue and Special Track on the 3rd and 4th International Planning Competitions. He served on the JAIR Advisory Board 2004–2007. Smith was recognized as a AAAI Fellow in 2005, and served on the AAAI Executive Council 2007–2010.\n
\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Special Issue on Companion Technologies.\n \n \n \n \n\n\n \n Susanne Biundo; Daniel Höller; and Pascal Bercher.\n\n\n \n\n\n\n Künstliche Intelligenz, 30(1): 5–9. 2016.\n This is the editorial of our Special Issue on Companion Technologies, in which we were the guest editors\n\n\n\n
\n\n\n\n \n \n \"Special paper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@Article{Biundo2016Editorial,\n  Title                    = {Special Issue on Companion Technologies},\n  Author                   = {Susanne Biundo and Daniel H\\"oller and Pascal Bercher},\n  Journal                  = {K{\\"u}nstliche Intelligenz},\n  Year                     = {2016},\n  Note                     = {This is the editorial of our Special Issue on Companion Technologies, in which we were the guest editors},\n  Number                   = {1},\n  Pages                    = {5--9},\n  Volume                   = {30},\n  Doi                      = {10.1007/s13218-015-0421-9},\n  abstract                 = {Dear reader, at present, we observe a rapid growth in the development of increasingly complex ``intelligent systems'' that serve users throughout all areas of their daily lives. They range from classical technical systems such as household appliances, cars, or consumer electronics through mobile apps and services to advanced service robots in various fields of application. While many of the rather conventional systems already provide multiple modalities to interact with, the most advanced are even equipped with cognitive abilities such as perception, cognition, and reasoning. However, the use of such complex technical systems and in particular the actual exploitation of their rich functionality remain challenging and quite often lead to users' cognitive overload and frustration. Companion Technologies bridge the gap between the extensive functionality of technical systems and human users' individual requirements and needs. They enable the construction of really smart -- adaptive, flexible, and cooperative -- technical systems by applying and fusing techniques from different areas of research. In our special issue we present interesting pieces of work -- quite a number of new technical contributions, ongoing and completed research projects, several dissertation abstracts, as well as an interview -- that are related to, or even fundamental for, Companion-Technology. In the community part of this issue, there is also a conference report on the first International Symposium on Companion-Technology},\n  url_Paper                = {https://bercher.net/publications/2016/Biundo2016Editorial.pdf}\n}\n\n
\n
\n\n\n
\n Dear reader, at present, we observe a rapid growth in the development of increasingly complex ``intelligent systems'' that serve users throughout all areas of their daily lives. They range from classical technical systems such as household appliances, cars, or consumer electronics through mobile apps and services to advanced service robots in various fields of application. While many of the rather conventional systems already provide multiple modalities to interact with, the most advanced are even equipped with cognitive abilities such as perception, cognition, and reasoning. However, the use of such complex technical systems and in particular the actual exploitation of their rich functionality remain challenging and quite often lead to users' cognitive overload and frustration. Companion Technologies bridge the gap between the extensive functionality of technical systems and human users' individual requirements and needs. They enable the construction of really smart – adaptive, flexible, and cooperative – technical systems by applying and fusing techniques from different areas of research. In our special issue we present interesting pieces of work – quite a number of new technical contributions, ongoing and completed research projects, several dissertation abstracts, as well as an interview – that are related to, or even fundamental for, Companion-Technology. In the community part of this issue, there is also a conference report on the first International Symposium on Companion-Technology\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2015\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Hybrid Planning – Theoretical Foundations and Practical Applications.\n \n \n \n \n\n\n \n Pascal Bercher.\n\n\n \n\n\n\n In Doctoral Consortium at ICAPS 2015 (ICAPS DC 2015), 2015. \n \n\n\n\n
\n\n\n\n \n \n \"Hybrid paper\n  \n \n \n \"Hybrid slides\n  \n \n \n \"Hybrid poster\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@InProceedings{Bercher2015DissertationAbstractDC,\n  Title                    = {Hybrid Planning -- Theoretical Foundations and Practical Applications},\n  Author                   = {Pascal Bercher},\n  Booktitle                = {Doctoral Consortium at ICAPS 2015 (ICAPS DC 2015)},\n  Year                     = {2015},\n  abstract                 = {The thesis presents a novel set-theoretic formalization of (propositional) hybrid planning -- a planning framework that fuses Hierarchical Task Network (HTN) planning with Partial-Order Causal-Link (POCL) planning. Several sub classes thereof are identified that capture well-known problems such as HTN planning and POCL planning. For these problem classes, the complexity of the plan-existence problem is investigated, i.e., the problem of deciding whether there exists a solution for a given planning problem. For solving the problems of the respective problem classes, a hybrid planning algorithm is presented. Its search is guided by informed heuristics. Several such heuristics are introduced, both for POCL planning problems (i.e., problems without task hierarchy) and for hybrid planning problems (i.e., heuristics that are ''hierarchy-aware'').},\n  url_Paper                = {https://bercher.net/publications/2015/Bercher2015DissertationAbstractDC.pdf},\n  url_Slides               = {https://bercher.net/publications/2015/Bercher2015DissertationAbstractDCSlides.pdf},\n  url_Poster               = {https://bercher.net/publications/2015/Bercher2015DissertationAbstractDCPoster.pdf}\n}\n\n
\n
\n\n\n
\n The thesis presents a novel set-theoretic formalization of (propositional) hybrid planning – a planning framework that fuses Hierarchical Task Network (HTN) planning with Partial-Order Causal-Link (POCL) planning. Several sub classes thereof are identified that capture well-known problems such as HTN planning and POCL planning. For these problem classes, the complexity of the plan-existence problem is investigated, i.e., the problem of deciding whether there exists a solution for a given planning problem. For solving the problems of the respective problem classes, a hybrid planning algorithm is presented. Its search is guided by informed heuristics. Several such heuristics are introduced, both for POCL planning problems (i.e., problems without task hierarchy) and for hybrid planning problems (i.e., heuristics that are ''hierarchy-aware'').\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2008\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A Planning Graph Heuristic for Forward-Chaining Adversarial Planning.\n \n \n \n \n\n\n \n Pascal Bercher; and Robert Mattmüller.\n\n\n \n\n\n\n Technical Report 238, University of Freiburg, Germany, 7 2008.\n \n\n\n\n
\n\n\n\n \n \n \"A paper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n  \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@techreport{Bercher2008FONDPGHeuristicTR,\n  author                      = {Pascal Bercher and Robert Mattm{\\"u}ller},\n  title                       = {A Planning Graph Heuristic for Forward-Chaining Adversarial Planning},\n  institution                 = {University of Freiburg, Germany},\n  year                        = {2008},\n  number                      = {238},\n  month                       = {7},\n  abstract                    = {In contrast to classical planning, in adversarial planning, the planning agent has to face an adversary trying to prevent him from reaching his goals. In this report, we investigate a forward-chaining approach to adversarial planning based on the AO* algorithm. The exploration of the underlying AND/OR graph is guided by a heuristic evaluation function, inspired by the relaxed planning graph heuristic used in the FF planner. Unlike FF, our heuristic uses an adversarial planning graph with distinct proposition and action layers for the protagonist and antagonist. First results suggest that in certain planning domains, our approach yields results competitive with the state of the art.},\n  url_Paper                  = {https://bercher.net/publications/2008/Bercher2008FONDPGHeuristicTR.pdf}\n}\n
\n
\n\n\n
\n In contrast to classical planning, in adversarial planning, the planning agent has to face an adversary trying to prevent him from reaching his goals. In this report, we investigate a forward-chaining approach to adversarial planning based on the AO* algorithm. The exploration of the underlying AND/OR graph is guided by a heuristic evaluation function, inspired by the relaxed planning graph heuristic used in the FF planner. Unlike FF, our heuristic uses an adversarial planning graph with distinct proposition and action layers for the protagonist and antagonist. First results suggest that in certain planning domains, our approach yields results competitive with the state of the art.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);