Skip to content

Commit

Permalink
Merge branch 'master' of github.com:icaps2024/icaps2024.github.io
Browse files Browse the repository at this point in the history
  • Loading branch information
haz committed May 14, 2024
2 parents afdbacf + fc75350 commit 6714a91
Show file tree
Hide file tree
Showing 21 changed files with 180 additions and 46 deletions.
24 changes: 22 additions & 2 deletions content/program/workshops/hplan.md
Original file line number Diff line number Diff line change
Expand Up @@ -186,14 +186,34 @@ Our workshop is scheduled for Monday, June 3, 2024. It takes place in room KC 30
- 10:50 -- 12:00       poster session 2 (6 posters)
- 12:00 -- 13:30       *BREAK*
- 13:30 -- 14:30       Invited talk (including discussion)
- 14:30 -- 15:00       tba
- 14:30 -- 15:00       A discussion on an novel HTN formalism in the presence of empty decomposition methods, by Roman Bartak (~10 min talk + open discussion)

Poster session 1:

- An ILP Heuristic for Total-Order HTN Planning
- On Semantics of Hierarchical Planning Domain Models with Decomposition Constraints and Empty Methods
- Laying the Foundations for Solving FOND HTN problems: Grounding, Search, Heuristics (and Benchmark Problems)
- Properties under Progression
- Redundant Decompositions in PO HTN Domains: Goto Considered Harmful
- Towards Search Node-Specific Special-Case Heuristics for HTN Planning – An Empirical Analysis of Search Space

Poster Session 2:

- A Comparative Analysis of Plan Repair in HTN Planning
- Barely Decidable Fragments of HTN Planning
- Correcting Totally-Ordered Hierarchical Plans by Action Deletion and Action Insertion
- HTN Model repair by completing incomplete methods (not an HPlan paper)
- Toward Planning with Hierarchical Decompositions and Time-frames
- Weighted Randomized Anytime Planning in Pyhop



<!--
- &nbsp;&nbsp;8:30 -- &nbsp;&nbsp;8:40 &nbsp; &nbsp; &nbsp; Welcome
- &nbsp;&nbsp;8:40 -- &nbsp;&nbsp;9:40 &nbsp; &nbsp; &nbsp;
- &nbsp;&nbsp;9:40 -- 10:00 &nbsp; &nbsp; &nbsp; tba
- 10:00 -- 10:30 &nbsp; &nbsp; &nbsp; *BREAK*
- 10:30 -- 10:50 &nbsp; &nbsp; &nbsp; poster teaser talks for session 1 (6 talks)
- 10:30 -- 10:50 &nbsp; &nbsp; &nbsp; poster teaser talks for session 1 (6 talks)
- 10:50 -- 12:00 &nbsp; &nbsp; &nbsp; poster session 1 (6 posters)
- 13:30 -- 13:50 &nbsp; &nbsp; &nbsp; poster teaser talks for session 2 (5 talks)
- 13:50 -- 15:00 &nbsp; &nbsp; &nbsp; poster session 2 (5 posters)
Expand Down
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
Binary file not shown.
93 changes: 60 additions & 33 deletions content/program/workshops/hsdip.md
Original file line number Diff line number Diff line change
Expand Up @@ -8,7 +8,7 @@ draft: false

ICAPS'24 Workshop \
Banff, Canada \
June 2-3, 2024
June 2, 2024

## Aim and Scope of the Workshop

Expand All @@ -18,39 +18,66 @@ The HSDIP workshop has always been welcoming of multidisciplinary work, for exam

The workshop is meant to be an open and inclusive forum, and we encourage papers that report on work in progress or that do not fit the mold of a typical conference paper. Non-trivial negative results are welcome to the workshop, but we expect the authors to argue for the significance of the presented results.

## List of Accepted Papers
* **The Bench Transition System and Stochastic Exploration**
Dawson Tomasz, Richard A. Valenzano
* **Crafting a Pogo Stick in Minecraft with Heuristic Search**
Yarin Benyamin, Argaman Mordoch, Shahaf S. Shperberg, Roni Stern
* **A Lifted Backward Computation of hAdd**
Pascal Lauer, Alvaro Torralba, Daniel Höller, Jörg Hoffmann
* **Consolidating LAMA with Best-First Width Search**
Augusto B. Corrêa, Jendrik Seipp
* **Some Orders Are Important: Partially Preserving Orders in Top-Quality Planning**
Michael Katz, Junkyu Lee, Jungkoo Kang, Shirin Sohrabi
* **Separate Generation and Evaluation for Parallel Greedy Best-First Search**
Takumi Shimoda, Alex Fukunaga
* **Cost Partitioning For Multiple Sequence Alignment**
Mika Skjelnes, Daniel Gnad, Jendrik Seipp
* **Hitting Set Heuristics for Overlapping Landmarks in Satisficing Planning**
## Workshop Schedule

HSDIP is scheduled on the June 2.

---
[08:50 - 10:00] - **Opening & Invited Talk**
* **Opening Remarks**
* **Forest Agostinelli -- TBD**

