论文信息 - Generating Parallel Based on Planning Graph Analysis of Predicate/Transition Nets - 字舞流文

Generating Parallel Based on Planning Graph Analysis of Predicate/Transition Nets

Dianxiang Xu | Richard A. Volz | Thomas R. Ioerger

[1] Bernhard Nebel,et al. The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[2] Matthew J. Katz,et al. Plans for Multiple Agents , 1989, Distributed Artificial Intelligence.

[3] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[4] Gil Tidhar,et al. Planned Team Activity , 1992, MAAMAW.

[5] David E. Smith,et al. Temporal Planning with Mutual Exclusion Reasoning , 1999, IJCAI.

[6] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[7] Markus Lindqvist,et al. Parameterized reachability trees for predicate/transition nets , 1991 .

[8] Daniel S. Weld. Recent Advances in AI Planning , 1999, AI Mag..

[9] M. Veloso,et al. Nonlinear Planning with Parallel Resource Allocation , 1990 .

[10] Tadao Murata,et al. Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[11] Jaegeol Yim,et al. A Predicate-Transition Net Model for Multiple Agent Planning , 1991, Inf. Sci..

[12] Ronen I. Brafman,et al. Partial-Order Planning with Concurrent Interacting Actions , 2011, J. Artif. Intell. Res..