2012
DOI: 10.1177/0278364912461539
|View full text |Cite
|
Sign up to set email alerts
|

Multiple impacts: A state transition diagram approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
31
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 37 publications
(33 citation statements)
references
References 49 publications
1
31
0
Order By: Relevance
“…Simulation schemes to this problem (e.g. [9,11,19,22,24,36,41] and many others) focus on generation of a single solution via a heuristic (symmetry [22], potential energy [41], etc.). However, for many practical applications in robotics, it is not possible to create a model detailed enough to reliably disambiguate between the multiple potential solutions; essentially, the disambiguation performed by common simulation schemes is not grounded in physical principles.…”
Section: Introductionmentioning
confidence: 99%
“…Simulation schemes to this problem (e.g. [9,11,19,22,24,36,41] and many others) focus on generation of a single solution via a heuristic (symmetry [22], potential energy [41], etc.). However, for many practical applications in robotics, it is not possible to create a model detailed enough to reliably disambiguate between the multiple potential solutions; essentially, the disambiguation performed by common simulation schemes is not grounded in physical principles.…”
Section: Introductionmentioning
confidence: 99%
“…Extension to fast computation of multi-body impacts also awaits investigation. Such an impact can be either sequenced into two-body impacts (Chatterjee and Ruina, 1998) or treated as simultaneous impacts interacting with each other (Liu et al 2008;Jia et al 2013). With the first approach, Algorithm 1 is directly applicable to solving individual two-body impacts.…”
Section: Discussionmentioning
confidence: 99%
“…1: compute Λ(k + 1) by (5). If Λ(k + 1) ≠ 0, go to Step 2, otherwise go to Step 3 2: if Λ(k + 1) > 0, set y F = −c 1 , or, if Λ(k + 1) < 0, set y F = c 2 , and computė…”
Section: Algorithm 1 Computation Of a Reference Trajectorymentioning
confidence: 99%