First International Conference on Complex, Intelligent and Software Intensive Systems (CISIS'07) 2007
DOI: 10.1109/cisis.2007.52
|View full text |Cite
|
Sign up to set email alerts
|

Task Decomposition and Delegation Algorithms for Coordinating Unstructured Multi Agent Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2008
2008
2009
2009

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 13 publications
0
3
0
Order By: Relevance
“…if (p > mp) (6) mp = p (7) mq = q i (8) end if (9) end foreach (10) r = process(mq) // mq is the highest priority query (11) if (r = Ø) (12) depth(mq) = depth(mq) + 1 (13) foreach n i ! N (14) reply(forward(mq, n i )) (15) end foreach (16) else (17) reply(r) (18) end if Using this algorithm, peers can efficiently manage their work load by giving priority to local requests (search queries triggered by close peers) in detriment of requests originated by far-away peers.…”
Section: Algorithm: Priority-based Floodingmentioning
confidence: 99%
See 1 more Smart Citation
“…if (p > mp) (6) mp = p (7) mq = q i (8) end if (9) end foreach (10) r = process(mq) // mq is the highest priority query (11) if (r = Ø) (12) depth(mq) = depth(mq) + 1 (13) foreach n i ! N (14) reply(forward(mq, n i )) (15) end foreach (16) else (17) reply(r) (18) end if Using this algorithm, peers can efficiently manage their work load by giving priority to local requests (search queries triggered by close peers) in detriment of requests originated by far-away peers.…”
Section: Algorithm: Priority-based Floodingmentioning
confidence: 99%
“…In previously published work [6], we have presented a generic approach for developing an innovative process for resource coordination in unstructured distributed environments, by combining these two technologies. In this article, we present a survey of recent research on P2P computing and multi-agent systems for resource coordination and further extend the proposal described in [6] by presenting a concrete approach for optimizing resource coordination through the use of efficient P2P search mechanisms that rely upon a dynamically self-created powerful semantic overlay network.…”
Section: Introductionmentioning
confidence: 99%
“…Li and others put forward a task decomposition method combining the heuristic approach with "AND/OR" decomposition tree [2]. Lopes and others introduced task decomposition and delegation algorithms for coordinating unstructured multi agent systems [3], in which an agent that receives a request will use an AI-based planning algorithm to decompose the received request into several subtasks; it will handle those for which it has know-how and available resources; and it will use decentralized networks computing methods to delegate the rest of the request to other agents that can possibly handle it. DeLoach put forward a goal model for dynamic systems (GMoDS) [4] [5], in which the goal specification tree is statically designed and the algorithm for task decomposition which makes the agent system lack of autonomy and intelligence is not considered.…”
Section: Introductionmentioning
confidence: 99%