Multi-agent Patrolling: An Empirical Analysis of Alternative Architectures

Machado, Aydano Pamponet; Ramalho, Geber; Zucker, Jean-Daniel; Drogoul, Alexis

doi:10.1007/3-540-36483-8_11

Cited by 149 publications

(145 citation statements)

References 7 publications

Supporting

Mentioning

135

Contrasting

Unclassified

Order By: Relevance

“…One of the first works in this field is described in [2] and in more detail in [3], where several architectures of multi-agent patrolling and various evaluation criteria were presented.…”

Section: Pioneer Methodsmentioning

confidence: 99%

A Survey on Multi-robot Patrolling Algorithms

Portugal

Rocha

2011

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Abstract. This article presents a survey on cooperative multi-robot patrolling algorithms, which is a recent field of research. Every strategy proposed in the last decade is distinct and is normally based on operational research methods, simple and classic techniques for agent's coordination or alternative, and usually more complex, coordination mechanisms like market-based approaches or reinforcement-learning. The variety of approaches differs in various aspects such as agent type and their decision-making or the coordination and communication mechanisms. Considering the current work concerning the patrolling problem with teams of robots, it is felt that there is still a great potential to take a step forward in the knowledge of this field, approaching well-known limitations in previous works that should be overcome.

show abstract

“…One of the first works in this field is described in [2] and in more detail in [3], where several architectures of multi-agent patrolling and various evaluation criteria were presented.…”

Section: Pioneer Methodsmentioning

confidence: 99%

A Survey on Multi-robot Patrolling Algorithms

Portugal

Rocha

2011

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

show abstract

“…Pioneer work on this field was presented in [3] and [4], where very simple approaches with reactive and cognitive agents were proposed as well as a first evaluation criterion based on idleness. Following these works, more advanced approaches based on graph theory became also popular like [5] and [6], which use graph partitioning to assign efficient patrol routes to different robots.…”

Section: Related Workmentioning

confidence: 99%

“…Five state-of-the art patrolling algorithms were implemented, namely: Conscientious Reactive (CR) [3], Heuristic Conscientious Reactive (HCR) [4], Heuristic Pathfinder Conscientious Cognitive (HPCC) [4], Cyclic Algorithm for Generic Graphs (CGG) [5] and Generalized MSP Algorithm (MSP) [5]. These algorithms were combined with six different teamsizes: 1, 2, 4, 6, 8 and 12; and three environments with different connectivity properties: low connectivity (A), medium connectivity (B) and high connectivity (C).…”

Section: Preliminariesmentioning

confidence: 99%

Measuring Variables Effect to Statistically Model the Multi-Robot Patrolling Problem by Means of ANOVA

Portugal

Rocha

2012

Technological Innovation for Value Creation

View full text Add to dashboard Cite

Abstract. This paper focuses on analyzing extensive results generated from running diverse multi-robot patrolling algorithms with different configurations towards measuring the influence of the variables of the general problem. In order to do this, a statistical technique by the name of Analysis of Variance (ANOVA) is employed to compare the parameters and identify the ones which give raise to the total dispersion of the data set, at the same time accessing their contribution to the obtained results. It is shown that by applying such technique, it is possible to compute a data-related model for the Multi-Robot Patrolling Problem (MRPP).

show abstract

“…Informally, a good strategy is one that minimises the time lag between two passages to the same place and for all places. In [12], it was shown that in many applications of the patrolling problem, the territory could be represented by a graph. Given such a graph, the patrolling task refers to continuously visiting all the graph nodes so as to minimise the time lag between two visits.…”

Section: Example Applicationsmentioning

confidence: 99%

Welfare Engineering in Practice: On the Variety of Multiagent Resource Allocation Problems

Chevaleyre

Endriss

Estivie

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Many problems studied in the multiagent systems community can be considered instances of an abstract multiagent resource allocation problem. In this problem, which is now better understood theoretically, the goal is to satisfy a criterion of global optimality (formulated in terms of a suitable notion of social welfare), given that the agents sharing a set of resources follow a local rationality criterion reflecting their individual preferences. In this paper, we first show that this simple decentralised resource allocation framework allows us to model a wide variety of applications. These applications thereby benefit from all the theoretical results concerning the framework. We then draw up a list of criteria which can guide the application designer working within the framework and illustrate the relevance of our approach by discussing several applications in view of this list of design criteria.

show abstract

Multi-agent Patrolling: An Empirical Analysis of Alternative Architectures

Cited by 149 publications

References 7 publications

A Survey on Multi-robot Patrolling Algorithms

A Survey on Multi-robot Patrolling Algorithms

Measuring Variables Effect to Statistically Model the Multi-Robot Patrolling Problem by Means of ANOVA

Welfare Engineering in Practice: On the Variety of Multiagent Resource Allocation Problems

Contact Info

Product

Resources

About