# Active Preference Learning using Maximum Regret

## Abstract

We study active preference learning as a framework for intuitively specifying the behaviour of autonomous robots. A user chooses the preferred behaviour from a set of alternatives, from which the robot learns the user’s preferences, modeled as a parameterized cost function. Previous approaches present users with alternatives that minimize the uncertainty over the parameters of the cost function. However, different parameters might lead to the same optimal behaviour; as a consequence the solution space is more structured than the parameter space. We exploit this by proposing a query selection that greedily reduces the maximum error ratio over the solution space. In simulations we demonstrate that the proposed approach outperforms other state of the art techniques in both learning efficiency and ease of queries for the user. Finally, we show that evaluating the learning based on the similarities of solutions instead of the similarities of weights allows for better predictions for different scenarios.

## I Introduction

Recently, research in human robot interaction (HRI) has focused on the design of frameworks that enable inexperienced users to efficiently deploy robots [1, 2, 3, 4, 5, 6]. Autonomous mobile robots for instance are capable of navigating with little to no human guidance; however, user input is required to ensure their behaviour meets the user’s expectations. For example, in industrial facilities, a robot might need to be instructed about the context and established workflows or safety regulations [7], or an autonomous car should learn which driving style a passenger would find comfortable [8, 9]. Users who are not experts in robotics find it challenging to specify robot behaviour that meets their preferences [3].

Active preference learning offers a methodology for a robot to learn user preferences through interaction [1, 2, 10, 11, 3, 12]. Users are presented with a sequence of alternative behaviours to a specific robotic task and choose their preferred alternative.
Figure 1 shows an example of learning user preferences for an autonomous vehicle where alternative behaviours are presented on an interface.
Usually, the user is assumed to make their choice based on an internal, hidden cost function. The objective is to learn this cost function such that a robot can optimize its behaviour accordingly. Often, the user cost function is modelled as a weighted sum of predefined features [1]. Hence, learning the cost function is reduced to learning the weights. The key questions in this methodology are (1) how to select a set of possible solutions that are presented to the user such that the cost function can be learned from few queries to the user, and (2) can the user choose reliably between these solutions.

In this work we propose a new approach for selecting solutions in active preference learning. In contrast to the work of [1, 13, 2] our approach does not focus on reducing the uncertainty of the belief over the weights; instead, we consider the set of all possible solutions to the task. Different weights in the user cost function might correspond to similar or even equal optimal solutions; in optimization problems this is known as sensitivity [14]. Thus, even if the estimated weights do not equal the true user weights, the corresponding solution might be the same. Therefore, we propose a new measure for active preference learning: The regret of the learned path. The concept of regret is known in robust shortest path problems [15, 16]. Consider two sets of weights for a user cost function, one that is optimal for a user and one that was estimated through active preference learning. The regret of the estimate captures the suboptimality of the solution found using the estimated weights, i.e., the ratio of the cost of the estimated solution evaluated by the optimal weights and the cost of the optimal solution, evaluated by the optimal weights.

We use the notion of regret to select alternatives to show to the user. From a set of solutions that are considered equally good for the user given the feedback obtained so far, we choose the pair of solutions that, if is the optimum, the ratio of costs is maximised. As the user either rejects or we remove the most sub-optimal alternative from our solution space. In each iteration, our proposed approach optimizes over the set of all solutions that are consistent with the user feedback obtained so far. It then presents the user with the pair of solutions where the regret is maximized.

Following the motivation for regret, we evaluate the results of active preference learning based on the learned solution, instead of the learned weights. Therefore, we use the relative error in the cost of paths as a metric. This mirrors how an actual user would evaluate a robot’s behaviour: Users are not interested in what weights are used by a robot’s motion planner; one of the main motivations for active preference learning is that users find it challenging to express weights for cost or reward functions. Instead users judge a robot’s behaviour by how similar it is to what they deem as optimal.

### I-a Related Work

The concept of learning a hidden cost or reward function from a user is widely used in various human-robot interaction frameworks, such as learning from demonstrations (LfD) [4, 17], learning from corrections [18, 19] and learning from preferences [1, 17, 13, 12, 3].

