2018
DOI: 10.1007/s12369-018-0487-2
|View full text |Cite
|
Sign up to set email alerts
|

Human-Like Motion Planning Based on Game Theoretic Decision Making

Abstract: Robot motion planners are increasingly being equipped with an intriguing property: human likeness. This property can enhance human-robot interactions and is essential for a convincing computer animation of humans. This paper presents a (multi-agent) motion planner for dynamic environments that generates human-like motion. The presented motion planner stands out against other motion planners by explicitly modeling human-like decision making and taking interdependencies between individuals into account, which is… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
31
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 44 publications
(31 citation statements)
references
References 82 publications
(132 reference statements)
0
31
0
Order By: Relevance
“…The RRT trajectory was selected from 1000 solutions produced by RRT reruns, preferring the one with the least number of curvature sign changes. (Note that the RRT provides a baseline comparison with a non piecewise-linear path; moreover, there is evidence that people perceive RRT paths as human-like [32].) The three chosen trajectories are shown in Fig.…”
Section: A Experimental Setupmentioning
confidence: 99%
“…The RRT trajectory was selected from 1000 solutions produced by RRT reruns, preferring the one with the least number of curvature sign changes. (Note that the RRT provides a baseline comparison with a non piecewise-linear path; moreover, there is evidence that people perceive RRT paths as human-like [32].) The three chosen trajectories are shown in Fig.…”
Section: A Experimental Setupmentioning
confidence: 99%
“…According to the conclusion of [33], it is difficult to find the optimal solution in the case of incomplete information. So reducing sensing overlap (1) for all adjacent grids next P1 of P 1 do (2) for all adjacent grids next P2 of P 2 do (3) Suppose the current adjacent grid of P 1 and P 2 is next P1(i) and next P2(j), respectively. According to LOS and the method in Section 3, calculate the shortest path set from current position of E to each boundary grid.…”
Section: Complexitymentioning
confidence: 99%
“…According to LOS and the method in Section 3, calculate the shortest path set from current position of E to each boundary grid. (4) Denote the shortest path set as Path PE(i, j) ∈ Path PE(i, j) (1), Path PE(i, j) (2) . .…”
Section: Complexitymentioning
confidence: 99%
See 1 more Smart Citation
“…In [ 30 ], haptic shared control for human-robot collaboration was modeled by a game-theoretical approach. In [ 31 ], human-like motion planning was studied based on game theoretic decision making. In [ 32 ], cooperative game was used for human-robot collaborative manufacturing.…”
Section: Introductionmentioning
confidence: 99%