The MO-GRT System : Heuristic Planning with Multiple Criteria
暂无分享,去创建一个
[1] Subbarao Kambhampati,et al. AltAlt: Combining the Advantages of Graphplan and Heuristic State Search , 2000 .
[2] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[3] Chelsea C. White,et al. Multiobjective A* , 1991, JACM.
[4] F. B. Vernadat,et al. Decisions with Multiple Objectives: Preferences and Value Tradeoffs , 1994 .
[5] Kikuo Fujimura. Path planning with multiple objectives , 1996, IEEE Robotics Autom. Mag..
[6] Manuela Veloso. Learning by analogical reasoning in general problem-solving , 1992 .
[7] Ioannis P. Vlahavas,et al. GRT: A Domain Independent Heuristic for STRIPS Worlds Based on Greedy Regression Tables , 1999, ECP.
[8] Journal of the Association for Computing Machinery , 1961, Nature.
[9] Ioannis P. Vlahavas,et al. The GRT Planner: New Results , 2000, Local Search for Planning and Scheduling.
[10] Steve Hanks,et al. Optimal Planning with a Goal-directed Utility Model , 1994, AIPS.
[11] Drew McDermott,et al. Using Regression-Match Graphs to Control Search in Planning , 1999, Artif. Intell..
[12] Ioannis P. Vlahavas,et al. Heuristic Planning with Resources , 2000, ECAI.
[13] M. Fox,et al. Efficient Implementation of the Plan Graph in STAN , 2011, J. Artif. Intell. Res..
[14] Peter Haddawy,et al. Utility Models for Goal‐Directed, Decision‐Theoretic Planners , 1998, Comput. Intell..
[15] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[16] Alexis Tsoukiàs,et al. Graph Based Representation of Dynamic Planning , 2000, ECAI.
[17] Jörg Hoffmann. A Heuristic for Domain Independent Planning and its Use in an Enforced Hill-climbing Algorithm , 2000, Planen und Konfigurieren.