I Introduction
In situations where robots are operating in close physical proximity with humans, it is often critical for the robot to anticipate human motion. One popular predictive approach is to model humans as approximately rational with respect to an objective function learned from prior data [23, 14]. When a person is moving in accordance with the learned objective (e.g. to a known goal location), such models often make accurate predictions and the robot can easily find a safe path around the person. Unfortunately, no model is ever perfect, and the robot’s model of the human will not be able to capture all possible movements that it might eventually observe. For example, the human might walk toward another goal location that the robot does not know about, or move to avoid an obstacle of which the robot is unaware. In these cases where the human’s motion diverges from the model’s predictions, safety might be compromised. In Fig. 1 (left), the robot fails to reason about the human avoiding the unobserved obstacle and gets dangerously close to the human.
One method to mitigate the effects of model inaccuracy is for the robot to recompute its human model over time. However, restrictions in sensing and in the availability of human data limit how much a model can be refined online without overfitting. Alternatively, the robot can reason about its confidence in its current model’s predictions. In this paper, we propose a method in which the robot continually estimates its confidence in its human model in real time and adapts its motion plan according to this confidence (Fig.
1, right). In particular, our approach leverages the socalled “rationality” coefficient in the commonly used Boltzmann model of approximately rational human behavior [3, 22] as a timevarying indicator of the model’s predictive performance. This is a single scalar parameter that can be tractably inferred at deployment time. We couple the resulting confidenceaware human motion predictions with a provably safe motion planner to obtain probabilistically safe robotic motion plans that are conservative when appropriate but efficient when possible.This paper makes two key contributions:
(1) a realtime Bayesian framework for reasoning about the uncertainty inherent in a model’s prediction of human movement, and (2) extending a stateoftheart, provably safe, realtime robotic motion planner to incorporate our timevarying, probabilistic human predictions. Together, these two contributions facilitate the realtime generation of robot trajectories through humanoccupied spaces. Further, they guarantee that when the robot tracks these trajectories at runtime they will be collisionfree with arbitrarily high probability.
Ii Prior Work
Iia Human Modeling and Prediction
One common approach for predicting human actions is supervised learning, where the current state and the history of the human’s actions are used directly to predict future actions. Such approaches have enabled inference and planning around human arm motion
[1, 5, 13, 15, 10], navigation [5], plans for multistep tasks like assembly [10], and driving [20].Rather than predicting actions directly, an alternative is for the robot to model the human as a rational agent seeking to maximize an unknown objective function. The human’s actions up to a particular time may be viewed as evidence about this objective from which the robot may infer the parameters of that objective. Assuming that the human seeks to maximize this objective in the future, the robot can predict her future movements [3, 18]. In this paper, we build on in this work by introducing a principled online technique for estimating confidence in such a learned model of human motion.
IiB Safe Robot Motion Planning
Once armed with a predictive model of the human motion, the robot may leverage motion planning methods that plan around uncertain moving obstacles and generate realtime dynamically feasible and safe trajectories.
To avoid moving obstacles in real time, robots typically employ reactive and/or pathbased methods. Reactive methods directly map sensor readings into control, with no memory involved [4]. Pathbased methods such as rapidlyexploring random trees and A* find simple kinematic paths through space and, if necessary, time [9, 12]. These pathbased methods of planning are advantageous in terms of efficiency, yet, while they have in some cases been combined with probabilistically moving obstacles [2, 23]
, they do not consider the endogenous dynamics of the robot or exogenous disturbances such as wind. As a result, the robot may deviate from the planned path and potentially collide with obstacles. It is common for these plans to try to avoid obstacles by a heuristic margin of error. FaSTrack is a recent algorithm that provides a guaranteed tracking error margin and corresponding errorfeedback controller for dynamic systems tracking a generic planner in the presence of bounded external disturbance
[11, 8]. Our work builds upon FaSTrack to create an algorithm that can safely and dynamically navigate around uncertain moving obstacles in real time.Iii Problem Statement and Approach
We consider a single robot moving to a preset goal location in a space shared with a single human, and assume that the human expects the robot to avoid her. Therefore, it is the robot’s responsibility to maintain a safe distance from the human at all times. We present our theory for a general single human and single robot setting, and use the running example of quadcopter navigating around a walking human to illustrate the proposed approach and demonstrate the utility of our method.
Iiia Motion Model
Let the state of the human be , where is the dimension of the human state space. We similarly define the robot’s state, for planning purposes, as . These states could represent the positions and velocities of a mobile robot and a human in a shared environment or the kinematic configurations of a human and a robotic manipulator in a common workspace. The human and robot are each modeled by their dynamics:
(1) 
where and are the control actions of the human and robot, respectively.
The robot ultimately needs to plan and execute a trajectory to a goal state according to some notion of efficiency, while avoiding collisions with the human. We define the keepout set as the set of joint robothuman states to be avoided, e.g. because they imply physical collisions. To avoid reaching this set, the robot must reason about the human’s future motion when constructing its own motion plan.
Running example:
We introduce a running example for illustration throughout the paper.
In this example we consider a small quadcopter that needs to fly to locations in a room where a human is walking.
For the purposes of planning, the quadcopter’s 3D state is given by its position in space , with velocity controls assumed decoupled in each spatial direction, up to m/s.
The human can only move by walking and therefore her state is given by planar coordinates evolving as .
At any given time, the human is assumed to either move at a leisurely walking speed ( m/s) or remain still ().
In this example, consists of joint robothuman states in which the quadcopter is flying within a square of side length m centered around the human’s location, while at
any altitude, as well as any joint states in which the robot is outside the bounds of a box with a square base of side m and height m, regardless of the human’s state.
IiiB Robot Dynamics
Ideally, robots should plan their motion based on a highfidelity model of their dynamics, accounting for inertia, actuator limits, and environment disturbances. Unfortunately, reasoning with such complex models is almost always computationally prohibitive.As a result, the models used for planning typically constitute a simplified representation of the physical dynamics of the real robot, and are therefore subject to some error that can have critical implications for safety. In particular, let denote the state of the robot in the higherfidelity dynamical model, and let be a known function that projects this higherfidelity state onto a corresponding planning state, i.e . A planner which operates on may generate a trajectory which is difficult to track or even infeasible under the more accurate dynamical model. Thus reasoning with the planning model alone is not sufficient to guarantee safety for the real robot.
Running example:
We model our quadcopter with the following flight dynamics (in nearhover regime):
(2) 
where is the quadcopter’s position in space and is its velocity expressed in the fixed world frame, with thrust and attitude angles (roll and pitch ) as controls. The quadcopter’s motion planner generates nominal kinematic trajectories in the lowerdimensional position state space. Therefore we have a linear projection map , that is, retains the position variables in and discards the velocities.
IiiC Predictive Human Model
The robot has a predictive model of the human’s motion, based on a set of parameters whose values may be inferred under a Bayesian framework or otherwise estimated over time. Extensive work in econometrics and cognitive science has shown that human behavior can be well modeled by utilitydriven optimization [21, 16, 3]. Thus, the robot models the human as optimizing a reward function, , that depends on the human’s state and action, as well as a set of parameters . This reward function could be a linear combination of features as in many inverse optimal control implementations (where the weighting
between the features needs to be learned), or more generally learned through function approximators such as deep neural networks (where
are the trained weights) [7].We assume that the robot has a suitable human reward function, either learned offline from prior human demonstrations or otherwise encoded by the system designers. With this, the robot can compute the human’s policy as a probability distribution over actions conditioned on the state. Using maximumentropy assumptions
[22] and inspiration from noisyrationality models used in cognitive science [3], the robot models the human as more likely to choose actions with high expected utility, in this case the stateaction value (or Qvalue):(3) 
Running example: The quadcopter’s model of the human assumes that she intends to reach some target location in the most direct way possible. The human’s reward function is given by the distance traveled and human trajectories are constrained to terminate at . The stateaction value, parametrized by , captures the optimal cost of reaching from when initially applying :
The coefficient is traditionally called the rationality coefficient and it determines the degree to which the robot expects to observe human actions aligned with its model of utility. A common interpretation of is a human who appears “irrational,” choosing actions uniformly at random and completely ignoring the modeled utility, while corresponds a “perfectly rational” human. Instead, we believe that can be given a more pragmatic interpretation related to the accuracy with which the robot’s model of the human is able to explain her motion. Consistently, in this paper, we refer to as model confidence.
Note that we assume the human does not react to the robot. This assumption can realistically capture plausible sharedspace settings in which lightweight robots (e.g. microdrones) may be expected to carry out services such as indoor surveillance in a building while minimizing interference with human activity. Additionally, to the extent that a more compliant human will tend to avoid collisions with the robot, the robot may still benefit in such scenarios—it is merely not assuming any cooperation a priori in its planning.
IiiD Probabilistic Safe Motion Planning Problem
The problem that the robot needs to solve is to plan a trajectory that, when tracked by the physical system, will reach a goal state as efficiently as possible while avoiding collisions with high confidence, based on an informed prediction of the human’s future motion.
Since any theoretical guarantee is tied to the model it is based on, safety guarantees will inherit the probabilistic nature of human predictions. This induces a fundamental tradeoff between safety and liveness: predictions of human motion may assign nonzero probability to a wide range of states at a future time, which may severely impede the robot’s ability to operate in the shared space with “absolute safety” (only absolute according to the model). Therefore, depending on the context, the designers or operators of the system will need to determine what is an acceptable probability that a robot’s plan will conflict with the human’s future motion. Based on this, the robot’s online planning algorithm will determine when a motion plan is predicted to be sufficiently safe. In our demonstrated system, we use a collision probability threshold for planning.
Our goal now is to find efficient robot motion plans that will keep collisions with a human below an acceptable probability. Formally, given a current state , a cumulative cost , a probability threshold and a final time , we define the constrained planning problem:
(4a)  
s.t.  (4b)  
(4c)  
(4d) 
with a discretetime approximation of the dynamics . The term is a Boolean variable indicating whether the human and the robot are in collision. The safety analysis necessary to solve this online motion planning problem therefore has two main components, the robot’s state and the human’s state, both of which are affected by uncertainty in their evolution over time. We tackle these two sources of uncertainty through a combined method that draws simultaneously on the two main approaches to uncertain systems: probabilistic and worstcase analysis.
Running example: The quadcopter’s cost can be a weighted combination of distance traversed and time elapsed on its way to a specified goal: .
The proposed approach in this paper follows two central steps to provide a quantifiable, highconfidence collision avoidance guarantee for the robot’s motion around the human. In Section IV we present our proposed Bayesian framework for reasoning about the uncertainty inherent in a model’s prediction of human behavior. Based on this inference, we demonstrate how to generate a realtime probabilistic prediction of the human’s motion over time. Next, in Section V we introduce a theoretical extension to a stateoftheart, provably safe, realtime robotic motion planner to incorporate our timevarying probabilistic human predictions yielding a quantitative probabilistic safety certificate.
Iv ConfidenceAware Human Motion Prediction
Predictions of human motion, even when based on wellinformed models, may eventually perform poorly when the human’s behavior outstrips the model’s predictive power. Such situations can have a negative impact on safety if the robot fails to appropriately, and quickly, notice the degradation of its predictions.
It will often be the case in practice that the same model will perform variably well over time in different situations and for different people. In some cases this model might be perfectly representative, in others the robot might not have access to some important feature that explains the human’s behavior, and therefore the robot’s conservativeness should vary accordingly.
Given a utilitybased human model in the form of (3), the term can be leveraged as an indicator of the model’s predictive capabilities, rather than the human’s actual level of rationality. Thus, by maintaining an estimate of , the robot can dynamically adapt its predictions (and therefore its motion plan) to the current reliability of its human model. For this reason, in this paper, we refer to as model confidence, and aim to make the robot reason about its value in real time in order to generate confidenceaware “introspective” predictions of the human’s motion.
Iva Realtime Inference of Model Confidence
At every time step , the robot obtains a new measurement^{1}^{1}1In practice, the robot measures the evolution of the human state and computes the associated action by inverting the motion model. of the human’s action, . This measurement can be used as evidence to update the robot’s belief about over time via a Bayesian update:
(5) 
with for , and given by (3). It is critical to be able to perform this update extremely fast, which would be difficult to do in the original continuous hypothesis space or even a large discrete set. Fortunately, as we will see in Section VI, maintaining a Bayesian belief over a relatively small set of values ( on a logscale) achieves significant improvement relative to maintaining a fixed precomputed value.^{2}^{2}2 Since the predictive performance of the model might change over time as the human’s behavior evolves, we do not in fact treat
as a static parameter, but as a hidden state in a hidden Markov model (HMM). Concretely, between successive “measurement updates” (
5), we apply a uniform smoothing “time update”, allowing our belief over to slowly equalize over time, which has the effect of downweighting older observations.IvB Human motion prediction
We can now use the belief over to recursively propagate the human’s motion over time and obtain a probabilistic prediction of her state at any number of time steps into the future. In particular, at every future time step, we can estimate the likelihood of the human taking action from any state by directly applying (3). Combining this with the dynamics model, we can generate a distribution of human occupancies over time, with the recursive update:
(6) 
for ; for the deterministic dynamics in our case, .
Running example:
The simplest scenario in our running example involves a human moving towards a known goal. In Fig 2(ac), the human acts predictably, moving directly to the goal. Each subfigure shows the robot’s human prediction under different confidence conditions. Predictions for the second scenario, where the human deviates from her path to avoid a coffee spill on the ground, are shown in Fig 2(df).
IvC Integrating Model Confidence into Online Model Updates
When a robot is faced with human behavior that is not well explained by its current model, it can attempt to update some of its elements to better fit the observed human actions. These elements can include parameters, hyperparameters, or potentially even the structure of the model itself. Assuming that the parameters can be tractably adjusted online, this update may result in better prediction performance.
Even under online model updates, it continues to be necessary for the robot to reason about model confidence. In this section we demonstrate how reasoning about model confidence can be done compatibly (and in some cases jointly) with model parameter updates.
Recall that denotes the set of parameters in the human’s utility model. The ideal approach is to perform inference over both the model confidence, , and the model parameters, by maintaining a joint Bayesian belief, . The joint Bayesian belief update rule takes the form
(7) 
with .^{3}^{3}3 Analogously to the case with only inference, the parameters can be allowed to evolve as a hidden state. This approach can be practical for parameters taking finitely many values from a discrete set, for example, possible distinct modes for a human driver (distracted, cautious, aggressive).
Running example: The quadcopter’s model of the human considers a number of known frequentlyvisited locations that she might intend to walk to next. However, there may be additional unmodeled destinations, or more complex objectives driving the human’s motion in the room (for example, she could be searching for a misplaced object, or pacing while on the phone). Fig. 3 shows how reasoning about model confidence as well as the human’s destination enables the robot to navigate confidently while the human’s motion is well explained by the model, and automatically become more cautious when it departs from its predictions. More detailed results are presented in Section VI.
For certain scenarios or approaches it may not be practical to maintain a full Bayesian belief on the parameters, and these are instead estimated over time (for example, through a maximum likelihood estimator (MLE), or by shallow retraining of a pretrained neural network). In these cases, a practical approach can be to maintain a “bootstrapped” belief on by running the Bayesian update on the running parameter estimate :
(8) 
Running example: The quadcopter’s predictions of human motion are parameterized by her walking speed ; the quadcopter maintains a simple running average based on recent motioncapture measurements, and incorporates the current estimate into inference and prediction.
When it is not desirable or computationally feasible to update the parameter estimate continually, we can leverage our model confidence as an indicator of when reestimating these parameters may be most useful—namely as confidence in the model under the current parameter estimates degrades.
V Safe Probabilistic Planning and Tracking
Once it can generate realtime probabilistic predictions of the human’s motion, the robot needs to plan a trajectory that will, with high probability, avoid collisions with her. On the one hand, any rigorous safety analysis for a robotic system needs to account for deviations of the actual dynamic trajectory from the ideal motion plan. On the other hand, since human motion predictions are by nature uncertain, the safety analysis will necessarily be quantified in probabilistic terms. To this end, we build on the recent FaSTrack framework [11], which provides controltheoretic robust safety certificates in the presence of deterministic obstacles, and extend the theoretical analysis to provide probabilistic certificates allowing uncertain dynamic obstacles (here, humans).
Va Background: Fast Planning, Safe Tracking
Recall that and are the robot’s state and control input, for the purposes of motion planning. The recently proposed FaSTrack framework [11] uses HamiltonJacobi reachability analysis [6, 17] to provide a simple realtime motion planner with a worstcase tracking error bound and error feedback controller for the dynamic robot. Formally, FaSTrack precomputes an optimal tracking control policy, as well as a corresponding compact set in the robot’s planning state space, such that for any reference trajectory proposed by the lowerfidelity planner. This bound is a trajectory tracking certificate that can be passed to the online planning algorithm for realtime safety verification: the dynamical robot is guaranteed to always be somewhere within the bound relative to the plan. Therefore the planner can generate safe plans by ensuring that the entire bound around the nominal state remains collisionfree throughout the trajectory. Note that the planner only needs to know and otherwise requires no explicit understanding of the highfidelity model.
Running example: Since dynamics (2) are decoupled in the three spatial directions, the bound computed by FaSTrack is an axisaligned box of dimensions .
VB Robust Tracking, Probabilistic Safety
Unfortunately, planning algorithms for collision checking against deterministic obstacles cannot be readily applied to our problem. Instead, a trajectory’s collision check should return the probability that it might lead to a collision. Based on this probability, the planning algorithm can discriminate between trajectories that are sufficiently safe and those that are not.
As discussed in Section IIID, a safe online motion planner should continually check the probability that, at any future time , . The tracking error bound guarantee from FaSTrack allows us to conduct worstcase analysis on collisions given a human state : if no point in the Minkowski sum is in the collision set with , we can guarantee that the robot is not in collision with the human.
The probability of a collision event for any point in a candidate trajectory plan, assuming worstcase tracking error, can be computed as the total probability that will be in collision with any of the possible robot states . For each robot planning state we can define the set of human states in potential collision with the robot:
(9) 
The following result is then true by construction.
Proposition 1: The probability of a robot with worstcase tracking error being in collision with the human at any trajectory point is bounded above by the probability mass of contained within .
Therefore, the lefthand side of the inequality in our problem’s safety constraint (4d) can be rewritten as
(10) 
Evaluating the above probability exactly would require reasoning jointly about the distribution of human states over all time steps, or equivalently over all time trajectories that the human might follow. Due to the need to plan in real time, we must in practice approximate this distribution.
Since assuming independence of collision probabilities over time is both unrealistic and overly conservative, we instead seek to find a tight lower bound on a trajectory’s overall collision probability based on the marginal probabilities at each moment in time. In particular, based on the positive correlation over time resulting from human motion continuity, we first consider replacing each conditional probability
by for all . This would then give the lower bound(11) 
which would seem like an unreasonably optimistic approximation. However, note that probabilities can be conditioned in any particular order (not necessarily chronological) and we can therefore generate lower bounds of the form for , again by replacing all successive conditional noncollision probabilities by 1. Taking the tightest of all of these bounds, we can obtain an informative, yet quickly computable, approximator for the sought probability:
(12) 
In other words, we are replacing the probability of collision of an entire trajectory with the highest marginal collision probability at each point in the trajectory. While this approximation will err on the side of optimism, we note that the robot’s ability to continually replan as updated human predictions become available mitigates any potentially underestimated risks, since in reality the robot does not need to commit to a plan that was initially deemed safe, and will readily rectify as the estimated collision risk increases prior to an actual collision.
Running example: Given and , is the set of human positions within the rectangle of dimensions centered on . A human anywhere in this rectangle could be in collision with the quadcopter.
VC Safe Online Planning under Uncertain Human Predictions
We can now use this realtime evaluation of collision probabilities to discriminate between valid and invalid trajectory candidates in the robot’s online motion planning. Using the formulation in Section IV, we can quickly generate, at every time , the marginal probabilities in (12) at each future time , based on past observations at times . Specifically, for any candidate trajectory point , we first calculate the set ; this set can often be obtained analytically from (9), and can otherwise be numerically approximated from a discretization of . The planner then computes the instantaneous probability of collision by integrating over , and rejects the candidate point if this probability exceeds .
Note that for searchbased planners that consider candidate trajectories by generating a tree of timestamped states, rejecting a candidate node from this tree is equivalent to rejecting all further trajectories that would contain the node. This early rejection rule is consistent with the proposed approximation (12) of while preventing unnecessary exploration of candidate trajecories that would ultimately be deemed unsafe.
As the robot is continuously regenerating its motion plan online as the human’s predicted motion is updated, we simultaneously track the planned trajectory using our error feedback controller, which ensures that we deviate by no more than the tracking error bound . This planning and tracking procedure continues until the robot’s goal has been achieved.
Running example: Our quadcopter is now required to navigate to a target position shown in Fig. 2 without colliding with the human. Our proposed algorithm successfully avoids collisions at all times, replanning to leave greater separation from the human whenever her motion departs from the model. In contrast, robot planning with fixed model confidence is either overly conservative at the expense of time and performance or overly aggressive at the expense of safety.
Vi Demonstration with Real Human Trajectories
We implemented realtime human motion prediction with inference and safe probabilistic motion planning via FaSTrack within the Robot Operating System (ROS) framework [19]. To demonstrate the characteristic behavior of our approach, we created three different environment setups and collected a total of 48 human walking trajectories (walked by 16 different people). The trajectories are measured as positions on the ground plane at roughly 235 Hz by an OptiTrack infrared motion capture system.^{4}^{4}4We note that in a more realistic setting, we would need to utilize alternative methods for state estimation such as lidar measurements. We also demonstrated our system in hardware on a Crazyflie 2.0 platform navigating around a person in a physical space.^{5}^{5}5https://youtu.be/2ZRGxWknENg
Environments. In the first environment there are no obstacles and the robot is aware of the human’s goal. The second environment is identical to the first, except that the human must avoid a coffee spill that the robot is unaware of. In the third environment, the human walks in a triangular pattern from her start position to two known goals and back.
Evaluated Methods. For each human trajectory, we compare the performance of our adaptive inference method with two baselines using fixed . When , the robot is unsure of its model of the human’s motion. This lowconfidence method cannot trust its own predictions about the human’s future trajectory. On the other hand, the highconfidence method remains confident in its predictions even when the human deviates from them. These two baselines exist at opposite ends of a spectrum. Comparing our adaptive inference method to these baselines provides useful intuition for the relative performance of all three methods in common failure modes (see Fig. 4).
Metrics. We measure the performance of our adaptive inference approach in both of these cases by simulating a quadcopter moving through the environment to a prespecified goal position while replaying the recorded human trajectory. We simulate nearhover quadcopter dynamics with the FaSTrack optimal controller applied at 100 Hz. For each simulation, we record the minimum distance in the ground plane between the human and the quadcopter as a proxy for the overall safety of the system. The quadcopter’s travel time serves to measure its overall efficiency.
In each environment, we compute the safety metric for all 16 human trajectories when applying each of the three human motion prediction methods and display the corresponding box and whisker plots side by side. To compare the efficiency of our approach to the baselines we compute the difference between the trajectory completion time of our approach, , and that of the low and high confidence baselines, . If the resulting boxplots are below zero, then inference results in faster robot trajectories than the baselines on a perhuman trajectory basis.^{6}^{6}6The upper and lower bounds of the box in each boxplot are the and percentiles. The horizontal red line is the median, and the notches show the bootstrapped confidence interval for the population mean.
Complete Model. First, we designed an example environment where the robot’s model is complete and the human motion appears to be rational. In this scenario, humans would walk in a straight line from their start location to their goal which was known by the robot a priori.
When the robot has high confidence in its model, the human’s direct motion towards the goal appears highly rational and results in both safe (Fig. 5, top left) and efficient plans (Fig. 5, bottom left). We see a similar behavior for the robot that adapts its confidence: although initially the robot is uncertain about how well the human’s motion matches its model, the direct behavior of the human leads to the robot to believe that it has high model confidence. Thus, the inference robot produces overall safe and efficient plans. Although we expect that the lowconfidence model would lead to less efficient plans but comparably safe plans, we see that the lowconfidence robot performs comparably in terms of both safety and efficiency.
Ultimately, this example demonstrates that when the robot’s model is rich enough to capture the environment and behavior of the human, inferring model confidence does not hinder the robot from producing safe and efficient plans.
Unmodeled Obstacle. Often, robots do not have fully specified models of the environment. In this scenario, the human has the same start and goal as in the complete model case except that there is a coffee spill in her path. This coffee spill on the ground is unmodeled by the robot, making the human’s motion appear less rational.
When the human is navigating around the unmodeled coffee spill, the robot that continuously updates its model confidence and replans with the updated predictions almost always maintains a safe distance (Fig. 5, top right). In comparison, the fixed models that have either highconfidence or lowconfidence approach the human more closely. This increase in the minimum distance between the human and the robot during execution time indicates that continuous inference can lead to safer robot plans.
For the efficiency metric, a robot that uses inference is able to get to the goal faster than a robot that assumes a high or a low confidence in its human model (Fig. 5, bottom right). This is particularly interesting as overall we see that enabling the robot to reason about its model confidence can lead to safer and more efficient plans.
Unmodeled Goal. In most realistic humanrobot encounters, even if the robot does have an accurate environment map and observes all obstacles, it is unlikely for it to be aware of all human goals. We test our approach’s resilience to unknown human goals by constructing a scenario in which the human moves between both known and unknown goals. The human first moves to two known goal positions, then back to the start. The first two legs of this trajectory are consistent with the robot’s model of goaloriented motion. However, when the human returns to the start, she appears irrational to the robot.
Fig. 6 and 7 summarize the performance of the inferred, highconfidence, and lowconfidence methods in this scenario. All three methods perform similarly with respect to the minimum distance safety metric in Fig. 6. However, Fig. 7 suggests that the inferred method is several seconds faster than both fixed approaches. This indicates that, without sacrificing safety, our inferred approach allows the safe motion planner to find more efficient robot trajectories.
Vii Discussion & Conclusion
In this paper, we interpret the “rationality” coefficient in the human decision modeling literature as an indicator of the robot’s confidence in its ability to predict human motion. We formulate this confidence as a hidden state that the robot can infer by contrasting observed human motion with its predictive model. Marginalizing over this hidden state, the robot can quickly adapt its forecasts to effectively reflect the predictability of the human’s motion in real time. We build on the theoretical analysis of the provably safe FaSTrack motion planning scheme to construct a novel probabilistic safety certificate that combines worstcase and probabilistic analysis, and show that the resulting trajectories are collisionfree at runtime with high probability.
We compare our inference technique to two fixed approaches, all using our proposed probabilistically safe motion planning scheme. Our results indicate that, even though the three methods perform similarly when the human’s motion is wellexplained by the robot’s model, inferring yields safer and more efficient robot trajectories in environments with unmodeled obstacles or unmodeled human goals. Future work should investigate more complex human motion, closedloop interaction models, and navigating around multiple humans.
Acknowledgments
We thank Smitha Milli for confidence inference guidance.
References
 Amor et al. [2014] Heni Ben Amor, Gerhard Neumann, Sanket Kamthe, Oliver Kroemer, and Jan Peters. Interaction primitives for humanrobot cooperation tasks. In Robotics and Automation (ICRA), 2014 IEEE International Conference on, pages 2831–2837. IEEE, 2014.
 Aoude et al. [2013] Georges S. Aoude, Brandon D. Luders, Joshua M. Joseph, Nicholas Roy, and Jonathan P. How. Probabilistically safe motion planning to avoid dynamic obstacles with uncertain motion patterns. Auton. Robots, 35(1):51–76, 2013. doi: 10.1007/s1051401393343. URL http://dx.doi.org/10.1007/s1051401393343.
 Baker et al. [2007] Chris L Baker, Joshua B Tenenbaum, and Rebecca R Saxe. Goal inference as inverse planning. In Proceedings of the Annual Meeting of the Cognitive Science Society, volume 29, 2007.
 Belkhouche [2009] Fethi Belkhouche. Reactive path planning in a dynamic environment. IEEE Transactions on Robotics, 25(4):902–911, 2009.
 Ding et al. [2011] Hao Ding, Gunther Reißig, Kurniawan Wijaya, Dino Bortot, Klaus Bengler, and Olaf Stursberg. Human arm motion modeling and longterm prediction for safe and efficient humanrobotinteraction. In Robotics and Automation (ICRA), 2011 IEEE International Conference on, pages 5875–5880. IEEE, 2011.
 Evans and Souganidis [1984] L. C. Evans and P. E. Souganidis. Differential games and representation formulas for solutions of HamiltonJacobiIsaacs equations. Indiana University mathematics journal, 33(5):773–797, 1984.

