Online Macro Generation for Privacy Preserving Planning. Shani, G., Brafman, R., & Maliah, S. In Paper abstract bibtex Agents with private actions that use Multi-Agent Forward Search (MAFS), often repeatedly develop similar paths. We describe a simple technique for online macro generation that provides agents with shortcuts that reuse successful previous action sequences. By focusing on specific sequences that end with a single public action only, we are able to address the utility problem – our technique has little overhead and has negligible cost in the worst case, while providing substantial speedups in domains where agents have a reasonable amount of private actions. We describe two variants of our approach, both with attractive privacy preserving properties, and demonstrate the value of macros empirically.
@inproceedings {icaps16-18,
track = {Main Track},
title = {Online Macro Generation for Privacy Preserving Planning},
url = {http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13013},
author = {Guy Shani and Ronen Brafman and Shlomi Maliah},
abstract = {Agents with private actions that use Multi-Agent Forward Search (MAFS), often repeatedly develop similar paths. We describe a simple technique for online macro generation that provides agents with shortcuts that reuse successful previous action sequences. By focusing on specific sequences that end with a single public action only, we are able to address the utility problem -- our technique has little overhead and has negligible cost in the worst case, while providing substantial speedups in domains where agents have a reasonable amount of private actions. We describe two variants of our approach, both with attractive privacy preserving properties, and demonstrate the value of macros empirically.},
keywords = {Distributed and multi-agent planning}
}
Downloads: 0
{"_id":"R7awJcbNzehrdrFPM","bibbaseid":"shani-brafman-maliah-onlinemacrogenerationforprivacypreservingplanning","downloads":0,"creationDate":"2016-03-09T03:04:32.860Z","title":"Online Macro Generation for Privacy Preserving Planning","author_short":["Shani, G.","Brafman, R.","Maliah, S."],"year":null,"bibtype":"inproceedings","biburl":"icaps16.icaps-conference.org/papers.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","track":"Main Track","title":"Online Macro Generation for Privacy Preserving Planning","url":"http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13013","author":[{"firstnames":["Guy"],"propositions":[],"lastnames":["Shani"],"suffixes":[]},{"firstnames":["Ronen"],"propositions":[],"lastnames":["Brafman"],"suffixes":[]},{"firstnames":["Shlomi"],"propositions":[],"lastnames":["Maliah"],"suffixes":[]}],"abstract":"Agents with private actions that use Multi-Agent Forward Search (MAFS), often repeatedly develop similar paths. We describe a simple technique for online macro generation that provides agents with shortcuts that reuse successful previous action sequences. By focusing on specific sequences that end with a single public action only, we are able to address the utility problem – our technique has little overhead and has negligible cost in the worst case, while providing substantial speedups in domains where agents have a reasonable amount of private actions. We describe two variants of our approach, both with attractive privacy preserving properties, and demonstrate the value of macros empirically.","keywords":"Distributed and multi-agent planning","bibtex":"@inproceedings {icaps16-18,\r\n track = {Main Track},\r\n title = {Online Macro Generation for Privacy Preserving Planning},\r\n url = {http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13013},\r\n author = {Guy Shani and Ronen Brafman and Shlomi Maliah},\r\n abstract = {Agents with private actions that use Multi-Agent Forward Search (MAFS), often repeatedly develop similar paths. We describe a simple technique for online macro generation that provides agents with shortcuts that reuse successful previous action sequences. By focusing on specific sequences that end with a single public action only, we are able to address the utility problem -- our technique has little overhead and has negligible cost in the worst case, while providing substantial speedups in domains where agents have a reasonable amount of private actions. We describe two variants of our approach, both with attractive privacy preserving properties, and demonstrate the value of macros empirically.},\r\n keywords = {Distributed and multi-agent planning}\r\n}\r\n\r\n","author_short":["Shani, G.","Brafman, R.","Maliah, S."],"key":"icaps16-18","id":"icaps16-18","bibbaseid":"shani-brafman-maliah-onlinemacrogenerationforprivacypreservingplanning","role":"author","urls":{"Paper":"http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13013"},"keyword":["Distributed and multi-agent planning"],"metadata":{"authorlinks":{}},"downloads":0,"html":""},"search_terms":["online","macro","generation","privacy","preserving","planning","shani","brafman","maliah"],"keywords":["distributed and multi-agent planning"],"authorIDs":[],"dataSources":["iMkx859KiXcegwsin","EZtZjCTnxcdTTyeij"]}