Representing and planning with interacting actions and privacy
Interacting actions – actions whose joint effect differs from the union of their individual effects – are challenging both to represent and to plan with due to their combinatorial nature. So far, there have been few attempts to provide a succinct language for representing them that can also support...
Gespeichert in:
Veröffentlicht in: | Artificial intelligence 2020-01, Vol.278, p.103200, Article 103200 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | 103200 |
container_title | Artificial intelligence |
container_volume | 278 |
creator | Shekhar, Shashank Brafman, Ronen I. |
description | Interacting actions – actions whose joint effect differs from the union of their individual effects – are challenging both to represent and to plan with due to their combinatorial nature. So far, there have been few attempts to provide a succinct language for representing them that can also support efficient centralized planning and distributed privacy preserving planning. In this paper we suggest an approach for representing interacting actions succinctly and show how such a domain model can be compiled into a standard single-agent planning problem as well as to privacy preserving multi-agent planning. We test the performance of our method on a number of novel domains involving interacting actions and privacy. |
doi_str_mv | 10.1016/j.artint.2019.103200 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2337150245</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0004370218302832</els_id><sourcerecordid>2337150245</sourcerecordid><originalsourceid>FETCH-LOGICAL-c380t-9ae7d70b5454a07a4aea7f64624b2d3acead41d140dc4d8f58712cd305938f6e3</originalsourceid><addsrcrecordid>eNp9UE1LAzEQDaJgrf4DDwXPWycfu9m9FKT4BQVB9BymyazuUrM12Vb6702JZ0_Dm3nvzcxj7JrDnAOvbvs5hrHz41wAb1JLCoATNuG1FoVuBD9lEwBQhdQgztlFjH2Csmn4hC1eaRsokk_6jxl6N9tu0Psj-OnGz1lypYA2T1MZfMys0O3RHi7ZWYubSFd_dcreH-7flk_F6uXxeXm3KqysYSwaJO00rEtVKgSNCgl1W6lKqLVwEi2hU9xxBc4qV7dlrbmwTkLZyLqtSE7ZTfbdhuF7R3E0_bALPq00QkrNSxCqTCyVWTYMMQZqTTrzC8PBcDDHpExvclLmmJTJSSXZIssofbDvKJhoO_KWXBfIjsYN3f8Gvzscc4k</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2337150245</pqid></control><display><type>article</type><title>Representing and planning with interacting actions and privacy</title><source>Elsevier ScienceDirect Journals Complete</source><source>Free E-Journal (出版社公開部分のみ)</source><creator>Shekhar, Shashank ; Brafman, Ronen I.</creator><creatorcontrib>Shekhar, Shashank ; Brafman, Ronen I.</creatorcontrib><description>Interacting actions – actions whose joint effect differs from the union of their individual effects – are challenging both to represent and to plan with due to their combinatorial nature. So far, there have been few attempts to provide a succinct language for representing them that can also support efficient centralized planning and distributed privacy preserving planning. In this paper we suggest an approach for representing interacting actions succinctly and show how such a domain model can be compiled into a standard single-agent planning problem as well as to privacy preserving multi-agent planning. We test the performance of our method on a number of novel domains involving interacting actions and privacy.</description><identifier>ISSN: 0004-3702</identifier><identifier>EISSN: 1872-7921</identifier><identifier>DOI: 10.1016/j.artint.2019.103200</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Combinatorial analysis ; Concurrent interacting actions ; Deterministic planning ; Distributed privacy preserving planning ; Domains ; Multi-agent planning ; Multiagent systems ; Planning ; Privacy</subject><ispartof>Artificial intelligence, 2020-01, Vol.278, p.103200, Article 103200</ispartof><rights>2019 Elsevier B.V.</rights><rights>Copyright Elsevier Science Ltd. Jan 2020</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c380t-9ae7d70b5454a07a4aea7f64624b2d3acead41d140dc4d8f58712cd305938f6e3</citedby><cites>FETCH-LOGICAL-c380t-9ae7d70b5454a07a4aea7f64624b2d3acead41d140dc4d8f58712cd305938f6e3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.artint.2019.103200$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3548,27923,27924,45994</link.rule.ids></links><search><creatorcontrib>Shekhar, Shashank</creatorcontrib><creatorcontrib>Brafman, Ronen I.</creatorcontrib><title>Representing and planning with interacting actions and privacy</title><title>Artificial intelligence</title><description>Interacting actions – actions whose joint effect differs from the union of their individual effects – are challenging both to represent and to plan with due to their combinatorial nature. So far, there have been few attempts to provide a succinct language for representing them that can also support efficient centralized planning and distributed privacy preserving planning. In this paper we suggest an approach for representing interacting actions succinctly and show how such a domain model can be compiled into a standard single-agent planning problem as well as to privacy preserving multi-agent planning. We test the performance of our method on a number of novel domains involving interacting actions and privacy.</description><subject>Combinatorial analysis</subject><subject>Concurrent interacting actions</subject><subject>Deterministic planning</subject><subject>Distributed privacy preserving planning</subject><subject>Domains</subject><subject>Multi-agent planning</subject><subject>Multiagent systems</subject><subject>Planning</subject><subject>Privacy</subject><issn>0004-3702</issn><issn>1872-7921</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNp9UE1LAzEQDaJgrf4DDwXPWycfu9m9FKT4BQVB9BymyazuUrM12Vb6702JZ0_Dm3nvzcxj7JrDnAOvbvs5hrHz41wAb1JLCoATNuG1FoVuBD9lEwBQhdQgztlFjH2Csmn4hC1eaRsokk_6jxl6N9tu0Psj-OnGz1lypYA2T1MZfMys0O3RHi7ZWYubSFd_dcreH-7flk_F6uXxeXm3KqysYSwaJO00rEtVKgSNCgl1W6lKqLVwEi2hU9xxBc4qV7dlrbmwTkLZyLqtSE7ZTfbdhuF7R3E0_bALPq00QkrNSxCqTCyVWTYMMQZqTTrzC8PBcDDHpExvclLmmJTJSSXZIssofbDvKJhoO_KWXBfIjsYN3f8Gvzscc4k</recordid><startdate>202001</startdate><enddate>202001</enddate><creator>Shekhar, Shashank</creator><creator>Brafman, Ronen I.</creator><general>Elsevier B.V</general><general>Elsevier Science Ltd</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>202001</creationdate><title>Representing and planning with interacting actions and privacy</title><author>Shekhar, Shashank ; Brafman, Ronen I.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c380t-9ae7d70b5454a07a4aea7f64624b2d3acead41d140dc4d8f58712cd305938f6e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Combinatorial analysis</topic><topic>Concurrent interacting actions</topic><topic>Deterministic planning</topic><topic>Distributed privacy preserving planning</topic><topic>Domains</topic><topic>Multi-agent planning</topic><topic>Multiagent systems</topic><topic>Planning</topic><topic>Privacy</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shekhar, Shashank</creatorcontrib><creatorcontrib>Brafman, Ronen I.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Artificial intelligence</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shekhar, Shashank</au><au>Brafman, Ronen I.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Representing and planning with interacting actions and privacy</atitle><jtitle>Artificial intelligence</jtitle><date>2020-01</date><risdate>2020</risdate><volume>278</volume><spage>103200</spage><pages>103200-</pages><artnum>103200</artnum><issn>0004-3702</issn><eissn>1872-7921</eissn><abstract>Interacting actions – actions whose joint effect differs from the union of their individual effects – are challenging both to represent and to plan with due to their combinatorial nature. So far, there have been few attempts to provide a succinct language for representing them that can also support efficient centralized planning and distributed privacy preserving planning. In this paper we suggest an approach for representing interacting actions succinctly and show how such a domain model can be compiled into a standard single-agent planning problem as well as to privacy preserving multi-agent planning. We test the performance of our method on a number of novel domains involving interacting actions and privacy.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.artint.2019.103200</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0004-3702 |
ispartof | Artificial intelligence, 2020-01, Vol.278, p.103200, Article 103200 |
issn | 0004-3702 1872-7921 |
language | eng |
recordid | cdi_proquest_journals_2337150245 |
source | Elsevier ScienceDirect Journals Complete; Free E-Journal (出版社公開部分のみ) |
subjects | Combinatorial analysis Concurrent interacting actions Deterministic planning Distributed privacy preserving planning Domains Multi-agent planning Multiagent systems Planning Privacy |
title | Representing and planning with interacting actions and privacy |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T15%3A33%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Representing%20and%20planning%20with%20interacting%20actions%20and%20privacy&rft.jtitle=Artificial%20intelligence&rft.au=Shekhar,%20Shashank&rft.date=2020-01&rft.volume=278&rft.spage=103200&rft.pages=103200-&rft.artnum=103200&rft.issn=0004-3702&rft.eissn=1872-7921&rft_id=info:doi/10.1016/j.artint.2019.103200&rft_dat=%3Cproquest_cross%3E2337150245%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2337150245&rft_id=info:pmid/&rft_els_id=S0004370218302832&rfr_iscdi=true |