Tentative program
| Time | Event |
|---|---|
| Sunday, June 14 | |
| 9:00-17:00 | Day trip to Arctic Circle |
| 19:00-21:00 | Informal meetup |
| Monday, June 15 | |
| 8:45-9:00 | Opening welcome |
| 9:00-10:00 | Session I: Session title and speakers |
| 10:00-10:30 | Break |
| 10:30-11:30 | Keynote talk by Lenore Blum: AI Consciousness is Inevitable: A Theoretical Computer Science Perspective |
| 11:30-12:30 | Session II: Session title and speakers |
| 12:30-13:30 | Lunch |
| 13:30-15:00 | Session III: Session title and speakers |
| 15:00-15:30 | Break |
| 15:30-17:00 | Session IV: Session title and speakers |
| 17:30-19:30 | Reception dinner |
| Tuesday, June 16 | |
| 9:00-10:00 | Session V: Session title and speakers |
| 10:00-10:30 | Break |
| 10:30-11:30 | Keynote talk by Sven Koenig: Advances in Heuristic Search and Their Applications in Robotics |
| 11:30-12:30 | Session on open problems in robotics |
| 12:30-13:30 | Lunch |
| 13:30-15:00 | Session VI: Session title and speakers |
| 15:00-15:30 | Break |
| 15:30-17:00 | Session VII: Session title and speakers |
| Wednesday, June 17 | |
| 9:00-10:00 | Session VIII: Session title and speakers |
| 10:00-10:30 | Break |
| 10:30-11:30 | Keynote talk by Marc Toussaint: Towards Diverse Solvers |
| 11:30-12:30 | Session IX: Session title and speakers |
| 12:30-13:30 | Lunch |
| 13:30-15:00 | Session X: Session title and speakers |
| 15:00-15:30 | Break |
| 15:30-17:00 | Session XI: Session title and speakers |
Keynote speakers
Lenore Blum
Title: AI Consciousness is Inevitable: A Theoretical Computer Science Perspective
Abstract: We look at consciousness through the lens of Theoretical Computer Science, a branch of mathematics that studies computation under resource limitations, distinguishing functions that are efficiently computable from those that are not. From this perspective, we are developing a formal machine model for consciousness. We are inspired by Alan Turing’s simple yet powerful model of computation and Bernard Baars’ theater model of consciousness. Though extremely simple, the model (1) aligns at a high level with many of the major scientific theories of human and animal consciousness, (2) provides explanations at a high level for many phenomena associated with consciousness, (3) gives insight into how a machine can have subjective consciousness, and (4) is clearly buildable. This combination supports our claim that machine consciousness is not only plausible but inevitable. See: https://arxiv.org/pdf/2403.17101 This is joint work with Manuel Blum and Avrim Blum.
Bio: Lenore Blum (PhD, MIT; Distinguished Career Professor of Computer Science, Emerita, CMU) is a mathematician and theoretical computer scientist. She is a Fellow of the American Association for the Advancement of Science, the American Mathematical Society, the Association for Women in Mathematics, and the American Academy of Arts and Science. Lenore is the inaugural and current president of the international Association for Mathematical Consciousness Science (AMCS).
Sven Koenig
Title: Advances in Heuristic Search and Their Applications in Robotics
Abstract: AI researchers and others have made significant progress in heuristic search algorithms over the years, for example, in incremental search, any-angle search, hierarchical search, multi-objective search, and multi-agent pathfinding. In this talk, I will provide an overview of some of these approaches, both from my research group and others. Then, I will discuss whether machine learning has made heuristic search obsolete. Finally, I will explain how heuristic search approaches from train scheduling, turn-by-turn navigation for cars, video games, and other applications can be helpful to know about in mobile robotics.
Bio: Sven Koenig is a fellow of IEEE, ACM, AAAI, and AAAS whose research focuses on AI decision-making techniques that enable single robots and multi-robot systems to act intelligently in real-time.
Marc Toussaint
Title: Towards Diverse Solvers
Abstract: Optimization is a powerful tool across fields, including robot planning and control, but also underlying ML and RL. However, in certain cases we would like solvers to return a diversity of solutions rather than only a single optimal one – e.g. to overcome or enumerate local optima or to guarantee a kind of completeness when combined with higher-level search.
In this talk I will discuss approaches towards diverse solvers, including existing methods in optimization, MCMC, RL, and robotics, and novel ideas to combine them.
Bio: TBD