Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Anne-Sophie Puydupin-Jamin

dblp:116/6398 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Reinforcement learning · 87% 3D vision · 13%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
cost function learning
0.112012
A convex approach to inverse optimal control and its application to modeling human locomotion · ICRA 2012
Machine learning › Reinforcement learning › imitation learning › inverse reinforcement learning
inverse optimal control
0.112012
A convex approach to inverse optimal control and its application to modeling human locomotion · ICRA 2012
Computer vision › 3D vision › 3d motion analysis
human motion modeling
0.012012
A convex approach to inverse optimal control and its application to modeling human locomotion · ICRA 2012

Methods — techniques the papers use, named apart from their topics

least squares · 0.1convex optimization · 0.1
YearPublicationVenuePosition
2012 A convex approach to inverse optimal control and its application to modeling human locomotion
abstract
Inverse optimal control is the problem of computing a cost function that would have resulted in an observed sequence of decisions. The standard formulation of this problem assumes that decisions are optimal and tries to minimize the difference between what was observed and what would have been observed given a candidate cost function. We assume instead that decisions are only approximately optimal and try to minimize the extent to which observed decisions violate first-order necessary conditions for optimality. For a discrete-time optimal control system with a cost function that is a linear combination of known basis functions, this formulation leads to an efficient method of solution as an unconstrained least-squares problem. We apply this approach to both simulated and experimental data to obtain a simple model of human walking trajectories. This model might subsequently be used either for control of a humanoid robot or for predicting human motion when moving a robot through crowded areas.
Anne-Sophie Puydupin-Jamin, Miles Johnson, Timothy Bretl
ICRA1