Closely related to our work, the authors of [1, 13] and [2] investigate how active preference learning can be used to shape a robot’s behaviour. Thereby a general robot control problem with continuous states and actions is considered. The user cost function is modelled as weighted sum of features. They show that the robot is able to learn user preferred behaviours from few iterations using active preference learning. In [1] and [13], Dragan and colleagues investigate a measure for selecting a new pair of possible solutions to be shown to the user based on the posterior belief over the set of all weights. In detail, new solutions are selected such that the integral over the unnormalized posterior, called volume, is minimized in expectation. This approach is revised in [2], where a failure case for the volume removal is demonstrated. As an alternative measure, the authors propose the information entropy of the posterior belief over the weights. We show that both of the above approaches disregard the sensitivity of the underlying motion planning problem: Learning about weights of a cost function can be inefficient, as different weights can lead to the same optimal behaviour. In our previous work [12] we discretized the weight space into equivalence regions, i.e., sets of weights where the optimal solution of the planning problem is the same.

Another concern during active preference learning is to present alternatives to the user that are easy for them to differentiate which leads to a lower error rate. The authors of [20] investigate strategies for active learning that consider the flow of the queries to reduce the mental effort of the user and thus decrease the user’s error rate. Similarly, [2] optimizes for queries that are easy to answer. In our work, we present an active query strategy that features these properties intrinsically: By maximizing the regret of the presented paths, we automatically choose paths that are different with respect to the user cost function and thus are expected to be easily distinguishable for the user.

### I-B Contributions

We contribute to the ongoing research in active preference learning as a framework for specifying complex robot behaviours. We propose a measure for evaluating the solution found by preference learning based on the robot’s learned behaviour instead of the learned weights in the cost function. Further, we propose a new active query selection guided by the maximum error ratio between solutions. Thereby, users are presented with the pair of solutions that has the maximum error ratio among all paths in the feasible solution space. We demonstrate the performance of our approach by comparing it to a competing state of the art technique and show that our proposed method learns the desired behaviour more efficiently. Moreover, the queries the user is presented with are easier to answer and thus lead to more reliable user feedback. Finally, we demonstrate how our measure based on solutions gives better predictions about the behaviour of the robot in different scenarios that were not part of the learning.

## Ii Problem Statement

#### Preliminaries

Let be the state space of a robot and the environment it is acting in and some start state. Further, we have an action space where each potentially only affect parts of the state, i.e., there might be static or dynamic obstacles unaffected by the robot’s actions.

Further let be a path of finite length starting at . A path is evaluated by a column vector of predefined features . Together with a row vector of weights we define the cost of a path as

(1) |

Given some weight let the optimal path be . The optimal cost for a weight is

(2) |

For any other weight , we call the cost of evaluated by .

#### Problem Formulation

We consider a robot’s state and action space and some start state . Further, let a vector of weights , describing a user’s preference for the robot’s behaviour and the corresponding optimal path . Each weight has a lower and upper bound and . However, itself is hidden. We can learn about by presenting the user with pairs of paths over iterations. The objective is to find an estimated path that reflects the user preferences , i.e., is as similar to as possible. To evaluate the result of learning the authors of [1] propose the alignment metric, i.e., the cosine of the angle between the learned weight vector and . We adapt this metric and transform it to a normalized error between and , which we call the weight error:

(3) |

The alignment metric was also used in [13, 2]. However, this metric has two potential shortcomings: 1) It does not consider the sensitivity of the optimization problem that finds an optimal path for a given weight vector. Thus, an error in might actually not result in a different optimal path. Moreover, even if the learned weight has a relatively small error, the corresponding path might be suboptimal to the user. 2) The weight error is not suitable as a test error (i.e., to test whether the learned user preferences generalize well to new task instances not encountered during learning) since it does not consider the robot’s resulting behaviour: is equal for all training and test instances. Hence, the weight error gives no insight into how well the estimated preferences translate into different scenarios, unless , i.e,. the optimal weights are found. Therefore, we choose a different metric for evaluating the learned behaviour: Instead of the learned weight we consider the learned path . We compare the cost of , evaluated by the user’s true cost to the optimal cost path of :

(4) |

This error was proposed in [21] and we refer to it as the path error. A similar error was used in [22] for finding risk-aware policies in inverse reinforcement learning. Based on this metric we can now formally pose the learning problem.

###### Problem 1.

Given and , and a user with hidden weights who can be queried over iterations about their preference between two paths and , find a weight with the corresponding optimal path starting at that minimizes .

## Iii Active Preference Learning

