Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-25T05:53:57.207Z Has data issue: false hasContentIssue false
  • English
  • Français

An approach to robot motion planning for time-varying obstacle avoidance using the view-time concept

Published online by Cambridge University Press:  09 March 2009

Nak Yong Ko ,
Bum Hee Leet  and
Myoung Sam Kot
Nak Yong Ko
Affiliation:
Department of Control and Instrumentation Engineering, Chosun University, Gwangjoo 501-759 (Korea)
Bum Hee Leet
Affiliation:
Department of Control and Instrumentation Engineering, Seoul National University, Shillim-Dong Kwanak-Ku, Seoul 151-742 (Korea)
Myoung Sam Kot
Affiliation:
Department of Control and Instrumentation Engineering, Seoul National University, Shillim-Dong Kwanak-Ku, Seoul 151-742 (Korea)
Get access Rights & Permissions [Opens in a new window]

Summary

An analytic solution approach to the time-varying obstacle avoidance problem is adopted. The problem considers the collision between any link of the robotic manipulator and the time-varying obstacle. The information on the motion and shape change of the obstacle is given prior to robot motion planning. To facilitate the problem, we analyze and formulate it mathematically in a robot joint space. We then introduce the view-time concept and analyze its properties. Using the properties of the view-time, a view-time based motion planning method is proposed. The view-time based method plans the robot motion by units of the view-time. In every view-time, it uses a stationary obstacle avoidance scheme. The proposed method is applied to the motion planning of a 2 DOF robotic manipulator in an environment with a polyhedral moving obstacle.

Keywords

Obstacle avoidance; View-time concept; Motion planning; Moving obstacle.
Type
Research Article
Information
Robotica , Volume 11 , Issue 4 , July 1993 , pp. 315 - 327
Copyright
Copyright © Cambridge University Press 1993

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.Lee, B.H., “Constraint identification in time-varying obstacle avoidance for mechanical manipulators” IEEE Trans. Syst., Man, Cybern. 19, No. 1, 140–143 (01/02, 1989).CrossRefGoogle Scholar
2.Fujimura, K. and Samet, H., “A hierarchical strategy for path planning among amoving obstacles” IEEE Trans. Robotics Automat, 5, No. 1, 61–69 (02, 1989).CrossRefGoogle Scholar
3.Erdmann, M. and Lozano-Pérez, T., “On multiple moving objects” Proc. 1986 IEEE Int. Conf. Robotics Automat.(1986) pp. 1419–1424.Google Scholar
4.Shin, C.L., Lee, T.T. and Gruver, W.A., “A unified approach for robot motion planning with moving polyhedral obstacles” IEEE Trans. Syst., Man, Cybern. 20, No. 4, 903–915 (07/08, 1990).Google Scholar
5.Lee, B.H. and Lee, C.S.G., “Collision-free motion planning of two robots” IEEE Trans. Syst., Man, Cybern. 17, No. 1, 21–32 (01/02, 1987).CrossRefGoogle Scholar
6.Kant, K. and Zucker, S.W., “Toward efficient trajectory planning: The path-velocity decomposition” Int. J. Robotics Res. 5, No. 3, 72–89 (Fall, 1986).CrossRefGoogle Scholar
7.Kant, K. and Zucker, S., “Planning collision-free trajec- tories in time-varying environments: A two-level hierarchy” Proc. 1988 IEEE Int. Conf. Robotics Automat.(1988) pp. 1644–1649.Google Scholar
8.Kyriakopoulos, K.J. and Saridis, G.N., “Collision avoidance of mobile robots in non-stationary environments” Proc. 1991 IEEE Int. Conf. Robotics Automat.(04, 1991) pp. 904–909.Google Scholar
9.Krogh, B.H., “A generalized potential field approach to obstacle avoidance control” SME Conf. Proc. Robotics Res.: The Next Five Years and Beyond, Bethlehem, Pennsylvania (08 1984).Google Scholar
10.Khatib, O., “Real-time obstacle avoidance for manipulators and mobile robots” Int. J. Robotics Res. 5, No. 1, 90–98 (Spring, 1986).CrossRefGoogle Scholar
11.Warren, C.W., “Multiple robot path coordination using artificial potential fields” Proc. 1990 IEEE Int. Conf. Robotics Automat.(1990) pp. 500–505.Google Scholar
12.Koren, Y. and Borenstein, J., “Potential field methods and their inherent limitations for mobile robot navigation” Proc. 1991 IEEE Int. Conf. Robotics Automat.(04, 1991) pp. 1398–1404.Google Scholar
13.Hwang, Y.K. and Ahuja, N., “A potential field approach to path planning” IEEE Trans. Robotics Automat. 8, No. 1, 23–32 (02, 1992).CrossRefGoogle Scholar
14.Volpe, R. and Khosla, P., “Manipulator control with superquadric artificial potential functions: Theory and experiments” IEEE Trans. Syst., Man, Cybern. 20, No. 6, 1423–1436 (11/12, 1990).CrossRefGoogle Scholar
15.Borenstein, J. and Koren, Y., “Real-time obstacle avoidance for fast mobile robots” IEEE Trans. Syst., Man, Cybern. 19, No. 5, 1179–1187 (09/10, 1989).CrossRefGoogle Scholar
16.Borenstein, J. and Koren, Y., “The vector field histogram- fast obstacle avoidance for mobile robots” IEEE Trans. Robotics Automat. 7, No. 3, 278–288 (06, 1991).CrossRefGoogle Scholar
17.Gilbert, E.G. and Johnson, D.W., “Distance functions and their application to robot path planning in the presence of obstacles” IEEE J. Robotics Automat. 1, No. 1, 21–30 (03, 1985).CrossRefGoogle Scholar
18.Gilbert, E.G., Johnson, D.W. and Keerthi, S.S., “A fast procedure for computing the distance between convex objects in three-dimensional space” IEEE J. Robotics Automat. 4, No. 2, 193–203 (04, 1988).CrossRefGoogle Scholar
19.Gilbert, E.G. and Foo, C.P., “Computing the distance between general convex objects in three-dimensional space” IEEE Trans. Robotics Automat. 6, No. 1, 53–61 (02, 1990).CrossRefGoogle Scholar
20.Bobrow, J.E., “A direct minimization approach for obtaining the distance between convex polyhedra” Int. J. Robotics Res. 8, No. 3, 65–76 (06, 1989).CrossRefGoogle Scholar
21.Lozano-Perez, T. and Wesley, M.A., “An algorithm for planning collision-free paths among polyhedral obstacles” Comm. ACM. 22, No. 10, 560–570 (10, 1979).CrossRefGoogle Scholar
22.Lin, C.S., Chang, P.R. and Luh, J.Y.S., “Formulation and optimization of cubic polynomial joint trajectories for industrial manipulators” IEEE Trans. Automat. Contr. AC-28, No. 12, 1066–1074 (12, 1983).CrossRefGoogle Scholar
23.Shin, K.G. and McKay, N.D., “Minimum-time control of robotic manipulators with geometric path constraints” IEEE Trans. Automat. Contr. AC-30, No. 6, 531–541 (06, 1985).CrossRefGoogle Scholar
24.Tan, H.H. and Potts, R.B., “Minimum time trajectory planner for the discrete dynamic robot model with dynamic constraints” IEEE J. Robotics Automat. 4, No. 2, 174–185 (04, 1988).CrossRefGoogle Scholar
25.Lozano-Perez, T., “A simple motion planning algorithm for general robot manipulators” IEEE Trans. Robotics Automat. 3, No. 3, 224–238 (06, 1987).CrossRefGoogle Scholar