乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,30]],"date-time":"2022-10-30T04:41:37Z","timestamp":1667104897970},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T00:00:00Z","timestamp":1656720000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T00:00:00Z","timestamp":1656720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura Cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["18-24965Y"],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10458-022-09568-4","type":"journal-article","created":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T08:05:52Z","timestamp":1656749152000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Privacy leakage of search-based multi-agent planning algorithms"],"prefix":"10.1007","volume":"36","author":[{"given":"Michal","family":"\u0160tolba","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-2450-701X","authenticated-orcid":false,"given":"Michaela","family":"Urbanovsk\u00e1","sequence":"additional","affiliation":[]},{"given":"Anton\u00edn","family":"Komenda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,2]]},"reference":[{"key":"9568_CR1","unstructured":"Brafman, R.\u00a0I. (2015). A privacy preserving algorithm for multi-agent planning and search. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, (IJCAI\u201915), pp. 1530\u20131536"},{"key":"9568_CR2","unstructured":"Brafman, R.\u00a0I., Domshlak, C. (2008). From one to many: Planning for loosely coupled multi-agent systems. In Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS\u201908), pp. 28\u201335."},{"key":"9568_CR3","volume-title":"A modern approach to distributed artificial intelligence, chapter 3","author":"HD Edmund","year":"1999","unstructured":"Edmund, H. D. (1999). Distributed problem solving and planning. In G. Wei\u00df (Ed.), A modern approach to distributed artificial intelligence, chapter 3. The MIT Press."},{"key":"9568_CR4","unstructured":"Fi\u0161er, D., \u0160tolba, M., Komenda, A. (2015). MAPlan. In Proceedings of the Competition of Distributed and Multi-Agent Planners (CoDMAP\u201915), pp. 8\u201310."},{"key":"9568_CR5","unstructured":"Gerevini, A.\u00a0E, Lipovetzky, N., Peli, N., Percassi, F., Saetti, A., Serina, I. (2019). Novelty messages filtering for multi agent privacy-preserving plannin. In Twelfth Annual Symposium on Combinatorial Search."},{"key":"9568_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1613\/jair.1705","volume":"26","author":"M Helmert","year":"2006","unstructured":"Helmert, M. (2006). The fast downward planning system. Journal of Artificial Intelligence Research, 26, 191\u2013246.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"3","key":"9568_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1609\/aimag.v37i3.2658","volume":"37","author":"A Komenda","year":"2016","unstructured":"Komenda, A., Stolba, M., & Kovacs, D. L. (2016). The international competition of distributed and multiagent planners (CoDMAP). AI Magazine, 37(3), 109\u2013115.","journal-title":"AI Magazine"},{"key":"9568_CR8","unstructured":"Maliah, S., Brafman, R.\u00a0I., Shani, G. (2016). Increased privacy with reduced communication and computation in multi-agent planning. In Proceedings of the 4th Workshop on Distributed and Multi-Agent Planning, DMAP\u2013ICAPS\u201916, pp. 106\u2013112."},{"key":"9568_CR9","doi-asserted-by":"crossref","unstructured":"Maliah, S., Shani, G., Brafman, R.\u00a0I.(2016). Online macro generation for privacy preserving planning. In Proceedings of the 26th International Conference on Automated Planning and Scheduling","DOI":"10.1609\/icaps.v26i1.13741"},{"key":"9568_CR10","doi-asserted-by":"crossref","unstructured":"Maliah, S., Shani, G., Stern, R. (2016). Stronger privacy preserving projections for multi-agent planning. In Proceedings of the 26th International Conference on Automated Planning and Scheduling, pp. 216\u2013220.","DOI":"10.1609\/icaps.v26i1.13741"},{"issue":"6","key":"9568_CR11","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/s10458-018-9394-z","volume":"32","author":"S Maliah","year":"2018","unstructured":"Maliah, S., Shani, G., & Stern, R. (2018). Action dependencies in privacy-preserving multi-agent planning. Autonomous Agents and Multi-Agent Systems, 32(6), 779\u2013821.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9568_CR12","unstructured":"Nissim, R., Brafman, R.\u00a0I. (2012). Multi-agent A* for parallel and distributed systems. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS\u201912), pp. 1265\u20131266."},{"key":"9568_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1613\/jair.4295","volume":"51","author":"R Nissim","year":"2014","unstructured":"Nissim, R., & Brafman, R. I. (2014). Distributed heuristic forward search for multi-agent planning. Journal of Artificial Intelligence Research, 51, 293\u2013332.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9568_CR14","doi-asserted-by":"crossref","unstructured":"Pommerening, F., Helmert, M., R\u00f6ger, G., Seipp, J. (2015). From non-negative to general operator cost partitioning. In Proceedings of the 29th AAAI Conference on Artificial Intelligence, pp. 3335\u20133341.","DOI":"10.1609\/aaai.v29i1.9668"},{"key":"9568_CR15","doi-asserted-by":"crossref","unstructured":"Smith, G. (2009). On the foundations of quantitative information flow. In Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures, pp. 288\u2013302.","DOI":"10.1007\/978-3-642-00596-1_21"},{"key":"9568_CR16","doi-asserted-by":"crossref","unstructured":"\u0160tolba, M. (2017). Reveal or hide: Information sharing in multi-agent planning.","DOI":"10.1145\/2970030.2970042"},{"key":"9568_CR17","doi-asserted-by":"crossref","unstructured":"\u0160tolba, M., Fi\u0161er, D., Komenda, A. (2016). Potential heuristics for multi-agent planning. In Proceedings of the 26th International Conference on Automated Planning and Scheduling, ICAPS\u201916, pp. 308\u2013316.","DOI":"10.1609\/icaps.v26i1.13757"},{"key":"9568_CR18","doi-asserted-by":"crossref","unstructured":"\u0160tolba, M., Fi\u0161er, D., & Komenda, A. (2019). Privacy leakage of search-based multi-agent planning algorithms. In Proceedings of the International Conference on Automated Planning and Scheduling, 29, 482\u2013490.","DOI":"10.1609\/icaps.v29i1.3513"},{"key":"9568_CR19","doi-asserted-by":"crossref","unstructured":"\u0160tolba, M., Komenda, A. (2014). Relaxation heuristics for multiagent planning. In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS\u201914), pp. 298\u2013306.","DOI":"10.1609\/icaps.v24i1.13642"},{"key":"9568_CR20","doi-asserted-by":"crossref","unstructured":"\u0160tolba, M., Komenda, A., Kovacs, D. (2016). Competition of distributed and multiagent planners (CoDMAP). In Proceedings of the AAAI Conference on Artificial Intelligence, pp. 4343\u20134345.","DOI":"10.1609\/aaai.v30i1.9870"},{"key":"9568_CR21","doi-asserted-by":"crossref","unstructured":"\u0160tolba, M., To\u017ei\u010dka, J., Komenda, A. (2017). Quantifying privacy leakage in multi-agent planning. Transactions on Internet Technology (TOIT).","DOI":"10.1145\/2970030.2970042"},{"issue":"6","key":"9568_CR22","first-page":"84","volume":"50","author":"A Torre\u00f1o","year":"2017","unstructured":"Torre\u00f1o, A., Onaindia, E., Komenda, A., & \u0160tolba, M. (2017). Cooperative multi-agent planning: A survey. ACM Computing Surveys (CSUR), 50(6), 84.","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"9568_CR23","doi-asserted-by":"crossref","unstructured":"To\u017ei\u010dka, J., \u0160tolba, M., Komenda, A. (2017). The limits of strong privacy preserving multi-agent planning. In Proceedings of the 27th International Conference on Automated Planning and Scheduling (ICAPS\u201917)","DOI":"10.1609\/icaps.v27i1.13828"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-022-09568-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10458-022-09568-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-022-09568-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T12:50:07Z","timestamp":1667047807000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10458-022-09568-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,2]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["9568"],"URL":"https:\/\/doi.org\/10.1007\/s10458-022-09568-4","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,2]]},"assertion":[{"value":"26 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"40"}}