Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-24T18:37:24.533Z Has data issue: false hasContentIssue false
  • English
  • Français

Strategies of searching for collision-free manipulator motions: automata theory approach*

Published online by Cambridge University Press:  09 March 2009

Witold Jacak
Witold Jacak
Affiliation:
Institute of Engineering Cybernetics, Technical University, Janiszewskiego 11/17, 50–370 Wrocław (Poland)
Get access Rights & Permissions [Opens in a new window]

Summary

The paper present a model of the kinematics of a rotary, redundant manipulator, in the form of a Finite State Machine, this is in fact, an example of AI production systems. This model is able to supply us with succesive configurations, calculated immediately in Cartesian space and allowing at the same time to considerably simplify the computations engaged in the graph searching. For an automaton-type model of the manipulator kinematics, diverse strategies of searching for a collision-free trajectory, reduced to a search of an appropriate path in the state-transition graph of FSM, are analyzed.

Keywords

Collision-free movementRobotKinematicsFinite state machineGraph searching.
Type
Research Article
Information
Robotica , Volume 7 , Issue 2 , April 1989 , pp. 129 - 138
Copyright
Copyright © Cambridge University Press 1989

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.Pieper, D.L., “The kinematics of Manipulator under Computer Control”, Ph.D. Thesis (Stanford University 1968).Google Scholar
2.Nilsson, N.J., Principles of Artificial Intelligence (Tioga Publishing Co., California, 1980).Google Scholar
3.Lozano-Perez, T., “Automatic Planning of Manipulator Transfer Movements”, IEEE Trans. SMC 11, 681–698 (1981).Google Scholar
4.Khatib, O., Commande Dynamique dans l'Espace Operationnel des Robots Manipulateurs en Presence d'Obstacles” Ph.D. Thesis (Toulouse, 1980).Google Scholar
5.Ozaki, H. & Mohri, A., “Planning of Collision-free Movements of a Manipulator with Dynamic Constraints” Robotica 4(3), 163–169 (1986).Google Scholar
6.Brooks, R.A., “Planning collision free motions for pick-and-place operations” Intern. J. Robotics Res. 2(4), 19–44 (1983).CrossRefGoogle Scholar
7.Gouzenes, L., “Strategies for Solving Collision-free Trajectories Problems for Mobile and Manipulator Robots” Intern. J. Robotics Res. 3(4), 51–65 (1984).Google Scholar
8.Lumelsky, V.J., “Continuous motion Planning, in unknown environment for a 3D Cartesian robot arm” IEEE Conf. on Robotics and Automation 2, 1050–1055 (1986).Google Scholar
9.Herman, M., “Fast three dimensional collision-free motion planning” IEEE Int. Conf. on Robotics and Automation 2, 1057–1063 (1986).Google Scholar
10.Paul, R.P., Robot Manipulators: Mathematics, Programming and Control (MIT Press, Cambridge, Mass. 1981).Google Scholar
11.Lozano-Perez, T., “Spatial Planning: Configuration Space Approach” IEEE Trans, on Computers 32(2), 108–120 (1983).Google Scholar
12.Lozano-Perez, T., “Task Planning” In: Robot Motion: Planning and Control (Ed. Brady, M. et al. ) (MIT Press, Cambridge, Mass., 1983) pp. 463–489.Google Scholar
13.Luh, J.Y. & Campbell, C., “Minimum Distance Collision-Free Path Planning for Industrial Robots with a Prismatic Joint” IEEE Trans. Autom. Control 29(8), 675–680 (1984).Google Scholar
14.Gerke, W., “Collision-free and Shortest Path for Industrial Robots Found by Dynamic Programming” Robotersysteme 1, 43–52 (1985).Google Scholar
15.Jurevic, E.J., The Dynamics of Robots Control (in Russian) (Nauka, Moscow 1984).Google Scholar
16.Jacak, W., Łysakowska, B. & Sierocki, I., “Planning collision-free movements of a robot: A systems theory approach” Robotica 6, 289–296 (1988).CrossRefGoogle Scholar
17.Yu, Z. & Khalil, W., “Table look up for Collision detection and safe operation of robots” Proc. IFAC Symp. Theory of Robots, Vienna, 407–411 (1986).Google Scholar
18.Charniak, E. & McDermot, D., Introduction to Artificial Intelligence (Addison-Wesley Pub. Massachusetts 1985).Google Scholar
19.Lee, D.T. & Preparata, P.P., “Computational Geometry— A survey” IEEE Tran, on Computers 33(12), 1072–1101 (1984).Google Scholar
20.Dobkin, D.P. & Kirkpatrick, D.G., “Fast detection of polyhedral intersection” Theoret. Comp. Sci. 27, 241–253 (1983).Google Scholar
21.Shamos, M.I. & Hoey, D., “Geometric intersection problems” Proc. 17th IEEE Ann. Symp. Found. Comp. Sci. 208–215 (1976).Google Scholar
22.Jacak, W. & Sierocki, I., “A discrete model of robot's kinematics” Proc. of IFAC Symp. Theory of Robots, Vienna 25–28 (1986).Google Scholar