Secure Multi-agent Planning via Sharemind

Radek Bumbálek, Michal Štolba, Antonín Komenda

Abstract

Classical planning provides models and algorithms for solving problems of finding a sequence of actions that transforms the initial state of the world into a state of the world with the desired properties. In classical planning, we assume that the solution plan entails all actors in the world and thus it can be computed centrally. In multi-agent planning, this assumption is dropped in favor of situations where there is multitude of actors with individual capabilities, goals, and objectives, called agents. In this work, we propose a novel technique for multi-agent planning which combines a state-of-the-art planner called Planning State Machine (PSM) Planner with a framework for mutli-party secure computation, Sharemind. This allows the agents to find a cooperative plan while preventing the leakage of private information in a practical and scalable way.

Download


Paper Citation


in Harvard Style

Bumbálek R., Štolba M. and Komenda A. (2020). Secure Multi-agent Planning via Sharemind.In Proceedings of the 12th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-395-7, pages 852-859. DOI: 10.5220/0009147908520859


in Bibtex Style

@conference{icaart20,
author={Radek Bumbálek and Michal Štolba and Antonín Komenda},
title={Secure Multi-agent Planning via Sharemind},
booktitle={Proceedings of the 12th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2020},
pages={852-859},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0009147908520859},
isbn={978-989-758-395-7},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 12th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Secure Multi-agent Planning via Sharemind
SN - 978-989-758-395-7
AU - Bumbálek R.
AU - Å tolba M.
AU - Komenda A.
PY - 2020
SP - 852
EP - 859
DO - 10.5220/0009147908520859