Finn et al. [2016]
Chelsea Finn, Sergey Levine, and Pieter Abbeel.
Guided cost learning: Deep inverse optimal control via policy
optimization.
In
International Conference on Machine Learning
, pages 49–58, 2016.  FridovichKeil* et al. [2018] David FridovichKeil*, Sylvia L Herbert*, Jaime F Fisac*, Sampada Deglurkar, and Claire J Tomlin. Planning, fast and slow: A framework for adaptive realtime safe trajectory planning. IEEE Conference on Robotics and Automation, 2018.
 Hart et al. [1968] Peter E Hart, Nils J Nilsson, and Bertram Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE transactions on Systems Science and Cybernetics, 4(2):100–107, 1968.
 Hawkins et al. [2013] Kelsey P Hawkins, Nam Vo, Shray Bansal, and Aaron F Bobick. Probabilistic human action prediction and waitsensitive planning for responsive humanrobot collaboration. In Humanoid Robots (Humanoids), 2013 13th IEEERAS International Conference on, pages 499–506. IEEE, 2013.
 Herbert* et al. [2017] Sylvia L. Herbert*, Mo Chen*, SooJean Han, Somil Bansal, Jaime F. Fisac, and Claire J. Tomlin. Fastrack: a modular framework for fast and guaranteed safe motion planning. IEEE Conference on Decision and Control, 2017.
 Karaman and Frazzoli [2011] Sertac Karaman and Emilio Frazzoli. Samplingbased algorithms for optimal motion planning. The international journal of robotics research, 30(7):846–894, 2011.
 Koppula and Saxena [2013] Hema Swetha Koppula and Ashutosh Saxena. Anticipating human activities for reactive robotic response. In IROS, page 2071, 2013.

