Model-Lite Planning : Diverse Multi-Option Plans & Dynamic Objective Functions
暂无分享,去创建一个
[1] Anne Condon,et al. On the Undecidability of Probabilistic Planning and Infinite-Horizon Partially Observable Markov Decision Problems , 1999, AAAI/IAAI.
[2] Subbarao Kambhampati,et al. Domain Independent Approaches for Finding Diverse Plans , 2007, IJCAI.
[3] Subbarao Kambhampati,et al. Model-lite Planning for the Web Age Masses: The Challenges of Planning with Incomplete and Evolving Domain Models , 2007, AAAI.
[4] Nils J. Nilsson,et al. Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[5] Nathanael Hyafil,et al. Utilizing Structured Representations and CSP's in Conformant Probabilistic Planning , 2004, ECAI.
[6] Shapour Azarm,et al. Metrics for Quality Assessment of a Multiobjective Design Optimization Solution Set , 2001 .
[7] Shlomo Zilberstein,et al. LAO*: A heuristic search algorithm that finds solutions with loops , 2001, Artif. Intell..
[8] Daniel Bryce,et al. Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics , 2006, ICAPS.
[9] David E. Smith,et al. Optimal Limited Contingency Planning , 2002, UAI.
[10] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[11] Karen L. Myers,et al. Generating qualitatively Different Plans througt Metatheoretic Biases , 1999, AAAI/IAAI.
[12] M. I. Henig. Vector-Valued Dynamic Programming , 1983 .
[13] Andrew G. Barto,et al. Learning to Act Using Real-Time Dynamic Programming , 1995, Artif. Intell..