Proceedings of the 26th Annual International Conference on Machine Learning 2009
DOI: 10.1145/1553374.1553508
|View full text |Cite
|
Sign up to set email alerts
|

Robot trajectory optimization using approximate inference

Abstract: The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to first compute an optimal (deterministic) trajectory and then solve a local linear-quadratic-gaussian (LQG) perturbation model to handle the system stochasticity. We present a new algorithm for this approach which improves upon previous algorithms like iLQG. We consider a probabilistic model for which the maximum likelihood (ML) trajec… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
337
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 277 publications
(338 citation statements)
references
References 9 publications
0
337
0
Order By: Relevance
“…Our first contribution is to generate legible motion via functional gradient optimization in the space of trajectories (Sec. IV), echoing earlier works in motion planning [9,21,22,27,29,33,35], now with legibility as an optimization criterion. Fig.1 depicts this optimization process: by exaggerating the motion to the right, the robot makes the other goal option, G O , far less likely to be inferred by the observer that the correct goal G R .…”
Section: Introductionmentioning
confidence: 74%
“…Our first contribution is to generate legible motion via functional gradient optimization in the space of trajectories (Sec. IV), echoing earlier works in motion planning [9,21,22,27,29,33,35], now with legibility as an optimization criterion. Fig.1 depicts this optimization process: by exaggerating the motion to the right, the robot makes the other goal option, G O , far less likely to be inferred by the observer that the correct goal G R .…”
Section: Introductionmentioning
confidence: 74%
“…Despite recent efforts at reducing the computational costs of such global searches for a feasible path (Diankov and Kuffner, 2007;Burns and Brock, 2005;Toussaint, 2009), these methods cannot offer the reactivity sought for swiftly avoiding obstacles that appear suddenly.…”
Section: Related Workmentioning
confidence: 99%
“…When we collaborate, we make two inferences ( Fig.1,lower center) about our collaborator [12,54,56]: 1) we infer their goal based on their ongoing action (action-to-goal), and 2) if we know their goal, we infer their future action from it (goal-to-action). Our work Fig.…”
Section: Introductionmentioning
confidence: 99%