دسترسی نامحدود
برای کاربرانی که ثبت نام کرده اند
برای ارتباط با ما می توانید از طریق شماره موبایل زیر از طریق تماس و پیامک با ما در ارتباط باشید
در صورت عدم پاسخ گویی از طریق پیامک با پشتیبان در ارتباط باشید
برای کاربرانی که ثبت نام کرده اند
درصورت عدم همخوانی توضیحات با کتاب
از ساعت 7 صبح تا 10 شب
ویرایش: نویسندگان: Takahiro Uchiya (editor), Quan Bai (editor), Iván Marsá Maestre (editor) سری: ISBN (شابک) : 303069321X, 9783030693213 ناشر: Springer سال نشر: 2021 تعداد صفحات: 440 زبان: English فرمت فایل : PDF (درصورت درخواست کاربر به PDF، EPUB یا AZW3 تبدیل می شود) حجم فایل: 37 مگابایت
در صورت تبدیل فایل کتاب PRIMA 2020: Principles and Practice of Multi-Agent Systems: 23rd International Conference, Nagoya, Japan, November 18–20, 2020, Proceedings (Lecture Notes in Computer Science) به فرمت های PDF، EPUB، AZW3، MOBI و یا DJVU می توانید به پشتیبان اطلاع دهید تا فایل مورد نظر را تبدیل نمایند.
توجه داشته باشید کتاب PRIMA 2020: اصول و تمرین سیستم های چند عاملی: بیست و سومین کنفرانس بین المللی، ناگویا، ژاپن، 18 تا 20 نوامبر 2020، مجموعه مقالات (یادداشت های سخنرانی در علوم کامپیوتر) نسخه زبان اصلی می باشد و کتاب ترجمه شده به فارسی نمی باشد. وبسایت اینترنشنال لایبرری ارائه دهنده کتاب های زبان اصلی می باشد و هیچ گونه کتاب ترجمه شده یا نوشته شده به فارسی را ارائه نمی دهد.
Preface Organization Contents Full Papers Implementation of Real Data for Financial Market Simulation Using Clustering, Deep Learning, and Artificial Financial Market 1 Introduction 2 Related Works 3 Data and Extracting HFT-MM Orders 4 Trader Models 4.1 Stylized Trader Model 4.2 Traditional HFT-MM Trader Model 4.3 HFT-MM Machine Learned (ML) Trader Model 5 Simulations 6 Results 6.1 Comparison of Ordering Price Distribution 6.2 Comparison by Kullback–Leibler Divergence 6.3 Deep Analysis for ML Model Simulation 7 Discussion 8 Conclusion References Hybrid Dynamic Programming for Simultaneous Coalition Structure Generation and Assignment 1 Introduction 2 Related Work 3 Basic Concepts and Notation 4 The Dynamic Programming Algorithm 5 The Hybrid Algorithm 6 Benchmarks and Experiments 6.1 Optimality Benchmarks 6.2 Anytime Benchmarks 7 Conclusions References A Socio-psychological Approach to Simulate Trust and Reputation in Modal Choices 1 Introduction 2 Related Work 2.1 Learning Models 2.2 Reputation Models 2.3 Socio-cognitive Models 3 Agent Decision-Making Architecture 3.1 Modelling Trust and Reputation 3.2 Utility Function 3.3 An Overview 4 Experiment 4.1 The Behaviour-Driven Demand Model (BedDeM) 4.2 Setup 4.3 Results 4.4 Discussion 5 Conclusion References Reasoning About Trustworthiness in Cyber-Physical Systems Using Ontology-Based Representation and ASP 1 Introduction 2 Background 2.1 CPS Framework (CPSF), CPS Ontology, and Representation 2.2 Answer Set Programming 3 OA4cps: A Hybrid Reasoner for CPS 3.1 From CPS Theory Specification to ASP Encoding 3.2 Queries Related to Trustworthiness 3.3 Queries Answering Using (,n) 4 Towards a Decision-Support System for CPSF 5 Conclusions, Related Work, and Discussion References Optimal Deterministic Time-Based Policy in Automated Negotiation 1 Introduction 2 Notation and Problem Statement 2.1 Policy 2.2 Acceptance Models 2.3 Problem Statement 3 Related Work: GCA 4 Policy Operations 5 Proposed Algorithms 5.1 Static Acceptance Models: QGCA 5.2 General Time Dependent Acceptance Models: PA 5.3 Extensions 6 Evaluation 6.1 Probabilistic Opponents on Random Domains 6.2 Realistic Domains and Opponents 7 Limitations and Discussion 8 Conclusions References Agent Simulation of Collision Avoidance Based on Meta-strategy Model 1 Introduction 2 Background 3 Active and Passive Strategy Acquisition Experiments 3.1 Methods 3.2 Results 4 Experiment of Cooperative Behavior Acquisition Using Meta-strategy 4.1 Methods 4.2 Results 5 Discussion 6 Conclusion References The Smart Appliance Scheduling Problem: A Bayesian Optimization Approach 1 Introduction 2 Related Work 3 Background 3.1 Constraint Satisfaction Problems (CSPs) 3.2 Bayesian Optimization 4 The Smart Appliance Scheduling (SAS) Problem with Users\' Satisfaction 4.1 The User\'s Satisfaction Function 5 Bayesian Optimization for the SAS Problem 5.1 Existing Acquisition Functions 5.2 Acquisition Functions for the SAS Problem 6 Empirical Evaluations 6.1 Experimental Setup 6.2 Impact of Energy-Cost Based Acquisition Functions 6.3 Impact of Different Kernel Functions 7 Conclusions References Distance-Based Heuristic Solvers for Cooperative Path Planning with Heterogeneous Agents 1 Introduction 2 Preliminary 2.1 Graphs and Requests 2.2 Vehicle Platooning Problem 2.3 Cooperative Path Planning Problem 2.4 Exact Solvers Using Integer Programming 3 Distance-Based Heuristic Solver 3.1 High-Level Overview 3.2 Step 1. Evaluating Benefits of Cooperation for Vehicle Pairs 3.3 Step 2. Finding Vehicle Groups by Assignments 3.4 Step 3. Constructing Routes 4 Computational Experiments 4.1 Evaluation of IP-Based Exact Solver 4.2 Evaluations of Gap Parameter in IP-Solver 4.3 Experiments Using Heuristics 4.4 Summary of Experiments 5 Related Work 6 Conclusion References Policy Advisory Module for Exploration Hindrance Problem in Multi-agent Deep Reinforcement Learning 1 Introduction 2 Related Work 3 Problem Description 3.1 Dec-POMDP 3.2 Agents and Sequential Tasks 3.3 Rewards Setting 3.4 Description of Exploration Hindrance Problem 4 Proposed Method 4.1 Learning Architecture for Agents in Sequential Tasks 4.2 Policy Advisory Module 5 Experimental Evaluation 5.1 Experiment Settings 5.2 Network Structure in Agent 5.3 Experiment 1—Training Results 5.4 Ratio of Incompletion 5.5 Effect of Policy Advisory Module 5.6 Number of Collisions 6 Discussion 7 Conclusion and Future Work References Analysis of Coordination Structures of Partially Observing Cooperative Agents by Multi-agent Deep Q-Learning 1 Introduction 2 Related Studies 3 Problem Formulation 3.1 Problem and Environment 3.2 View Obstruction 4 Proposed Method 4.1 Agent View Methods 4.2 Local View 4.3 Relative View 4.4 Merged View 4.5 Neural Network Structure 5 Experiment and Discussion 5.1 Experimental Setting 5.2 Experiment 1: Static Spawn Location 5.3 Experiment 2: Dynamic Spawn Location 5.4 Discussion 6 Conclusion References Policy Adaptive Multi-agent Deep Deterministic Policy Gradient 1 Introduction 2 Related Work 2.1 Centralized Critic 2.2 Decentralized Learning 2.3 Opponent Modeling 2.4 Meta-learning 2.5 Communication 3 Background 3.1 Partially Observable Markov Games 3.2 Multi-agent Deep Deterministic Policy Gradient 3.3 Dealing Non-stationarity in MADDPG 4 Policy Adaptive MADDPG 4.1 Learning Multiple Policies 4.2 Learning Policy Predictors 5 Experiments 5.1 Environments 5.2 Setup 5.3 Results 6 Conclusion References Multi-agent Planning with High-Level Human Guidance 1 Introduction 2 Related Work 3 The HL-DEC-POMDP Model 4 Solving HL-DEC-POMDPs 4.1 The Command Model 4.2 Point-Based Policy Optimization 4.3 Suggesting Commands to the Operators 5 Experiments 6 Conclusions A The Benchmark Problems A.1 Meeting in a 33 Grid A.2 Cooperative Box-Pushing References Preference Elicitation in Assumption-Based Argumentation 1 Introduction 2 Background 3 Approach for Preference Elicitation in ABA 4 Demonstration (Example) 5 Related Work 6 Conclusions and Future Work References Declarative Preferences in Reactive BDI Agents 1 Introduction 2 Background 3 Method 3.1 Components of Extended Agent Programs 3.2 Transformation to Logic Program 3.3 Plan Priority Extraction and Script Rewriting 4 Application 5 Discussion and Further Developments References Predicting the Priority of Social Situations for Personal Assistant Agents 1 Introduction 2 Proposed Approach 3 Concepts and Methods 3.1 Social Science Concepts 3.2 Machine Learning Methods 4 Crowd-Sourcing User Study 4.1 Choice of Concepts 4.2 Method 4.3 Description of Data 5 Predicting Priority of Social Situations 5.1 Predictive Models and Results 5.2 Determining Important Features for Predictions 5.3 Role of Personal Values in Predicting Priorities 6 Conclusions 6.1 Contributions 6.2 Limitations and Future Work References Mutex Propagation for SAT-based Multi-agent Path Finding 1 Introduction 2 Background 2.1 Mutex Propagation in MAPF 2.2 Conflict-Based Search with Mutex Propagation 3 SAT-Based Approach: MDD-SAT 3.1 Mutexes in SAT-Based Solver 3.2 Experimental Evaluation 4 Conclusion References A SMT-based Implementation for Safety Checking of Parameterized Multi-Agent Systems 1 Introduction 2 Related Work and Contribution 3 PMASs: Parameterized MAS 3.1 Agent Formulae 3.2 Concurrent and Interleaved PMASs 4 A Practical Solution to the Reachability Problem for PMASs 4.1 MCMT: Model Checker Modulo Theories 4.2 MCMT Input Files for Interleaved and Concurrent PMASs 4.3 SAFE: the Swarm Safety Detector 5 Execution of SAFE-MCMT 5.1 A Further Example 6 Conclusions and Future Work References A Goal-Based Framework for Supporting Medical Assistance: The Case of Chronic Diseases 1 Introduction and Motivations 2 Preliminaries 3 Working Example 4 Proposed Framework 4.1 The Proposed Extension 4.2 Next Question Selection 5 The Framework in Action 6 Evaluation 7 Final Remarks References Optimal Control of Pedestrian Flows by Congestion Forecasts Satisfying User Equilibrium Conditions 1 Introduction 1.1 Related Work 2 Simulation Model and Problem Formulation 2.1 Simulation Model 2.2 Parameters 2.3 Problem Formulation 3 Algorithm 3.1 Finding Congestion Forecast 3.2 Optimizing the Proportion of Visitors Receiving Congestion Information 4 Computational Experiments 4.1 Experimental Settings 4.2 Comparison with Black-Box Optimization Methods 4.3 Optimization in Large-Scale Simulation 4.4 Scalability Analysis 4.5 Convergence Analysis 5 Conclusion References Short Papers Automated Negotiation Mechanism and Strategy for Compensational Vehicular Platooning 1 Introduction 2 Related Work 3 Model 3.1 Problem Solution 4 Negotiation Strategy 5 Experiments 6 Conclusion and Outlook References A Cognitive Agent Framework in Information Retrieval: Using User Beliefs to Customize Results 1 Introduction and Motivation 2 Rule-Based Agents 3 Belief Revision 3.1 AGM Belief Revision 3.2 Partial Entrenchment Ranking 3.3 Tracking Beliefs and Preferences 4 Knowledge Extraction from Documents - RAKE 5 Proposed Framework 5.1 Model Architecture 5.2 Extracting Knowledge and Belief Entrenchment 5.3 Revising Beliefs 5.4 Document Similarity and Result Filtering 6 Conclusion and Future Work References Deep Reinforcement Learning for Pedestrian Guidance 1 Introduction 2 Problem Settings 3 Proposed Method 4 Experiments 5 Results References NegMAS: A Platform for Automated Negotiations 1 Introduction 2 System Design 3 Tools and Common Components 4 Applications 5 Conclusions References Simulation of Unintentional Collusion Caused by Auto Pricing in Supply Chain Markets 1 Introduction 2 Related Works 3 Market Settings and Collusion Metric 4 Agents 5 Simulations 6 Results 7 Discussion 8 Conclusion References Construct an Artificial Population with Urban and Rural Population Differences Considered: To Support Long-Term Care System Evaluation by Agent-Based Simulation 1 Introduction 2 Datasets Preparation 2.1 Dataset Description 2.2 Method 3 An Algorithm for Population Construction 3.1 Method 3.2 Evaluation 4 Conclusion and Discussion References Multi-Agent Path Finding with Destination Choice 1 Introduction 2 MAPF with Destination Choice 2.1 Definition 2.2 Reduction from MAPF-DC to a Network Flow Problem 2.3 Formulation 3 Evaluation 3.1 Experimental Setups 3.2 Results 4 Conclusion References Abductive Design of BDI Agent-Based Digital Twins of Organizations 1 Introduction 2 Abductive Plan Recognition 3 Abductive Reasoning Cycle Recognition 4 Experimental Results 4.1 Evaluation 4.2 Complexity of the Abductive Approach 5 Conclusion References Beliefs, Time and Space: A Language for the Yōkai Board Game 1 Introduction 2 A Timed Language for Explicit and Implicit Belief 2.1 Static Language 2.2 Dynamic Extension 3 Conclusion References Argumentation-Based Explanations of Multimorbidity Treatment Plans 1 Introduction 2 Argumentation and Multimorbidity for NICE Pathways 3 Argumentation Model 4 Conclusion and Future Work References The Persistence of False Memory: Brain in a Vat Despite Perfect Clocks 1 Introduction 2 A Tribute to J. K. Rowling: Harry Potter\'s View 3 A Glimpse of Our Formal Results References Box-Office Prediction Based on Essential Features Extracted from Agent-Based Modeling 1 Introduction 2 Prediction Model 2.1 Features of Twitter 2.2 Features of Information Diffusion Model 2.3 Regression Analysis 3 Experiments 3.1 Datasets 3.2 Results of Prediction 4 Conclusions References Short Duration Aggregate Statistical Model Checking for Multi-Agent Systems 1 Introduction 2 Preliminaries and Related Work 3 Sampling Agent Populations 3.1 Sampling Attribute Values 3.2 The Sampling Approach 3.3 Cities and Population Movement 4 Experiments and Results References Author Index