2011 IEEE/RSJ International Conference on Intelligent Robots and Systems 2011
DOI: 10.1109/iros.2011.6048309
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of the discontinuities in prioritized tasks-space control under discreet task scheduling operations

Abstract: This paper examines the control continuity in hierarchical task-space controllers. While the continuity is ensured for any a priori fixed number of tasks-even in ill-conditioned configurations-, the control resulting from a hierarchical stack-of-task computation may not be continuous under some discrete events. In particular, we study how the continuity of the stack-of-task control computation is affected under discreet scheduling operations such as on-the-fly priority switching between tasks, or tasks inserti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
30
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(30 citation statements)
references
References 14 publications
0
30
0
Order By: Relevance
“…However, space-time data are not able to provide direct information on which tasks individual players were exploring and in what context, within the game. Because we were interested in the technical-tactical and exploratory behavior in the discrete task-space [52] the nominal scale was the scale of choice. Each 1 s window was defined as a 51-component binary vector representing the full action configuration during the same time interval.…”
Section: Methodsmentioning
confidence: 99%
“…However, space-time data are not able to provide direct information on which tasks individual players were exploring and in what context, within the game. Because we were interested in the technical-tactical and exploratory behavior in the discrete task-space [52] the nominal scale was the scale of choice. Each 1 s window was defined as a 51-component binary vector representing the full action configuration during the same time interval.…”
Section: Methodsmentioning
confidence: 99%
“…Much of earlier research has tried to assign priority between tasks [1][2] [3][4] to overcome incompatibility, also known as algorithmic singularity, between tasks. In spite of their successive achievements, there are some cases that fixed priority structures cannot fulfill task requirements, i.e., obstacle avoidance [5] [6], joint limits [7] [8], and task scheduling [9] [10], in which tasks need to be added, removed, or switched during operations.…”
Section: Introductionmentioning
confidence: 99%
“…Second, the parameters are coupled with task variables in an elaborate way, such that it is hard to analyze the behavior of the inverse mapping during transitions and it becomes aggravated near singularity. Third, it seems difficult to switch priority between tasks by interpolating task trajectories; it has been implemented by interpolating joint trajectories [8] [9].…”
Section: Introductionmentioning
confidence: 99%
“…{gerardo.jarquin,garechav,vicente.parra} @cinvestav.edu.mx in [11], by formulating variants of optimization problems. The authors proposed a linear interpolation strategy between control laws to swap two consecutive tasks.…”
mentioning
confidence: 99%
“…In this work, we focus on coupling TAs with recent continuous kinematic controllers reported in [9], [10] and [11]. This is possible because of the continuity properties of the proposed time base generator (TBG) that behaves as a TA.…”
mentioning
confidence: 99%