First International Workshop on Search and Planning with Complex Objectives (WoSePCO)
Deterministic search and planning algorithms typically operate on graphs where each edge has a cost. They compute paths that minimize a simple sum of the costs the edges they contain. Yet, in real life, planning objectives are often more complex. For example, decision makers must optimize over non-linear utility functions, or they must trade off between different cost measures. These complex objectives prevent the usage of standard reasoning techniques and necessitate more sophisticated approaches for exploiting the domain structure of problems and for scaling search and planning algorithms to instances of realistic sizes. The proposed workshop will bring together researchers interested in these topics to exchange research ideas and recent results, especially on using AI techniques to make multi-objective search and planning more efficient, effective, and robust.
A workshop co-located with IJCAI'2023 Conference (https://ijcai-23.org/) in Macao, China.
All works that relate to complex search and planning objectives are welcome, including but not limited to:
This one-day workshop features invited talks, paper presentations, a poster session, and community discussion.
Monday (August 21, 2023) | ||
---|---|---|
09:00-09:10 |
Welcome | |
09:10-10:10 |
Invited Talk: From Robot Inspection Planning to Efficient Heuristic-Search: A Multi-Objective Journey |
Oren Salzman webpage |
10:10-10:30 |
Multi-Objective Demo |
Nathan Sturtevant webpage |
10:30-11:00 |
Coffee Break | |
11:00-12:30 |
Technical Session #1 (15-min Presentation + 3-min Q&A per talk) | |
Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies |
Han Zhang | |
Planning with Non-Linear Objective Functions in Partially Observable Domains |
Paul Weng | |
Must-Expand Nodes in Multi-Objective Search |
Shawn Skyler | |
Observer-Aware Planning with Implicit and Explicit Communication |
Shuwa Miura | |
VBMO: Voting-Based Multi-Objective Path Planning |
Raj Korpan | |
12:30-14:00 |
Lunch Break | |
14:00-15:30 |
Technical Session #2 (15-min Presentation + 3-min Q&A per talk) | |
Individually Rational Collaborative Vehicle Routing through Give-And-Take Exchanges |
Hoong Chuin Lau | |
Heuristic search for multi-objective probabilistic planning |
Dillon Chen | |
Optimal Path Planning on a Semi-Dynamic Subdivision Graph |
Zhaoqi Zhang | |
Using Reinforcement Learning for the Three-Dimensional Loading Capacitated Vehicle Routing Problem |
Stefan Schoepf | |
Multi-objective Search via Lazy and Efficient Dominance Checks |
Carlos Hernández | |
15:30-16:00 |
Coffee Break | |
16:00-17:00 |
Discussion and Closing |
The workshop expects up to 100 participants, including program committees, accepted authors, invited speakers, and researchers who are active in the heuristic search, planning, and operations research communities. Other interested researchers and practitioners are also welcome to attend.
Submissions can contain recent and relevant work in all possible stages, including work that was recently published, is under submission, or is still ongoing. Authors of recently published or under-submission works are encouraged to submit their original papers or short versions (including abstracts), as long as these resubmissions are clearly labeled to avoid copyright violations. All submissions will go through a light review process to ensure they fit with the scope of the workshop and to verify that they meet an acceptable quality threshold. Non-archival workshop notes will be produced containing the material presented at the workshop.
All deadlines are “anywhere on earth” (UTC-12)