2013 IEEE International Conference on Robotics and Automation 2013
DOI: 10.1109/icra.2013.6630609
|View full text |Cite
|
Sign up to set email alerts
|

Planning with approximate preferences and its application to disambiguating human intentions in navigation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 14 publications
0
4
0
Order By: Relevance
“…Those then serve to train models that will predict the trajectory of a human based on online observations. Typically, a dense discretization of the space is applied, see, e.g., [ 6 , 7 , 8 , 9 ]. Within the works of [ 10 , 11 ], the discretization issue is addressed by learning a topological map, which summarizes a set of observed (person) trajectories.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Those then serve to train models that will predict the trajectory of a human based on online observations. Typically, a dense discretization of the space is applied, see, e.g., [ 6 , 7 , 8 , 9 ]. Within the works of [ 10 , 11 ], the discretization issue is addressed by learning a topological map, which summarizes a set of observed (person) trajectories.…”
Section: Related Workmentioning
confidence: 99%
“…In contrast to these works, in an indoor environment these cues are typically not available and instead of learning the static context within our work we explicitly model it. Looking at the robotics domain, the idea of considering the plausible alternatives for human intentions is in line with [ 8 , 19 , 25 ]. Within the first of these works, hypotheses about occupied areas in the map are created by considering various trajectories.…”
Section: Related Workmentioning
confidence: 99%
“…Clear preferences Under the clear preferences assumption (Likhachev and Stentz 2009;Neuman and Likhachev 2013), for any action with more than one outcome, we are given an outcome which is "clearly preferred" over the other outcomes. Specifically, for any state x and action a, the clearly-preferred outcome x satisfies the following condition,…”
Section: Probabilistic Planning With Clear Preferencesmentioning
confidence: 99%
“…Ok et al [13] develop a path planner called Voronoi Uncertainty Fields, which uses Voronoi diagrams and potential fields to deal with map uncertainties. Neumany and Likhachevy [12] design a generalization to the PPCP (Probabilistic Planning with Clear Preferences) algorithm, which allows a robot to reason about uncertainty in the trajectories of dynamic obstacles. Sonti et al [16] present a grid-based path planning algorithm using probabilistic finite state automata (PFSA), and address the routing problems in the presence of dynamic obstacles with stochastic motion models.…”
Section: Introductionmentioning
confidence: 99%