On the complexity of planning for agent teams and its implications for single agent planning-Reference-Cited by-同舟云学术

On the complexity of planning for agent teams and its implications for single agent planning

Published:2013-05 Issue: Volume:198 Page:52-71
ISSN:0004-3702
Container-title:Artificial Intelligence
language:en
Short-container-title:Artificial Intelligence

Author:

Brafman Ronen I.,Domshlak Carmel

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference41 articles.

1. E. Amir, B. Engelhardt, Factored planning, in: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 2003, pp. 929–935.

2. Approximation algorithms for treewidth;Amir;Algorithmica,2010

3. Complexity of finding embeddings in a k-tree;Arnborg;SIAM Journal of Algebraic Discrete Methods,1987

4. Fast planning through planning graph analysis;Blum;Artificial Intelligence,1997

5. Partial-order planning with concurrent interacting actions;Boutilier;Journal of Artificial Intelligence Research,2001

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Reducing disclosed dependencies in privacy preserving planning;Autonomous Agents and Multi-Agent Systems;2022-10

2. Privacy preserving planning in multi-agent stochastic environments;Autonomous Agents and Multi-Agent Systems;2022-03-26

3. Scheduling Aerial Vehicles in an Urban Air Mobility Scheme;2021 IEEE Vehicular Networking Conference (VNC);2021-11-10

4. Rational verification: game-theoretic verification of multi-agent systems;Applied Intelligence;2021-08-03

5. Plan distance heuristics for task fusion in distributed temporal continuous planning;Multiagent and Grid Systems;2020-07-24