We introduce the user model and learning framework of our active preference learning approach and then discuss several approaches for selecting new solutions in each iteration.

### Iii-a User Model

To learn about and thus find , we can iteratively present the user with a pair of paths and they return the one they prefer:

(5) | ||||

However, a user might not always follow this model exactly. For instance, they might consider features that are not in the model or they are uncertain in their decision when and are relatively similar. Thus, we extend equation (5) to a probabilistic model, similar to our previous work in [12]. Let be a binary random variable where if the user prefers path over , and otherwise. Then we have

(6) | ||||||

where . If we recover the deterministic case from equation (5). In this very simple model the user’s choice does not depend on how similar and are. In the simulations we simulate the user with to the more complex model in [2], which poses the user’s error rate as a function of the similarity between alternatives, and show that equation (6) nonetheless allows us to achieve strong performance.

### Iii-B Learning Framework

Over multiple iterations, equation (5) yields a collection of inequalities of the form . We write the feedback obtained after iterations as a sequence . Without loss of generality, we assume that for any pair in the path was preferred over the path . We then summarize the left-hand-sides for all iterations using a matrix . Based on the sequence we can compute an estimate of by taking the expectation.

#### Deterministic case

In the deterministic case, i.e., , the estimate must satisfy to be consistent with the user feedback obtained thus far. The set of all such weights constitutes the feasible set .

### Iii-C Active Query Selection

In active preference learning we can choose a pair of paths to present to the user in each iteration .
Throughout this work we only consider paths and that are optimal for some weights and .
Given the user feedback obtained until iteration , a new pair is found by maximizing some measure describing the expected learning effect from showing to the user.
Recently, several measures have been introduced:
Removing the Volume, i.e., minimizing the integral of the unnormalized posterior over the weights [1, 13], maximizing the information entropy over the weights [2] and removing equivalence regions, i.e., sets of weights where for each weight has the same optimal path [12].

#### Parameter space and solution space

The first two approaches maximize information about the parameter space, i.e., the weights , instead of the solution space, i.e., the set of all possible paths . Despite its motivation based on inverse reinforcement learning, this has a major drawback: The difference in the parameters does not map linearly to the difference in the features of corresponding optimal solutions. Given some and , we can compute optimal paths and with features and , respectively. Then does not necessarily hold. Thus, learning efficiently about does not guarantee efficient or effective learning about paths. Moreover, learning about might allow for disregarding a large number of weights. However, the corresponding optimal paths might be very similar and thus the learning step is potentially less informative in the solution space.

###### Example 1.

We consider the autonomous driving example from [2] which is posed in a continuous state and action space, illustrated in Figure 1. In Figure 2 we compare the weight error and the path error of uniformly random samples. While the weight error is distributed uniformly, the path error distribution takes nearly a discrete form, despite the continuous action space. This illustrates how different weights do not necessarily lead to different solutions, making the solution space more structured than the parameter space.

In our previous work [12] we proposed a query selection based on a discretization of the weight space: Sets of weights that have the same optimal path are labeled as equivalence regions. The objective then is to maximally reduce the posterior belief over equivalence regions, i.e, to reject as many equivalence regions as possible. A drawback of this approach is that there exists cases where any query only allows for updating the belief of few equivalence regions, resulting in slow convergence. Because of these limitations of the existing approaches we study a new measure based on the solution space.

## Iv Min-Max Regret Learning

We propose a new measure called the maximum regret, which we seek to minimize.

###### Definition 1 (Regret of weights).

Given a weight with its corresponding optimal path and some weight , the regret of under is

(7) |

Regret expresses how sub-optimal a path is when evaluated by some weights . In active learning, this can be interpreted as follows: If is the final estimate, but is the optimal solution, how large is the ratio between the cost of , evaluated by , and the optimal cost? We now formulate an approach for selecting which alternatives to show to the user by using regret.

### Iv-a Deterministic Regret

When assuming a deterministic user, we need to assure that and , such that the presented paths reflect the user feedback obtained so far. Given we pose the Maximum Regret under Constraints Problem (MRuC) as

(8) | ||||

The objective can be written in the form . This is a bi-linear program, which are a generalization of quadratic programs. Unfortunately, in our case the objective function is non-convex; generally, such problems are hard to solve.

#### Symmetric Regret

