Erdogan, KemalKorkmaz, MehmetDurdu, AkifYilmaz, NihatTopal, Sebahattin2020-03-262020-03-262015978-988-19253-6-72078-0958https://hdl.handle.net/20.500.12395/32177World Congress on Engineering and Computer Science -- OCT 21-23, 2015 -- San Francisco, CAIn this study, it is considered the case of chasing escapers using graph theory method with multi robots, which are connected to each other. In this simulation study the fugitives are trying to escape from a campus region which has five possible gates for entrance and exit. Because of not determining the possible escape ways of fugitives, it is hard to obtain useful results from police or security chase in a quick time. In this approach, some security robots are waiting in stand-by position to get a new command for positioning in a specified area. Happening of any undesired case, robots are informed by an operator which gate is the alarmed gate. At this point, multi-robots are positioned by using graph theory if the communication range is appropriate to connect each other. This imaginary scenario is supposed to take place in the campus of Selcuk University. There are five gates in the campus that are used for vehicle and pedestrian entrance and exit. For any unusual events similar to this simulation like shooting or robbery, security robots would be alarmed. After alarm case, the backup team would be sent to the gates to start the aerial chasing of escapers.eninfo:eu-repo/semantics/closedAccessgrapy theorymorphing robotsmulti-robotssearch and rescueConference Object388392N/AWOS:000380591600074N/A