Multiagent Planning Supported by Plan Diversity Metrics and Landmark Actions
暂无分享,去创建一个
[1] Damien Pellier. Distributed Planning through Graph Merging , 2010, ICAART.
[2] Ronen I. Brafman,et al. From One to Many: Planning for Loosely Coupled Multi-Agent Systems , 2008, ICAPS.
[3] Thomas Bäck,et al. Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .
[4] Edmund H. Durfee,et al. Distributed Problem Solving and Planning , 2001, EASSS.
[5] Victor R. Lesser,et al. Generalizing the Partial Global Planning Algorithm , 1992, Int. J. Cooperative Inf. Syst..
[6] Subbarao Kambhampati,et al. Domain Independent Approaches for Finding Diverse Plans , 2007, IJCAI.
[7] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[8] Patrick Doherty,et al. TALplanner: A Temporal Logic-Based Planner , 2001, AI Mag..
[9] Ronen I. Brafman,et al. A general, fully distributed multi-agent planning algorithm , 2010, AAMAS.
[10] Vladimir I. Levenshtein,et al. Binary codes capable of correcting deletions, insertions, and reversals , 1965 .
[11] Ronen I. Brafman,et al. Multi-agent A* for parallel and distributed systems , 2012, AAMAS.
[12] Eva Onaindia,et al. An approach to multi-agent planning with incomplete information , 2012, ECAI.
[13] Silvia Richter,et al. The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks , 2010, J. Artif. Intell. Res..
[14] Subhrajit Bhattacharya,et al. Search-Based Path Planning with Homotopy Class Constraints in 3D , 2010, AAAI.