Distributed Constraint Satisfaction: Foundations of Cooperation in Multi-agent Systems
When multiple agents are in a shared environment, there usually exist con straints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem in which the goal is to find a consistent combination of actions that satisfies these inter-age...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2001
|
| Ausgabe: | 1st ed. 2001 |
| Schriftenreihe: | Springer Series on Agent Technology
|
| Schlagworte: | |
| Online-Zugang: | UBY01 Volltext |
| Zusammenfassung: | When multiple agents are in a shared environment, there usually exist con straints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem in which the goal is to find a consistent combination of actions that satisfies these inter-agent constraints. More specifically, a distributed CSP is a constraint satisfaction problem (CSP) in which multiple agents are involved. A constraint satisfaction problem is a problem in which the goal is to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of artificial intelligence (AI) problems can be formalized as CSPs. Therefore, the research on CSPs has a long and distinguished history in AI (Mackworth 1992; Dechter 1992; Tsang 1993; Kumar 1992). A distributed CSP is a CSP in which variables and constraints are distributed among multiple autonomous agents. Various application problems in Multi-agent Systems (MAS) that are concerned with finding a consistent combination of agent actions can he formalized as dis tributed CSPs. Therefore, we can consid(~r distributed CSPs as a general framework for MAS, and algorithms for solving distributed CSPs as impor tant infrastructures for cooperation in MAS. This book gives an overview of the research on distributed CSPs, as well as introductory material on CSPs. In Chapter 1. we show the problem defi nition of normal, centralized CSPs and describe algorithms for solving CSPs |
| Beschreibung: | 1 Online-Ressource (XVII, 143 p) |
| ISBN: | 9783642595462 |
| DOI: | 10.1007/978-3-642-59546-2 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV047064757 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 201216s2001 |||| o||u| ||||||eng d | ||
| 020 | |a 9783642595462 |9 978-3-642-59546-2 | ||
| 024 | 7 | |a 10.1007/978-3-642-59546-2 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-3-642-59546-2 | ||
| 035 | |a (OCoLC)1227477528 | ||
| 035 | |a (DE-599)BVBBV047064757 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 082 | 0 | |a 006.3 |2 23 | |
| 084 | |a ST 285 |0 (DE-625)143648: |2 rvk | ||
| 084 | |a ST 300 |0 (DE-625)143650: |2 rvk | ||
| 084 | |a ST 301 |0 (DE-625)143651: |2 rvk | ||
| 100 | 1 | |a Yokoo, Makoto |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Distributed Constraint Satisfaction |b Foundations of Cooperation in Multi-agent Systems |c by Makoto Yokoo |
| 250 | |a 1st ed. 2001 | ||
| 264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 2001 | |
| 300 | |a 1 Online-Ressource (XVII, 143 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Springer Series on Agent Technology | |
| 520 | |a When multiple agents are in a shared environment, there usually exist con straints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem in which the goal is to find a consistent combination of actions that satisfies these inter-agent constraints. More specifically, a distributed CSP is a constraint satisfaction problem (CSP) in which multiple agents are involved. A constraint satisfaction problem is a problem in which the goal is to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of artificial intelligence (AI) problems can be formalized as CSPs. Therefore, the research on CSPs has a long and distinguished history in AI (Mackworth 1992; Dechter 1992; Tsang 1993; Kumar 1992). A distributed CSP is a CSP in which variables and constraints are distributed among multiple autonomous agents. Various application problems in Multi-agent Systems (MAS) that are concerned with finding a consistent combination of agent actions can he formalized as dis tributed CSPs. Therefore, we can consid(~r distributed CSPs as a general framework for MAS, and algorithms for solving distributed CSPs as impor tant infrastructures for cooperation in MAS. This book gives an overview of the research on distributed CSPs, as well as introductory material on CSPs. In Chapter 1. we show the problem defi nition of normal, centralized CSPs and describe algorithms for solving CSPs | ||
| 650 | 4 | |a Artificial Intelligence | |
| 650 | 4 | |a Algorithm Analysis and Problem Complexity | |
| 650 | 4 | |a Computer Communication Networks | |
| 650 | 4 | |a IT in Business | |
| 650 | 4 | |a Artificial intelligence | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computer communication systems | |
| 650 | 4 | |a Information technology | |
| 650 | 4 | |a Business—Data processing | |
| 650 | 0 | 7 | |a Constraint-Erfüllung |0 (DE-588)4580374-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Verteilte künstliche Intelligenz |0 (DE-588)4281805-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Mehragentensystem |0 (DE-588)4389058-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Mehragentensystem |0 (DE-588)4389058-1 |D s |
| 689 | 0 | 1 | |a Constraint-Erfüllung |0 (DE-588)4580374-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Verteilte künstliche Intelligenz |0 (DE-588)4281805-9 |D s |
| 689 | 1 | 1 | |a Constraint-Erfüllung |0 (DE-588)4580374-2 |D s |
| 689 | 1 | |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783642640209 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783540675969 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783642595479 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-642-59546-2 |x Verlag |z URL des Eerstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2000/2004 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032471869 | ||
| 966 | e | |u https://doi.org/10.1007/978-3-642-59546-2 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804182063194046464 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Yokoo, Makoto |
| author_facet | Yokoo, Makoto |
| author_role | aut |
| author_sort | Yokoo, Makoto |
| author_variant | m y my |
| building | Verbundindex |
| bvnumber | BV047064757 |
| classification_rvk | ST 285 ST 300 ST 301 |
| collection | ZDB-2-SCS |
| ctrlnum | (ZDB-2-SCS)978-3-642-59546-2 (OCoLC)1227477528 (DE-599)BVBBV047064757 |
| dewey-full | 006.3 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 006 - Special computer methods |
| dewey-raw | 006.3 |
| dewey-search | 006.3 |
| dewey-sort | 16.3 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1007/978-3-642-59546-2 |
| edition | 1st ed. 2001 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04052nmm a2200661zc 4500</leader><controlfield tag="001">BV047064757</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2001 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783642595462</subfield><subfield code="9">978-3-642-59546-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-642-59546-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-3-642-59546-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227477528</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047064757</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">006.3</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 285</subfield><subfield code="0">(DE-625)143648:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 300</subfield><subfield code="0">(DE-625)143650:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 301</subfield><subfield code="0">(DE-625)143651:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Yokoo, Makoto</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed Constraint Satisfaction</subfield><subfield code="b">Foundations of Cooperation in Multi-agent Systems</subfield><subfield code="c">by Makoto Yokoo</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2001</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XVII, 143 p)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Springer Series on Agent Technology</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">When multiple agents are in a shared environment, there usually exist con straints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem in which the goal is to find a consistent combination of actions that satisfies these inter-agent constraints. More specifically, a distributed CSP is a constraint satisfaction problem (CSP) in which multiple agents are involved. A constraint satisfaction problem is a problem in which the goal is to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of artificial intelligence (AI) problems can be formalized as CSPs. Therefore, the research on CSPs has a long and distinguished history in AI (Mackworth 1992; Dechter 1992; Tsang 1993; Kumar 1992). A distributed CSP is a CSP in which variables and constraints are distributed among multiple autonomous agents. Various application problems in Multi-agent Systems (MAS) that are concerned with finding a consistent combination of agent actions can he formalized as dis tributed CSPs. Therefore, we can consid(~r distributed CSPs as a general framework for MAS, and algorithms for solving distributed CSPs as impor tant infrastructures for cooperation in MAS. This book gives an overview of the research on distributed CSPs, as well as introductory material on CSPs. In Chapter 1. we show the problem defi nition of normal, centralized CSPs and describe algorithms for solving CSPs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial Intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer Communication Networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">IT in Business</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Artificial intelligence</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer communication systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information technology</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Business—Data processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Constraint-Erfüllung</subfield><subfield code="0">(DE-588)4580374-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verteilte künstliche Intelligenz</subfield><subfield code="0">(DE-588)4281805-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mehragentensystem</subfield><subfield code="0">(DE-588)4389058-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Mehragentensystem</subfield><subfield code="0">(DE-588)4389058-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Constraint-Erfüllung</subfield><subfield code="0">(DE-588)4580374-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Verteilte künstliche Intelligenz</subfield><subfield code="0">(DE-588)4281805-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Constraint-Erfüllung</subfield><subfield code="0">(DE-588)4580374-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783642640209</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783540675969</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783642595479</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-642-59546-2</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Eerstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2000/2004</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032471869</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-642-59546-2</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">ZDB-2-SCS_2000/2004</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV047064757 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T16:12:23Z |
| indexdate | 2024-07-10T09:01:35Z |
| institution | BVB |
| isbn | 9783642595462 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471869 |
| oclc_num | 1227477528 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 1 Online-Ressource (XVII, 143 p) |
| psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Springer Berlin Heidelberg |
| record_format | marc |
| series2 | Springer Series on Agent Technology |
| spelling | Yokoo, Makoto Verfasser aut Distributed Constraint Satisfaction Foundations of Cooperation in Multi-agent Systems by Makoto Yokoo 1st ed. 2001 Berlin, Heidelberg Springer Berlin Heidelberg 2001 1 Online-Ressource (XVII, 143 p) txt rdacontent c rdamedia cr rdacarrier Springer Series on Agent Technology When multiple agents are in a shared environment, there usually exist con straints among the possible actions of these agents. A distributed constraint satisfaction problem (distributed CSP) is a problem in which the goal is to find a consistent combination of actions that satisfies these inter-agent constraints. More specifically, a distributed CSP is a constraint satisfaction problem (CSP) in which multiple agents are involved. A constraint satisfaction problem is a problem in which the goal is to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of artificial intelligence (AI) problems can be formalized as CSPs. Therefore, the research on CSPs has a long and distinguished history in AI (Mackworth 1992; Dechter 1992; Tsang 1993; Kumar 1992). A distributed CSP is a CSP in which variables and constraints are distributed among multiple autonomous agents. Various application problems in Multi-agent Systems (MAS) that are concerned with finding a consistent combination of agent actions can he formalized as dis tributed CSPs. Therefore, we can consid(~r distributed CSPs as a general framework for MAS, and algorithms for solving distributed CSPs as impor tant infrastructures for cooperation in MAS. This book gives an overview of the research on distributed CSPs, as well as introductory material on CSPs. In Chapter 1. we show the problem defi nition of normal, centralized CSPs and describe algorithms for solving CSPs Artificial Intelligence Algorithm Analysis and Problem Complexity Computer Communication Networks IT in Business Artificial intelligence Algorithms Computer communication systems Information technology Business—Data processing Constraint-Erfüllung (DE-588)4580374-2 gnd rswk-swf Verteilte künstliche Intelligenz (DE-588)4281805-9 gnd rswk-swf Mehragentensystem (DE-588)4389058-1 gnd rswk-swf Mehragentensystem (DE-588)4389058-1 s Constraint-Erfüllung (DE-588)4580374-2 s DE-604 Verteilte künstliche Intelligenz (DE-588)4281805-9 s Erscheint auch als Druck-Ausgabe 9783642640209 Erscheint auch als Druck-Ausgabe 9783540675969 Erscheint auch als Druck-Ausgabe 9783642595479 https://doi.org/10.1007/978-3-642-59546-2 Verlag URL des Eerstveröffentlichers Volltext |
| spellingShingle | Yokoo, Makoto Distributed Constraint Satisfaction Foundations of Cooperation in Multi-agent Systems Artificial Intelligence Algorithm Analysis and Problem Complexity Computer Communication Networks IT in Business Artificial intelligence Algorithms Computer communication systems Information technology Business—Data processing Constraint-Erfüllung (DE-588)4580374-2 gnd Verteilte künstliche Intelligenz (DE-588)4281805-9 gnd Mehragentensystem (DE-588)4389058-1 gnd |
| subject_GND | (DE-588)4580374-2 (DE-588)4281805-9 (DE-588)4389058-1 |
| title | Distributed Constraint Satisfaction Foundations of Cooperation in Multi-agent Systems |
| title_auth | Distributed Constraint Satisfaction Foundations of Cooperation in Multi-agent Systems |
| title_exact_search | Distributed Constraint Satisfaction Foundations of Cooperation in Multi-agent Systems |
| title_exact_search_txtP | Distributed Constraint Satisfaction Foundations of Cooperation in Multi-agent Systems |
| title_full | Distributed Constraint Satisfaction Foundations of Cooperation in Multi-agent Systems by Makoto Yokoo |
| title_fullStr | Distributed Constraint Satisfaction Foundations of Cooperation in Multi-agent Systems by Makoto Yokoo |
| title_full_unstemmed | Distributed Constraint Satisfaction Foundations of Cooperation in Multi-agent Systems by Makoto Yokoo |
| title_short | Distributed Constraint Satisfaction |
| title_sort | distributed constraint satisfaction foundations of cooperation in multi agent systems |
| title_sub | Foundations of Cooperation in Multi-agent Systems |
| topic | Artificial Intelligence Algorithm Analysis and Problem Complexity Computer Communication Networks IT in Business Artificial intelligence Algorithms Computer communication systems Information technology Business—Data processing Constraint-Erfüllung (DE-588)4580374-2 gnd Verteilte künstliche Intelligenz (DE-588)4281805-9 gnd Mehragentensystem (DE-588)4389058-1 gnd |
| topic_facet | Artificial Intelligence Algorithm Analysis and Problem Complexity Computer Communication Networks IT in Business Artificial intelligence Algorithms Computer communication systems Information technology Business—Data processing Constraint-Erfüllung Verteilte künstliche Intelligenz Mehragentensystem |
| url | https://doi.org/10.1007/978-3-642-59546-2 |
| work_keys_str_mv | AT yokoomakoto distributedconstraintsatisfactionfoundationsofcooperationinmultiagentsystems |