An a-team based architecture for constraint programming

Authors:
Yujun Zheng;Lianlai Wang;Jinyun Xue
Affiliations:
Systems Engineering Institute of Engineer Equipment, Beijing, China;Systems Engineering Institute of Engineer Equipment, Beijing, China;Institute of Software, Chinese Academy of Sciences, Beijing, China
Venue:
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
Year:
2006

Citing 5
Cited 1

A high-level derivation of global search algorithms (with constraint propagation)

Science of Computer Programming - Special issue: on formal specifications: foundations, methods, tools and applications: selected papers from the FMTA '95 conference (29–31 May 1995, Konstancin n. Warsaw, Poland)
An Agent-Based Approach for Scheduling Multiple Machines

Applied Intelligence
Optimization-Oriented Global Constraints

Constraints
Asynchronous Teams: Cooperation Schemes for Autonomous Agents

Journal of Heuristics
Semirings for Soft Constraint Solving and Programming (LECTURE NOTES IN COMPUTER SCIENCE)

Semirings for Soft Constraint Solving and Programming (LECTURE NOTES IN COMPUTER SCIENCE)

Agent based framework for emergency rescue and assistance planning

PAISI'07 Proceedings of the 2007 Pacific Asia conference on Intelligence and security informatics

Quantified Score

Hi-index	0.02

Visualization

Abstract

The paper proposes an agent-based constraint programming architecture that we have successfully applied to solve large, particularly combinatorial, operations problems. The architecture is based on the asynchronous team (A-Team) in which multiple problem solving agents cooperate with each other by exchanging results to produce a set of non-dominated solutions. We extend the A-Team by introducing CSP-specific agents, explicitly defining solution states, and enabling solution decomposition/composition, and thereby improve the performance, reliability, and automation of constraint programming significantly.