Modeling the transportation domain
Abstract The transportation domain is presented as a multi-agent scenario and the use of techniques of Distributed Artificial Intelligence (DAI) for solving cooperatively the hard problems that occur in this domain are demonstrated. After a motivation and a description of the domain we will address...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Fischer, K. [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
1995 |
|---|
| Anmerkung: |
© Kluwer Academic Publishers 1995 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Computational economics - Kluwer Academic Publishers, 1993, 8(1995), 2 vom: Mai, Seite 81-93 |
|---|---|
| Übergeordnetes Werk: |
volume:8 ; year:1995 ; number:2 ; month:05 ; pages:81-93 |
| Links: |
|---|
| DOI / URN: |
10.1007/BF01299711 |
|---|
| Katalog-ID: |
OLC2026992754 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2026992754 | ||
| 003 | DE-627 | ||
| 005 | 20230503034221.0 | ||
| 007 | tu | ||
| 008 | 200819s1995 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/BF01299711 |2 doi | |
| 035 | |a (DE-627)OLC2026992754 | ||
| 035 | |a (DE-He213)BF01299711-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 330 |a 650 |a 004 |q VZ |
| 084 | |a 3,2 |2 ssgn | ||
| 100 | 1 | |a Fischer, K. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Modeling the transportation domain |
| 264 | 1 | |c 1995 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Kluwer Academic Publishers 1995 | ||
| 520 | |a Abstract The transportation domain is presented as a multi-agent scenario and the use of techniques of Distributed Artificial Intelligence (DAI) for solving cooperatively the hard problems that occur in this domain are demonstrated. After a motivation and a description of the domain we will address questions of cooperation between the agents, techniques for task decomposition and task allocation, and multi-agent planning and scheduling. By introducing a cooperation protocol, examples will be presented that show the utility of the approach. Finally, some implementation aspects will be considered. | ||
| 700 | 1 | |a Kuhn, N. |4 aut | |
| 700 | 1 | |a Müller, H. J. |4 aut | |
| 700 | 1 | |a Müller, J. P. |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Computational economics |d Kluwer Academic Publishers, 1993 |g 8(1995), 2 vom: Mai, Seite 81-93 |w (DE-627)131178121 |w (DE-600)1142021-2 |w (DE-576)033040664 |x 0927-7099 |7 nnns |
| 773 | 1 | 8 | |g volume:8 |g year:1995 |g number:2 |g month:05 |g pages:81-93 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/BF01299711 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a GBV_ILN_26 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2009 | ||
| 912 | |a GBV_ILN_2020 | ||
| 912 | |a GBV_ILN_4012 | ||
| 912 | |a GBV_ILN_4029 | ||
| 912 | |a GBV_ILN_4310 | ||
| 912 | |a GBV_ILN_4318 | ||
| 951 | |a AR | ||
| 952 | |d 8 |j 1995 |e 2 |c 05 |h 81-93 | ||
| author_variant |
k f kf n k nk h j m hj hjm j p m jp jpm |
|---|---|
| matchkey_str |
article:09277099:1995----::oeightasot |
| hierarchy_sort_str |
1995 |
| publishDate |
1995 |
| allfields |
10.1007/BF01299711 doi (DE-627)OLC2026992754 (DE-He213)BF01299711-p DE-627 ger DE-627 rakwb eng 330 650 004 VZ 3,2 ssgn Fischer, K. verfasserin aut Modeling the transportation domain 1995 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 1995 Abstract The transportation domain is presented as a multi-agent scenario and the use of techniques of Distributed Artificial Intelligence (DAI) for solving cooperatively the hard problems that occur in this domain are demonstrated. After a motivation and a description of the domain we will address questions of cooperation between the agents, techniques for task decomposition and task allocation, and multi-agent planning and scheduling. By introducing a cooperation protocol, examples will be presented that show the utility of the approach. Finally, some implementation aspects will be considered. Kuhn, N. aut Müller, H. J. aut Müller, J. P. aut Enthalten in Computational economics Kluwer Academic Publishers, 1993 8(1995), 2 vom: Mai, Seite 81-93 (DE-627)131178121 (DE-600)1142021-2 (DE-576)033040664 0927-7099 nnns volume:8 year:1995 number:2 month:05 pages:81-93 https://doi.org/10.1007/BF01299711 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_26 GBV_ILN_70 GBV_ILN_2009 GBV_ILN_2020 GBV_ILN_4012 GBV_ILN_4029 GBV_ILN_4310 GBV_ILN_4318 AR 8 1995 2 05 81-93 |
| spelling |
10.1007/BF01299711 doi (DE-627)OLC2026992754 (DE-He213)BF01299711-p DE-627 ger DE-627 rakwb eng 330 650 004 VZ 3,2 ssgn Fischer, K. verfasserin aut Modeling the transportation domain 1995 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 1995 Abstract The transportation domain is presented as a multi-agent scenario and the use of techniques of Distributed Artificial Intelligence (DAI) for solving cooperatively the hard problems that occur in this domain are demonstrated. After a motivation and a description of the domain we will address questions of cooperation between the agents, techniques for task decomposition and task allocation, and multi-agent planning and scheduling. By introducing a cooperation protocol, examples will be presented that show the utility of the approach. Finally, some implementation aspects will be considered. Kuhn, N. aut Müller, H. J. aut Müller, J. P. aut Enthalten in Computational economics Kluwer Academic Publishers, 1993 8(1995), 2 vom: Mai, Seite 81-93 (DE-627)131178121 (DE-600)1142021-2 (DE-576)033040664 0927-7099 nnns volume:8 year:1995 number:2 month:05 pages:81-93 https://doi.org/10.1007/BF01299711 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_26 GBV_ILN_70 GBV_ILN_2009 GBV_ILN_2020 GBV_ILN_4012 GBV_ILN_4029 GBV_ILN_4310 GBV_ILN_4318 AR 8 1995 2 05 81-93 |
| allfields_unstemmed |
10.1007/BF01299711 doi (DE-627)OLC2026992754 (DE-He213)BF01299711-p DE-627 ger DE-627 rakwb eng 330 650 004 VZ 3,2 ssgn Fischer, K. verfasserin aut Modeling the transportation domain 1995 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 1995 Abstract The transportation domain is presented as a multi-agent scenario and the use of techniques of Distributed Artificial Intelligence (DAI) for solving cooperatively the hard problems that occur in this domain are demonstrated. After a motivation and a description of the domain we will address questions of cooperation between the agents, techniques for task decomposition and task allocation, and multi-agent planning and scheduling. By introducing a cooperation protocol, examples will be presented that show the utility of the approach. Finally, some implementation aspects will be considered. Kuhn, N. aut Müller, H. J. aut Müller, J. P. aut Enthalten in Computational economics Kluwer Academic Publishers, 1993 8(1995), 2 vom: Mai, Seite 81-93 (DE-627)131178121 (DE-600)1142021-2 (DE-576)033040664 0927-7099 nnns volume:8 year:1995 number:2 month:05 pages:81-93 https://doi.org/10.1007/BF01299711 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_26 GBV_ILN_70 GBV_ILN_2009 GBV_ILN_2020 GBV_ILN_4012 GBV_ILN_4029 GBV_ILN_4310 GBV_ILN_4318 AR 8 1995 2 05 81-93 |
| allfieldsGer |
10.1007/BF01299711 doi (DE-627)OLC2026992754 (DE-He213)BF01299711-p DE-627 ger DE-627 rakwb eng 330 650 004 VZ 3,2 ssgn Fischer, K. verfasserin aut Modeling the transportation domain 1995 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 1995 Abstract The transportation domain is presented as a multi-agent scenario and the use of techniques of Distributed Artificial Intelligence (DAI) for solving cooperatively the hard problems that occur in this domain are demonstrated. After a motivation and a description of the domain we will address questions of cooperation between the agents, techniques for task decomposition and task allocation, and multi-agent planning and scheduling. By introducing a cooperation protocol, examples will be presented that show the utility of the approach. Finally, some implementation aspects will be considered. Kuhn, N. aut Müller, H. J. aut Müller, J. P. aut Enthalten in Computational economics Kluwer Academic Publishers, 1993 8(1995), 2 vom: Mai, Seite 81-93 (DE-627)131178121 (DE-600)1142021-2 (DE-576)033040664 0927-7099 nnns volume:8 year:1995 number:2 month:05 pages:81-93 https://doi.org/10.1007/BF01299711 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_26 GBV_ILN_70 GBV_ILN_2009 GBV_ILN_2020 GBV_ILN_4012 GBV_ILN_4029 GBV_ILN_4310 GBV_ILN_4318 AR 8 1995 2 05 81-93 |
| allfieldsSound |
10.1007/BF01299711 doi (DE-627)OLC2026992754 (DE-He213)BF01299711-p DE-627 ger DE-627 rakwb eng 330 650 004 VZ 3,2 ssgn Fischer, K. verfasserin aut Modeling the transportation domain 1995 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 1995 Abstract The transportation domain is presented as a multi-agent scenario and the use of techniques of Distributed Artificial Intelligence (DAI) for solving cooperatively the hard problems that occur in this domain are demonstrated. After a motivation and a description of the domain we will address questions of cooperation between the agents, techniques for task decomposition and task allocation, and multi-agent planning and scheduling. By introducing a cooperation protocol, examples will be presented that show the utility of the approach. Finally, some implementation aspects will be considered. Kuhn, N. aut Müller, H. J. aut Müller, J. P. aut Enthalten in Computational economics Kluwer Academic Publishers, 1993 8(1995), 2 vom: Mai, Seite 81-93 (DE-627)131178121 (DE-600)1142021-2 (DE-576)033040664 0927-7099 nnns volume:8 year:1995 number:2 month:05 pages:81-93 https://doi.org/10.1007/BF01299711 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_26 GBV_ILN_70 GBV_ILN_2009 GBV_ILN_2020 GBV_ILN_4012 GBV_ILN_4029 GBV_ILN_4310 GBV_ILN_4318 AR 8 1995 2 05 81-93 |
| language |
English |
| source |
Enthalten in Computational economics 8(1995), 2 vom: Mai, Seite 81-93 volume:8 year:1995 number:2 month:05 pages:81-93 |
| sourceStr |
Enthalten in Computational economics 8(1995), 2 vom: Mai, Seite 81-93 volume:8 year:1995 number:2 month:05 pages:81-93 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| dewey-raw |
330 |
| isfreeaccess_bool |
false |
| container_title |
Computational economics |
| authorswithroles_txt_mv |
Fischer, K. @@aut@@ Kuhn, N. @@aut@@ Müller, H. J. @@aut@@ Müller, J. P. @@aut@@ |
| publishDateDaySort_date |
1995-05-01T00:00:00Z |
| hierarchy_top_id |
131178121 |
| dewey-sort |
3330 |
| id |
OLC2026992754 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2026992754</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503034221.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1995 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF01299711</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2026992754</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF01299711-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">330</subfield><subfield code="a">650</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fischer, K.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Modeling the transportation domain</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1995</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Kluwer Academic Publishers 1995</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The transportation domain is presented as a multi-agent scenario and the use of techniques of Distributed Artificial Intelligence (DAI) for solving cooperatively the hard problems that occur in this domain are demonstrated. After a motivation and a description of the domain we will address questions of cooperation between the agents, techniques for task decomposition and task allocation, and multi-agent planning and scheduling. By introducing a cooperation protocol, examples will be presented that show the utility of the approach. Finally, some implementation aspects will be considered.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kuhn, N.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Müller, H. J.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Müller, J. P.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Computational economics</subfield><subfield code="d">Kluwer Academic Publishers, 1993</subfield><subfield code="g">8(1995), 2 vom: Mai, Seite 81-93</subfield><subfield code="w">(DE-627)131178121</subfield><subfield code="w">(DE-600)1142021-2</subfield><subfield code="w">(DE-576)033040664</subfield><subfield code="x">0927-7099</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:1995</subfield><subfield code="g">number:2</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:81-93</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF01299711</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4310</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">8</subfield><subfield code="j">1995</subfield><subfield code="e">2</subfield><subfield code="c">05</subfield><subfield code="h">81-93</subfield></datafield></record></collection>
|
| author |
Fischer, K. |
| spellingShingle |
Fischer, K. ddc 330 ssgn 3,2 Modeling the transportation domain |
| authorStr |
Fischer, K. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)131178121 |
| format |
Article |
| dewey-ones |
330 - Economics 650 - Management & auxiliary services 004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0927-7099 |
| topic_title |
330 650 004 VZ 3,2 ssgn Modeling the transportation domain |
| topic |
ddc 330 ssgn 3,2 |
| topic_unstemmed |
ddc 330 ssgn 3,2 |
| topic_browse |
ddc 330 ssgn 3,2 |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Computational economics |
| hierarchy_parent_id |
131178121 |
| dewey-tens |
330 - Economics 650 - Management & public relations 000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Computational economics |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)131178121 (DE-600)1142021-2 (DE-576)033040664 |
| title |
Modeling the transportation domain |
| ctrlnum |
(DE-627)OLC2026992754 (DE-He213)BF01299711-p |
| title_full |
Modeling the transportation domain |
| author_sort |
Fischer, K. |
| journal |
Computational economics |
| journalStr |
Computational economics |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
300 - Social sciences 600 - Technology 000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
1995 |
| contenttype_str_mv |
txt |
| container_start_page |
81 |
| author_browse |
Fischer, K. Kuhn, N. Müller, H. J. Müller, J. P. |
| container_volume |
8 |
| class |
330 650 004 VZ 3,2 ssgn |
| format_se |
Aufsätze |
| author-letter |
Fischer, K. |
| doi_str_mv |
10.1007/BF01299711 |
| dewey-full |
330 650 004 |
| title_sort |
modeling the transportation domain |
| title_auth |
Modeling the transportation domain |
| abstract |
Abstract The transportation domain is presented as a multi-agent scenario and the use of techniques of Distributed Artificial Intelligence (DAI) for solving cooperatively the hard problems that occur in this domain are demonstrated. After a motivation and a description of the domain we will address questions of cooperation between the agents, techniques for task decomposition and task allocation, and multi-agent planning and scheduling. By introducing a cooperation protocol, examples will be presented that show the utility of the approach. Finally, some implementation aspects will be considered. © Kluwer Academic Publishers 1995 |
| abstractGer |
Abstract The transportation domain is presented as a multi-agent scenario and the use of techniques of Distributed Artificial Intelligence (DAI) for solving cooperatively the hard problems that occur in this domain are demonstrated. After a motivation and a description of the domain we will address questions of cooperation between the agents, techniques for task decomposition and task allocation, and multi-agent planning and scheduling. By introducing a cooperation protocol, examples will be presented that show the utility of the approach. Finally, some implementation aspects will be considered. © Kluwer Academic Publishers 1995 |
| abstract_unstemmed |
Abstract The transportation domain is presented as a multi-agent scenario and the use of techniques of Distributed Artificial Intelligence (DAI) for solving cooperatively the hard problems that occur in this domain are demonstrated. After a motivation and a description of the domain we will address questions of cooperation between the agents, techniques for task decomposition and task allocation, and multi-agent planning and scheduling. By introducing a cooperation protocol, examples will be presented that show the utility of the approach. Finally, some implementation aspects will be considered. © Kluwer Academic Publishers 1995 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW GBV_ILN_26 GBV_ILN_70 GBV_ILN_2009 GBV_ILN_2020 GBV_ILN_4012 GBV_ILN_4029 GBV_ILN_4310 GBV_ILN_4318 |
| container_issue |
2 |
| title_short |
Modeling the transportation domain |
| url |
https://doi.org/10.1007/BF01299711 |
| remote_bool |
false |
| author2 |
Kuhn, N. Müller, H. J. Müller, J. P. |
| author2Str |
Kuhn, N. Müller, H. J. Müller, J. P. |
| ppnlink |
131178121 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/BF01299711 |
| up_date |
2024-07-03T13:19:09.114Z |
| _version_ |
1803564088417058816 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2026992754</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503034221.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1995 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF01299711</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2026992754</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF01299711-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">330</subfield><subfield code="a">650</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fischer, K.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Modeling the transportation domain</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1995</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Kluwer Academic Publishers 1995</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The transportation domain is presented as a multi-agent scenario and the use of techniques of Distributed Artificial Intelligence (DAI) for solving cooperatively the hard problems that occur in this domain are demonstrated. After a motivation and a description of the domain we will address questions of cooperation between the agents, techniques for task decomposition and task allocation, and multi-agent planning and scheduling. By introducing a cooperation protocol, examples will be presented that show the utility of the approach. Finally, some implementation aspects will be considered.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kuhn, N.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Müller, H. J.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Müller, J. P.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Computational economics</subfield><subfield code="d">Kluwer Academic Publishers, 1993</subfield><subfield code="g">8(1995), 2 vom: Mai, Seite 81-93</subfield><subfield code="w">(DE-627)131178121</subfield><subfield code="w">(DE-600)1142021-2</subfield><subfield code="w">(DE-576)033040664</subfield><subfield code="x">0927-7099</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:8</subfield><subfield code="g">year:1995</subfield><subfield code="g">number:2</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:81-93</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF01299711</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2009</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4029</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4310</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">8</subfield><subfield code="j">1995</subfield><subfield code="e">2</subfield><subfield code="c">05</subfield><subfield code="h">81-93</subfield></datafield></record></collection>
|
| score |
7.3979874 |