Abstract: "Scheduling Problems can be solved by approaches from Distributed Artificial Intelligence (DAI). Negotiation is often taken as a powerful way of resolving conflicts between agents. In this paper, based on discussion of Kwa's negotiation model (6) for solving AGV movement scheduli...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Huang, Xueyue (VerfasserIn), Hallam, John (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Edinburgh 1996
Schriftenreihe:	University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 798
Schlagworte:	Bionics and artificial intelligence Computer software Automated guided vehicle systems Constraints (Artificial intelligence) Negotiation Robots > Programming
Zusammenfassung:	Abstract: "Scheduling Problems can be solved by approaches from Distributed Artificial Intelligence (DAI). Negotiation is often taken as a powerful way of resolving conflicts between agents. In this paper, based on discussion of Kwa's negotiation model (6) for solving AGV movement scheduling problems, we propose what we call a spring-based negotiaition [sic] model to overcome the deficiencies in Kwa's model. We view a scheduling problem as a constraint satisfaction problem (CSP) and constraints are categorized into soft constraints and hard constraints. Hard constraints must be strictly satisfied and soft constraints can be relaxed but are expected to be satisfied as well as possible. We use springs to represent soft constraints. The scheduling problem is solved in a multiple negotiating agent system in which each agent is responsible for solving a local scheduling problem. Any local schedule is represented by a spring model. When one agent detects a situation in which its local schedule is in conflict with that of another agent, then it initiates a negotiation process during which conflicting agents exchange their information, commencing with proposals. A proposal consists of an intention and an explanation."
Beschreibung:	g6] S.