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 73
Página viii
... situation , and in fact the different approaches often involve reasoning about similar information . Another important idea exemplified by Durfee's approach is the distinction between " satisficing " network control and optimal network ...
... situation , and in fact the different approaches often involve reasoning about similar information . Another important idea exemplified by Durfee's approach is the distinction between " satisficing " network control and optimal network ...
Página 2
... situation is sufficiently predictable for computing elements to tentatively plan sequences of related tasks . • The communication delays are of the same order of magnitude as the task times , so that computing elements can communicate ...
... situation is sufficiently predictable for computing elements to tentatively plan sequences of related tasks . • The communication delays are of the same order of magnitude as the task times , so that computing elements can communicate ...
Página 3
... situations , the coordination mechanisms must be flexible enough for the nodes to coordinate in different styles . The focus of this research is on developing , implementing , and evaluating a new approach for coordinating cooperating ...
... situations , the coordination mechanisms must be flexible enough for the nodes to coordinate in different styles . The focus of this research is on developing , implementing , and evaluating a new approach for coordinating cooperating ...
Página 4
... situations : individual nodes are free to form local goals and plans based on their local knowledge and priorities , and the nodes ' coordination re- sponsibilities and their criteria for choosing what plans to communicate can be ...
... situations : individual nodes are free to form local goals and plans based on their local knowledge and priorities , and the nodes ' coordination re- sponsibilities and their criteria for choosing what plans to communicate can be ...
Página 5
... situation : although useful in a wide range of situations , they do introduce overhead that makes them impractical in either very simple situ- ations ( where cheaper and less sophisticated control mechanisms would suffice ) or in very ...
... situation : although useful in a wide range of situations , they do introduce overhead that makes them impractical in either very simple situ- ations ( where cheaper and less sophisticated control mechanisms would suffice ) or in very ...
Í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