Navigation Strategies for Exploring Indoor Environments Presented by Mathieu Bredif February 17, 2004 CS326A: Motion Planning.

Slides:



Advertisements
Similar presentations
Chapter 2 : Bug Algorithms Hyoekjae Kwon Sungmin Lee.
Advertisements

Motion Planning for Point Robots CS 659 Kris Hauser.
University of Amsterdam Search, Navigate, and Actuate - Quantitative Navigation Arnoud Visser 1 Search, Navigate, and Actuate Quantative Navigation.
The Vector Field Histogram Erick Tryzelaar November 14, 2001 Robotic Motion Planning A Method Developed by J. Borenstein and Y. Koren.
DESIGN OF A GENERIC PATH PATH PLANNING SYSTEM AILAB Path Planning Workgroup.
NUS CS5247 Randomized Kinodynamic Motion Planning with Moving Obstacles - D. Hsu, R. Kindel, J.C. Latombe, and S. Rock. Int. J. Robotics Research, 21(3): ,
Randomized Kinodynamics Motion Planning with Moving Obstacles David Hsu, Robert Kindel, Jean-Claude Latombe, Stephen Rock.
Visibility-based Motion Planning Lecture slides for COMP presented by Georgi Tsankov.
Active SLAM in Structured Environments Cindy Leung, Shoudong Huang and Gamini Dissanayake Presented by: Arvind Pereira for the CS-599 – Sequential Decision.
David Hsu, Robert Kindel, Jean- Claude Latombe, Stephen Rock Presented by: Haomiao Huang Vijay Pradeep Randomized Kinodynamic Motion Planning with Moving.
Real-Time Tracking of an Unpredictable Target Amidst Unknown Obstacles Cheng-Yu Lee Hector Gonzalez-Baños* Jean-Claude Latombe Computer Science Department.
“Visibility-based Probabilistic Roadmaps for Motion Planning” Siméon, Laumond, Nissoux Presentation by: Mathieu Bredif CS326A: Paper Review Winter 2004.
CS 326 A: Motion Planning Planning Exploration Strategies.
Autonomous Robot Navigation Panos Trahanias ΗΥ475 Fall 2007.
1 Target Tracking u u Real Time Tracking of an Unpredictable Target Amidst Unknown Obstacles by Cheng Yu Lee, Hector Gonzalez-Banos and Jean Claude Latombe.
Motion Planning. Basic Topology Definitions  Open set / closed set  Boundary point / interior point / closure  Continuous function  Parametric curve.
“Visibility-based Probabilistic Roadmaps for Motion Planning” Siméon, Laumond, Nissoux Presentation by: Eric Ng CS326A: Paper Review Spring 2003.
1 Last lecture  Path planning for a moving Visibility graph Cell decomposition Potential field  Geometric preliminaries Implementing geometric primitives.
Motion Planning with Visibility Constraints Jean-Claude Latombe Computer Science Department Stanford University.
Presented by David Stavens. Autonomous Inspection Compute a path such that every point on the boundary of the workspace can be inspected from some point.
Mining SNPs from EST Databases Picoult-Newberg et al. (1999)
CS 326 A: Motion Planning Exploring and Inspecting Environments.
Panos Trahanias: Autonomous Robot Navigation
P. Ögren (KTH) N. Leonard (Princeton University)
Pursuit and Evasion CS326A: Motion Planning Spring 2003 Final Project Eric Ng Huy Nguyen.
Randomized Planning for Short Inspection Paths Tim Danner Lydia E. Kavraki Department of Computer Science Rice University.
Adaptive Dynamic Collision Checking for Single and Multiple Articulated Robots in Complex Environments Schwarzer, Saha, and Latombe CS326A Winter 2004,
Randomized Motion Planning for Car-like Robots with C-PRM Guang Song, Nancy M. Amato Department of Computer Science Texas A&M University College Station,
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Configuration Space – Basic Path-Planning Methods.
An experiment on squad navigation of human and robots IARP/EURON Workshop on Robotics for Risky Interventions and Environmental Surveillance January 7th-8th,
Robot Motion Planning Bug 2 Probabilistic Roadmaps Bug 2 Probabilistic Roadmaps.
CS 326A: Motion Planning Basic Motion Planning for a Point Robot.
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
Panos Trahanias: Autonomous Robot Navigation PATH PLANNING.
Introduction to Robot Motion Planning. Example A robot arm is to build an assembly from a set of parts. Tasks for the robot: Grasping: position gripper.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces Lydia E. Kavraki Petr Švetka Jean-Claude Latombe Mark H. Overmars Presented.
1 DARPA TMR Program Collaborative Mobile Robots for High-Risk Urban Missions Second Quarterly IPR Meeting January 13, 1999 P. I.s: Leonidas J. Guibas and.
Kalman filter and SLAM problem
Using Incomplete Online Metric Maps for Topological Exploration with the Gap Navigation Tree Liz Murphy and Paul Newman Mobile Robotics Research Group,
ROBOT LOCALISATION & MAPPING: NAVIGATION Ken Birbeck.
© Manfred Huber Autonomous Robots Robot Path Planning.
SPIE'01CIRL-JHU1 Dynamic Composition of Tracking Primitives for Interactive Vision-Guided Navigation D. Burschka and G. Hager Computational Interaction.
Robot Crowd Navigation using Predictive Position Fields in the Potential Function Framework Ninad Pradhan, Timothy Burg, and Stan Birchfield Electrical.
ALIGNMENT OF 3D ARTICULATE SHAPES. Articulated registration Input: Two or more 3d point clouds (possibly with connectivity information) of an articulated.
Gapped BLAST and PSI- BLAST: a new generation of protein database search programs By Stephen F. Altschul, Thomas L. Madden, Alejandro A. Schäffer, Jinghui.
Robotics Chapter 5 – Path and Trajectory Planning
DARPA TMR Program Collaborative Mobile Robots for High-Risk Urban Missions Third Quarterly IPR Meeting May 11, 1999 P. I.s: Leonidas J. Guibas and Jean-Claude.
Path Planning for a Point Robot
How are things going? Core AI Problem Mobile robot path planning: identifying a trajectory that, when executed, will enable the robot to reach the goal.
Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe, M. Overmars.
CS B659: Principles of Intelligent Robot Motion Configuration Space.
1 Distributed and Optimal Motion Planning for Multiple Mobile Robots Yi Guo and Lynne Parker Center for Engineering Science Advanced Research Computer.
Legged Locomotion Planning Kang Zhao B659 Intelligent Robotics Spring
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
1 Energy-Efficient Mobile Robot Exploration Yongguo Mei, Yung-Hsiang Lu Purdue University ICRA06.
Navigation Strategies for Exploring Indoor Environments Hector H Gonzalez-Banos and Jean-Claude Latombe The International Journal of Robotics Research.
Motion Planning Howie CHoset. Assign HW Algorithms –Start-Goal Methods –Map-Based Approaches –Cellular Decompositions.
Path Planning Based on Ant Colony Algorithm and Distributed Local Navigation for Multi-Robot Systems International Conference on Mechatronics and Automation.
Vision-Guided Humanoid Footstep Planning for Dynamic Environments P. Michel, J. Chestnutt, J. Kuffner, T. Kanade Carnegie Mellon University – Robotics.
Vision-Guided Humanoid Footstep Planning for Dynamic Environments
COGNITIVE APPROACH TO ROBOT SPATIAL MAPPING
Example robot cleared region robot’s visibility region hiding region 2
Paper – Stephen Se, David Lowe, Jim Little
CS b659: Intelligent Robotics
Real-time Wall Outline Extraction for Redirected Walking
Irving Vasquez, L. Enrique Sucar, Rafael Murrieta-Cid
Motion Planning for a Point Robot (2/2)
Search-Based Footstep Planning
for Vision-Based Navigation
Planning.
Presentation transcript:

