Opportunistic Use of Vision to Push Back the Path-Planning Horizon

Mobile robots need maps or other forms of geometric information about the environment to navigate. The mobility sensors (LADAR, stereo, etc.) on these robotic vehicles can however populate these maps only up to a distance of a few tens of meters. A navigation system has no knowledge about the world beyond this sensing horizon. As a result, path planners that rely only on this knowledge are unable to anticipate obstacles sufficiently early and have no choice but to resort to an inefficient local obstacle avoidance behavior. However, recent developments in the computer vision community allows us to collect geometric information about the environment far beyond this sensing horizon. The coarse 3D geometric estimation that can be recovered is derived from an appearance-based model. That uses a multiple-hypothesis framework to robustly estimate scene structure from a single image and estimating confidences for each geometric label. This 3D geometric estimation is used with a previously presented navigation strategy that reasons about sensor constraints and plans for measurements while navigating towards the goal. The validity of the sensing method and navigation strategy is supported by results from simulations as well as field experiments with a real robotic platform. These results also show that significant reduction in path length can be achieved by using this framework

[1]  J. Besag.  On the Statistical Analysis of Dirty Pictures , 1986 .

[2]  Chee Sun Won,et al.  Unsupervised segmentation of noisy and textured images using Markov random fields , 1992, CVGIP Graph. Model. Image Process..

[3]  Steven M. LaValle.  A game-theoretic framework for robot motion planning , 1996 .

[4]  Alonzo Kelly,et al.  Rough Terrain Autonomous Mobility—Part 2: An Active Vision, Predictive Control Approach , 1998, Auton. Robots.

[5]  R. Tibshirani,et al.  Additive Logistic Regression : a Statistical View ofBoostingJerome , 1998 .

[6]  Vijay Kumar,et al.  Closed loop motion plans for mobile robots , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[7]  Stan Z. Li,et al.  Markov Random Field Modeling in Image Analysis , 2001, Computer Science Workbench.

[8]  David Nistér,et al.  An efficient solution to the five-point relative pose problem , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..

[9]  Daniel P. Huttenlocher,et al.  Efficient Graph-Based Image Segmentation , 2004, International Journal of Computer Vision.

[10]  Yoram Singer,et al.  Logistic Regression, AdaBoost and Bregman Distances , 2000, Machine Learning.

[11]  Martial Hebert,et al.  Path planning with hallucinated worlds , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[12]  Anthony Stentz,et al.  Field D*: An Interpolation-Based Path Planner and Replanner , 2005, ISRR.

[13]  Alexei A. Efros,et al.  Geometric context from a single image , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[14]  Ashutosh Saxena,et al.  Learning Depth from Single Monocular Images , 2005, NIPS.

[15]  Robert C. Bolles,et al.  Outdoor Mapping and Navigation Using Stereo Vision , 2006, ISER.

[16]  Martial Hebert,et al.  Extending the Path-Planning Horizon , 2007, Int. J. Robotics Res..