Inspection Planning for Sensor Coverage of 3d Marine Structures Brendan Englot and Franz Hover Presented by Arvind Pereira for the CS599 Class on Sequential.

Slides:



Advertisements
Similar presentations
NUS CS5247 Motion Planning for Car- like Robots using a Probabilistic Learning Approach --P. Svestka, M.H. Overmars. Int. J. Robotics Research, 16: ,
Advertisements

O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.
Problem Solving by Searching Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 3 Spring 2007.
Motion Planning for Point Robots CS 659 Kris Hauser.
Probabilistic Path Planner by Someshwar Marepalli Pratik Desai Ashutosh Sahu Gaurav jain.
The GraphSLAM Algorithm Daniel Holman CS 5391: AI Robotics March 12, 2014.
Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”
Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles (1991) Jerome Barraquand Jean-Claude Latombe.
Visibility-based Motion Planning Lecture slides for COMP presented by Georgi Tsankov.
Zach Ramaekers Computer Science University of Nebraska at Omaha Advisor: Dr. Raj Dasgupta 1.
“Visibility-based Probabilistic Roadmaps for Motion Planning” Siméon, Laumond, Nissoux Presentation by: Eric Ng CS326A: Paper Review Spring 2003.
Randomized Planning for Short Inspection Paths Tim Danner and Lydia E. Kavraki 2000 Presented by David Camarillo CS326a: Motion Planning, Spring
Sampling Design: Determine Where to Take Measurements Sampling Design: Determine Where to Take Measurements Empirical Approaches to Sensor Placement: Mobile.
Search-based Path Planning with Homotopy Class Constraints Subhrajit Bhattacharya Vijay Kumar Maxim Likhachev University of Pennsylvania GRASP L ABORATORY.
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.
CS 326A: Motion Planning Criticality-Based Motion Planning: Target Finding.
Randomized Planning for Short Inspection Paths Tim Danner Lydia E. Kavraki Department of Computer Science Rice University.
1 Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network Prof. Yu-Chee Tseng Department of Computer Science National Chiao-Tung University.
Workspace-based Connectivity Oracle An Adaptive Sampling Strategy for PRM Planning Hanna Kurniawati and David Hsu Presented by Nicolas Lee and Stephen.
Finding an Unpredictable Target in a Workspace with Obstacles LaValle, Lin, Guibas, Latombe, and Motwani, 1997 CS326 Presentation by David Black-Schaffer.
Two Discrete Optimization Problems Problem #2: The Minimum Cost Spanning Tree Problem.
Randomized Planning for Short Inspection Paths Tim Danner and Lydia E. Kavraki 2000 Presented by Dongkyu, Choi On the day of 28 th May 2003 CS326a: Motion.
1 Single Robot Motion Planning Liang-Jun Zhang COMP Sep 22, 2008.
Quiz Th. Jan. 19.
Overview and Mathematics Bjoern Griesbach
Optimal Arrangement of Ceiling Cameras for Home Service Robots Using Genetic Algorithms Stefanos Nikolaidis*, ** and Tamio Arai** *R&D Division, Square.
Exposure In Wireless Ad-Hoc Sensor Networks Seapahn Meguerdichian Computer Science Department University of California, Los Angeles Farinaz Koushanfar.
A model for combination of set covering and network connectivity in facility location Rana Afzali and Shaghayegh Parhizi.
Computational Geometry Piyush Kumar (Lecture 5: Linear Programming) Welcome to CIS5930.
© Manfred Huber Autonomous Robots Robot Path Planning.
Topology aggregation and Multi-constraint QoS routing Presented by Almas Ansari.
June 21, 2007 Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta.
Graph Algorithms. Definitions and Representation An undirected graph G is a pair (V,E), where V is a finite set of points called vertices and E is a finite.
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 12 MACHINE SETUP AND OPERATION SEQUENCING E. Gutierrez-Miravete Spring 2001.
Notes 5IE 3121 Knapsack Model Intuitive idea: what is the most valuable collection of items that can be fit into a backpack?
1 P. David, V. Idasiak, F. Kratz P. David, V. Idasiak, F. Kratz Laboratoire Vision et Robotique, UPRES EA 2078 ENSI de Bourges - Université d'Orléans 10.
Aimée Vargas, Jyh-Ming Lien, Marco Morales and Nancy M. Amato Algorithms & Applications Group Parasol Lab, Dept. of Computer Science, Texas A&M University.
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
Lecture 2: 11/4/1435 Problem Solving Agents Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Chapter 2. Optimal Trees and Paths Combinatorial Optimization
28.
Coverage Problems in Wireless Ad-hoc Sensor Networks Seapahn Meguerdichian 1 Farinaz Koushanfar 2 Miodrag Potkonjak 1 Mani Srivastava 2 University of California,
Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.
Management Science 461 Lecture 7 – Routing (TSP) October 28, 2008.
1 Chapter 5 Branch-and-bound Framework and Its Applications.
::Network Optimization:: Minimum Spanning Trees and Clustering Taufik Djatna, Dr.Eng. 1.
Prof. Yu-Chee Tseng Department of Computer Science
Rapidly-Exploring Random Trees
Part 3 Linear Programming
The minimum cost flow problem
Application of network flow: Protecting coral reef ecosystems
Mathematics & Path Planning for Autonomous Mobile Robots
Graph Algorithm.
Part 3 Linear Programming
EMIS 8373: Integer Programming
Integer Programming (정수계획법)
Presented By: Aninoy Mahapatra
Heuristic Algorithms via VBA
Lecture 19-Problem Solving 4 Incremental Method
Problem Solving 4.
Graphs.
Integer Programming (정수계획법)
Mobile-Assisted Localization in Sensor Network
 = N  N matrix multiplication N = 3 matrix N = 3 matrix N = 3 matrix