In equation (8) we have defined the maximum regret problem when one path is given. While presenting users with a new pair of paths , we want to find paths where the regret of under is maximized and vice versa. Thus, we rewrite the objective in (8) to , which we call the symmetric regret. The maximum symmetric regret of a feasible set can be found with the following bi-linear program:

(9) | ||||

### Iv-B Probabilistic Regret

We now formulate regret with consideration of the user’s uncertainty when choosing among paths. Taking a Bayesian perspective we treat as a random vector. This allows us to express a posterior belief over given an observation . Let and , respectively. Further, we assume a uniform prior over . For any estimate where we have

(10) |

Let denote . We calculate the posterior given a sequence of user feedback as

(11) |

We formulate the symmetric regret in the probabilistic case by weighting the regret by the posterior of and :

(12) | ||||

That is, we discount the symmetric regret such that we only consider pairs where both and are likely given the user feedback .

Finally, we adapt the problem of finding the maximum symmetric regret from equation (9) to the probabilistic case. As we cannot formulate a feasible set for a probabilistic user, we consider a finite set where each is uniformly randomly sampled from the set . We then take the maximum over all to compute the probabilistic maximum regret

(13) |

In min-max regret learning, we choose the pair of paths that is the maximizer of equation (13).

### Iv-C Preference Learning with Probabilistic Maximum Regret

Our proposed solution for active preference learning using probabilistic maximum regret is summarized in Algorithm 1. In each iteration we find the pair that maximizes the probabilistic symmetric regret as in equation (13) over a set of samples (line 4). We then obtain user feedback if the user prefers path and otherwise (line 7) and add the feedback to a sequence (line 6-10). After iterations, we return the path that is optimal for the expected weight, given the observed user feedback (line 11). Using the maximum regret in the query selection is a greedy approach to minimize the maximum error. Given the current belief over the weights, we choose the pair with the maximum error ratio, discounted by the likelihoods of and .

## V Evaluation

We evaluate the proposed approach using the simulation environment from [2], allowing us to compare our approach to theirs in the same experimental setup.
To label the approaches let denote the maximum entropy learning from [2] and our maximum regret learning.

#### Learning experiments

First, we consider one of the experiments in [2]: The autonomous driving scenario (Driver) where an autonomous car moves on a three lane road in the presence of a human-driven vehicle as shown in Figure 1. Paths are described by four features: Heading relative to the road, staying in the lane, vehicle speed, and the distance to the other car. Every feature is averaged over the entire path. Furthermore, we introduce the Extended Driver experiment with additional features to create a more complex scenario. In addition to the above features we add the distance travelled along the road, the summed lateral movement, summed and maximum lateral and angular acceleration, the minimal speed, and the minimum distance to the other vehicle. We choose the Driver example because the entropy approach from [2] showed strong results and this scenario was already previously investigated in [1]. The extension aims to show how the learning techniques behave in higher dimensions.

Additionally we consider a third experiment adapted from [12, 3]: An autonomous mobile robot navigates between given start and goal locations in a known environment. However, there are areas in the environment that a user marked as desired or undesired for robot traffic. Each such area is a soft constraint, i.e., there is a penalty or reward associated with it, which can be expressed by a weight. By defining features for all areas describing if a robot trajectory passes through yields a cost function of the form . Here is an dimensional vector, the first entries are the features describing the length of path in area for all . The -th feature is the time it takes the robot to execute path . The robot is unaware of the value of each penalty and reward, i.e., the weights are not given to the robot, yielding an instance of Problem 1. We will refer to this experiment as Mobile. The instance of the problem used for evaluation consists of areas; thus, the dimensionality of the feature and weight space is .

#### Optimal paths

Given a weight we need to find the corresponding optimal path in order to evaluate the path error (and to compute regret in Algorithm 1). In [2] no motion planner is given; in the experiments we rely on the generic non-linear optimizer L-BFGS [23] for the Driver and Extended Driver experiments. However, depending on the problem, this solver can return suboptimal solutions. To mitigate this effect, we pre-sample paths which are used as a look-up-table. Given a path that was found using L-BFGS, we iterate over all pre-sampled paths; if a sampled path yields a better cost for the given weight, we use that path instead.
In both experiments, the entropy approach uses the implementation provided by [2] where queries are chosen from pre-sampled pairs of random paths. Since regret requires optimal paths, the regret approach uses a set of weights with their corresponding optimal paths, yielding possible pairs of paths^{1}

