Exportar Publicação

A publicação pode ser exportada nos seguintes formatos: referência da APA (American Psychological Association), referência do IEEE (Institute of Electrical and Electronics Engineers), BibTeX e RIS.

Exportar Referência (APA) 
Lopes, A. L. & Botelho, L. (2013). Distributed Coordination of Heterogeneous Agents Using a Semantic Overlay Network and a Goal-Directed Graphplan Planner. PLoS One. 8 (5), e62931
Exportar Referência (IEEE) 
A. L. Lopes and L. M. Botelho,  "Distributed Coordination of Heterogeneous Agents Using a Semantic Overlay Network and a Goal-Directed Graphplan Planner", in PLoS One, vol. 8, no. 5, pp. e62931, 2013
Exportar BibTeX 
@article{lopes2013_1731116081351,
	author = "Lopes, A. L. and Botelho, L.",
	title = "Distributed Coordination of Heterogeneous Agents Using a Semantic Overlay Network and a Goal-Directed Graphplan Planner",
	journal = "PLoS One",
	year = "2013",
	volume = "8",
	number = "5",
	doi = "10.1371/journal.pone.0062931",
	pages = "e62931",
	url = "http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0062931"
}
Exportar RIS 
TY  - JOUR
TI  - Distributed Coordination of Heterogeneous Agents Using a Semantic Overlay Network and a Goal-Directed Graphplan Planner
T2  - PLoS One
VL  - 8
IS  - 5
AU  - Lopes, A. L.
AU  - Botelho, L.
PY  - 2013
SP  - e62931
SN  - 1932-6203
DO  - 10.1371/journal.pone.0062931
UR  - http://www.plosone.org/article/info%3Adoi%2F10.1371%2Fjournal.pone.0062931
AB  - In this paper, we describe a distributed coordination system that allows agents to seamlessly cooperate in problem solving by partially contributing to a problem solution and delegating the subproblems for which they do not have the required skills or knowledge to appropriate agents. The coordination mechanism relies on a dynamically built semantic overlay network that allows the agents to efficiently locate, even in very large unstructured networks, the necessary skills for a specific problem. Each agent performs partial contributions to the problem solution using a new distributed goal-directed version of the Graphplan algorithm. This new goal-directed version of the original Graphplan algorithm provides an efficient solution to the problem of "distraction", which most forward-chaining algorithms suffer from. We also discuss a set of heuristics to be used in the backward-search process of the planning algorithm in order to distribute this process amongst idle agents in an attempt to find a solution in less time. The evaluation results show that our approach is effective in building a scalable and efficient agent society capable of solving complex distributable problems.
ER  -