Muutke küpsiste eelistusi

Real-Time Search for Learning Autonomous Agents 1997 ed. [Kõva köide]

Teised raamatud teemal:
  • Kõva köide
  • Hind: 141,35 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 166,29 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Teised raamatud teemal:
Extends realtime search algorithms for computational systems in which several computational agents interact to perform some set of tasks. Addresses the problem solver's inability to attain its goal without performing superfluous actions, to utilize and improve previous experiments, to be applied directly to a multi-agent world, and to cooperate with other problem solvers. Covers realtime search performance, controlling learning processes, adapting to changing goals, cooperating in uncertain situations, and forming problem-solving organizations. Double spaced. Annotation c. by Book News, Inc., Portland, Or.

Autonomous agents or multiagent systems are computational systems in which several computational agents interact or work together to perform some set of tasks. These systems may involve computational agents having common goals or distinct goals.
Real-Time Search for Learning Autonomous Agents focuses on extending real-time search algorithms for autonomous agents and for a multiagent world. Although real-time search provides an attractive framework for resource-bounded problem solving, the behavior of the problem solver is not rational enough for autonomous agents. The problem solver always keeps the record of its moves and the problem solver cannot utilize and improve previous experiments. Other problems are that although the algorithms interleave planning and execution, they cannot be directly applied to a multiagent world. The problem solver cannot adapt to the dynamically changing goals and the problem solver cannot cooperatively solve problems with other problem solvers. This book deals with all these issues.
Real-Time Search for Learning Autonomous Agents serves as an excellent resource for researchers and engineers interested in both practical references and some theoretical basis for agent/multiagent systems. The book can also be used as a text for advanced courses on the subject.
1 Realtime Search Performance
1(16)
1.1 Introduction
1(1)
1.2 Realtime Search Algorithms
2(4)
1.2.1 LRTA*
2(2)
1.2.2 RTA*
4(1)
1.2.3 LCM
5(1)
1.3 Evaluation Environment
6(2)
1.4 Evaluation Results
8(8)
1.4.1 Comparison of RTA* and LRTA*
8(1)
1.4.2 Comparison of Different Heuristic Functions
9(6)
1.4.3 Comparison of LRTA* and LCM
15(1)
1.5 Summary
16(1)
2 Controlling Learning Processes
17(18)
2.1 Introduction
17(1)
2.2 LRTA* Performance
18(3)
2.3 Introducing XXX-Lower and Upper Bounds
21(2)
2.4 Weighted Realtime Search (XXX-Search)
23(5)
2.4.1 Algorithm
23(3)
2.4.2 Performance of XXX-Search
26(2)
2.5 Realtime Search with Upper Bounds (XXX-Search)
28(5)
2.5.1 Algorithm
28(2)
2.5.2 Performance of XXX-Search
30(3)
2.6 Summary
33(2)
3 Adapting to Changing Goals
35(32)
3.1 Introduction
35(2)
3.2 Problem Formulation
37(3)
3.3 Moving Target Search (MTS)
40(2)
3.4 Completeness of MTS
42(3)
3.5 Computational Complexity
45(1)
3.5.1 Space Complexity
45(1)
3.5.2 Time Complexity
45(1)
3.5.3 Learning Over Multiple Trials
46(1)
3.6 Relaxing Some Constraints on MTS
46(2)
3.6.1 Speed of the Problem Solver and the Target
46(1)
3.6.2 Available Information about the Target
47(1)
3.7 Performance Bottleneck of MTS
48(7)
3.7.1 Experiments with a User-Controlled Target
48(2)
3.7.2 Experiments with an Automatically Controlled Target
50(3)
3.7.3 Heuristic Depression
53(2)
3.8 Commitment to Goals
55(2)
3.9 Deliberation for Selecting Plans
57(4)
3.10 Evaluation Results
61(3)
3.11 Summary
64(3)
4 Cooperating in Uncertain Situations
67(30)
4.1 Introduction
67(3)
4.2 Realtime Bidirectional Search (RTBS)
70(9)
4.2.1 Framework
70(1)
4.2.2 Classification of RTBS Algorithms
71(2)
4.2.3 Centralized RTBS
73(3)
4.2.4 Decoupled RTBS
76(3)
4.3 Performance of RTBS
79(8)
4.3.1 Computational Complexity
79(3)
4.3.2 Measurements on Typical Problems
82(5)
4.4 Heuristic Topographies
87(7)
4.4.1 Topographical Changes
87(3)
4.4.2 Heuristic Depressions in Mazes and n-Puzzles
90(1)
4.4.3 RTUS and RTBS Behavior in Mazes and n-Puzzles
91(3)
4.5 Summary
94(3)
5 Forming Problem Solving Organizations
97(22)
5.1 Introduction
97(2)
5.2 Previous Work
99(2)
5.3 Organizational Problem Solving
101(4)
5.3.1 Organization Self-Design
101(1)
5.3.2 Meta-Level Organization
102(1)
5.3.3 Organizational Agent
103(2)
5.4 Tower Building Problem
105(3)
5.4.1 Original Problem
105(2)
5.4.2 Extending the Original Problem
107(1)
5.5 Experiments
108(8)
5.5.1 Basic Agents
108(3)
5.5.2 Coordinating Agents
111(1)
5.5.3 Organizational Agents
111(5)
5.6 Summary
116(3)
Bibliography 119(6)
Index 125