In the Mobile experiment the robot moves using a state lattice planner [24]; given a weight we can always find an optimal path in polynomial time. We varied the problem setup by choosing three different start and goal locations for the robot to navigate between. For each start goal pair we need to pre-sample paths individually. The discrete state space led to a significantly smaller set of pre-samples, varying between and . However, using randomly generated paths as in [2] for led to very poor performance. Therefore, we slightly modified the approach for this experiment, such that the same pre-samples were used as for the approach.

#### Simulated users

We simulate user feedback using the probabilistic user model from [2]. Given two paths, the user’s uncertainty depends on how similar the paths are with respect to the cost function evaluated for :

(14) |

The probabilistic regret is computed using pre-sampled weights as described in Algorithm 1, with an uncertainty of in equation (6). Similar to [2] for each experiment we sample a user preference uniformly randomly from the unit circle, i.e., . We notice that this can include irrational user behaviour: A negative weight on heading for instance would encourage the autonomous car to not follow the road.

### V-a Learning error

In Figure 3 we compare to on both metrics over iterations for the two experiments, each repeated times. In the boxplots the center line shows the median and the green triangle shows the mean.

In the driver example, overall achieves a smaller weight error and smaller deviations from the mean, reproducing the results from [2]. In the path space we observe that achieves a slightly better result in the last two iterations. However, between iteration and , the approach performs better, i.e., learns more quickly. Overall, both approaches perform equally well.

For the Extended Driver example in Figure 2(b), both approaches make limited progress on the weight metric and exhibit large deviations. For the path error we observe that performs better initially, but makes little progress after iteration . The final median lies at at iteration , but the highest quartile still reaches up to . The approach achieves a lower mean and median error in iteration and subsequently improves further. At iteration the mean and median are close to , the box plot also shows that three quarters of all trials are very close to convergence.

Figure 2(c) illustrates the result for the Mobile experiment. Here, the weight error shows no difference between the two approaches; both perform equally poorly and inconsistently. At the same time the path error shows a large difference. achieves convergence for nearly all trials after just iterations (some outliers cause the mean value to still be at ). At the same time the performance of is inferior: Even though the median error becomes in iteration , the mean value is still with large deviations.

In conclusion, achieves an equally good result as on the path error for the Driver experiment, despite having a larger weight error. That is, while the weights found by are more similar to based on the alignment metric, the resulting behaviour of and are equally good. Moreover, the Extended Driver and Mobile experiments have shown that the performance of deteriorates for higher dimensions, i.e., larger sets of features. In contrast, still achieves a very strong performance on the path error.

### V-B Easiness of queries

A major contribution of [2] is the design of queries that are easy for the user to answer, i.e., the probability that the user choice is inconsistent with the assumed cost function from equation (14) is low. In maximum regret learning we do not directly consider the user’s uncertainty when choosing a new pair of paths. However, as the paths maximizing the probabilistic symmetric regret have a large difference on cost, our approach implicitly selects paths that potentially are easy for a user to answer. To compare the easiness of the queries presented to the user, we consider the probability that the user would choose the path with lower cost, evaluated by (14). In Figure 4 we compare the probability of correct user answers for and .

In the Driver experiment, we recorded a mean probability of for , which is slightly worse than reported for the strict queries in [2], where correct answers occurred in of cases. Nonetheless, with the simulated answers had a mean probability of being correct of , outperforming . In Figure 4, we observe that both approaches achieve very high probabilities for correct user answers in the first iteration, i.e., ask an easy question. Afterwards, the probabilities get smaller: The median of decreases to in iteration and the deviations increase significantly. The approach maintains higher median values for all iterations. Interestingly, we observe cyclic decreases of the mean (and increases for the deviations) in iterations , and . According to the user model the presented paths were very similar, indicating that the learning might have been close to convergence. This aligns with the small errors of the expected weight reported in Figure 2(a).

In the Extended Driver experiment the user behaviour is much more accurate for both approaches with a mean of for and for . This indicates that the sampled paths differ more in cost. From iteration onwards, starts to show larger deviations, i.e., questions become more difficult to answer, implying that the presented paths are very similar. Together with the very small decrease in path error the we observed in Experiment 1 (Figure 2(b)) at the same iteration, this leads to the conjecture that is converging to a local optimum. Finally, the Mobile experiment did not show any difference between the two approaches, both achieving a very high accuracy of .

