暂无分享,去创建一个
[1] Ivan Serina,et al. Iterative Width Search for Multi Agent Privacy-Preserving Planning , 2018, AI*IA.
[2] Hector Geffner,et al. Purely Declarative Action Descriptions are Overrated: Classical Planning with Simulators , 2017, IJCAI.
[3] Ronen I. Brafman,et al. Distributed Heuristic Forward Search for Multi-agent Planning , 2014, J. Artif. Intell. Res..
[4] Christian Muise,et al. MAP-LAPKT: Omnipotent Multi-Agent Planning via Compilation to Classical Planning , 2015 .
[5] Hector Geffner,et al. Width and Serialization of Classical Planning Problems , 2012, ECAI.
[6] Eva Onaindia,et al. FMAP: Distributed cooperative multi-agent planning , 2014, Applied Intelligence.
[7] Nir Lipovetzky,et al. Adapting Novelty to Classical Planning as Heuristic Search , 2017, ICAPS.
[8] Ronen I. Brafman,et al. From One to Many: Planning for Loosely Coupled Multi-Agent Systems , 2008, ICAPS.
[9] Shlomi Maliah,et al. Stronger Privacy Preserving Projections for Multi-Agent Planning , 2016, ICAPS.
[10] Michal Stolba,et al. Relaxation Heuristics for Multiagent Planning , 2014, ICAPS.
[11] Michal Stolba,et al. Admissible Landmark Heuristic for Multi-Agent Planning , 2015, ICAPS.
[12] Shlomi Maliah,et al. Increased Privacy with Reduced Communication in Multi-Agent Planning , 2017, ICAPS.
[13] Michal Stolba,et al. Competition of Distributed and Multiagent Planners (CoDMAP) , 2016, AAAI.
[14] Hector Geffner,et al. Best-First Width Search: Exploration and Exploitation in Classical Planning , 2017, AAAI.
[15] Ivan Serina,et al. A privacy-preserving model for multi-agent propositional planning , 2018, J. Exp. Theor. Artif. Intell..