Formation Morphing of Multi-Robots Using Graph Theory: Fugitive Chasing
Küçük Resim Yok
Tarih
2015
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
INT ASSOC ENGINEERS-IAENG
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
In 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.
Açıklama
World Congress on Engineering and Computer Science -- OCT 21-23, 2015 -- San Francisco, CA
Anahtar Kelimeler
grapy theory, morphing robots, multi-robots, search and rescue
Kaynak
WORLD CONGRESS ON ENGINEERING AND COMPUTER SCIENCE, WCECS 2015, VOL I
WoS Q Değeri
N/A
Scopus Q Değeri
N/A