Overall, these results strongly support our claim that maximizing regret implicitly creates queries that are easy for the user to answer.

### V-C Generalization of the error

Finally, we investigate how the two error metrics generalize to different scenarios, independent of whether the error is a result of learning with or . That is, we investigate how useful each error metric is for predicting the robot’s performance when deployed in a new instance of the problem not encountered during learning. For the Driver experiment we use the setup from Figure 1 as a training case and construct five test cases by changing the initial state of the human driven vehicle (white). The weight error is scenario independent, it directly describes how similar the estimated weight is to . Thus, the weight error is the same in training and test cases and cannot be used as test error, as this would contain no additional information about performance on the test case. Hence, we use the path error as the test error. Further, we notice that if the weight error is zero, i.e., the weights have been learned perfectly, then the path error is zero in all scenarios. However, as shown in Figure 3 and in [1, 2] the weights typically do not converge to the true user weight within few iterations. Given some weight the path errors are fixed values in every test scenario. We are interested in how well the weight error and the path error of the training predict the path error of the test scenario.

We generate different random user weights and then generate estimates of each of these weights. For every estimate we find the optimal path and compute the path and weight error which are used as training errors for the estimate. In Figure 5 we show how these training errors relate to the test error. We compare the path and weight error as a measure of generalisation performance (i.e., how well the weight and path errors predict the test case performance).

We observe that the path error translates linearly between training and test scenarios: Given a weight with a certain path error in the training scenario, the weight yields paths in the test scenarios that have a similar path error, on average. The relationship between weight error and test error is more complex. For a weight error of during training, we observe a test error of , i.e., if the weights are very close to the optimum, the optimal solution is found in every scenario. However, for larger training errors the test error shows large deviations, implying that a low weight error in training is not a robust measure of how good the resulting behaviour is in test cases. The observation is supported by a strong Pearson correlation of between training and test error for the path error, but a much weaker correlation of for the weight error. This lends support to the claim that the path error is better suited for making predictions of the performance in scenarios that were not part of the training.

We conducted a the same experiment for the Extended Driver scenario. The correlation of the path error is weaker, but with still substantially stronger than for the weight error where we observed . In the Mobile scenario, training and test instances are defined by multiple start-goal pairs. However, we observed no correlation for both path error and weight error. The features in this scenario are local, i.e., describe if the robot visits a certain part of the environment. Learning about one task gains insufficient information to always find a good path for a different task.

In summary, we observe that the path error is more suitable than the weight error for reliable predictions of the test performance in scenarios with global features. However, higher dimensions can weaken the reliability, and local features may not allow for any predictions.

## Vi Discussion

In this paper we investigated a new technique for generating queries in active preference learning for robot tasks. We have shown that competing state of the art techniques have shortcomings as they focus on the weight space only. As an alternative, we introduced the regret of the cost of paths as a heuristic for the query selection, which allows to greedily minimize the maximum error. Further, we studied an error function that captures the cost ratio between the behaviour of estimated preferences and the optimal behaviour, instead of the similarity of weights. In simulations we demonstrated that using regret in the query selection leads to faster convergence than entropy while the queries are even easier for the user to answer. Moreover, we have shown that the path error allows for better predictions for other scenarios.

For future work special cases such as discrete action spaces in the form of lattice planners should be investigated. This would give further inside into the computational hardness of finding the maximum regret and potentially allow for solution strategies that do not require pre-sampling weights and paths. Richer user feedback such as an equal preference option could be of interest, promising results for this approach were presented in [13, 2]. Finally, regret based preference learning should be investigated in a user study to show the practicality of this approach.

### Footnotes

- Using sampled optimal paths for the entropy approach did not lead to different results in the experiments, therefore we show the results using the original implementation.

### References

