Journal article 941 views
Motion Planning of Manipulators for Simultaneous Obstacle Avoidance and Target Tracking: An RNN Approach with Guaranteed Performance
Zhihao Xu,
Xuefeng Zhou,
Hongmin Wu,
Xiaoxiao Li,
Shuai Li 
IEEE Transactions on Industrial Electronics, Pages: 1 - 1
Swansea University Author:
Shuai Li
Full text not available from this repository: check for access using links below.
DOI (Published version): 10.1109/tie.2021.3073305
Abstract
Motion planning is a core issue in the field of robotic control, which directly affects the programming efficiency of robots. In this paper, we study the motion planning problem of manipulators for simultaneous obstacle avoidance and target tracking and propose a novel real-time planning method in a...
| Published in: | IEEE Transactions on Industrial Electronics |
|---|---|
| ISSN: | 0278-0046 1557-9948 |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2021
|
| Online Access: |
Check full text
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa56810 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract: |
Motion planning is a core issue in the field of robotic control, which directly affects the programming efficiency of robots. In this paper, we study the motion planning problem of manipulators for simultaneous obstacle avoidance and target tracking and propose a novel real-time planning method in a complex workspace. One important feature of the proposed method is that the robot can avoid colliding with obstacles by easily defining virtual fences, which are described by a group of level set functions. Thus, the feasible space can be abstracted as inequality constraints. Taking the predefined task, physical constraints, and feasible space constraints into consideration, the motion planning problem is formulated into quadratic programming (QP) one, in which the redundant DOFs are used to optimize the velocities of the robot. Then, the control command is obtained by an established recurrent neural network, which is capable of solving the QP problem in an online manner. Theoretical conduction and verification in several typical workspaces demonstrate the efficacy of the established method, such as the ability to remove physical fences, quick rearrangement, and performance optimization. |
|---|---|
| College: |
Faculty of Science and Engineering |
| Start Page: |
1 |
| End Page: |
1 |