Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
93
0
9

Year Published

2005
2005
2019
2019

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 106 publications
(102 citation statements)
references
References 5 publications
0
93
0
9
Order By: Relevance
“…A comparative study up to 2004 was presented in [10], which analyzed many different approaches. They observed that the best strategy depends on the topology of the environment and the agents' population size.…”
Section: Alternative Methodsmentioning
confidence: 99%
“…A comparative study up to 2004 was presented in [10], which analyzed many different approaches. They observed that the best strategy depends on the topology of the environment and the agents' population size.…”
Section: Alternative Methodsmentioning
confidence: 99%
“…There is no communication among the agents. The approach is generalized to weighted graphs in Almeida et al (2004 studied adaptive agents that learn to patrol weighted graphs to minimize the time intervals between visits to the nodes, using Reinforcement Learning (RL) techniques. A Markov Decision Process (MDP) formalism was used to model the patrolling problem, and the challenge was to define a state and action space for each agent individually, and to develop proper models of instantaneous rewards which could lead to satisfactory long term performance.…”
Section: Background and Reviewmentioning
confidence: 99%
“…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%