Avoiding Planetary Rover Damage by Automated Path Planning Michael Flammia Mentor: Dr. Wolfgang Fink Tempe, AZ April 18 th, 2015.

Slides:



Advertisements
Similar presentations
Is the shape below a function? Explain. Find the domain and range.
Advertisements

Segmentation by Morphological Watersheds
Semir Elezovikj Mo'taz Abdul Aziz Ali Al-Hami Howard Liu
Jill Goryca, Richard Hill American Control Conference June 17, 2013.
Implementing the Probability Matrix Technique for Positron Emission Tomography By: Chris Markson Student Adviser: Dr. Kaufman.
S I E M E N S C O R P O R A T E R E S E A R C H 1 1 A Seeded Image Segmentation Framework Unifying Graph Cuts and Random Walker Which Yields A New Algorithm.
Applications of Single and Multiple UAV for Patrol and Target Search. Pinsky Simyon. Supervisor: Dr. Mark Moulin.
1 E190Q – Project Introduction Autonomous Robot Navigation Team Member 1 Name Team Member 2 Name.
Do Dogs Know Calculus ? This project will explore the innate ability of a dog to find the quickest path to retrieve a ball thrown into the water. We calculate.
Improved Image Quilting Jeremy Long David Mould. Introduction   Goal: improve “ minimum error boundary cut ”
Chapter 4: Divide and Conquer The Design and Analysis of Algorithms.
Randomized Planning for Short Inspection Paths Tim Danner Lydia E. Kavraki Department of Computer Science Rice University.
An Evaluation of Interpolation Methods for MOLA Data Oleg Abramov and Alfred McEwen: Department of Planetary Sciences, University of Arizona INTRODUCTION.
A Novel 2D To 3D Image Technique Based On Object- Oriented Conversion.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Fractals Joceline Lega Department of Mathematics University of Arizona.
Clustering Ram Akella Lecture 6 February 23, & 280I University of California Berkeley Silicon Valley Center/SC.
TOPOGRAPHIC MAP.
Feedback Control for Steering Needles Through 3D Deformable Tissue Using Helical Paths Kris Hauser, Ron Alterovitz, Nuttapon Chentanez, Allison Okamura,
Entropy and some applications in image processing Neucimar J. Leite Institute of Computing
Graph-based consensus clustering for class discovery from gene expression data Zhiwen Yum, Hau-San Wong and Hongqiang Wang Bioinformatics, 2007.
Chapter 10: Image Segmentation
Digital Image Processing
Ranga Rodrigo April 6, 2014 Most of the sides are from the Matlab tutorial. 1.
Constraints-based Motion Planning for an Automatic, Flexible Laser Scanning Robotized Platform Th. Borangiu, A. Dogar, A. Dumitrache University Politehnica.
CPU Sizing vs. Latency Analysis FTS EDR Latency Simulation 5 March 2008 Doug Shannon.
1 Hybrid methods for solving large-scale parameter estimation problems Carlos A. Quintero 1 Miguel Argáez 1 Hector Klie 2 Leticia Velázquez 1 Mary Wheeler.
CS774. Markov Random Field : Theory and Application Lecture 13 Kyomin Jung KAIST Oct
ROBUST RESOURCE ALLOCATION OF DAGS IN A HETEROGENEOUS MULTI-CORE SYSTEM Luis Diego Briceño, Jay Smith, H. J. Siegel, Anthony A. Maciejewski, Paul Maxwell,
Methods in Gravitational Shear Measurements Michael Stefferson Mentor: Elliott Cheu Arizona Space Grant Consortium Statewide Symposium Tucson, Arizona.
1 Oblivious Routing in Wireless networks Costas Busch Rensselaer Polytechnic Institute Joint work with: Malik Magdon-Ismail and Jing Xi.
The Application of The Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem International Conference on Future Computer and Communication,
Optimal Placement of Femto Base Stations in Enterprise Femtocell Networks Adviser: Frank, Yeong - Sung Lin Present by Li Wen Fang.
A* Project Project 1 Due Sep. 26, 2012, 10pm EST Class presentation on Oct. 1, 2012.
Generation of a Digital Elevation Model using high resolution satellite images By Mr. Yottanut Paluang FoS: RS&GIS.
Image Segmentation in Color Space By Anisa Chaudhary.
NASA Space Grant Symposium April 11-12, 2013 Multi-Goal Path Planning Based on the Generalized Traveling Salesman Problem with Neighborhoods by Kevin Vicencio.
CS654: Digital Image Analysis Lecture 5: Pixels Relationships.
1 Motion Fuzzy Controller Structure(1/7) In this part, we start design the fuzzy logic controller aimed at producing the velocities of the robot right.
Bouncing Balls Alex Jing Wei Huang. Goals of this Project Analyze the ball collision rates under different conditions (parameters). – Different container.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Model 5 Long Distance Phone Calls By Benjamin Cutting
Automated design of lightweight exploration rovers Slide 1> Automated rover design > Alexandre C. Leite ASTRA 2013 > Alexandre Carvalho.
CSE554Contouring IISlide 1 CSE 554 Lecture 5: Contouring (faster) Fall 2013.
Genetic algorithms: A Stochastic Approach for Improving the Current Cadastre Accuracies Anna Shnaidman Uri Shoshani Yerach Doytsher Mapping and Geo-Information.
Application of the GA-PSO with the Fuzzy controller to the robot soccer Department of Electrical Engineering, Southern Taiwan University, Tainan, R.O.C.
11 -1 Chapter 12 On-Line Algorithms On-Line Algorithms On-line algorithms are used to solve on-line problems. The disk scheduling problem The requests.
Dave Lattanzi’s Laplace Planner. Laplace Solution Store node charges as a dictionary – Originally used state variables and nodeList Find Laplace solution.
S7-1 ADM , Section 7, August 2005 Copyright  2005 MSC.Software Corporation SECTION 7 DESIGN OF EXPERIMENTS.
Detection of nerves in Ultrasound Images using edge detection techniques NIRANJAN TALLAPALLY.
Beard & McLain, “Small Unmanned Aircraft,” Princeton University Press, 2012, Chapter 12: Slide 1 Chapter 12 Path Planning.
Joint Routing and Scheduling Optimization in Wireless Mesh Networks with Directional Antennas A. Capone, I. Filippini, F. Martignon IEEE international.
Midterm Review 28-29/05/2015 Progress on wire-based accelerating structure alignment Natalia Galindo Munoz RF-structure development meeting 13/04/2016.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Intelligent Exploration for Genetic Algorithms Using Self-Organizing.
CSE 554 Lecture 5: Contouring (faster)
Adaptive Image Processing for Automated Structural Crack Detection
Prediction of fading and link budget in land-satellite (LEO) communication Tal Nir & Ziv Gitelman Department of Communication Systems Engineering , Ben-Gurion.
CS4670/5670: Image Scissors Noah Snavely Today’s Readings
E190Q – Project Introduction Autonomous Robot Navigation
Enumerating Distances Using Spanners of Bounded Degree
Agent-Centered Search
Building Fractal Landscapes
Project P06441: See Through Fog Imaging
Methods and Materials (cont.)
Digital Image Processing
Plotting Points Guided Notes
Volume 88, Issue 3, Pages (November 2015)
Agent-Centered Search
Scientific Visualization
Reporter: Wenkai Cui Institution: Tsinghua University Date:
Presentation transcript:

Avoiding Planetary Rover Damage by Automated Path Planning Michael Flammia Mentor: Dr. Wolfgang Fink Tempe, AZ April 18 th, 2015

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona Outline Introduction Rover Traverse-Optimizing Planner (RTOP) Generating Terrain Data Maps Simulation Setup Results Conclusion and Outlook

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona Introduction Orbital mapping of terrain for path planning. After 3 km. images showed wheel damage. Planetary scientist use terrain data to laboriously plot ideal path to Mount Sharp. Curiosity arrived at mount sharp and readies to ascend the mountain. [Image Credits: NASA/JPL-Caltech/MSSS]

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona Rover Traverse-Optimizing Planner (RTOP) Rover Traverse Optimizing Planner (RTOP). Automated system to rapidly generate optimal rover traverses. Uses Stochastic Optimization Framework (SOF; Fink 2008). Accounts for less defined and changing real world environments. Minimized traverse length while optimizing user-defined mission constraints.

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona SOF as applied to RTOP In case of traverse path optimization, SOF minimizes Euclidian distance, but lets the path wander while optimizing for user- defined mission constraints. Generated traverses are compared against the constraints and optimization is reiterated a user-defined number of times.

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona Generating Terrain Data Maps Terrain Roughness Generated in MATLAB. Starts from a matrix of “random white noise”. Expands pixel of white noise to adjacent and diagonal pixels. Runs a user defined number of times.

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona Seed: Iteration #0Final: Iteration #100,000 Generating Terrain Data Maps Terrain Roughness cont.

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona Generating Terrain Data Maps Altitude Generation – Random Averaging Approach #1: 1.Start with a matrix randomly populated user defined numbers. 2.A random point in matrix and set that point equal to the average of its diagonals. 3.Set the points above, below, left of, and right of the center to the average of the values vertical to or horizontal to the element. 4.Runs user defined number of iterations. (1) (2) (3)

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona Generating Terrain Data Maps Random Averaging – Final Altitude Map

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona Approach #2: Figure Credit: Generating Terrain Data Maps “Diamond Square” Algorithm (Fournier 1982)

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona (1)(2) (3) Generating Terrain Data Maps “Diamond Square” Iteration Number

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona Generating Terrain Data Maps “Diamond Square” – Final Terrain

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona Random Averaging More complicated code but smaller (~50 lines) Much faster to run. Generates more realistic terrains. Limited to a matrix with (2^n) + 1 sides. Diamond Square Less complicated and larger code (~80 lines) Very slow to run.. Generates smooth terrains No limits to matrix side length. Generating Terrain Data Maps Comparison Between Algorithms

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona Simulation Setup 3D Terrain Map with Altitude/Slope Data Associated 2D Terrain Roughness/Traversability Map

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona Simulation Setup We optimized rover traverses for six possible constraints: #0: No mission constraints; #1: Minimum traverse length; #2: Minimum average terrain roughness; #3: Maximum average terrain roughness; #4: Minimum average terrain slope; #5: Maximum average terrain slope. All traverses have same start/end coordinates. To optimize scenarios #0–#5, 100,000 iterations of RTOP were executed, respectively (~85s on MacBookPro 2.8 GHz Intel Core 2 Duo).

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona Results: Scenario #1: Shortest Traverse Length

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona Results: Scenarios #2-5: Minimum vs. Maximum Average Terrain Roughness Minimum average terrain roughness Maximum average terrain roughness Minimum average terrain slope Maximum average terrain slope

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona Results: Scenarios #4-5: Minimum vs. Maximum Average Terrain Slope Minimum average terrain slopeMaximum average terrain slope

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona Results: Scenarios #2-3: Min. vs. Max. Average Terrain Roughness Minimum average terrain roughnessMaximum average terrain roughness

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona RTOP Results: Scenarios #4/5: x/z-plane and y/z-plane traverse profiles Minimum average terrain slope x/z-plane traverse profile Maximum average terrain slope x/z-plane traverse profile Maximum average terrain slope y/z-plane traverse profile Minimum average terrain slope y/z-plane traverse profile

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona RTOP Results: Summary of Simulation Results for Scenarios #0-#5

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona Conclusion and Outlook RTOP can optimize for several different user-defined mission constraints simultaneously. Main traverse path can be split into several segments, each with its own goal/scenario. Frequent mission replanning can occur based on terrain data gathered in-situ. Apply RTOP to real Mars topographic and associated terrain roughness/traversability data. Compare RTOP-results to traverses chosen by mission planners.

© Visual and Autonomous Exploration Systems Research Laboratory at Caltech and the University of Arizona Acknowledgements U of A Space Grant Consortium Dr. Wolfgang Fink and the Visual and Autonomous Explorations Systems Research Laboratory at Caltech and the University of Arizona UA Space Grant Intern Advisors