- D. Sadigh, A. D. Dragan, S. Sastry, and S. A. Seshia, “Active preference-based learning of reward functions,” in RSS, 2017.
- E. BÄ±yÄ±k, M. Palan, N. C. Landolfi, D. P. Losey, and D. Sadigh, “Asking easy questions: A user-friendly approach to active reward learning,” 2019.
- N. Wilde, A. Blidaru, S. L. Smith, and D. Kulić, “Improving user specifications for robot behavior through active preference learning: Framework and evaluation,” IJRR, vol. 39, no. 6, pp. 651–667, 2020.
- P. Abbeel and A. Y. Ng, “Apprenticeship learning via inverse reinforcement learning,” in Proceedings of the twenty-first international conference on Machine learning. ACM, 2004, p. 1.
- A. Jain, S. Sharma, T. Joachims, and A. Saxena, “Learning preferences for manipulation tasks from online coactive feedback,” IJRR, vol. 34, no. 10, pp. 1296–1313, 2015.
- B. Akgun, M. Cakmak, J. W. Yoo, and A. L. Thomaz, “Trajectories and keyframes for kinesthetic teaching: A human-robot interaction perspective,” in ACM/IEEE international conference on Human-Robot Interaction. ACM, 2012, pp. 391–398.
- M. C. Gombolay, R. J. Wilcox, and J. A. Shah, “Fast scheduling of robot teams performing tasks with temporospatial constraints,” IEEE Transactions on Robotics, vol. 34, no. 1, pp. 220–239, 2018.
- D. S. González, O. Erkent, V. Romero-Cano, J. Dibangoye, and C. Laugier, “Modeling driver behavior from demonstrations in dynamic environments using spatiotemporal lattices,” in 2018 IEEE ICRA. IEEE, 2018, pp. 1–7.
- T. Gu, J. Atwood, C. Dong, J. M. Dolan, and J.-W. Lee, “Tunable and stable real-time trajectory planning for urban autonomous driving,” in 2015 IEEE/RSJ IROS. IEEE, 2015, pp. 250–256.
- C. Daniel, M. Viering, J. Metz, O. Kroemer, and J. Peters, “Active Reward Learning,” RSS, vol. 10, no. July, 2014.
- P. F. Christiano, J. Leike, T. Brown, M. Martic, S. Legg, and D. Amodei, “Deep reinforcement learning from human preferences,” in NIPS, 2017, pp. 4299–4307.
- N. Wilde, D. Kulić, and S. L. Smith, “Bayesian active learning for collaborative task specification using equivalence regions,” IEEE RA-L, vol. 4, no. 2, pp. 1691–1698, April 2019.
- C. Basu, M. Singhal, and A. D. Dragan, “Learning from richer human guidance: Augmenting comparison-based learning with feature queries,” in Proceedings of the 2018 ACM/IEEE International Conference on Human-Robot Interaction, ser. HRI ’18. New York, NY, USA: ACM, 2018, pp. 132–140.
- D. Bertsimas and J. N. Tsitsiklis, Introduction to linear optimization. Athena Scientific Belmont, MA, 1997, vol. 6.
- R. Montemanni and L. M. Gambardella, “An exact algorithm for the robust shortest path problem with interval data,” Computers & Operations Research, vol. 31, no. 10, pp. 1667–1680, 2004.
- A. Kasperski and P. Zielinski, “An approximation algorithm for interval data minmax regret combinatorial optimization problems.” Inf. Process. Lett., vol. 97, no. 5, pp. 177–180, 2006.
- M. Palan, N. C. Landolfi, G. Shevchuk, and D. Sadigh, “Learning reward functions by integrating human demonstrations and preferences,” arXiv preprint arXiv:1906.08928, 2019.
- D. P. Losey and M. K. OâMalley, “Including uncertainty when learning from human corrections,” in Conference on Robot Learning, 2018, pp. 123–132.
- J. Y. Zhang and A. D. Dragan, “Learning from extrapolated corrections,” in IEEE ICRA, 2019, pp. 7034–7040.
- M. Racca, A. Oulasvirta, and V. Kyrki, “Teacher-aware active robot learning,” in 2019 14th ACM/IEEE International Conference on Human-Robot Interaction (HRI). IEEE, 2019, pp. 335–343.
- N. Wilde, D. Kulić, and S. L. Smith, “Learning user preferences in robot motion planning through interaction,” in IEEE ICRA, May 2018, pp. 619–626.
- D. S. Brown, Y. Cui, and S. Niekum, “Risk-aware active inverse reinforcement learning,” in Conference on Robot Learning, 2018, pp. 362–372.
- G. Andrew and J. Gao, “Scalable training of l 1-regularized log-linear models,” in Proceedings of the 24th international conference on Machine learning, 2007, pp. 33–40.
- M. Pivtoraiko, R. A. Knepper, and A. Kelly, “Differentially constrained mobile robot motion planning in state lattices,” Journal of Field Robotics, vol. 26, no. 3, pp. 308–333, 2009.