TY - JOUR
T1 - Online macro generation for privacy preserving planning
AU - Maliah, Shlomi
AU - Shani, Guy
AU - Brafman, Ronen
N1 - Funding Information:
We thank the reviewers for their useful comments. This work was supported by ISF Grant 933/13, by the Helmsley Charitable Trust through the Agricultural, Biological and Cognitive Robotics Center of Ben-Gurion University of the Negev, and by the Lynn and William Frankel Center for Computer Science.
Publisher Copyright:
Copyright © 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2016/1/1
Y1 - 2016/1/1
N2 - Agents that use Multi-Agent Forward Search (MAFS) to do privacy-preserving planning, often repeatedly develop similar paths. We describe a simple technique for online macro generation allowing agents to 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 negligible cost, yet provides both speedups and reduced communication 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. We also show that one variant is equivalent to secure MAFS.
AB - Agents that use Multi-Agent Forward Search (MAFS) to do privacy-preserving planning, often repeatedly develop similar paths. We describe a simple technique for online macro generation allowing agents to 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 negligible cost, yet provides both speedups and reduced communication 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. We also show that one variant is equivalent to secure MAFS.
UR - http://www.scopus.com/inward/record.url?scp=84989862129&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:84989862129
VL - 2016-January
SP - 216
EP - 220
JO - Proceedings International Conference on Automated Planning and Scheduling, ICAPS
JF - Proceedings International Conference on Automated Planning and Scheduling, ICAPS
SN - 2334-0835
T2 - 26th International Conference on Automated Planning and Scheduling, ICAPS 2016
Y2 - 12 June 2016 through 17 June 2016
ER -