Collision free minimum time trajectory planning for manipulators using global search and gradient method

Motoji Yamamoto, Yukihiro Isshiki, Akira Mohri

Research output: Contribution to conferencePaper

7 Citations (Scopus)

Abstract

A method for time optimal collision free trajectory planning problem is proposed. In this paper, the dynamics of manipulator and obstacles are considered. This type of optimal trajectory planning problem is very difficult and complicated one because of non-linearity of manipulator dynamics and existence of obstacles. Generally, it results in a multimodal optimization problem. The proposed method is basically an iteratively improving one based on a gradient method. Firstly, two global methods (a genetic algorithm or an exact cell decomposition method) are used to search multiple initial feasible spatial paths for the gradient method. Next, the gradient method searches time optimal solution locally with the multiple initial feasible solutions. Simulation results show that this approach is effective to the time optimal collision free trajectory planning problem.

Original languageEnglish
Pages2184-2191
Number of pages8
Publication statusPublished - Dec 1 1994
EventProceedings of the IEEE/RSJ/GI International Conference on Intelligent Robots and Systems. Part 3 (of 3) - Munich, Ger
Duration: Sep 12 1994Sep 16 1994

Other

OtherProceedings of the IEEE/RSJ/GI International Conference on Intelligent Robots and Systems. Part 3 (of 3)
CityMunich, Ger
Period9/12/949/16/94

Fingerprint

Gradient methods
Manipulators
Trajectories
Planning
Genetic algorithms
Decomposition

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Yamamoto, M., Isshiki, Y., & Mohri, A. (1994). Collision free minimum time trajectory planning for manipulators using global search and gradient method. 2184-2191. Paper presented at Proceedings of the IEEE/RSJ/GI International Conference on Intelligent Robots and Systems. Part 3 (of 3), Munich, Ger, .

Collision free minimum time trajectory planning for manipulators using global search and gradient method. / Yamamoto, Motoji; Isshiki, Yukihiro; Mohri, Akira.

1994. 2184-2191 Paper presented at Proceedings of the IEEE/RSJ/GI International Conference on Intelligent Robots and Systems. Part 3 (of 3), Munich, Ger, .

Research output: Contribution to conferencePaper

Yamamoto, M, Isshiki, Y & Mohri, A 1994, 'Collision free minimum time trajectory planning for manipulators using global search and gradient method' Paper presented at Proceedings of the IEEE/RSJ/GI International Conference on Intelligent Robots and Systems. Part 3 (of 3), Munich, Ger, 9/12/94 - 9/16/94, pp. 2184-2191.
Yamamoto M, Isshiki Y, Mohri A. Collision free minimum time trajectory planning for manipulators using global search and gradient method. 1994. Paper presented at Proceedings of the IEEE/RSJ/GI International Conference on Intelligent Robots and Systems. Part 3 (of 3), Munich, Ger, .
Yamamoto, Motoji ; Isshiki, Yukihiro ; Mohri, Akira. / Collision free minimum time trajectory planning for manipulators using global search and gradient method. Paper presented at Proceedings of the IEEE/RSJ/GI International Conference on Intelligent Robots and Systems. Part 3 (of 3), Munich, Ger, .8 p.
@conference{e4845242d3c141be864458da1c51485b,
title = "Collision free minimum time trajectory planning for manipulators using global search and gradient method",
abstract = "A method for time optimal collision free trajectory planning problem is proposed. In this paper, the dynamics of manipulator and obstacles are considered. This type of optimal trajectory planning problem is very difficult and complicated one because of non-linearity of manipulator dynamics and existence of obstacles. Generally, it results in a multimodal optimization problem. The proposed method is basically an iteratively improving one based on a gradient method. Firstly, two global methods (a genetic algorithm or an exact cell decomposition method) are used to search multiple initial feasible spatial paths for the gradient method. Next, the gradient method searches time optimal solution locally with the multiple initial feasible solutions. Simulation results show that this approach is effective to the time optimal collision free trajectory planning problem.",
author = "Motoji Yamamoto and Yukihiro Isshiki and Akira Mohri",
year = "1994",
month = "12",
day = "1",
language = "English",
pages = "2184--2191",
note = "Proceedings of the IEEE/RSJ/GI International Conference on Intelligent Robots and Systems. Part 3 (of 3) ; Conference date: 12-09-1994 Through 16-09-1994",

}

TY - CONF

T1 - Collision free minimum time trajectory planning for manipulators using global search and gradient method

AU - Yamamoto, Motoji

AU - Isshiki, Yukihiro

AU - Mohri, Akira

PY - 1994/12/1

Y1 - 1994/12/1

N2 - A method for time optimal collision free trajectory planning problem is proposed. In this paper, the dynamics of manipulator and obstacles are considered. This type of optimal trajectory planning problem is very difficult and complicated one because of non-linearity of manipulator dynamics and existence of obstacles. Generally, it results in a multimodal optimization problem. The proposed method is basically an iteratively improving one based on a gradient method. Firstly, two global methods (a genetic algorithm or an exact cell decomposition method) are used to search multiple initial feasible spatial paths for the gradient method. Next, the gradient method searches time optimal solution locally with the multiple initial feasible solutions. Simulation results show that this approach is effective to the time optimal collision free trajectory planning problem.

AB - A method for time optimal collision free trajectory planning problem is proposed. In this paper, the dynamics of manipulator and obstacles are considered. This type of optimal trajectory planning problem is very difficult and complicated one because of non-linearity of manipulator dynamics and existence of obstacles. Generally, it results in a multimodal optimization problem. The proposed method is basically an iteratively improving one based on a gradient method. Firstly, two global methods (a genetic algorithm or an exact cell decomposition method) are used to search multiple initial feasible spatial paths for the gradient method. Next, the gradient method searches time optimal solution locally with the multiple initial feasible solutions. Simulation results show that this approach is effective to the time optimal collision free trajectory planning problem.

UR - http://www.scopus.com/inward/record.url?scp=0028756545&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028756545&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0028756545

SP - 2184

EP - 2191

ER -