---
[10:00 - 10:30] - Coffee Break

---
[10:30 - 12:00] - Session 1
* **Hitting Set Heuristics for Overlapping Landmarks in Satisficing Planning** ([PDF](../hsdip-papers/paper_14.pdf))
Clemens Büchner, Remo Christen, Salomé Eriksson, Thomas Keller
* **Metareasoning Needs Distributions: Put Up or Shut Up Games**
Sean Mariasin, Andrew I. Coles, Erez Karpas, Wheeler Ruml, Eyal S. Shimony, Shahaf S. Shperberg
* **Improving the Solvability of the Rubik’s Cube with Domain-Independent Planners Using Standard Planning Representations**
Bharath C. Muppasani, Vishal Pallagani, Biplav Srivastava, Forest Agostinelli
* **Reasonable Landmark Orderings for Lifted Classical Planning**
* **Consolidating LAMA with Best-First Width Search** ([PDF](../hsdip-papers/paper_3.pdf))
Augusto B. Corrêa, Jendrik Seipp
* **Reasonable Landmark Orderings for Lifted Classical Planning** ([PDF](../hsdip-papers/paper_7.pdf))
Marcel Schubert, Julia Wichlacz, Daniel Höller
* **PDBs Go Numeric: Pattern-Database Heuristics for Simple Numeric Planning**
* **A Lifted Backward Computation of hAdd** ([PDF](../hsdip-papers/paper_9.pdf))
Pascal Lauer, Alvaro Torralba, Daniel Höller, Jörg Hoffmann
* **Gotta Catch 'Em All! Sequence Flaws in CEGAR for Classical Planning** ([PDF](../hsdip-papers/paper_17.pdf))
Martín Pozo, Carlos Linares Lopez, Alvaro Torralba

---
[12:00 - 13:30] - Lunch

---
[13:30 - 15:00] - Session 2
* **PDBs Go Numeric: Pattern-Database Heuristics for Simple Numeric Planning** ([PDF](../hsdip-papers/paper_13.pdf))
Alexander Shleyfman, Daniel Gnad, Eyal Weiss, Lee-or Alon
* **Merge-and-Shrink Heuristics for Stochastic Shortest-Path Problems with Prune Transformations**
* **Merge-and-Shrink Heuristics for Stochastic Shortest-Path Problems with Prune Transformations** ([PDF](../hsdip-papers/paper_16.pdf))
Thorsten Klößner, Alvaro Torralba, Marcel Steinmetz, Silvan Sievers
* **Choosing a Classical Planner with Graph Neural Networks**
Jana Vatter, Ruben Mayer, Hans-Arno Jacobsen, Horst Samulowitz, Michael Katz
* **Expected Runtime Comparisons Between Breadth-First Search and Constant-Depth Restarting Random Walks**
* **Crafting a Pogo Stick in Minecraft with Heuristic Search** ([PDF](../hsdip-papers/paper_15.pdf))
Yarin Benyamin, Argaman Mordoch, Shahaf S. Shperberg, Roni Stern
* **Cost Partitioning For Multiple Sequence Alignment** ([PDF](../hsdip-papers/paper_2.pdf))
Mika Skjelnes, Daniel Gnad, Jendrik Seipp
* **Improving the Solvability of the Rubik’s Cube with Domain-Independent Planners Using Standard Planning Representations** ([PDF](../hsdip-papers/paper_10.pdf))
Bharath C. Muppasani, Vishal Pallagani, Biplav Srivastava, Forest Agostinelli
* **Some Orders Are Important: Partially Preserving Orders in Top-Quality Planning** ([PDF](../hsdip-papers/paper_4.pdf))
Michael Katz, Junkyu Lee, Jungkoo Kang, Shirin Sohrabi

---
[15:00 - 15:30] - Coffee Break

---
[15:30 - 17:00] - Session 3
* **The Bench Transition System and Stochastic Exploration** ([PDF](../hsdip-papers/paper_11.pdf))
Dawson Tomasz, Richard A. Valenzano
* **Separate Generation and Evaluation for Parallel Greedy Best-First Search** ([PDF](../hsdip-papers/paper_8.pdf))
Takumi Shimoda, Alex Fukunaga
* **Expected Runtime Comparisons Between Breadth-First Search and Constant-Depth Restarting Random Walks** ([PDF](../hsdip-papers/paper_12.pdf))
Daniel Platnick, Richard A. Valenzano
* **Gotta Catch 'Em All! Sequence Flaws in CEGAR for Classical Planning**
Martín Pozo, Carlos Linares Lopez, Alvaro Torralba
* **Choosing a Classical Planner with Graph Neural Networks** ([PDF](../hsdip-papers/paper_6.pdf))
Jana Vatter, Ruben Mayer, Hans-Arno Jacobsen, Horst Samulowitz, Michael Katz
* **Metareasoning Needs Distributions: Put Up or Shut Up Games** ([PDF](../hsdip-papers/paper_5.pdf))
Sean Mariasin, Andrew I. Coles, Erez Karpas, Wheeler Ruml, Eyal S. Shimony, Shahaf S. Shperberg