Heuristic Algorithms via VBA
Heuristic Algorithms via VBA
Part 3 Linear Programming
Motivation Semantic Transformation Module Most of the existing works neglect the semantic relationship between the visual feature and linguistic knowledge,
Robotics meet Computer Science
A feasible solution for problem 2.
Presentation transcript:

Inspection Planning for Sensor Coverage of 3d Marine Structures Brendan Englot and Franz Hover Presented by Arvind Pereira for the CS599 Class on Sequential Decision Making in Robotics

Objective Algorithm to achieve complete sensor coverage of complex 3-d structures when surveyed by an autonomous agent with multiple degrees of freedom Motivating application is ship-hull inspection using bathymetric sonar Plans on a closed triangular mesh model of the structure being inspected

Related Work Art Gallery Problem – Minimum # of guards who can together observe the entire gallery Car painting/Building inspection – Specific geometry of structure being covered Challenging issues in Computational Geometry for complex 3-d models in the absence of a priori knowledge

Related Work Sampling-based planning for similar problems employed the “art gallery” approach i.e. choosing a set of configurations which offer complete coverage and finding a feasible tour among these nodes Postman Framework – information efficient approach to solve deterministically-designed inspections for point robots in a 2-d workspace when robot has a small FOV relative to the size of the workspace

Sensor Footprint of a bathymetric sweep

Graph Construction Algorithm

Find Neighbors

Add Missing View to Graph

Add To Graph

Connect Subtours

Path-Finding Algorithm Incidence Matrix for flows Constraint Matrix ensuring that all nodes are inspected by a chosen path Constraint that enforces the initial node is on the graph

Structure Models

Dense Graphs for Examples

Paths Found

Subtour Connection

Algorithm Performance

Conclusion Algorithm ensures coverage planning over arbitrary discrete 3D structures using an information-efficient postman formulation Need to be more efficient in the search for feasible views Want to optimally manage the division between graph construction and path-finding