A logic-based calculus of events
New Generation Computing
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
DARE: a system for distributed abductive reasoning
Autonomous Agents and Multi-Agent Systems
Multi-agent abductive reasoning with confidentiality
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Towards cooperation in adversarial search with confidentiality
HoloMAS'11 Proceedings of the 5th international conference on Industrial applications of holonic and multi-agent systems for manufacturing
| Hi-index | 0.00 |
Distributed planning has seen a wide range of techniques aiming to address problems such as distributed plan formation and distributed plan execution. Common to these techniques is the notion of Multi-Agent Planning (MAP) as a combination of planning and coordination by de Weerdt et al. [2]. Among the three types of MAP problems summarised by Durfee [3], distributed planning for distributed plans is considered to be the most challenging. The key issue to tackle is the plan merging, which concerns about resolving potential conflicts (negative interactions) between individual plans (sequences of actions) of the agents. A more complex version of the problem that has many real world examples, is that where agents need to maintain confidential information such as private knowledge, and/or do not wish to expose their individual plans. Such confidentiality constraints may make the central/direct analysis of action interactions impossible. This paper focuses on the task of distributed planning for distributed plans with confidentiality.