×

Representing and planning with interacting actions and privacy. (English) Zbl 1478.68388

Summary: Interacting actions – actions whose joint effect differs from the union of their individual effects – are challenging both to represent and to plan with due to their combinatorial nature. So far, there have been few attempts to provide a succinct language for representing them that can also support efficient centralized planning and distributed privacy preserving planning. In this paper we suggest an approach for representing interacting actions succinctly and show how such a domain model can be compiled into a standard single-agent planning problem as well as to privacy preserving multi-agent planning. We test the performance of our method on a number of novel domains involving interacting actions and privacy.

MSC:

68T42 Agent technology and artificial intelligence
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Software:

Graphplan
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] Baral, C.; Gelfond, M., Reasoning about effects of concurrent actions, J. Log. Program., 31, 1-3, 85-117 (1997) · Zbl 0882.68027
[2] Blum, A.; Furst, M. L., Fast planning through planning graph analysis, Artif. Intell., 90, 281-300 (1997) · Zbl 1017.68533
[3] Boutilier, C.; Brafman, R. I., Planning with concurrent interacting actions, (Proc. of the 14th National Conference on AI. Proc. of the 14th National Conference on AI, AAAI-97 (1997)), 720-726
[4] Brafman, R. I.; Zoran, U., Distributed heuristic forward search with interacting actions, (Proc. of the 2nd ICAPS Workshop on Distributed and Multi-Agent Planning (2014))
[5] Crosby, M.; Jonsson, A.; Rovatsos, M., A single-agent approach to multiagent planning, (ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic - Including Prestigious Applications of Intelligent Systems (PAIS 2014) (2014)), 237-242 · Zbl 1366.68339
[6] Dimopoulos, Y.; Nebel, B.; Koehler, J., Encoding planning problems in nonmonotonic logic programs, (Recent Advances in AI Planning, 4th European Conference on Planning. Recent Advances in AI Planning, 4th European Conference on Planning, ECP’97, Toulouse, France, September 24-26, 1997 (1997)), 169-181
[7] Furelos-Blanco, D.; Frances, G.; Jonsson, A., Universal PDDL parser – multiagent extension (March 2019)
[8] Helmert, M., The fast downward planning system, J. Artif. Intell. Res., 26, 1, 191-246 (2006) · Zbl 1182.68245
[9] Hoffmann, J.; Nebel, B., The FF planning system: fast plan generation through heuristic search, J. Artif. Intell. Res., 14, 1, 253-302 (2001) · Zbl 0970.68044
[10] Kovacs, D. L., A multi-agent extension of PDDL3.1, (Proc. of the 3rd Workshop on the International Planning Competition. Proc. of the 3rd Workshop on the International Planning Competition, IPC-2012 (2012))
[11] Lin, F.; Shoham, Y., Concurrent actions in the situation calculus, (Proceedings of the 10th National Conference on Artificial Intelligence. Proceedings of the 10th National Conference on Artificial Intelligence, San Jose, CA, July 12-16, 1992 (1992)), 590-595
[12] Maliah, S.; Shani, G.; Stern, R., Collaborative privacy preserving multi-agent planning – planners and heuristics, Auton. Agents Multi-Agent Syst., 31, 3, 493-530 (2017)
[13] Nissim, R.; Brafman, R. I., Distributed heuristic forward search for multi-agent planning, J. Artif. Intell. Res., 51, 293-332 (2014) · Zbl 1367.68325
[14] Poole, D., The independent choice logic for modelling multiple agents under uncertainty, Artif. Intell., 94, 1-2, 7-56 (1997) · Zbl 0902.03017
[15] Reiter, R., The frame problem in the situation calculus: a simple solution (sometimes) and a completeness result for goal regression, (Lifshitz, V., AI and Mathematical Theory of Computation: Papers in Honour of John McCarthy (1991)), 359-380 · Zbl 0755.68124
[16] Richter, S.; Westphal, M.; Helmert, M., LAMA 2008 and 2011 (planner abstract), (Proc. of IPC 2011 (planner abstracts) (2011)), 50-54
[17] Rintanen, J.; Heljanko, K.; Niemelä, I., Planning as satisfiability: parallel plans and algorithms for plan search, Artif. Intell., 170, 12-13, 1031-1080 (2006) · Zbl 1131.68099
[18] Shekhar, S.; Brafman, R. I., Representing and planning with interacting actions, (Proc. of ICAPS’18 (2018))
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.