
רונן ברפמן
אקדמי בכיר
Online macro generation for privacy preserving planning
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.
| שפת פרסום | אנגלית |
| דפים | 216-220 |
| כתב עת | Proceedings International Conference on Automated Planning and Scheduling, ICAPS |
| כרך | 2016-January |
| סטטוס פרסום | פורסם - 01.01.2016 |
ASJC Scopus subject areas
Artificial Intelligence
Computer Science Applications
Information Systems and Management