User profiles for Alan Fern
![]() | Alan FernOregon State University Verified email at oregonstate.edu Cited by 10436 |
[PDF][PDF] FF-Replan: A Baseline for Probabilistic Planning.
FF-Replan was the winner of the 2004 International Probabilistic Planning Competition (IPPC-04)(Younes
& Littman 2004a) and was also the top performer on IPPC-06 domains, …
& Littman 2004a) and was also the top performer on IPPC-06 domains, …
Visualizing and understanding atari agents
While deep reinforcement learning (deep RL) agents are effective at maximizing rewards, it
is often unclear what strategies they use to do so. In this paper, we take a step toward …
is often unclear what strategies they use to do so. In this paper, we take a step toward …
Multi-task reinforcement learning: a hierarchical bayesian approach
We consider the problem of multi-task reinforcement learning, where the agent needs to
solve a sequence of Markov Decision Processes (MDPs) chosen randomly from a fixed but …
solve a sequence of Markov Decision Processes (MDPs) chosen randomly from a fixed but …
Blind bipedal stair traversal via sim-to-real reinforcement learning
Accurate and precise terrain estimation is a difficult problem for robot locomotion in real-world
environments. Thus, it is useful to have systems that do not depend on accurate estimation …
environments. Thus, it is useful to have systems that do not depend on accurate estimation …
Discriminatively trained particle filters for complex multi-object tracking
R Hess, A Fern - 2009 IEEE conference on computer vision …, 2009 - ieeexplore.ieee.org
This work presents a discriminative training method for particle filters in the context of multi-object
tracking. We are motivated by the difficulty of hand-tuning the many model parameters …
tracking. We are motivated by the difficulty of hand-tuning the many model parameters …
A decision-theoretic model of assistance
There is a growing interest in intelligent assistants for a variety of applications from sorting
email to helping people with disabilities to do their daily chores. In this paper, we formulate the …
email to helping people with disabilities to do their daily chores. In this paper, we formulate the …
Approximate policy iteration with a policy language bias
We explore approximate policy iteration, replacing the usual costfunction learning step with
a learning step in policy space. We give policy-language biases that enable solution of very …
a learning step in policy space. We give policy-language biases that enable solution of very …
[PDF][PDF] Explainable reinforcement learning via reward decomposition
We study reward decomposition for explaining the decisions of reinforcement learning (RL)
agents. The approach decomposes rewards into sums of semantically meaningful reward …
agents. The approach decomposes rewards into sums of semantically meaningful reward …
A bayesian approach for policy learning from trajectory preference queries
We consider the problem of learning control policies via trajectory preference queries to an
expert. In particular, the learning agent can present an expert with short runs of a pair of …
expert. In particular, the learning agent can present an expert with short runs of a pair of …
[PDF][PDF] Fast Online Trajectory Optimization for the Bipedal Robot Cassie.
We apply fast online trajectory optimization for multi-step motion planning to Cassie, a
bipedal robot designed to exploit natural spring-mass locomotion dynamics using lightweight, …
bipedal robot designed to exploit natural spring-mass locomotion dynamics using lightweight, …