Kretzschmar et al. [2016]
Henrik Kretzschmar, Markus Spies, Christoph Sprunk, and Wolfram Burgard.
Socially compliant mobile robot navigation via inverse reinforcement learning.
The International Journal of Robotics Research, 35(11):1289–1307, 2016.  Lasota and Shah [2015] Przemyslaw A Lasota and Julie A Shah. Analyzing the effects of humanaware motion planning on closeproximity human–robot collaboration. Human factors, 57(1):21–33, 2015.
 Luce [1959] R. Duncan Luce. Individual choice behavior: A theoretical analysis. Wiley, 1959.
 Mitchell et al. [2005] Ian M. Mitchell, A. M. Bayen, and C. J. Tomlin. A timedependent HamiltonJacobi formulation of reachable sets for continuous dynamic games. IEEE Transactions on Automatic Control, 50(7):947–957, 2005. doi: 10.1109/TAC.2005.851439. URL http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1463302.
 Ng et al. [2000] Andrew Y Ng, Stuart J Russell, et al. Algorithms for inverse reinforcement learning. In Icml, pages 663–670, 2000.
 Quigley et al. [2009] Morgan Quigley, Ken Conley, Brian P. Gerkey, Josh Faust, Tully Foote, Jeremy Leibs, Rob Wheeler, and Andrew Y. Ng. Ros: an opensource robot operating system. In ICRA Workshop on Open Source Software, 2009.
 Schmerling et al. [2017] Edward Schmerling, Karen Leung, Wolf Vollprecht, and Marco Pavone. Multimodal probabilistic modelbased planning for humanrobot interaction. arXiv preprint arXiv:1710.09483, 2017.
 Von Neumann and Morgenstern [1945] John Von Neumann and Oskar Morgenstern. Theory of games and economic behavior. Princeton University Press Princeton, NJ, 1945.
 Ziebart et al. [2008] Brian D. Ziebart, Andrew L. Maas, J Andrew Bagnell, and Anind K Dey. Maximum entropy inverse reinforcement learning. In AAAI, 2008.
 Ziebart et al. [2009] Brian D. Ziebart, Nathan Ratliff, Garratt Gallagher, Christoph Mertz, Kevin Peterson, J. Andrew Bagnell, Martial Hebert, Anind K Dey, and Siddhartha Srinivasa. Planningbased prediction for pedestrians. In Intelligent Robots and Systems, 2009. IROS 2009. IEEE/RSJ International Conference on, pages 3931–3936. IEEE, 2009.
Comments
There are no comments yet.