The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
A Swarm Robotics Approach to Decontamination
|
|
Author(s): Daniel S. F. Alves (Instituto de Matemática, UFRJ, Brazil), E. Elael M. Soares (Escola Politécnica, UFRJ, Brazil), Guilherme C. Strachan (Escola Politécnica, UFRJ, Brazil), Guilherme P. S. Carvalho (Escola Politécnica, UFRJ, Brazil), Marco F. S. Xaud (Escola Politécnica, UFRJ, Brazil), Marcos V. B. Couto (Escola Politécnica, UFRJ, Brazil), Rafael M. Mendonça (UERJ, Brazil), Renan S. Freitas (Escola Politécnica, UFRJ, Brazil), Thiago M. Santos (Escola Politécnica, UFRJ, Brazil), Vanessa C. F. Gonçalves (UFRJ, Brazil), Luiza M. Mourelle (UERJ, Brazil), Nadia Nedjah (UERJ, Brazil), Nelson Maculan (UFRJ, Brazil), Priscila M. V. Lima (Instituto de Ciências Exactas, UFRRJ, Brazil)and Felipe M. G. França (UFRJ, Brazil)
Copyright: 2014
Pages: 15
Source title:
Robotics: Concepts, Methodologies, Tools, and Applications
Source Author(s)/Editor(s): Information Resources Management Association (USA)
DOI: 10.4018/978-1-4666-4607-0.ch046
Purchase
|
Abstract
Many interesting and difficult practical problems need to be tackled in the areas of firefighting, biological and/or chemical decontamination, tactical and/or rescue searches, and Web spamming, among others. These problems, however, can be mapped onto the graph decontamination problem, also called the graph search problem. Once the target space is mapped onto a graph G(N,E), where N is the set of G nodes and E the set of G edges, one initially considers all nodes in N to be contaminated. When a guard, i.e., a decontaminating agent, is placed in a node i ? N, i becomes (clean and) guarded. In case such a guard leaves node i, it can only be guaranteed that i will remain clean if all its neighboring nodes are either clean or clean and guarded. The graph decontamination/search problem consists of determining a sequence of guard movements, requiring the minimum number of guards needed for the decontamination of G. This chapter presents a novel swarm robotics approach to firefighting, a conflagration in a hypothetical apartment ground floor. The mechanism has been successfully simulated on the Webots platform, depicting a firefighting swarm of e-puck robots.
Related Content
|
Rashmi Rani Samantaray, Zahira Tabassum, Abdul Azeez.
© 2024.
32 pages.
|
|
Sanjana Prasad, Deepashree Rajendra Prasad.
© 2024.
25 pages.
|
|
Deepak Varadam, Sahana P. Shankar, Aryan Bharadwaj, Tanvi Saxena, Sarthak Agrawal, Shraddha Dayananda.
© 2024.
24 pages.
|
|
Tarun Kumar Vashishth, Vikas Sharma, Kewal Krishan Sharma, Bhupendra Kumar, Sachin Chaudhary, Rajneesh Panwar.
© 2024.
29 pages.
|
|
Mrutyunjaya S. Hiremath, Rajashekhar C. Biradar.
© 2024.
30 pages.
|
|
C. L. Chayalakshmi, Mahabaleshwar S. Kakkasageri, Rajani S. Pujar, Nayana Hegde.
© 2024.
30 pages.
|
|
Amit Kumar Tyagi.
© 2024.
29 pages.
|
|
|