Mas NetLogo Models

MAS Netlogo Models for Asyncronous Search Technique

These are NetLogo models that implement asynchronous search techniques. Click on the title name to see the applet running and get the source code.

If you use or refer to a model from the NetLogo Models, we ask that you cite it as follows:

I. Muscalagiu, J. M. Vidal and H.E. Popa. MAS NetLogo Models, http://discsp-netlogo.fih.upt.ro/, 2007-2014.

Title	Description	Last Modified
Asynchronous Weak-Commitment Search-AWCS:
Graph Coloring using Asynchronous Weak-Commitment by Ionel Muscalagiu, Jose M. Vidal	This is the implementation of the Asynchronous Weak-Commitment Search for the graph coloring problem (SIES). We solve the graph coloring problem using the AWCS algorithm from Makoto Yokoo and Katsutoshi Hirayama. Algorithms for Distributed Constraint Satisfaction: A Review. Autonomous Agents and Multi-Agent Systems, 3(2):185--207, 2000.	14 October 2007
Graph Coloring using Asynchronous Weak-Commitment- no synchronisation by Ionel Muscalagiu, Jose M. Vidal	This is the implementation of the Asynchronous Weak-Commitment Search for the graph coloring problem (SIEAS). We solve the graph coloring problem using the AWCS algorithm from Makoto Yokoo and Katsutoshi Hirayama. Algorithms for Distributed Constraint Satisfaction: A Review. Autonomous Agents and Multi-Agent Systems, 3(2):185--207, 2000.	14 October 2007
Graph Coloring using Asynchronous Weak-Commitment with message management (no synchronisation) by Ionel Muscalagiu, Jose M. Vidal	This is the implementation of the Asynchronous Weak-Commitment Search with message management for the graph coloring problem (SIEAS). We solve the graph coloring problem using the AWCS algorithm from Makoto Yokoo and Katsutoshi Hirayama. Algorithms for Distributed Constraint Satisfaction: A Review. Autonomous Agents and Multi-Agent Systems, 3(2):185--207, 2000.	14 October 2007
Graph Coloring using Asynchronous Weak-Commitment with the resolved-based learning by Ionel Muscalagiu, Jose M. Vidal	This is the implementation of the Asynchronous Weak-Commitment Search with the resolved-based learning for the graph coloring problem.(SIES). We solve the graph coloring problem using the AWCS algorithm from Makoto Yokoo and Katsutoshi Hirayama. Algorithms for Distributed Constraint Satisfaction: A Review. Autonomous Agents and Multi-Agent Systems, 3(2):185--207, 2000. Katsutoshi Hirayama and Makoto Yokoo. The Effect of Nogood Learning in Distributed Constraint Satisfaction In Proceedings of the 20th IEEE International Conf. on Distributed Computing Systems, pages 169--177, 2000.	14 October 2007
Graph Coloring using Asynchronous Weak-Commitment with the resolved-based learning (no synchronisation) by Ionel Muscalagiu, Jose M. Vidal	This is the implementation of the Asynchronous Weak-Commitment Search with the resolved-based learning for the graph coloring problem.(SIEAS). We solve the graph coloring problem using the AWCS algorithm from Makoto Yokoo and Katsutoshi Hirayama. Algorithms for Distributed Constraint Satisfaction: A Review. Autonomous Agents and Multi-Agent Systems, 3(2):185--207, 2000. Katsutoshi Hirayama and Makoto Yokoo. The Effect of Nogood Learning in Distributed Constraint Satisfaction In Proceedings of the 20th IEEE International Conf. on Distributed Computing Systems, pages 169--177, 2000.	19 October 2007
Graph Coloring using Asynchronous Weak-Commitment with nogood processor by Ionel Muscalagiu, Jose M. Vidal	This is the implementation of the Asynchronous Weak-Commitment Search with nogood processor for the graph coloring problem. We adapt the nogood processor technique from Armstrong A., Durfee E. Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems. In. Proceedings of the 15th IJCAI, Nagoya, Japan, 620-625, 1997. We solve the graph coloring problem using the AWCS algorithm (with nogood processor centralized) from Makoto Yokoo and Katsutoshi Hirayama. Algorithms for Distributed Constraint Satisfaction: A Review. Autonomous Agents and Multi-Agent Systems, 3(2):185--207, 2000. Ionel Muscalagiu and Valdimir Cretu. Improving the Performances of Asynchronous Algorithms by Combining the Nogood Processors with the Nogood Learning Techniques. Journal "INFORMATICA" Lithuania, Vol. 17, Nr 1, 2006, pp (39-54).	14 October 2007
Random binary CSPs using Asynchronous Weak-Commitment by Ionel Muscalagiu, Jose M. Vidal and Hong Jiang	This is the implementation of the Asynchronous Weak-Commitment algorithm for the random binary problems (SIES). We generate and solve the random binary problem using the Asynchronous Weak-Commitment algorithm from Makoto Yokoo and Katsutoshi Hirayama. Algorithms for Distributed Constraint Satisfaction: A Review. Autonomous Agents and Multi-Agent Systems, 3(2):185--207, 2000.	14 October 2007
Asynchronous Backtracking-ABT:
Graph Coloring using ABT kernel - derived in Asynchronous Backtracking by Ionel Muscalagiu, Jose M. Vidal	This is the implementation of the Asynchronous Backtracking for the graph coloring problem (SIES). We solve the graph coloring problem using the ABT kernel algorithm (derived in Asynchronous Backtracking ) from C. Bessiere, I. Brito, A. Maestre, P. Meseguer. Asynchronous Backtracking without Adding Links: A New Member in the ABT Family . Artificial Intelligence, volume 161, pages 7-24.	14 October 2007
Graph Coloring using ABT kernel - derived in Asynchronous Backtracking - no synchronisation by Ionel Muscalagiu, Jose M. Vidal	This is the implementation of the Asynchronous Backtracking for the graph coloring problem (SIEAS). We solve the graph coloring problem using the ABT kernel algorithm (derived in Asynchronous Backtracking ) from C. Bessiere, I. Brito, A. Maestre, P. Meseguer. Asynchronous Backtracking without Adding Links: A New Member in the ABT Family . Artificial Intelligence, volume 161, pages 7-24.	14 October 2007
Graph Coloring using Asychronous Backtracking with Message Manager by Hong Jiang, Jose M. Vidal	An implementation of the Asynchronous Backtracking algorithm with Message Manager (MMABT) from Hong Jiang and Jose M. Vidal. Reducing Redundant Messages in the Asynchronous Backtracking Algorithm. In Proceedings of the Sixth International Workshop on Distributed Constraint Reasoning, 2005.	30 August 2007
Graph Coloring using Asychronous Backtracking by Hong Jiang, Jose M. Vidal	An implementation of the Asynchronous Backtracking algorithm from Makoto Yokoo and Katsutoshi Hirayama. Algorithms for Distributed Constraint Satisfaction: A Review. Autonomous Agents and Multi-Agent Systems, 3(2):185--207, 2000.	30 August 2007
Random binary CSPs using Asynchronous Backtracking by Ionel Muscalagiu, Jose M. Vidal and Hong Jiang	This is the implementation of the Asynchronous Backtracking algorithm for the random binary problems (SIES). We generate and solve the random binary problem using the Asynchronous Backtracking algorithm from Makoto Yokoo and Katsutoshi Hirayama. Algorithms for Distributed Constraint Satisfaction: A Review. Autonomous Agents and Multi-Agent Systems, 3(2):185--207, 2000.	14 October 2007
Asynchronous Backtracking-ABT with variable-ordering heuristics:
Random binary CSPs using Asynchronous Backtracking with a standard degree-based variable-ordering heuristic by Ionel Muscalagiu, Jose M. Vidal	This is the implementation of the Asynchronous Backtracking algorithm for the random binary problems (SIES). The priority order among agents is determined with a standard degree-based variable-ordering heuristic. Variables are ordered before the start of the run of the search algorithm and the order is not changed during the run of the algorithm. The max-degree heuristic [Dechter 1988], orders the variables from last to first by selecting, at each stage, a node in the constraint graph which has a minimal degree in the graph remaining after deleting from the graph all nodes which have been selected already.We generate and solve the random binary problem using the Asynchronous Backtracking algorithm from Makoto Yokoo and Katsutoshi Hirayama. Algorithms for Distributed Constraint Satisfaction: A Review. Autonomous Agents and Multi-Agent Systems, 3(2):185--207, 2000. Dechter, R., Pearl, J. Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence, 34:1-38, 1988.	11 April 2013
Distributed Dynamic Backtracking-DisDB:
Graph Coloring using ABT kernel - derived in Distributed Dynamic Backtracking by Ionel Muscalagiu, Jose M. Vidal	This is the implementation of the Distributed Dynamic Backtracking for the graph coloring problem (SIES). We solve the graph coloring problem using the ABT kernel algorithm (derived in Distributed Dynamic Backtracking ) from C. Bessiere, I. Brito, A. Maestre, P. Meseguer. Asynchronous Backtracking without Adding Links: A New Member in the ABT Family . Artificial Intelligence, volume 161, pages 7-24.	14 October 2007
Graph Coloring using DisDB(old interface) by Ionel Muscalagiu and Jose M Vidal	We solve the graph coloring problem using the DisDB algorithm from Christian Bessiere, Arnold Maestre, Pedro Meseguer. Distributed Dynamic Backtracking (english version). or Distributed Dynamic Backtracking. In Proceedings of the CP00 Workshop on Distributed Constraint Satisfaction Problems, Singapore, Thailand, 2000.	11 August 2004
NQueens DisDB (Distributed Dynamic Backtracking) by Muscalagiu Ionel	This is the N-Queens problem solution using Distributed Dynamic Backtracking-DisDB as outlined in Christian Bessiere, Arnold Maestre, Pedro Meseguer. Distributed Dynamic Backtracking. C. Bessiere, A. Maestre, and P. Meseguer. In M.C. Silaghi, editor, Proceedings of the IJCAI'01 workshop on Distributed Constraint Reasoning, Seattle WA, pages 9-16.	31 July 2004
ABT kernel:
Graph Coloring using ABT kernel by Ionel Muscalagiu, Jose M. Vidal	This is the implementation of the ABT kernel for the graph coloring problem (SIES). We solve the graph coloring problem using the ABT kernel algorithm from C. Bessiere, I. Brito, A. Maestre, P. Meseguer. "Asynchronous Backtracking without Adding Links: A New Member in the ABT Family" . Artificial Intelligence, volume 161, pages 7-24. 2005.	06 October 2007
Graph Coloring using ABT kernel - derived in Asynchronous Backtracking with temporary links by Ionel Muscalagiu, Jose M. Vidal	This is the implementation of the Asynchronous Backtracking with temporary links for the graph coloring problem (SIES). We solve the graph coloring problem using the ABT kernel algorithm (derived in Asynchronous Backtracking with temporary links ) from C. Bessiere, I. Brito, A. Maestre, P. Meseguer. Asynchronous Backtracking without Adding Links: A New Member in the ABT Family . Artificial Intelligence, volume 161, pages 7-24.	14 October 2007
Random binary CSPs using ABT kernel by Ionel Muscalagiu, Jose M. Vidal and Hong Jiang	This is the implementation of the ABT kernel algorithm for the random binary problems (SIES). We generate and solve the random binary problem using the ABT kernel algorithm from C. Bessiere, I. Brito, A. Maestre, P. Meseguer. "Asynchronous Backtracking without Adding Links: A New Member in the ABT Family" . Artificial Intelligence, volume 161, pages 7-24. 2005.	14 October 2007
NQueens ABT kernel by Muscalagiu Ionel	This is the N-Queens problem solution using ABT kernel as outlined in Christian Bessiere, Arnold Maestre, Pedro Meseguer. The ABT family. In Proceedings of JFNP, 2002	06 October 2007
ABT with temporary links :
Random binary CSPs using ABT with temporary links by Ionel Muscalagiu, Jose M. Vidal and Popa Horia	This is the implementation of the ABT with temporary links for the random binary problems (SIES). We generate and solve the random binary problem using the ABT with temporary links algorithm.	10 July 2011
Distributed Bactracking with Sessions (DBS):
Graph Coloring using DBS by Ionel Muscalagiu and Jose M Vidal	This is the implementation of the Distributed Bactracking with Sessions (DBS) algorithms for the graph coloring problem. (SIES). We generate and solve the graph coloring problem using the Distributed Bactracking with Sessions (DBS) algorithms from Pierre Monier, Sylvain Piechowiak and René Mandiau. "A complete algorithm for DisCSP: Distributed Backtracking with Sessions (DBS)" . In Second International Workshop on: Optimisation in Multi-Agent Systems (OptMas), Eigth Joint Conference on Autonomous and Multi-Agent Systems (AAMAS 2009), Budapest, Hungary.	29 March 2013
The Asynchronous Distributed OPTimization (ADOPT):
Graph Coloring using ADOPT by Jose M Vidal and Ionel Muscalagiu	This is the implementation of the Asynchronous Distributed OPTimization (ADOPT) algorithms for the graph coloring problem. We generate and solve the graph coloring problem using the Asynchronous Distributed OPTimization (ADOPT) algorithms from Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, and Makoto Yokoo. ADOPT: Asynchronous distributed constraint optimization with quality guarantees. In Artificial Intelligence, 161:149–180, January, 2005	29 March 2013

Last modified Friday, 29 March 2013, 12:00AM. Send comments to Ionel Muscalagiu

MAS Netlogo Models for Asyncronous Search Technique

Asynchronous Weak-Commitment Search-AWCS:

Asynchronous Backtracking-ABT:

Asynchronous Backtracking-ABT with variable-ordering heuristics:

Distributed Dynamic Backtracking-DisDB: