diff --git a/content/program/workshops/hplan.md b/content/program/workshops/hplan.md index fce863a..9d6e938 100644 --- a/content/program/workshops/hplan.md +++ b/content/program/workshops/hplan.md @@ -6,21 +6,21 @@ draft: false # Workshop on Hierarchical Planning (HPlan) -6th ICAPS Workshop on Hierarchical Planning (HPlan 2023) \ -Prague, Czech Republic \ -July 9-10, 2023 +7th ICAPS Workshop on Hierarchical Planning (HPlan 2024) \ +Banff, Alberta, Canada \ +June 2/3 (tba), 2024 ## Aim and Scope of the Workshop -The motivation for using hierarchical planning formalisms is manifold. It ranges from an explicit and predefined guidance of the plan generation process and the ability to represent complex problem solving and behavior patterns to the option of having different abstraction layers when communicating with a human user or when planning co-operatively. The best-known formalism in the field is Hierarchical Task Network (HTN) planning. In addition, there are several other hierarchical planning formalisms, e.g., hybrid planning (incorporating aspects from POCL planning), Hierarchical Goal Network (HGN) planning (incorporating a hierarchy on goals), or formalisms that combine task hierarchies with timeline planning (e.g. ANML). Hierarchies induce fundamental differences from classical planning, creating distinct computational properties and requiring separate algorithms from non-hierarchical planners. Many of these aspects of hierarchical planning are still unexplored. Thus, we encourage any contribution, independent of the underlying hierarchical planning formalism, and want to provide a forum for researchers to discuss the various aspects of hierarchical planning. +The motivation for using hierarchical planning formalisms is manifold. It features explicit and predefined guidance of the plan generation process and allows to represent complex problem solving and behavior patterns. A further benefit is that hierarchical planning offers different abstraction levels when communicating with a human user or when planning cooperatively. The best-known formalism in the field is Hierarchical Task Network (HTN) planning. In addition, there are several other hierarchical planning formalisms, e.g., hybrid planning (incorporating aspects from POCL planning), Hierarchical Goal Network (HGN) planning (incorporating a hierarchy on goals), or formalisms that combine task hierarchies with timeline planning (e.g., ANML). Hierarchies induce fundamental differences from classical planning, creating distinct computational properties and requiring separate algorithms from non-hierarchical planners. Many of these aspects of hierarchical planning are still unexplored. Thus, we encourage any contribution, independent of the underlying hierarchical planning formalism, and want to provide a forum for researchers to discuss the various aspects of hierarchical planning. ## Topics of Interest -Topics of interests include but are not limited to: +Topics of interests include but are not limited to: - theoretical foundations, e.g., complexity results - heuristics, search, and other solving techniques for plan generation @@ -31,52 +31,57 @@ Topics of interests include but are not limited to: - hierarchical plan repair techniques - techniques for verifying solutions of hierarchical planning problems - techniques for automated learning and synthesis of hierarchical models - ## Important Dates -- Submission Deadline: ~~March 24, 2023~~ **March 31, 2023** (AoE), also see note below! -- Author Notification: April 28, 2023 -- Camera-Ready Deadline: June 3, 2023 -- ICAPS 2023 Workshops: July 9-10, 2023 +- Submission Deadline: Monday, 25 March 2024 (AoE) +- Author Notification: Friday, 26 April 2024 +- Camera-Ready Deadline: Friday 24 May 2024 (AoE) +- ICAPS 2024 Workshops: June 2-3, 2024 -Note that at the date of the submission deadline, all papers need to be registered, which includes all relevant information such as title, abstract, authors, and kind of paper (long, short, etc.). **You will still be able to upload/update your paper until April 3 (AoE).** +We understand that for some, our notification date might come too late in order to plan travel accordingly, in particular if visa needs to be obtained. So in case you want to make your travel plans dependent on paper acceptance and thus require an earlier notification, please reach out to us to see whether submission and notification dates can be moved forward for your individual paper. + + ## Submission Details -The formatting guidelines (author kit, etc.) are the same as for ICAPS 2023. Like at the main conference, there will be a high quality double-blind review process against the standard ICAPS criteria of significance, soundness, scholarship, clarity, and reproducibility. However, submissions may be less evolved than at the main conference. +The formatting guidelines ([author kit](https://icaps24.icaps-conference.org/files/icaps-author-kit.zip), etc.) are the same as for ICAPS 2024. There will be a high quality double-blind review process against the standard criteria of significance, soundness, scholarship, clarity, and reproducibility. However, submissions may be less evolved than at the main conference. We have two categories: We have two categories: 1. Technical research papers (short or long) and 2. Challenge papers (short). -Technical research papers are standard conference papers, but may be less evolved. The purpose of challenge papers is to report on or to make aware of interesting/important problems in Hierarchical Planning and to encourage discussion at the workshop -- not to present some significant contribution. +Technical research papers correspond to standard conference papers, but may be less evolved or groundbreaking. The purpose of challenge papers is to make aware of interesting/important problems in Hierarchical Planning and to encourage discussion at the workshop -- not to present some significant contribution. Authors may submit *long papers* (up to 8 pages plus up to one page of references) or *short papers* (up to 4 pages plus up to one page of references). The purpose of short papers is to encourage publications of more preliminary results; challenge papers need to be short papers. In case of acceptance, the full 9, resp. 5, pages can be used for the paper. -Submissions will be done via [easychair](https://easychair.org/conferences/?conf=hplan2023). + +Submissions will be done via **easychair**, link will be provided in time. As written above, we are happy to check whether we can arrange an earlier submission, review, and notification date to accommodate your travel plans if required (e.g., for Visa). In this case we have to see how submissions will be done. Either way, contact the organizers at your earliest convenience in case you require this. + ### Workshop Proceedings -Please be aware that we put all accepted papers into a single proceedings that we will make publicly available (check out previous years' editions if interested: [hplan.hierarchical-task.net](https://hplan.hierarchical-task.net)). +On top of making all papers available for download individually, we also collect them in a single proceedings that we will also make publicly available (check out previous years' editions if interested: [hplan.hierarchical-task.net](https://hplan.hierarchical-task.net)). -Our proceedings are non-archival meaning that you will keep all copyrights. +Our proceedings are non-archival meaning that authors keep all copyrights. -### Policy on Previously Published Materials +### Policy on Previously Published Material -Despite our proceedings being non-archival we will strictly not include any paper where at the time of putting the proceedings online, portions of that paper are under the copyright of some other publisher. The reason is that normally the rights granted to the authors are rather restricted; they might be allowed to upload the specific entire paper on their own institution's webpage, but this does not include allowing others (like us workshop organizers) to distribute that material or parts of it. This means that all submitted work must be entirely original -- just as at any conference. If in doubt, contact the organizers. +Despite our proceedings being non-archival we will strictly not include any paper where at the time of putting the proceedings online, portions of that paper are under the copyright of some publisher. The reason is that normally the rights granted to the authors are rather restricted; they might be allowed to upload the specific entire paper on their own institution's webpage, but this does not include allowing others (like us workshop organizers) to distribute that material or parts of it. This means that all submitted work must be entirely original -- just as at any conference. If in doubt, contact the organizers. -We do allow and also explicitly encourage the submission of papers that at the time of submission are under review at another conference. Note that other conferences usually allow material that is under review at a workshop in parallel, but do not allow papers currently being under review at another archival conference or journal (HPlan is non-archival). If however the paper is also accepted at the respective conference, it will not be included in our proceedings to prevent any possible copyright infringements. We will still mention the paper as being accepted at the workshop and expect the paper be part of the program (and thus presented like all other papers), but no final paper can be submitted for our workshop/proceedings. Instead, the proceedings will include links to the respective conference paper version. Please check out websites and proceedings of the previous years ([hplan.hierarchical-task.net](https://hplan.hierarchical-task.net)) to see examples of how this looks. +We do allow and also explicitly encourage the submission of papers that at the time of submission are under review at another conference. Note that other conferences usually allow material that is under review at a workshop in parallel, but do not allow papers currently being under review at another archival conference or journal (HPlan is non-archival). If however the paper is also accepted at the respective conference, it will not be included in our proceedings to prevent any possible copyright infringements. Note that even for ECAI (which does not take copyrights as papers are put under a creative commons license) we will not include the paper in our proceedings. We will still mention the paper as being accepted at the workshop and expect the paper be part of the program (and thus presented like all other papers), but no final paper can be submitted for our workshop/proceedings. Instead, the proceedings will include links to the respective conference paper version. Please check out websites and proceedings of the previous years ([hplan.hierarchical-task.net](https://hplan.hierarchical-task.net)) to see examples of how this is done. @@ -91,66 +96,37 @@ TBA ### Organizing Committee - Pascal Bercher, pascal.bercher at anu.edu.au, [webpage](https://comp.anu.edu.au/people/pascal-bercher/) - - Daniel Höller, hoeller at cs.uni-saarland.de, [webpage](http://fai.cs.uni-saarland.de/hoeller/) - - Julia Wichlacz, wichlacz at cs.uni-saarland.de, [webpage](http://fai.cs.uni-saarland.de/wichlacz/) + - Dominik Schreiber, dominik.schreiber at kit.edu, [webpage](https://www.dominikschreiber.de/) + - Simona Ondrckova, ondrckova at ktiml.mff.cuni.cz - Ron Alford, ronwalf at volus.net, [webpage](https://www.volus.net/) ### Program Committee -- Ron Alford, The MITRE Corporation -- Pascal Bercher, the Australian National University -- Susanne Biundo, Ulm University -- Pascal Lauer, Saarland University -- Rouxi Li, University of Maryland, College Park -- Jane Jean Kiam, Universität der Bundeswehr München -- Songtuan Lin, the Australian National University -- Ugur Kuter, Smart Information Flow Technologies (SIFT) -- Damien Pellier, Laboratoire d'Informatique de Grenoble -- Julia Wichlacz, Saarland University -- Gregor Behnke, University of Amsterdam -- Xing Tan, Lakehead University -- Daniel Höller, Saarland University -- Sunandita Patra, IIT Kharagpur -- Robert Goldman, Smart Information Flow Technologies (SIFT) -- Kutluhan Erol, Izmir University of Economics -- Felipe Meneguzzi, University of Aberdeen -- Simona Ondrčková, Charles University -- Conny Olz, Ulm University - -If you'd like to be part of our team in any of the future years, please reach out to the organizers! - +TBA +If you'd like to be part of our team this year or in any of the future years, please reach out to the organizers! -## List of Accepted Papers -#### Accepted at HPlan and included in proceedings -The following publications will be included in the proceedings once it's ready. - -
- -#### Accepted at HPlan and another venue -The following publications will be excluded from the proceedings to preven copyright issues. We will provide a link instead. - +## List of Accepted Papers +tba
## Workshop Schedule -If you are interested in presenting work on hierarchical planning that was accepted or published at some other conference or journal (to promote your work to the hierarchical planning community), please contact the organizers. We will not include such a paper into our proceedings, but we are happy to discuss options for presenting such work. - -The actual schedule is TBA. +tba +If you are interested in presenting work on hierarchical planning that was accepted or published at some other conference or journal (to promote your work to the hierarchical planning community), please contact the organizers. We will not include such a paper into our proceedings, but we are happy to discuss options for presenting such work. -## Further Information -- On the HPlan website [hplan.hierarchical-task.net](https://hplan.hierarchical-task.net) you find (among other things) a list of bibtex entries for all accepted papers in all HPlan editions. Individual workshop pages of past editions are available by adding the respective year, e.g., you may use [hplan2022.hierarchical-task.net](https://hplan2022.hierarchical-task.net) for last year's edition. -- Note that this year the second IPC on Hierarchical Planning will take place! See [ipc2023.hierarchical-task.net](https://ipc2023.hierarchical-task.net). The link to the first IPC as well as any future ones can be found on [ipc.hierarchical-task.net](https://ipc.hierarchical-task.net). -- We have a mailing list (via google groups) for hierarchical planning with currently approx. 70 subscribers. The list is almost zero traffic, moderated, and only allows mails related to hierarchical planning! Interested? Drop Pascal an email. +## Further Information +- On the HPlan website [hplan.hierarchical-task.net](https://hplan.hierarchical-task.net) you find, among others, a list of bibtex entries for all accepted papers in all HPlan editions. Individual workshop pages of past editions are available by adding the respective year, e.g., you may use [hplan2023.hierarchical-task.net](https://hplan2023.hierarchical-task.net) for last year's edition (or 2024 for this very page). +- We have a mailing list (via google groups) for hierarchical planning with currently approx. 70 subscribers. The list is almost zero traffic, moderated, and only allows mails related to hierarchical planning! Interested? Drop Pascal an email. \ No newline at end of file diff --git a/content/summerschool.md b/content/summerschool.md index e1f1003..bbfd85e 100644 --- a/content/summerschool.md +++ b/content/summerschool.md @@ -34,7 +34,7 @@ The following is a preliminary list of speakers (ordered alphabetically) and top gives a talk on *Hierarchical Task Network Planning: Algorithms & Theoretical Foundations* - [Jeremy Frank](https://www.linkedin.com/in/jeremy-frank-62141bb3), NASA, gives a talk on *The Distributed Spacecraft Autonomy (DSA) Project* -- [Sarah Keren](https://sarahkeren.wixsite.com/sarahkeren-academics), Technion, +- [Sarah Keren](https://sarahk.cs.technion.ac.il), Technion, gives a talk on *Introduction to integrated task and motion planning* - [Jane Jean Kiam](https://www.unibw.de/home-en/appointment-of-professors/prof-jane-jean-kiam), Universität der Bundeswehr München, gives a talk on *Applications of Planning* @@ -43,10 +43,12 @@ The following is a preliminary list of speakers (ordered alphabetically) and top - [Wheeler Ruml](https://www.cs.unh.edu/~ruml/), University of New Hampshire, gives a talk on *Suboptimal search and motion planning* - [Nathan Sturtevant](https://apps.ualberta.ca/directory/person/nathanst), University of Alberta, - gives a talk on *Classical Planning and A** + gives a talk on *The Foundation of Best-First Search* - [Brian C. Williams](https://groups.csail.mit.edu/mers/), MIT, gives a talk on *Risk-aware planning and scheduling* +Abstracts of the talks will be provided soon (likely before February 12). +