Dynamic area coverage using faulty multi-agent swarms

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (Scopus)

Abstract

We consider the problem of distributed coverage of an unknown two-dimensional environment using a swarm of mobile mini-robots. In contrast to previous approaches for robotic area coverage, we assume that each robot(agent) 1 in our system is limited in its communication range and memory capacity. Agents are also susceptible to sensor noise while communicating with other agents, and, can be subject to transient or permanent failures. The objective of the agents is to cover the entire environment while reducing the coverage time and the redundancy in the area covered by different agents. First, we describe our distributed coverage algorithm where each agent uses a local heuristic based on Manhattan distances and the information gained from other agents at each step to decide on its next action(movement). We then describe and analyze the fault model of our agents and show that the local heuristic used by the agents deteriorate linearly as the communication noise increases. Finally, we verify the performance of our system empirically within a simulated environment and show that the system is able to scale efficiently in the number of robots and size of the environment, and, determine the effect of communication faults and robot failures on the system performance.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages17-23
Number of pages7
ISBN (Print)0769530273, 9780769530277
DOIs
StatePublished - Jan 1 2007
EventIEEE Computer Society Technical Committee on Intelligent Informatics(TCII) - Fremont, CA, United States
Duration: Nov 2 2007Nov 5 2007

Publication series

NameProceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007

Conference

ConferenceIEEE Computer Society Technical Committee on Intelligent Informatics(TCII)
CountryUnited States
CityFremont, CA
Period11/2/0711/5/07

Fingerprint

Robots
Communication
Parallel algorithms
Redundancy
Robotics
Data storage equipment
Sensors

Keywords

  • Distributed area coverage
  • Failure
  • Fault
  • Swarming

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software

Cite this

Ke, C., & Dasgupta, P. (2007). Dynamic area coverage using faulty multi-agent swarms. In Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007 (pp. 17-23). [4407251] (Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IAT.2007.72

Dynamic area coverage using faulty multi-agent swarms. / Ke, Cheng; Dasgupta, Prithviraj.

Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007. Institute of Electrical and Electronics Engineers Inc., 2007. p. 17-23 4407251 (Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ke, C & Dasgupta, P 2007, Dynamic area coverage using faulty multi-agent swarms. in Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007., 4407251, Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007, Institute of Electrical and Electronics Engineers Inc., pp. 17-23, IEEE Computer Society Technical Committee on Intelligent Informatics(TCII), Fremont, CA, United States, 11/2/07. https://doi.org/10.1109/IAT.2007.72
Ke C, Dasgupta P. Dynamic area coverage using faulty multi-agent swarms. In Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007. Institute of Electrical and Electronics Engineers Inc. 2007. p. 17-23. 4407251. (Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007). https://doi.org/10.1109/IAT.2007.72
Ke, Cheng ; Dasgupta, Prithviraj. / Dynamic area coverage using faulty multi-agent swarms. Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007. Institute of Electrical and Electronics Engineers Inc., 2007. pp. 17-23 (Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007).
@inproceedings{98cddce6d1cc46a3b7d202f9605cc84a,
title = "Dynamic area coverage using faulty multi-agent swarms",
abstract = "We consider the problem of distributed coverage of an unknown two-dimensional environment using a swarm of mobile mini-robots. In contrast to previous approaches for robotic area coverage, we assume that each robot(agent) 1 in our system is limited in its communication range and memory capacity. Agents are also susceptible to sensor noise while communicating with other agents, and, can be subject to transient or permanent failures. The objective of the agents is to cover the entire environment while reducing the coverage time and the redundancy in the area covered by different agents. First, we describe our distributed coverage algorithm where each agent uses a local heuristic based on Manhattan distances and the information gained from other agents at each step to decide on its next action(movement). We then describe and analyze the fault model of our agents and show that the local heuristic used by the agents deteriorate linearly as the communication noise increases. Finally, we verify the performance of our system empirically within a simulated environment and show that the system is able to scale efficiently in the number of robots and size of the environment, and, determine the effect of communication faults and robot failures on the system performance.",
keywords = "Distributed area coverage, Failure, Fault, Swarming",
author = "Cheng Ke and Prithviraj Dasgupta",
year = "2007",
month = "1",
day = "1",
doi = "10.1109/IAT.2007.72",
language = "English (US)",
isbn = "0769530273",
series = "Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "17--23",
booktitle = "Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007",

}

TY - GEN

T1 - Dynamic area coverage using faulty multi-agent swarms

AU - Ke, Cheng

AU - Dasgupta, Prithviraj

PY - 2007/1/1

Y1 - 2007/1/1

N2 - We consider the problem of distributed coverage of an unknown two-dimensional environment using a swarm of mobile mini-robots. In contrast to previous approaches for robotic area coverage, we assume that each robot(agent) 1 in our system is limited in its communication range and memory capacity. Agents are also susceptible to sensor noise while communicating with other agents, and, can be subject to transient or permanent failures. The objective of the agents is to cover the entire environment while reducing the coverage time and the redundancy in the area covered by different agents. First, we describe our distributed coverage algorithm where each agent uses a local heuristic based on Manhattan distances and the information gained from other agents at each step to decide on its next action(movement). We then describe and analyze the fault model of our agents and show that the local heuristic used by the agents deteriorate linearly as the communication noise increases. Finally, we verify the performance of our system empirically within a simulated environment and show that the system is able to scale efficiently in the number of robots and size of the environment, and, determine the effect of communication faults and robot failures on the system performance.

AB - We consider the problem of distributed coverage of an unknown two-dimensional environment using a swarm of mobile mini-robots. In contrast to previous approaches for robotic area coverage, we assume that each robot(agent) 1 in our system is limited in its communication range and memory capacity. Agents are also susceptible to sensor noise while communicating with other agents, and, can be subject to transient or permanent failures. The objective of the agents is to cover the entire environment while reducing the coverage time and the redundancy in the area covered by different agents. First, we describe our distributed coverage algorithm where each agent uses a local heuristic based on Manhattan distances and the information gained from other agents at each step to decide on its next action(movement). We then describe and analyze the fault model of our agents and show that the local heuristic used by the agents deteriorate linearly as the communication noise increases. Finally, we verify the performance of our system empirically within a simulated environment and show that the system is able to scale efficiently in the number of robots and size of the environment, and, determine the effect of communication faults and robot failures on the system performance.

KW - Distributed area coverage

KW - Failure

KW - Fault

KW - Swarming

UR - http://www.scopus.com/inward/record.url?scp=44149111634&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=44149111634&partnerID=8YFLogxK

U2 - 10.1109/IAT.2007.72

DO - 10.1109/IAT.2007.72

M3 - Conference contribution

AN - SCOPUS:44149111634

SN - 0769530273

SN - 9780769530277

T3 - Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007

SP - 17

EP - 23

BT - Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2007

PB - Institute of Electrical and Electronics Engineers Inc.

ER -