------------------------------------------------------------------------ REGISTRATION FORM OF THE DETERMINISTIC PART OF IPC-5 ------------------------------------------------------------------------ In order to participate in the deterministic part of the competition, each team should send an email to the chair of the organizing committee (gerevini@ing.unibs.it), including the information specified below. As a default rule, we do not allow a team to enter more than two planners, or versions of the same planner. However, depending on the overall number of the registered teams and planners, if a convincing argument can be made that there are significant differences between the planners, more than two planners can be accepted. Please note that after the registration you will receive an account on the competition machine. All participants should upload their planner and compile it on the competition machine. If any technical problem will arise, please inform us as soon as possible by sending an email to ipc5@ing.unibs.it. Further information will be communicated to the registered participants soon after the registration deadline. (1) Name and email address of each member of the team: (2) Name and email address of the contact person of the team: (3) Name of the competing planner(s): (4) For each planner, please specify (4.1) Domain categories supported by the planner that will be attempted: - PDDL2.2 propositional Yes: No: - PDDL2.2 metric-temporal Yes: No: - PDDL3.0 simple preferences Yes: No: - PDDL3.0 qualitative preferences Yes: No: - PDDL3.0 complex constraints Yes: No: - PDDL3.0 complex preferences Yes: No: For a description of the categories and a few examples please see the "resources" page in the competition web site. NOTE: The participants are strongly encouraged to run their planner in every domain category that is supported by the planner. If you have comments about (PDDL2.2 or PDDL3.0) domain categories that are only partially supported by your planner (e.g., the planner does not support derived predicates, timed initial literals or some type of PDDL3.0 constraints), please indicate them here: ... (4.2) Type of the planner: - Satisficing (sub-optimal) Yes: No: - Optimal Yes: No: In case of optimal planner, please specify the objective function (e.g., number of actions, number of time steps, plan makespan, plan metric expression as specified in the metric field of the PDDL problem file, others): ... (4.3) The competition machine will run Linux Suse. Please specify the programming language(s) and compilers required by the planner: ... (4.4) The planner uses randomized algorithms Yes: No: (4.5) The planner is incremental/anytime Yes: No: (4.6) Additional details you want to let us know about your planner, such as particular features of PDDL2.2 or PDDL3.0 that are not supported or other particular aspects of the planner: .... (5) [OPTIONAL] At ICAPS'06 there will be a workshop on plan preferences and soft constraints in planning. If you have a planner handling PDDL3 preferences, you are encouraged to submit a paper. For more information about the workshop, please follow the workshop link from the ICAPS'06 website. I intend to submit a paper to the ICAPS'06 Workshop YES: NO: