×

Planning and control in artificial intelligence: A unifying perspective. (English) Zbl 0997.90533

Summary: The problem of selecting actions in environments that are dynamic and not completely predictable or observable is a central problem in intelligent behavior. In AI, this translates into the problem of designing controllers that can map sequences of observations into actions so that certain goals are achieved. Three main approaches have been used in AI for designing such controllers: the programming approach, where the controller is programmed by hand in a suitable high-level procedural language, the planning approach, where the control is automatically derived from a suitable description of actions and goals, and the learning approach, where the control is derived from a collection of experiences. The three approaches exhibit successes and limitations. The focus of this paper is on the planning approach. More specifically, we present an approach to planning based on various state models that handle various types of action dynamics (deterministic and probabilistic and sensor feedback (null, partial, and complete). The approach combines high-level representations languages for describing actions, sensors, and goals, mathematical models of sequential decisions for making precise the various planning tasks and their solutions, and heuristic search algorithms for computing those solutions. The approach is supported by a computational tool we have developed that accepts high-level descriptions of actions, sensors, and goals and produces suitable controllers. We also present empirical results and discuss open challenges.

MSC:

90B50 Management decision making, including multiple objectives
68T20 Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
90C40 Markov and semi-Markov decision processes
Full Text: DOI

References:

[1] Ahuja, R.; Magnanti, T.; Orlin, J.: Network flows: theory, algorithms, and applications. (1993) · Zbl 1201.90001
[2] Anderson, C.; Smith, D.; Weld, D.: Conditional effects in graphplan. Proc. 4th international conference on AI planning systems, 44-53 (1998)
[3] Blum, A.; Furst, M.: Fast planning through planning graph analysis. Artificial intelligence 90, No. 1-2, 281-300 (1997) · Zbl 1017.68533 · doi:10.1016/S0004-3702(96)00047-1
[4] Bonet, B.; Geffner, H.: Planning as heuristic search: new results. Lecture notes in artificial intelligence 1809, 359-371 (1999) · Zbl 0971.68146
[5] Bacchus, F.; Kabanza, F.: Using temporal logics to express search control knowledge for planning. Artificial intelligence 116, No. 1-2, 123-191 (2000) · Zbl 0939.68827 · doi:10.1016/S0004-3702(99)00071-5
[6] Bonet, B.; Loerincs, G.; Geffner, H.: A robust fast action selection mechanism for planning. Proc. AAAI-97, providence, RI, 714-719 (1997)
[7] Carlier, J.; Pinson, E.: An algorithm for solving the job shop problem. Management sci. 35, No. 2, 164-176 (1989) · Zbl 0677.90036 · doi:10.1287/mnsc.35.2.164
[8] Culberson, J.; Schaeffer, J.: Pattern databases. Comput. intelligence 14, No. 3, 318-334 (1998)
[9] Fikes, R.; Nilsson, N.: STRIPS: A new approach to the application of theorem proving to problem solving. Artificial intelligence 2, 189-208 (1971) · Zbl 0234.68036 · doi:10.1016/0004-3702(71)90010-5
[10] Geffner, H.: Functional strips: A more general language for planning and problem solving. (1999)
[11] Gerevini, A.; Schubert, L.: Inferring state constraints for domain-independent planning. Proc. AAAI-98, Madison, WI, 905-912 (1998)
[12] Harvey, W.; Ginsberg, M.: Limited discrepancy search. Proc. IJCAI-95, Montreal, Québec, 607-613 (1995)
[13] Haslum, P.; Geffner, H.: Admissible heuristics for optimal planning. Proc. 5th international conference on AI planning systems, 70-82 (2000)
[14] Holte, R.; Hernadvolgyi, I.: A space-time tradeoff for memory-based heuristics. Proc. AAAI-99, Orlando, FL, 704-709 (1999)
[15] Hoffmann, J.: A heuristic for domain independent planning, and its use in an enforced Hill-climbing algorithm. Proc. 12th international symposium on methodologies for intelligent systems (ISMIS-00), 216-227 (2000) · Zbl 0983.68740
[16] Van Hentenryck, P.; Simonis, H.; Dincbas, M.: Constraint satisfaction using constraint logic programming. Artificial intelligence 58, No. 1-3, 113-159 (1992) · Zbl 0782.68028 · doi:10.1016/0004-3702(92)90006-J
[17] Junghanns, A.; Schaeffer, J.: Domain-dependent single-agent search enhancements. Proc. IJCAI-99, Stockholm, Sweden, 570-575 (1999)
[18] Kambhampati, S.; Nigenda, R. Sanchez: Distance based goal ordering heuristics for graphplan. Proc. 5th international conference on artificial intelligence planning and scheduling, 315-322 (2000)
[19] Koehler, J.; Nebel, B.; Hoffman, J.; Dimopoulos, Y.: Extending planning graphs to an ADL subset. Lecture notes in artificial intelligence 1348, 273-285 (1997)
[20] Korf, R.: Depth-first iterative-deepening: an optimal admissible tree search. Artificial intelligence 27, No. 1, 97-109 (1985) · Zbl 0573.68030 · doi:10.1016/0004-3702(85)90084-0
[21] Korf, R.: Real-time heuristic search. Artificial intelligence 42, No. 2-3, 189-211 (1990) · Zbl 0718.68082 · doi:10.1016/0004-3702(90)90054-4
[22] Korf, R.: Linear-space best-first search. Artificial intelligence 62, No. 1, 41-78 (1993) · Zbl 0778.68079 · doi:10.1016/0004-3702(93)90045-D
[23] Korf, R.: Finding optimal solutions to rubik’s cube using pattern databases. Proc. AAAI-98, Madison, WI, 700-705 (1998)
[24] Kautz, H.; Selman, B.: Pushing the envelope: planning, propositional logic, and stochastic search. Proc. AAAI-96, Portland, OR, 1194-1201 (1996)
[25] Kautz, H.; Selman, B.: Unifying SAT-based and graph-based planning. Proc. IJCAI-99, Stockholm, Sweden, 318-327 (1999)
[26] Korf, R.; Taylor, L.: Finding optimal solutions to the twenty-four puzzle. Proc. AAAI-96, Portland, OR, 1202-1207 (1996)
[27] Long, D.; Fox, M.: The efficient implementation of the plan-graph in STAN. J. artificial intelligence res. 10, 85-115 (1999) · Zbl 0914.68180
[28] Long, D.; Fox, M.: Utilizing automatically inferred invariants in graph construction and search. Proc. 5th international conference on AI planning systems, 102-111 (2000)
[29] Laborie, P.; Ghallab, M.: Planning with sharable resources constraints. Proc. IJCAI-95, Montreal, Québec, 1643-1649 (1995)
[30] Lawler, E.; Kan, A. Rinnooy: The traveling salesman problem: A guided tour of combinatorial optimization. (1985) · Zbl 0562.00014
[31] Mcdermott, D.: A heuristic estimator for means-ends analysis in planning. Proc. 3rd international conference on AI planning systems, 142-149 (1996)
[32] Mcdermott, D.: PDDL–the planning domain definition language. (1998)
[33] Mcdermott, D.: Using regression-match graphs to control search in planning. Artificial intelligence 109, No. 1-2, 111-159 (1999) · Zbl 0916.68145 · doi:10.1016/S0004-3702(99)00010-7
[34] Mcdermott, D.: The 1998 AI planning systems competition. AI magazine 21, No. 2, 35-56 (2000)
[35] Nilsson, N.: Principles of artificial intelligence. (1980) · Zbl 0422.68039
[36] Nguyen, X.; Kambhampati, S.: Extracting effective and admissible heuristics from the planning graph. Proc. AAAI-2000, Austin, TX (2000)
[37] Newell, A.; Simon, H.: GPS: A program that simulates human thought. Computers and thought, 279-293 (1963)
[38] Newell, A.; Simon, H.: Human problem solving. (1972)
[39] Pearl, J.: Heuristics. (1983) · Zbl 0522.68088
[40] Pednault, E.: ADL: exploring the middle ground between strips and the situation calculus. Proc. 1st international conference on principles of knowledge representation and reasoning (KR-89), Toronto, Ontario, 324-332 (1989)
[41] Prieditis, A.: Machine discovery of effective admissible heuristics. Machine learning 12, 117-141 (1993) · Zbl 0784.68064
[42] Rintanen, J.: A planning algorithm not based on directional search. Proc. 6th international conference on principles of knowledge representation reasoning (KR-98), Trento, Italy, 617-624 (1998)
[43] Refanidis, I.; Vlahavas, I.: GRT: A domain independent heuristic for strips worlds based on greedy regression tables. Lecture notes in artificial intelligence 1809, 346-358 (1999)
[44] Sen, A.; Bagchi, A.: Fast recursive formulations for BFS that allow controlled used of memory. Proc. IJCAI-89, detroit, MI, 297-302 (1989) · Zbl 0707.68077
[45] Van Beek, P.; Chen, X.: Cplan: A constraint programming approach to planning. Proc. AAAI-99, Orlando, FL, 585-590 (1999)
[46] Weld, D.: An introduction to least commitment planning. AI magazine 15, No. 4, 27-61 (1994)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.