A hybrid autonomic computing-based approach to distributed constraint satisfaction problems

0Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

Distributed constraint satisfaction problems (DisCSPs) are among the widely endeavored problems using agent-based simulation. Fernandez et al. formulated sensor and mobile tracking problem as a DisCSP, known as SensorDCSP In this paper, we adopt a customized ERE (environment, reactive rules and entities) algorithm for the SensorDCSP, which is otherwise proven as a computationally intractable problem. An amalgamation of the autonomy-oriented computing (AOC)-based algorithm (ERE) and genetic algorithm (GA) provides an early solution of the modeled DisCSP. Incorporation of GA into ERE facilitates auto-tuning of the simulation parameters, thereby leading to an early solution of constraint satisfaction. This study further contributes towards a model, built up in the NetLogo simulation environment, to infer the efficacy of the proposed approach.

Cite

CITATION STYLE

APA

Bhatia, A., Singh, A., & Goyal, R. (2015). A hybrid autonomic computing-based approach to distributed constraint satisfaction problems. Computers, 4(1), 2–23. https://doi.org/10.3390/computers4010002

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free