Coordination of Distributed Problem SolversSpringer Science & Business Media, 06/12/2012 - 270 páginas As artificial intelligence (AI) is applied to more complex problems and a wider set of applications, the ability to take advantage of the computational power of distributed and parallel hardware architectures and to match these architec tures with the inherent distributed aspects of applications (spatial, functional, or temporal) has become an important research issue. Out of these research concerns, an AI subdiscipline called distributed problem solving has emerged. Distributed problem-solving systems are broadly defined as loosely-coupled, distributed networks of semi-autonomous problem-solving agents that perform sophisticated problem solving and cooperatively interact to solve problems. N odes operate asynchronously and in parallel with limited internode commu nication. Limited internode communication stems from either inherent band width limitations of the communication medium or from the high computa tional cost of packaging and assimilating information to be sent and received among agents. Structuring network problem solving to deal with consequences oflimited communication-the lack of a global view and the possibility that the individual agents may not have all the information necessary to accurately and completely solve their subproblems-is one of the major focuses of distributed problem-solving research. It is this focus that also is one of the important dis tinguishing characteristics of distributed problem-solving research that sets it apart from previous research in AI. |
No interior do livro
Resultados 1-5 de 52
Página 2
... exchange predictive partial results ( to focus . each other on forming compatible results ) or not ( to avoid overly influencing each other ) . In complex domains , the goals of cooperation may differ as cir- cumstances change , so ...
... exchange predictive partial results ( to focus . each other on forming compatible results ) or not ( to avoid overly influencing each other ) . In complex domains , the goals of cooperation may differ as cir- cumstances change , so ...
Página 3
... exchange their local solutions to converge on global solutions . Alternatively , they may negotiate in small groups to contract out tasks in the network . To work in a wide variety of situations , the coordination mechanisms must be ...
... exchange their local solutions to converge on global solutions . Alternatively , they may negotiate in small groups to contract out tasks in the network . To work in a wide variety of situations , the coordination mechanisms must be ...
Página 4
... exchange information to identify cases where their goals and plans interact ; and ( 3 ) nodes change their planned local actions and interactions to coordinate better based on their view of group activity . It is versatile because it ...
... exchange information to identify cases where their goals and plans interact ; and ( 3 ) nodes change their planned local actions and interactions to coordinate better based on their view of group activity . It is versatile because it ...
Página 5
... exchange and when a change to a local plan is worth communicating about . In addition , we examine the ramifications of frequently modifying and communicating about plans in dynamic situations . We study issues in how and when nodes ...
... exchange and when a change to a local plan is worth communicating about . In addition , we examine the ramifications of frequently modifying and communicating about plans in dynamic situations . We study issues in how and when nodes ...
Página 8
... exchange information to resolve inconsistencies . How nodes do this depends on the meta - level organization , specifying what nodes a node should inform about its local plans and PGPs , what nodes are responsible for forming PGPs and ...
... exchange information to resolve inconsistencies . How nodes do this depends on the meta - level organization , specifying what nodes a node should inform about its local plans and PGPs , what nodes are responsible for forming PGPs and ...
Índice
4 | |
7 | |
1 | 68 |
15 | 97 |
28 | 103 |
29 | 114 |
35 | 125 |
OCAAA | 148 |
63 | 172 |
67 | 197 |
68 | 209 |
71 | 220 |
Acknowledgments | 251 |
Bibliography | 257 |
265 | |
51 | 155 |
Outras edições - Ver tudo
Palavras e frases frequentes
achieve actions activities agents allows nodes alternative-goals attributes belief blackboard blackboard-level broadcast chapter clustering hierarchy combined communication computation computation overhead control decisions cooperation coordinating node Corkill costs d₁ d₂ data for sensed data structures develop di-de distributed distributed computing domain domain-level DVMT environment event-classes example exchange expected Experiment Set future node-plan goal processing highly-rated PGP hypotheses i-goal identify initial integration interactions invoked local plans long-term goals merged messages meta-level organization models modified multi-agent planning network-model node-models node's node2 overhead partial global planning partial results partial solutions performance PGGs PGP-partial-solution PGP's PGPlanner PGPlanning plan-activities plan-activity-map plan's planner planning mechanisms predictive information problem solving processor pursue queue R₁ received recognize redundancy relationships reordered represent sensor sequence short-term simulated situation solution-construction-graph solver specific storage subgoals task-passing tasks time-cushion time-locations time-regions total number tracking-levels updated vehicle monitoring vehicle-event-classes