Hostname: page-component-848d4c4894-p2v8j Total loading time: 0.001 Render date: 2024-05-30T21:23:13.723Z Has data issue: false hasContentIssue false

The Edinburgh Designer System as a framework for robotics: the design of behavior

Published online by Cambridge University Press:  27 February 2009

R. J. Popplestone
Affiliation:
Laboratory for Perceptual Robotics, Computer and Information Sciences, University of Massachusetts at Amherst, Amherst, MA 01003, U.S.A.

Abstract

I discuss how the capabilities of the Edinburgh Designer System can be extended and used to support symbolic computation for robotics. I conclude that the Algebra Engine requires to handle temporal constructs, groups and tolerances, that the taxonomy can support activity modules and that automatic plan formation would require the creation of a specialist.

Type
Research Article
Copyright
Copyright © Cambridge University Press 1987

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

Allen, J. F. 1983. Maintaining knowledge about temporal intervals. Communications of the Association for Computer Machinery, Vol 26, No 11.CrossRefGoogle Scholar
Armstrong, G. et al. 1982. Noname Description and Users Manual. Department of Mechanical Engineering, Leeds University, England.Google Scholar
Barrow, H. G. 1983. Proving the Correctness of Digital Hardware Designs. Proceedings of the National Conference on Artificial Intelligence, Washington, D.C.Google Scholar
Brachman, R. J. 1985. ‘I lied about the trees’, or defaults and definitions in knowledge representation. Al Magazine 6(3), 8093.Google Scholar
Brady, M., Hollerbach, J., Johnson, T., Lozano-Perez, T. and Mason, M. 1982. Robot Motion: Planning and Control. Cambridge, MA: MIT Press.Google Scholar
Brooks, R. A. 1982. Symbolic error analysis and robot planning. International Journal of Robotics Research 1(3), 2968.CrossRefGoogle Scholar
Bundy, A., Byrd, L., Luger, G., Mellish, C. and Palmer, M. 1979. Solving mechanics problems using meta-level inference. In: Specialist Systems in the Micro Electronics Age, Michie, D. (ed.). Edinburgh: Edinburgh University Press.Google Scholar
Burstall, R. M., Collins, J. S. and Popplestone, R. J. 1971. Programming in POP-2. Edinburgh: Edinburgh University Press.Google Scholar
Cameron, S. A. 1984. Modelling solids in motion. Ph.D. thesis, Department of Artificial Intelligence, Edinburgh University.Google Scholar
Clocksin, W. and Mellish, C. 1981. Programming in Prolog. New York: Springer-Verlag.Google Scholar
Codd, E. F. 1970. A relational model of data for large shared data banks. Communication of the Association for Computer Machinery 13, 377387.CrossRefGoogle Scholar
Cohn, P. M. 1965. Universal Algebra. Jointly published, New York: Harper and Row; Evanston, John Weatherhill.Google Scholar
Corner, D. F., Ambler, A. P., and Popplestone, R. J. 1983. Reasoning about the spatial relationships derived from a RAPT program for describing assembly by robot. Proceedings 8th International Joint Conference on Al, Karlsruhe, F.R.G, pp. 842844.Google Scholar
de Kleer, J. 1984. Choices without backtracking. Proceedings Conference American Association for Al, pp. 7985.Google Scholar
Fleming., A. 1985. Analysis of uncertainties in a structure of parts. International Joint Conference on AI 85, 11131115.Google Scholar
Hardy, S. 1984. A new software environment for list-processing and logic programming. In: Artificial Intelligence, Tools, Techniques and Applications, O'Shea, T. and Eisenstadt, M. (eds). New York: Harper and Row.Google Scholar
Hervé, J. M. 1978. Analyse structurelle des mécanismes par groupe des déplacements. Mechanism and Machine Theory 14(4).Google Scholar
Huet, G. 1978. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. Roquenfort, France: IRIA.Google Scholar
Shokichi, Iyanagra and Yukiyosi, Kawada. 1968. The Encyclopaedic Dictionary of Mathematics, English edition. Cambridge, MA: MIT Press; Tokyo: Iwanami Shoten (Japanese original).Google Scholar
Koutsou, A. 1986. Phd thesis, Department of Artificial Intelligence, Edinburgh University.Google Scholar
Latombe, J. C. 1977. Une application de I'intelligence artificielle à la conception assisstée par ordinateur (tropic). Thèse d'état, L'Université Scientifique et Médicale de Grenoble.Google Scholar
Lozano-Perez, T., Mason, M. T. and Taylor, R. H. 1984. Automatic synthesis of fine motion strategies for robots. International Journal of Robotics Research 3(1), 324.Google Scholar
Popplestone, R. J. 1979. Relational Programming. In Machine Intelligence 9, Mitchie, D. (ed.), Chichester, Sussex: Ellis Horwood.Google Scholar
Popplestone, R. J., Ambler, A. P. and Bellos, I. 1980. An interpreter for a language for describing assemblies. Artificial Intelligence 14(1), 79107.CrossRefGoogle Scholar
Popplestone, R. J., 1984. Group theory and robotics Robotics Research: The first International Symposium, Brady, M. and Paul, R. (eds). Cambridge, MA: MIT Press.Google Scholar
Popplestone, R. J. 1984. The application of artificial intelligence techniques to design systems. International Symposium on Design and Synthesis. Japan Society of Precision Engineering. Tokyo.Google Scholar
Popplestone, R. J. 1985. An integrated design system for engineering. Preprints of the 3rd International Symposium on Robotics Research, Gouvieux, France.Google Scholar
Requicha, A. A. G. and Tilove, R. B. 1978. Mathematical foundations of constructive solid geometry: general topology of closed regular sets. TM27A, Production Automation Project, University of Rochester, Rochester N.Y.Google Scholar
Requicha, A. A. G. and Tilove, R. B. 1983. Toward a theory of geometric tolerancing, International Journal of Robotics Research 2(4).CrossRefGoogle Scholar
Sloman, A. and Hardy, S. 1983. POPLOG: a multi-purpose multi language program development environment. Artificial Intelligence and Simulation of Behavior Quarterly, no. 47.Google Scholar
Tenenberg, J. 1986. Planning with abstraction. Proceedings Conference American Association for AI-86, pp. 7680.Google Scholar