| [papyrus-ic] 'Escape the maze' Rover Challenge Contest at MODELS'18 |
|
Hello everyone ! Some of you demonstrated interest in running a 'tutorial-format' day at MODELS'18 (in Copenhagen, Denmark 14-19 October 2018), in order to disseminate Papyrus-RT in industry/academics. We have met at MODELS'17 just a few days ago, in Austin, and we've mentioned the possibility to propose the participants of this 'tutorial' a hands-on challenge. Together with Queens' University, we started to formalize a 'maze' challenge, described in the following. Please let me, Nicolas Hili (hili@xxxxxxxxxxxxx), and Juergen Dingel (dingel@xxxxxxxxxxxxx) know if you would be interested in : (a) participate on the organization of the 'tutorial' day (b) attend the 'tutorial' day (c) none of the above, but something related, please specify. 'Escape the maze' Rover Challenge Contest (name to be probably changed) The contest would involve individuals and teams to compete in an maze solving scenario where one or multiple Rovers enter in a maze by the same entrance and must leave it by an exit. The maze will only contain one entrance and one exit. The Rover is the Pololu Rover to use and we will use Papyrus for Real-Time (Papyrus-RT) in order to model the behaviour of the system, to generate code and to execute the code of the Rover. The goal is then to create the model that will allow the Rover to find the fastest way for exiting the maze. Finding the exit will be timed. A prize can be envisioned for the winner who manages to leave the maze the fastest. Participants can register as individuals or work in a team. For an individual, the goal is to make one Rover exit the maze. For a team (composed of 2 or 3 participants), the goal is to make several Rovers exit the maze. The time is started when the first Rover enters the maze, and stops when all rovers exit the maze. Rovers should be collaborative: for example, when there is a fork in the maze, rovers should follow different paths. Therefore, Rover should communicate so each of them know the position of the other. Once the first Rover finds the exit, it should tell others that it found it and where it is. This information should help other Rovers to find it as well, and possibly to optimize the path to reach it faster. Different maze solving algorithms can be used. The contest will be scheduled during an entire day: Proposition of schedule: - from 9am to 11am: introduction to the contest, introduction to Papyrus-RT, cross-compilation, etc. - from 11am to 4pm: Papyrus-RT development and test on the physical rovers on a maze that is created - from 4pm to 5pm: live competition where all teams execute their model on the Rover and try to get out of the maze. Remind : Please let us know if you would be interested on that. Our best regards, -- Raquel Araujo de Oliveira Assistant Professor Université Toulouse III - Paul Sabatier | France MACAO research team (Models, Architectures, Components, Agility and prOcesses) | IRIT (Institut de Recherche en Informatique de Toulouse) | France http://roliveira.info |