## Topics of Interest

Expand All @@ -68,16 +95,16 @@ Examples of typical topics for submissions to this workshop are:
## Important Dates

**Submission deadline:**
~~March 28~~ April 4, 2024 (UTC-12 timezone)
~~April 4, 2024~~ (UTC-12 timezone)

**Author feedback period:**
~~April 15-21~~ April 22-24, 2024
~~April 22-24, 2024~~

**Notification:**
April 26 2024
~~April 26 2024~~

**Workshop:**
June 2-3 2024
June 2 2024

## Submission Details

Expand Down
14 changes: 6 additions & 8 deletions content/program/workshops/planrob.md
Original file line number Diff line number Diff line change
Expand Up @@ -40,13 +40,11 @@ Topics of interest include (but are not limited to):

![Tiago Stegun Vaquero](https://icaps24.icaps-conference.org/program/workshops/planrob-invitedSpeaker-Tiago-Vaquero.jpg)

Tiago is a Technical Group Supervisor of the Artificial Intelligence Group, Planning and Execution Section, of the Jet Propulsion Laboratory, California Institute of Technology.
*Bio:* Tiago is a Technical Group Supervisor of the Artificial Intelligence Group, Planning and Execution Section, of the NASA Jet Propulsion Laboratory, California Institute of Technology. He holds a B.Sc., M.Sc., and Ph.D. in Mechatronics Engineering from the University of Sao Paulo, Brazil. Tiago previously held a MIT research scientist position and a joint Caltech/MIT research position where he worked on Resilient Spacecraft Systems and Risk Sensitive Planning/Scheduling algorithms. At MIT, Tiago also worked on Risk-aware Planners and Executives for Autonomous Underwater Vehicles and Autonomous Cars. Tiago also previously held a research position at the University of Toronto where he worked on Multi-Robot Planning and Coordination. His research interest includes knowledge engineering for autonomous vehicles, and automated planning and scheduling for single and multi-robot missions.

Tiago holds a bachelor's, master's, and Ph.D. in Mechatronics Engineering from the University of Sao Paulo, Brazil. Tiago previously held a MIT research scientist position and a joint Caltech/MIT research position where he worked on Resilient Spacecraft Systems and Risk Sensitive Planning/Scheduling algorithms with Professor Brian Williams. At MIT, Tiago also worked on Risk Sensitive Planners and Executives for Autonomous Underwater Vehicles and Autonomous Cars. Tiago also held a research position at the University of Toronto where he worked on Multi-Robot Planning and Coordination with Prof. Christopher Beck and Goldie Nejat.

Tiago works on multi-agent coordination methods for multi-rover cave exploration and for surface site characterization.

*Title & Abstract coming soon!*
*Title:* Autonomous Task and Motion Planning for Ice Worlds Exploration

*Abstract:* Icy moons of the gas giant planets, such as Europa, Titan, and Enceladus, are at the forefront of astrobiological interest due to the evidence of subsurface oceans. Enceladus is unique among the icy moons because there are known vent systems that are likely connected to a subsurface ocean, through which the ocean water is ejected to space. An existing study has shown that sending small robots into the vents and directly sampling the ocean water is likely possible. To enable such a mission, JPL is developing a novel, snake-like robot called Exobiology Extant Life Surveyor (EELS) that can navigate Enceladus' extreme surface and descend an erupting vent to capture unaltered liquid samples and potentially reach the ocean. However, navigating to and through Enceladus' environment is challenging: there is substantial uncertainty with respect to its geometry and physical properties of the surface/vents due to the limitations of existing orbital reconnaissance; and communication is limited which requires highly autonomous robots to execute the mission with limited human supervision. In this talk we provide an overview of the EELS project and its development effort to create a risk-aware autonomous robot to navigate these extreme ice terrains/environments. We describe the robotÕs architecture and the technical challenges to navigate and sense the icy environment safely and effectively. We focus on the challenges related to surface mobility, and task and motion planning under uncertainty. We provide initial results on mobility and risk-aware task and motion planning from field tests and simulated scenarios.


## List of Accepted Papers
Expand Down Expand Up @@ -78,12 +76,12 @@ Ronen Brafman, Or Wertheim and Dan Suissa. **Plug'n Play Task-Level Autonomy for

## Workshop Schedule

Our workshop is scheduled for Monday, June 3, 2024. It takes place in room KC 105.
Our workshop is scheduled for Monday, June 3, 2024. It takes place in room KC 105. We look forward to seeing you there!

The preliminary schedule is as follows:

- 08:30 - 08:40 Welcome
- 08:40 - 09:40 Invited talk
- 08:40 - 09:40 Invited talk: Autonomous Task and Motion Planning for Ice Worlds Exploration
- 09:40 - 10:00 Search Applications for Integrated Planning and Execution of Satellite Observations using Dynamic Targeting
- 10:00 - 10:30 *Coffee Break*
- 10:30 - 10:50 PWTO: A Heuristic Approach for Trajectory Optimization in Complex Terrains
Expand Down
Loading

0 comments on commit 6714a91

Please sign in to comment.