: Max Bramer, Frans Coenen, Miltos Petridis
: Max Bramer, Frans Coenen, Miltos Petridis
: Research and Development in Intelligent Systems XXIV Proceedings of AI-2007, The Twenty-seventh SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence
: Springer-Verlag
: 9781848000940
: 1
: CHF 200.50
:
: Anwendungs-Software
: English
: 398
: Wasserzeichen
: PC/MAC/eReader/Tablet
: PDF
An agent in a multi-agent system (MAS) has to generate plans for its individual goal, but these plans may con?ict with those that are already being scheduled or executed by other agents. It must also be able to complete its planning and resolution of these con?icts within a reasonable time to have an acceptable quality plan. Although we adopt hierarchical planning (HP, for example, see [7, 12]) using the decision-theoretic planning (DTP) approach [6] for ef?cient planning, it is not trivial to apply HPO to MAS. In HP, appropriate (abstract) plans are selected level by level to maximize the utility U (p), where where p is the expected ?nal plan comprising a sequence of primitive actions. However, in the MAS context, con?icts between agents affect the ef?ciency and quality of resulting plans. When a con?ict is found at lower levels, an additional sophisticated process for avoiding it (con?ict resolution) must be invoked and some extra actions (such as waiting for synchronization and detouring) may have to be added to the plan. The con?ict resolution process may become costly or fail. Even a single con?ict, if it is dif?cult to resolve, will result in a plan with considerably lower quality than it otherwise would have. As a result, in multi-agent systems, the second- or third-best plans may result in better overall performance.
CONTENTS10
TECHNICAL KEYNOTE ADDRESS13
BEST TECHNICAL PAPER15
An Evolutionary Algorithm-Based Approach to Robust Analog Circuit Design using Constrained Multi- Objective Optimization16
1 Introduction16
2 Nominal Design versus Design for Yield18
3 IC Design as a Constrained MOP19
4 The Algorithm21
5 Radio Frequency Low Noise Amplifier22
6 LeapFrog Filter24
7 Ultra WideBand Low Noise Amplifier26
8 Conclusions28
Acknowledgment28
References28
CONSTRAINT SATISFACTION30
Dynamic Rule Mining for Argumentation Based Systems72
1 Introduction72
2 Previous Work73
3 PADUA Protocol77
4 Dynamic Association Rules Generation79
5 Experimentation and Analysis82
6 Conclusions83
References84
AI TECHNIQUES86
Learning Sets of Sub-Models for Spatio- Temporal Prediction127
1 Introduction127
2 Architecture for Models of Spatio-Temporal Data130
3 Learning the Models from Data132
4 Evaluation134
5 Results136
6 Conclusions138
References139
DATA MINING AND MACHINE LEARNING141
Frequent Set Meta Mining: Towards Multi-Agent Data Mining142
1 Introduction142
2 Previous Work143
3 Note on P and T Trees145
4 Proposed Meta ARM Algorithms146
5 Experimentation and Analysis149
6 Conclusions153
References153
A Flexible Framework To Experiment WithOntology Learning Techniques155
Evolving a Dynamic Predictive Coding Mechanism for Novelty Detection169
MULTI-AGENT SYSTEMS197
Merging Intelligent Agency and the Semantic Web198
Expressive security policy rules usingLayered Conceptual Graphs238
1 Introduction238
2 Motivation and background239
3 Security mechanisms for HealthAgents241
4 Policy rules with Conceptual Graphs245
5 Conclusions and future work250
6 Acknowledgements250
References250
DATA MINING252
Relevance Feedback for Association Rules by Leveraging Concepts from Information Retrieval253
1 Introduction253
2 Association Rules255
3 Related Work255
4 Using Concepts from Information Retrieval257
5 Rule Representation258
6 Pairwise Similarity259
7 Similarity Aggregation260
8 Relevance Scoring262
9 Conclusion264
References264
Visualization and Grouping of Graph Patterns in Molecular Databases267
1 Introduction267
2 Distance Measure269
3 Optimization: Restriction to Frequent Subgraphs and Grouping270
4 Visualization272
5 Performance273
6 Conclusions and Future Work277
References278
A Classification Algorithm based on Concept Similarity281
KNOWLEDGE ACQUISITION AND MANAGEMENT303
Knowledge Management for Evolving Products304
Recovery from Plan Failures in Partially Observable Environments318
Automatic Character Assignation332
SHORT PAPERS346
An Agent-Based Algorithm for Data Reduction347
Towards a Computationally Efficient Approach to Modular Classification Rule Induction353
Spatial N-player Dilemmas in Changing Environments377
1 Introduction377
2 Related Work378
3 Model and Experimental Set up379
4 Results380
5 Conclusion381
References381