Hostname: page-component-7dd5485656-kp629 Total loading time: 0 Render date: 2025-10-29T08:01:11.608Z Has data issue: false hasContentIssue false
  • English
  • Français

The application of logic programming to the generation of paths for robots*

Published online by Cambridge University Press:  09 March 2009

R. H. Davis  and
M. Camacho
R. H. Davis
Affiliation:
Department of Computer Science, Heriot-Watt University, 79, Grassmarket. Edinburg EH1 2HJ (U.K.)
M. Camacho
Affiliation:
Department of Computer Science, Heriot-Watt University, 79, Grassmarket. Edinburg EH1 2HJ (U.K.)
Get access Rights & Permissions [Opens in a new window]

Summary

This paper outlines a heuristic approach for the development of a control strategy for finding a safe path for a polyhedral object moving amongst known polyhedral objects. This is achieved by the algorithm A* for finding a minimum cost path in a graph; the algorithm is implemented on a computer under the UNIX operating system, using the NU7 version of PROLOG.

Information

Type
Article
Information
Robotica , Volume 2 , Issue 2 , April 1984 , pp. 93 - 103
Copyright
Copyright © Cambridge University Press 1984

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.)

Article purchase

Temporarily unavailable

References

1Boyse, J.W., “Interference Detection Among Solids and Surfaces” Communication of the ACM 22, No. 1, 3–9 (1979).CrossRefGoogle Scholar
2Pollack, M. and Wiebenson, H., “Solutions of the shortest-route problem” Operations Res. 8, (03–April, 1960).CrossRefGoogle Scholar
3Camacho, M., ‘Robot Programming Using Logic Programming’ M.Sc. Dissertation, Heriot-Watt University (06, 1983).Google Scholar
4Hart, P., Nilsson, N.J. and Raphael, B., “A formal basis for the heuristic determination of minimum cost paths” IEEE Trans. Syst. Sci. Cybernetics SSC-4, a, 100–107 (07, 1968).CrossRefGoogle Scholar
5Gelter, H., “Realization of geometry theorem proving machine” Computer and Thought (McGraw-Hill, N.Y., 1963).Google Scholar
6Nilsson, N.J., Principles of Artificial Intelligence (Tioga Publishing, California, 1980).Google Scholar
7Lozano-Perez, T., “The design of mechanical assembly system” (Artificial Intelligence Laboratory, M.I.T., Cambridge, Mass.).Google Scholar
8Udupa, S., “Collision and avoidance in computer controlled manipulators” Proc. 5th Int. Joint Conf. Artf. Intel. Cambridge, Mass. (1977) pp. 737–748.Google Scholar
9Nilsson, N.J., “A movable automaton: An application of Artificial Intelligence techniques” Proc. bit. Joint Conf., Artificial Intelligence (1969) pp. 509–520.Google Scholar
10Lyusternik, L.A., Convex Figures and Polyhedra (Dover Publications, N.Y., 1963). (Translated from Russian by Smith, T.J.; original copyright Moscow, 1956.)Google Scholar
11Preparata, F. and Hong, S., “Convex Hulls of Finite Sets of Point in Two and Three Dimensions” Communications of the ACM 20, No. 2, 87–93 (02, 1977).CrossRefGoogle Scholar
12Newman, W.M. and Sproull, R.F., Principles of Interactive Computer Graphics Second Edition (McGraw-Hill, N.Y., 1981).Google Scholar
13Warren, D.H.D., ‘Implementing Prolog — Compiling Predicate Logic Programs’. Technical Report 39 and 40 (Department of Artificial Intelligence, University of Edinburgh, 1977).Google Scholar