The evaluation of the asynchronous search techniques in DisCSP-NetLogo
نویسندگان
چکیده
The implementation and evaluation of asynchronous search techniques can be done in any programming language allowing a distributed programming. Nevertheless, for the study of such techniques and for their evaluation, it is easier and more efficient to implement the techniques under certain distributed environments, which offer various facilities, such as NetLogo and are open-source. This article proposes a solution of evaluation for the asynchronous search techniques in NetLogo. This model will allow the use of the NetLogo environment as a basic simulator for the evaluation of asynchronous search techniques. Starting from the proposed evaluation model, we obtain one multi-agent system which can be used for implementing and evaluating the asynchronous search techniques, that can run on a single computer. Key–Words: constraints programming, distributed problems, asynchronous searching techniques, multi-agent systems.
منابع مشابه
Implementation and evaluation methodology for the asynchronous search techniques in DisCSP-NetLogo
The implementation and evaluation of asynchronous search techniques can be done in any programming language allowing a distributed programming. Nevertheless, for the study of such techniques and for their evaluation, it is easier and more efficient to implement the techniques under certain distributed environments, which offer various facilities, such as NetLogo and are open-source. This articl...
متن کاملEnhancing DisCSP-Netlogo from Simulation to Real-execution of Agents in Distributed Constraints
The use of agent-based simulation models in NetLogo for research is growing rapidly in a number of fields of science and engineering, including in computer science, for example for analyzing the performances of asynchronous search techniques based on distributed constraints. Distributed Constraint programming (DisCSP/DCOP) is a programming approach used to describe and solve large classes of pr...
متن کاملLarge Scale Multiagent-Based Simulation using NetLogo for implementation and evaluation of the distributed constraints
Distributed Constraint programming (DisCSP/DCOP) is a programming approach used to describe and solve large classes of problems such as searching, combinatorial and planning problems. This type of distributed modeling appears naturally in many problems for which the information is distributed among many agents. Modeling and simulation are essential tools in many areas of science and engineering...
متن کاملCompleteness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions the search into different subproblems of the DisCSP. The original proof of completeness of the APO algorithm is based on the growth of the size of the subproblems. The present paper demonstrates that this expected grow...
متن کاملCooperative problem solving against adversary: quantified distributed constraint satisfaction problem
In this paper, we extend the traditional formalization of distributed constraint satisfaction problems (DisCSP) to a quantified DisCSP. A quantified DisCSP includes several universally quantified variables, while all of the variables in a traditional DisCSP are existentially quantified. A universally quantified variable represents a choice of nature or an adversary. A quantified DisCSP formaliz...
متن کامل