Name
Abstract | ||
|---|---|---|
Our objective is to find a small set of images that summarize a robot's visual experience along a path. We present a novel on-line algorithm for this task. This algorithm is based on a new extension to the classical Secretaries Problem. We also present an extension to the idea of Bayesian Surprise, which we then use to measure the fitness of an image as a summary image. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ROBOT.2010.5509464 | Robotics and Automation |
Keywords | Field | DocType |
video signal processing,online navigation summaries,mobile robots,max surprise score,classical secretaries problem,summary image,image fitness measurement,navigation summary,Bayesian surprise,path planning,mobile robot,sampling methods,robot visual experience,position control,sampling problem,robot vision | Motion planning,Approximation algorithm,Computer science,Artificial intelligence,Sampling (statistics),Surprise,Cluster analysis,Robot,Mobile robot,Machine learning,Trajectory | Conference |
Volume | Issue | ISSN |
2010 | 1 | 1050-4729 E-ISBN : 978-1-4244-5040-4 |
ISBN | Citations | PageRank |
978-1-4244-5040-4 | 2 | 0.37 |
References | Authors | |
9 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yogesh Girdhar | 1 | 7 | 0.84 |
| Gregory Dudek | 2 | 2163 | 255.48 |