Navigation Strategies for Exploring Indoor Environments Presented by Mathieu Bredif February 17, 2004 CS326A: Motion Planning

Problem statement Safe and Efficient Robot Mapping Imperfect Control & Sensing SLAM: Simultaneous Localization & Mapping NBV: Next Best View Whole Navigation Sensor data Global Map Sensor Data Single Position Sensor data Updated Global Map Sensor Data Next Position

Visibility Region Generalization, Constraints: Line-of-sight Range Incidence Solid Curves Polylines if Workspace is Polygonal Free Curves: ≤3 parts: Line Segments Circular Arcs Log Spiral Section Safe Region: Definition nv q ∂W w

Safe Region: Computation Polylines fit Point cloud Ordered by θ Subset of the Visibility Region Solid lines of ∂W Free curves Safe Region Polyline approx. of the free curves

Next Best View Algorithm Alignment/Merging Candidate Generation Candidate Evaluation

NBV: Alignment / Merging Global model Local model Alignment Matches  Transformation T Needs overlap Merging Global Safe Region Global Map

NBV: Candidate Generation Uniform Sampling of Uniform Sampling of the visibility range of each point sample Discard the candidates that see less than overlap threshold of ALIGN. Path Planner: Discard unreachable points

NBV: Candidate Evaluation A(q): Area of the potentially unexplored region seen from q L(q): Length of a collision-free Path q k ->q Score = motion/expected information gain Tradeoff  NBV = argmax Sampled Points (g)

NBV: Algorithm Overview

NBV & Termination Condition Single Position Sensor data Updated Global Map L(all free curves)< Lmax Next Best View Position Global Map L(all free curves)< Lmax SLAC

Small Obstacles Different nature, subject to change position Detectable: narrow in-ward pointing spikes Distinct Obstacle map

Implementation/Example Runs

Short Range Example

Long Range Example

Conclusion Good Heuristic to plan the exploring Navigation Trajectory On-the-fly. (Real Time) Limited sensors: r max, tau Also limited field of view In Safe Region Navigation Warranty (if no glass doors in the workspace…)