A heuristic approach to robot path planning based on task requirements using a genetic algorithm
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
88 | en_US |
dc.citation.issue |
1 | en_US |
dc.citation.spage |
65 | en_US |
dc.citation.volume |
16 | en_US |
dc.citation.woscount |
5 | |
dc.contributor.author |
Sheu, CH | en_US |
dc.contributor.author |
Young, KY | en_US |
dc.contributor.department |
交大名義發表 | zh_TW |
dc.contributor.department |
電控工程研究所 | zh_TW |
dc.contributor.department |
National Chiao Tung University | en_US |
dc.contributor.department |
Institute of Electrical and Control Engineering | en_US |
dc.date.accessioned |
2014-12-08T15:02:41Z | |
dc.date.available |
2014-12-08T15:02:41Z | |
dc.date.issued |
1996-05-01 | en_US |
dc.description.abstract |
In order to enhance integration between CAD and robots, we propose a scheme to plan kinematically feasible paths in the presence of obstacles based on task requirements, Thus, the feasibility of a planned path from a CAD system is assured before the path is sent for execution. The proposed scheme uses a heuristic approach to deal with a rather complex search space, involving high-dimensional C-space obstacles and task requirements specified in Cartesian space. When the robot is trapped by the local minimum in the potential field related to the heuristic, a genetic algorithm is then used to find a proper intermediate location that will guide it to escape out of the local minimum. For demonstration, simulations based on using a PUMA-typed robot manipulator to perform different tasks in the presence of obstacles were conducted. The proposed scheme can also be used for mobile robot planning. | en_US |
dc.identifier.issn |
0921-0296 | en_US |
dc.identifier.journal |
JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/1322 | |
dc.identifier.wosnumber |
WOS:A1996UX30400004 | |
dc.language.iso |
en_US | en_US |
dc.subject |
task requirement | en_US |
dc.subject |
obstacle avoidance | en_US |
dc.subject |
genetic algorithm | en_US |
dc.subject |
heuristic approach | en_US |
dc.subject |
robot path planning | en_US |
dc.subject |
CAD/robot integration | en_US |
dc.title |
A heuristic approach to robot path planning based on task requirements using a genetic algorithm | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 期刊論文
引用此條目
Sheu, C., & Young, K. (1996). A heuristic approach to robot path planning based on task requirements using a genetic algorithm. JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, 16(1), 65–88. https://ir.lib.nycu.edu.tw/handle/11536/1322
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/1322