April 28, 2001
Japan Open competition report.
Log files, disaster situation maps, simulator
codes, and agent source codes of Japan Open
competitors will be open soon.
A distributed computer simulation environment
of earthquake disasters including maps has
been prepared by the organizer, where buildings
collapse, streets are blocked, fire spreads,
and traffic condition is affected according
to given seismic intensity maps, reproducing
virtual comprehensive urban disaster.
Intelligent action brigades (agents) of software
try to minimize the disaster damage in this
virtual space. Rescue parties save
victims from the destroyed buildings, firefighter
companies extinguish the fire, and police
parties open the blocked roads. The
magnitude of damage is determined by the
behavior of these agents and their intelligence.
The autonomous agents have abilities similar to robots: sensing (see, hear, conversation, etc.) and action
(move, talk, rescue, extinguish, repair roads,
etc.) by their own decision.
In this competition, each participating team
develops 5 rescue parties, 10 fire companies,
10 police parties, 1 rescue center, 1 fire
station, and 1 poice station which behave
autonoously. Behavioral intelligences
compete each other in disaster fields 500m
x 500m. The winner of competition
should rescue the maximum number of victims
minimizing disaster damage.
Competition Plan
A pair of agent teams try a disaster field at the same time in order that the audience can compare them. They do not mutually fight each other, but they challenge the same situation independently such as golf and athletic sports. In this disaster domain, obstructing the opponent is not desirable, and fighting style competition is not suitable.
In order to minimize possibility of accidental win, all the teams try 4 disaster maps in the preliminary games and the total points determin the finalists. In the final round, total points of two maps judges the championship.
The point is counted by the number of remain of lives. Area of burnt and remaining agents' HP are considered supplementaly.
Japan Open 2001 uses the version 0 simulator that is currently available as an open resource in the web page. The rule, evaluation, etc are announced on the web page.
The following computer environment will be prepared. All the programs including simulators, agents, and logViewers should use these computers.
The participants should make their source code open after the competition.
Each participating team prepares two sets of agent parties changing parameters, etc. An agent party No.1 of Team A is referred as A1 here. Modification of program, parameters, etc. is not allowed after starting the competition.
| Participating Team Name | Team Members (Affiliations) |
Technical Appeal Points |
| Gemini-R | Masayuki Ohta (TIT, Japan) |
Agent strategies are determined according to the optimal order of rescue activities and allocation of man-power that has been automatically learned by simulation results. |
| YabAI | Takeshi Morimoto (UEC, Japan) |
Behavior of agents is switched according to the distribution of disater. |
| NITRescue-R | Taku Sakushima, Nobuhiro Ito, Yoshiki Asai,
Tetsuya Ezaki (NIT, Japan) |
Cooperation of multiple agents is important in a dynamic environment as the RoboCup-Rescue simulation. Cooperative behabior of agents is defined as a group behavior of agents. A dynamic grouping algorithm is developed. It has a different strategy from NITRescue-B. |
| NITRescue-B | Tetsuya Ezaki, Nobuhiro Itoh, Taku Sakushima,
Yoshiki Asai (NIT, Japan) |
Cooperation of multiple agents is important in a dynamic environment as the RoboCup-Rescue simulation. Cooperative behabior of agents is defined as a group behavior of agents. A dynamic grouping algorithm is developed. It has a different strategy from NITRescue-R. |
| no-fear | Norifumi Oda (TUT, Japan) |
A learning algorithm of AI gives optimal rescue action. |
| ISI Rescue | Takayuki Ito, Milind Tambe, Ranjit Nair, Stacy Marsella (ISI/USC, USA; JAIST, Japan) |
Cooperative and autonomous rescue activities are generated. |
| bachAv | P Ravi Prakash, Rahul D Vakil (National Centre for Software Tech., Mumbai, India |
In the preliminary match, each agent party tries 4 disaster situations. 2 agent parties with the top total points proceed to the final game. However, two agent parties of the same participating team cannot proceed at the same time. In the final match, each agent party tries 2 disaster situations. Top total point determines the winner.
| Day | Start Time (JST) | Agent Parties | Disaster Situation to be Tried |
| 28 (Sat) Preliminary |
11:00 | A1-B1 | I |
| 11:20 | C1-D1 | ||
| 11:40 | E1-F1 | ||
| 12:00 | A2-C2 | ||
| 12:20 | B2-E2 | ||
| 12:40 | D2-F2 | ||
| 15:00 | A1-D1 | II | |
| 15:20 | B1-F1 | ||
| 15:40 | C1-E1 | ||
| 16:00 | A2-E2 | ||
| 16:20 | B2-D2 | ||
| 16:40 | C2-F2 | ||
| 29 (Sun) Preliminary |
10:00 | A1-B1 | III |
| 10:20 | C1-D1 | ||
| 10:40 | E1-F1 | ||
| 11:00 | A2-C2 | ||
| 11:20 | B2-E2 | ||
| 11:40 | D2-F2 | ||
| 14:00 | A1-D1 | IV | |
| 14:20 | B1-F1 | ||
| 14:40 | C1-E1 | ||
| 15:00 | A2-E2 | ||
| 15:20 | B2-D2 | ||
| 15:40 | C2-F2 | ||
| 30 (Mon) Final |
10:30 | Top - Second |
V |
| 10:45 | Second - Top |
VI |
Participants to RoboCup Japan Open 2001 are welcome to participate in RoboFesta Kansai 2001 in Osaka, Japan and RoboCup World Cup 2001 in Seattle USA.