Dear all,
Many thanks to all of you who have participated in the IPC-6. We know that it’s a lot of work, especially with the new rules implemented in this IPC, and it takes a sustained effort from both the participants and the organizers to get it done successfully.
We are sorry that we couldn’t see all of you at ICAPS-2006, including some winners. For people who missed our presentation on Sunday and the poster session on Tuesday, below is the list of winners:
1. Sequential Satisficing Track:
a. Winner: LAMA by Silvia Richter and Matthias Westphal
b. Runner-up: FF(h_sa) by Emil Keyder and Hector Geffner
2. Sequential Optimization Track:
a. Winner: Gamer by Stefan Edelkamp and Peter Kissmann
b. Runner-up: HSP*_f by Patrik Haslum
3. Temporal Satisfycing Track:
a. Winner: SGPlan 6 by Chih-Wei Hsu and Benjamin Wah
b. Runner-up: Temporal Fast Downward by Gabriele Roger, Patrick Eyerich and Robert Mattmuller
4. Net-Benefit Optimization Track:
a. Winner: Gamer by Stefan Edelkamp and Peter Kissmann
b. Runner-up: Mips-XXL by Stefan Edelkamp and Shahid Jabbar
5. Jury Award Winner:
a. C3 by Miguel Ramirez, Nir Lipovetzky, and Hector Geffner
We want to again congratulate the winners. We will mail the award certificates to the teams that could not receive them at the conference (I attach the pdf file contains all the awards for reference). There are monetary prizes, thanks to our various sponsors – which you can check from our website. We are in the process of receiving all of the money and if there is no unexpected event, the award for the best planner in each track will be $500 and the runner-up team (and the jury award winner) will receive $250 each. Due to different circumstances for teams in US and other continents, we will discuss with each winning team separately to decide what would be the best way to get the prize money to them.
Malte’s presentation slides at ICAPS and the electronic copy of the posters, along with other materials to help you understand the IPC-6 procedure and scoring mechanism, individual performance of different planners in each domain (and comparison to baseline planners and specialized solvers), detail description of different domains and how test problems were generated etc., will be gradually available on our website. We will announce them when they are uploaded.
Thanks again for your great effort,
Minh