Spring bassed negotiation for conflict resolution in AGV scheduling:
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Edinburgh
1996
|
| Series: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
798 |
| Subjects: | |
| Summary: | 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." |
| Physical Description: | g6] S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011049806 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961111s1996 |||| 00||| engod | ||
| 035 | |a (OCoLC)35736617 | ||
| 035 | |a (DE-599)BVBBV011049806 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Huang, Xueyue |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Spring bassed negotiation for conflict resolution in AGV scheduling |c Huang, X. ; Hallam, J. |
| 264 | 1 | |a Edinburgh |c 1996 | |
| 300 | |a g6] S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 798 | |
| 520 | 3 | |a 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." | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Automated guided vehicle systems | |
| 650 | 4 | |a Constraints (Artificial intelligence) | |
| 650 | 4 | |a Negotiation | |
| 650 | 4 | |a Robots |x Programming | |
| 700 | 1 | |a Hallam, John |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 798 |w (DE-604)BV010450646 |9 798 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007400237 | ||
Record in the Search Index
| _version_ | 1804125539552722944 |
|---|---|
| any_adam_object | |
| author | Huang, Xueyue Hallam, John |
| author_facet | Huang, Xueyue Hallam, John |
| author_role | aut aut |
| author_sort | Huang, Xueyue |
| author_variant | x h xh j h jh |
| building | Verbundindex |
| bvnumber | BV011049806 |
| ctrlnum | (OCoLC)35736617 (DE-599)BVBBV011049806 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02459nam a2200361 cb4500</leader><controlfield tag="001">BV011049806</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961111s1996 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35736617</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011049806</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Huang, Xueyue</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Spring bassed negotiation for conflict resolution in AGV scheduling</subfield><subfield code="c">Huang, X. ; Hallam, J.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">g6] S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">798</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">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."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bionics and artificial intelligence</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automated guided vehicle systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraints (Artificial intelligence)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Negotiation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Robots</subfield><subfield code="x">Programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hallam, John</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">798</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">798</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007400237</subfield></datafield></record></collection> |
| id | DE-604.BV011049806 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:10Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007400237 |
| oclc_num | 35736617 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | g6] S. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Huang, Xueyue Verfasser aut Spring bassed negotiation for conflict resolution in AGV scheduling Huang, X. ; Hallam, J. Edinburgh 1996 g6] S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 798 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." Bionics and artificial intelligence sigle Computer software sigle Automated guided vehicle systems Constraints (Artificial intelligence) Negotiation Robots Programming Hallam, John Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 798 (DE-604)BV010450646 798 |
| spellingShingle | Huang, Xueyue Hallam, John Spring bassed negotiation for conflict resolution in AGV scheduling Bionics and artificial intelligence sigle Computer software sigle Automated guided vehicle systems Constraints (Artificial intelligence) Negotiation Robots Programming |
| title | Spring bassed negotiation for conflict resolution in AGV scheduling |
| title_auth | Spring bassed negotiation for conflict resolution in AGV scheduling |
| title_exact_search | Spring bassed negotiation for conflict resolution in AGV scheduling |
| title_full | Spring bassed negotiation for conflict resolution in AGV scheduling Huang, X. ; Hallam, J. |
| title_fullStr | Spring bassed negotiation for conflict resolution in AGV scheduling Huang, X. ; Hallam, J. |
| title_full_unstemmed | Spring bassed negotiation for conflict resolution in AGV scheduling Huang, X. ; Hallam, J. |
| title_short | Spring bassed negotiation for conflict resolution in AGV scheduling |
| title_sort | spring bassed negotiation for conflict resolution in agv scheduling |
| topic | Bionics and artificial intelligence sigle Computer software sigle Automated guided vehicle systems Constraints (Artificial intelligence) Negotiation Robots Programming |
| topic_facet | Bionics and artificial intelligence Computer software Automated guided vehicle systems Constraints (Artificial intelligence) Negotiation Robots Programming |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT huangxueyue springbassednegotiationforconflictresolutioninagvscheduling AT hallamjohn springbassednegotiationforconflictresolutioninagvscheduling |