Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-28T03:25:42.655Z Has data issue: false hasContentIssue false
  • English
  • Français

Planning in a Continuous Domain—An Introduction

Published online by Cambridge University Press:  09 March 2009

Richard M. Salter
Richard M. Salter
Affiliation:
Department of Mathematics, Oberlin College, Oberlin, Ohio 44074 (USA)
Get access Rights & Permissions [Opens in a new window]

Summary

Much of the work of Artificial Intelligence concerns the representation and symbolic manipulation of various domains. One problem shared by existing systems is their limitation to discrete states and state changes, brought about by the linking of declarative states with points in time. With this identification, models of continuous processes must forego such declarative states, resulting in a loss of decomposability that limits the amount of complexity that can be handled by a given amount of computation.

In this paper we develop a model for robot problem solving over a domain of continuous actions. The proposed world model consists of a vector of piecewise defined functions of time, i.e. functions that can be represented using finite sets of expressions and finite partitions of time intervals. The critical points of these functions are represented symbolically as discrete events. The goal is represented as a point through which the world model vector must thread at some point in model time. World model functions are transformed by adding events at various discrete points in time which transform the trajectories in the direction of the goal. As events are added, formulas relating the event times are added to the description of the world. The result is a partial order of events which represents a plan for “forcing” the world function to achieve the goal.

The relationships between this model and the classical problem-solving systems (e.g. STRIPS) are utilized in order to produce a planning procedure. This procedure is applied to a robot problem which can be solved using the model. We conclude by presenting an analysis and prospectus of considerations for an actual implementation of these ideas.

Type
Article
Information
Robotica , Volume 1 , Issue 2 , April 1983 , pp. 85 - 93
Copyright
Copyright © Cambridge University Press 1983

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Nilsson, N.J., Principles of Artificial Intelligence (Tioga Publishing Co., Palo Alto, California, 1980).Google Scholar
2.Salter, R.M., Brennan, T. and Friedman, D.P., “CONCUR: a language for continuous, concurrent processes” Computer Languages 5, 163–189 (1980).CrossRefGoogle Scholar
3.Hendrix, G.G., “Modeling simultaneous actions and continuous processes” Artificial Intelligence 4, 145–180 (1973).CrossRefGoogle Scholar
4.Sacerdoti, E.D., “The non-linear nature of plans” Proc. 4th IJCAI 206–214 (1975).Google Scholar
5.Steele, G.L. Jr., and Sussman, G.J., “The revised report on SCHEME, a dialect of LISP”, MIT Ai Memo No. 452 (Cambridge, Massachusetts, 1978).Google Scholar
6.Banerji, R.B., Artificial Intelligence—A Theoretical Approach (North Holland, New York, 1980).Google Scholar
7.Winograd, T., “Frame representations and the declarative/ procedural controversy” In: Representation and Understanding (Bobrow, D. & Collins, A., eds.) (1975) pp. 185–210.CrossRefGoogle Scholar
8.Waldinger, R., “Achieving several goals simultaneously” Machine Intelligence 8, 94–136 (1977).Google Scholar
9.Newell, A. and Simon, H.A., “GPS, a program that simulates human thought” In Computers and Thought Feigenbaum, and Feldman, , eds. (McGraw-Hill, New York, 1963) pp. 279–293.Google Scholar