Distributed coordination of heterogeneous agents using a semantic overlay network and a goal-directed graphplan planner.

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 coordinatio...

Full description

Bibliographic Details
Main Authors: António Luís Lopes, Luís Miguel Botelho
Format: Article
Language:English
Published: Public Library of Science (PLoS) 2013-01-01
Series:PLoS ONE
Online Access:http://europepmc.org/articles/PMC3660390?pdf=render
id doaj-6e7d9998ee674850843e6f96f7ec282b
record_format Article
spelling doaj-6e7d9998ee674850843e6f96f7ec282b2020-11-25T01:55:11ZengPublic Library of Science (PLoS)PLoS ONE1932-62032013-01-0185e6293110.1371/journal.pone.0062931Distributed coordination of heterogeneous agents using a semantic overlay network and a goal-directed graphplan planner.António Luís LopesLuís Miguel BotelhoIn 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.http://europepmc.org/articles/PMC3660390?pdf=render
collection DOAJ
language English
format Article
sources DOAJ
author António Luís Lopes
Luís Miguel Botelho
spellingShingle António Luís Lopes
Luís Miguel Botelho
Distributed coordination of heterogeneous agents using a semantic overlay network and a goal-directed graphplan planner.
PLoS ONE
author_facet António Luís Lopes
Luís Miguel Botelho
author_sort António Luís Lopes
title Distributed coordination of heterogeneous agents using a semantic overlay network and a goal-directed graphplan planner.
title_short Distributed coordination of heterogeneous agents using a semantic overlay network and a goal-directed graphplan planner.
title_full Distributed coordination of heterogeneous agents using a semantic overlay network and a goal-directed graphplan planner.
title_fullStr Distributed coordination of heterogeneous agents using a semantic overlay network and a goal-directed graphplan planner.
title_full_unstemmed Distributed coordination of heterogeneous agents using a semantic overlay network and a goal-directed graphplan planner.
title_sort distributed coordination of heterogeneous agents using a semantic overlay network and a goal-directed graphplan planner.
publisher Public Library of Science (PLoS)
series PLoS ONE
issn 1932-6203
publishDate 2013-01-01
description 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.
url http://europepmc.org/articles/PMC3660390?pdf=render
work_keys_str_mv AT antonioluislopes distributedcoordinationofheterogeneousagentsusingasemanticoverlaynetworkandagoaldirectedgraphplanplanner
AT luismiguelbotelho distributedcoordinationofheterogeneousagentsusingasemanticoverlaynetworkandagoaldirectedgraphplanplanner
_version_ 1724984504939970560