ACM SIGGRAPH 2008 Classes 2008
DOI: 10.1145/1401132.1401209
|View full text |Cite
|
Sign up to set email alerts
|

Planning collision-free reaching motions for interactive object manipulation and grasping

Abstract: We present new techniques that use motion planning algorithms based on probabilistic roadmaps to control 22 degrees of freedom (DOFs) of human-like characters in interactive applications. Our main purpose is the automatic synthesis of collision-free reaching motions for both arms, with automatic column control and leg flexion. Generated motions are collision-free, in equilibrium, and respect articulation range limits. In order to deal with the high (22) dimension of our configuration space, we bias the random … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2009
2009
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 41 publications
(30 citation statements)
references
References 22 publications
0
28
0
Order By: Relevance
“…Kallmann et al [8] propose a Probabilistic Roadmap-based planning algorithm to synthesize reaching and grasping motion while assuming prior knowledge about the motion. Pan et al [9] propose an efficient method to plan the motion in constrained environment by classifying body parts into groups with low-correlation.…”
Section: Interaction In Animationmentioning
confidence: 99%
“…Kallmann et al [8] propose a Probabilistic Roadmap-based planning algorithm to synthesize reaching and grasping motion while assuming prior knowledge about the motion. Pan et al [9] propose an efficient method to plan the motion in constrained environment by classifying body parts into groups with low-correlation.…”
Section: Interaction In Animationmentioning
confidence: 99%
“…If there's no new collision-free configuration q new that either locates outside of the inactive regions, or satisfies the distance descending condition: e(q new ) < e goal , no further step toward goal regions is permitted in current loop, and the node q near in T is pushed into InactiveRegion list to prevent it from being chosen as an candidate extending configuration in the next iteration. Otherwise, q new is added to the branch of T by a straight-line edge, and the minimum distance error e goal is updated (line [5][6][7][8][9][10][11][12][13][14]. The collision detection relies on the PQP package from the University of North Carolina [15].…”
Section: B Goal_rrt Motion Planning Algorithmmentioning
confidence: 99%
“…Kuffner et al [5] presented bi-directional RRT-Connect approach to design collision-free motion of virtual human arm. Kallmann et al [6] proposed a biased RRT algorithm to account for manipulation tasks in dynamic environments. Yamane et al [7] combined the greedy RRT with the motion capture data to generate natural manipulation motion.…”
Section: Introductionmentioning
confidence: 99%
“…To further reduce the execution time so as to make them applicable in changing environments, these methods need to re-build the roadmap or adapt the roadmap to the environmental changes. As examples, in [19,20], roadmaps are maintained in the dynamic environment, i.e., all nodes that become invalid after an obstacle change are deleted. Nevertheless, new configurations have to be sampled again to fill the empty regions created, which is a time-costly procedure.…”
Section: Introductionmentioning
confidence: 99%