A Hybrid Autonomic Computing-Based Approach to Distributed Constraint Satisfaction Problems

被引:2
|
作者
Bhatia, Abhishek [1 ]
Singh, Amandeep [1 ]
Goyal, Rinkaj [1 ]
机构
[1] GGS Indraprastha Univ, Univ Sch Informat & Commun Technol USICT, Sect Dwarka 16C, New Delhi 110078, India
关键词
distributed constraint satisfaction problems; autonomic computing; agent-based simulation; genetic algorithm; NetLogo;
D O I
10.3390/computers4010002
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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.
引用
收藏
页码:2 / 23
页数:22
相关论文
共 50 条
  • [1] A hybrid approach to Distributed Constraint Satisfaction
    Lee, David
    Arana, Ines
    Ahriz, Hatem
    Hui, Kit-Ying
    ARTIFICIAL INTELLIGENCE: METHODOLOGY, SYSTEMS, AND APPLICATIONS, 2008, 5253 : 375 - 379
  • [2] An approach to over-constrained distributed constraint satisfaction problems: Distributed hierarchical constraint satisfaction
    Hirayama, K
    Yokoo, M
    FOURTH INTERNATIONAL CONFERENCE ON MULTIAGENT SYSTEMS, PROCEEDINGS, 2000, : 135 - 142
  • [3] An Autonomic Computing-based Architecture for Cloud Computing Elasticity
    Coutinho, Emanuel Ferreira
    Gomes, Danielo Goncalves
    de Souza, Jose Neuman
    LANOMS 2015 8TH LATIN AMERICAN NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM, 2015, : 111 - 112
  • [4] Distributed splitting of constraint satisfaction problems
    Arbab, F
    Monfroy, E
    COORDINATION LANGUAGES AND MODELS, PROCEEDINGS, 2000, 1906 : 115 - 132
  • [5] An Evolutionary Computing-Based Efficient Hybrid Task Scheduling Approach for Heterogeneous Computing Environment
    Sulaiman, Muhammad
    Halim, Zahid
    Lebbah, Mustapha
    Waqas, Muhammad
    Tu, Shanshan
    JOURNAL OF GRID COMPUTING, 2021, 19 (01)
  • [6] An Evolutionary Computing-Based Efficient Hybrid Task Scheduling Approach for Heterogeneous Computing Environment
    Muhammad Sulaiman
    Zahid Halim
    Mustapha Lebbah
    Muhammad Waqas
    Shanshan Tu
    Journal of Grid Computing, 2021, 19
  • [7] A novel distributed dynamic planning approach based on constraint satisfaction
    Dehimi, Nour El Houda
    Guerram, Tahar
    Tolba, Zakaria
    Mokhati, Farid
    MULTIAGENT AND GRID SYSTEMS, 2018, 14 (03) : 243 - 261
  • [8] On communication in solving Distributed Constraint Satisfaction Problems
    Jung, H
    Tambe, M
    MULTI-AGENT SYSTEMS AND APPLICATIONS IV, PROCEEDINGS, 2005, 3690 : 418 - 429
  • [9] Algebraic approach to constraint satisfaction problems
    1600, Morgan Kaufmann Publ Inc, San Mateo, CA, USA (01):
  • [10] Distributed constraint satisfaction problems to model railway scheduling problems
    Tormos, P.
    Abril, M.
    Salido, M. A.
    Barber, F.
    Ingolotti, L.
    Lova, A.
    COMPUTERS IN RAILWAYS X: COMPUTER SYSTEM DESIGN AND OPERATION IN THE RAILWAY AND OTHER TRANSIT SYSTEMS, 2006, 88 : 289 - +