Trajectory Redundancy in Point-to-Point Tracking and Applications to Obstacle Avoidance
Trajectory Redundancy in Point-to-Point Tracking and Applications to Obstacle Avoidance
For tasks which require a robot to track some particular points along a trajectory (instead of the whole trajectory), there exits redundancy. This redundancy, which results from the robot tracking more points than that required for the task, is called trajectory redundancy. This redundancy results in a increase in the feasibility of the task, enabling the possibility of the robot to obtain better performance by satisfying secondary objectives whilst performing the primary objective of tracking the target points.
Point-to-point learning control (LC) has been shown to be an effect tool to deal with the trajectory redundancy since it has the ability to fully explore the increased feasibility resulting
from such redundancy. This is done using the decomposition technique, which is widely used in solving kinematic redundancy, where the primary and secondary tasks are achieved
independently using the appropriate LC algorithms. In order to apply the proposed point-to-point algorithms for tasks such as tracking a target point whilst avoiding an obstacle, the
algorithms are modified and implemented in an online fashion. Simulation results shows good performance from the proposed point-to-point LC online algorithms.
1-6
Zhou, Shou-Han
528f9270-a93a-40b5-98ee-66794057b0dd
Tan, Ying
23bafadb-0655-48fe-9937-c59f01cb58ab
Oetomo, Denny
88a00d0d-e242-411c-9075-536628e0c782
Freeman, C T
ccdd1272-cdc7-43fb-a1bb-b1ef0bdf5815
Mareels, Iven
4347bb59-c0ef-4029-a9da-4f71ad22ad23
1 June 2013
Zhou, Shou-Han
528f9270-a93a-40b5-98ee-66794057b0dd
Tan, Ying
23bafadb-0655-48fe-9937-c59f01cb58ab
Oetomo, Denny
88a00d0d-e242-411c-9075-536628e0c782
Freeman, C T
ccdd1272-cdc7-43fb-a1bb-b1ef0bdf5815
Mareels, Iven
4347bb59-c0ef-4029-a9da-4f71ad22ad23
Zhou, Shou-Han, Tan, Ying, Oetomo, Denny, Freeman, C T and Mareels, Iven
(2013)
Trajectory Redundancy in Point-to-Point Tracking and Applications to Obstacle Avoidance.
IEEE International Conference on Robotics and Automation, , Karlsruhe, Germany.
06 - 10 May 2013.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
For tasks which require a robot to track some particular points along a trajectory (instead of the whole trajectory), there exits redundancy. This redundancy, which results from the robot tracking more points than that required for the task, is called trajectory redundancy. This redundancy results in a increase in the feasibility of the task, enabling the possibility of the robot to obtain better performance by satisfying secondary objectives whilst performing the primary objective of tracking the target points.
Point-to-point learning control (LC) has been shown to be an effect tool to deal with the trajectory redundancy since it has the ability to fully explore the increased feasibility resulting
from such redundancy. This is done using the decomposition technique, which is widely used in solving kinematic redundancy, where the primary and secondary tasks are achieved
independently using the appropriate LC algorithms. In order to apply the proposed point-to-point algorithms for tasks such as tracking a target point whilst avoiding an obstacle, the
algorithms are modified and implemented in an online fashion. Simulation results shows good performance from the proposed point-to-point LC online algorithms.
Text
ICRA_conf12_final
- Author's Original
More information
Submitted date: 6 May 2013
Published date: 1 June 2013
Venue - Dates:
IEEE International Conference on Robotics and Automation, , Karlsruhe, Germany, 2013-05-06 - 2013-05-10
Organisations:
EEE
Identifiers
Local EPrints ID: 344299
URI: http://eprints.soton.ac.uk/id/eprint/344299
PURE UUID: 78b0b6d7-a311-42d4-af89-3317b4d2f34b
Catalogue record
Date deposited: 16 Oct 2012 23:32
Last modified: 18 Nov 2024 17:33
Export record
Contributors
Author:
Shou-Han Zhou
Author:
Ying Tan
Author:
Denny Oetomo
Author:
C T Freeman
Author:
Iven Mareels
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics