In this paper a method of autonomous space searching is described. The task is to search the given area and to find lost objects (e.g. injured people or bombs) as fast as possible. The given area is a building which is divided into rooms. It is assumed that the lost objects are located in groups and finding one object suggests there are more lost objects in the room. Robots divide the area and each robot searches its room. If it finds a lost object it broadcasts the information to whole team and the negotiation mechanism starts. The robots which win the auction, cancel their task and go to the room, where the lost object was found, to find other objects faster. A prototype system was realized in a symulator written in the Java language.
© 2001-2026 Fundación Dialnet · Todos los derechos reservados