Jonathan Wong Chong 14.8V Polymer Li-Ion Batteries o Only powering thrusters 19v 4Ah Li-Ion External Laptop Battery o Powers main CPU unit.

Slides:



Advertisements
Similar presentations
Single Source Shortest Paths
Advertisements

CS 206 Introduction to Computer Science II 04 / 01 / 2009 Instructor: Michael Eckmann.
Minimum Spanning Trees Definition Two properties of MST’s Prim and Kruskal’s Algorithm –Proofs of correctness Boruvka’s algorithm Verifying an MST Randomized.
October 31, Algorithms and Data Structures Lecture XIII Simonas Šaltenis Nykredit Center for Database Research Aalborg University
By Amber McKenzie and Laura Boccanfuso. Dijkstra’s Algorithm Question: How do you know that Dijkstra’s algorithm finds the shortest path and is optimal.
CSCI 3160 Design and Analysis of Algorithms Tutorial 2 Chengyu Lin.
1 Greedy 2 Jose Rolim University of Geneva. Algorithmique Greedy 2Jose Rolim2 Examples Greedy  Minimum Spanning Trees  Shortest Paths Dijkstra.
Electrical and Computer Engineer Large Portable Projected Peripheral Touchscreen Team Jackson Brian Gosselin Greg Langlois Nick Jacek Dmitry Kovalenkov.
Tirgul 12 Algorithm for Single-Source-Shortest-Paths (s-s-s-p) Problem Application of s-s-s-p for Solving a System of Difference Constraints.
CSE 780 Algorithms Advanced Algorithms Minimum spanning tree Generic algorithm Kruskal’s algorithm Prim’s algorithm.
Minimum Spanning Trees Definition Algorithms –Prim –Kruskal Proofs of correctness.
CS 206 Introduction to Computer Science II 10 / 31 / 2008 Happy Halloween!!! Instructor: Michael Eckmann.
CS 206 Introduction to Computer Science II 11 / 10 / 2008 Instructor: Michael Eckmann.
Graph Algorithms: Shortest Path We are given a weighted, directed graph G = (V, E), with weight function w: E R mapping.
Dynamic Sets and Data Structures Over the course of an algorithm’s execution, an algorithm may maintain a dynamic set of objects The algorithm will perform.
CSE 780 Algorithms Advanced Algorithms SSSP Dijkstra’s algorithm SSSP in DAGs.
1 CSE 417: Algorithms and Computational Complexity Winter 2001 Lecture 11 Instructor: Paul Beame.
Dijkstra’s Algorithm Slide Courtesy: Uwash, UT 1.
Dynamic Sets and Data Structures Over the course of an algorithm’s execution, an algorithm may maintain a dynamic set of objects The algorithm will perform.
ECE 250 Algorithms and Data Structures Douglas Wilhelm Harder, M.Math. LEL Department of Electrical and Computer Engineering University of Waterloo Waterloo,
Dealer Certification Section 2: Building the Network Physical Planning & Documentation Power Sources & Distribution Voltage Drop Calculations Copyright.
+ -. Methode Connector  This is the standard USGS connection for the DCP.  Some manufacturers do not recommend using a methode connector. However, we.
Theory of Computing Lecture 7 MAS 714 Hartmut Klauck.
Dijkstra's algorithm.
Jonathan Wong Chong 14.8V Polymer Li-Ion Batteries o Only powering thrusters 19v 4Ah Li-Ion External Laptop Battery o Powers main.
Light Sensing Wireless Network with Energy Efficient Routing Algorithm Man-Ting Au Thanh Nguyen Marie Shinotsuka Thomas To Georgia Institute of Technology.
Computer Basics An overview of computer hardware ICT Tools: Computer Basics.
SFC UPSHAW POWER GENERATION EQUIPMENT Preventive Maintenance & Troubleshooting.
Shortest Path Algorithms. Kruskal’s Algorithm We construct a set of edges A satisfying the following invariant:  A is a subset of some MST We start with.
Theory of Computing Lecture 10 MAS 714 Hartmut Klauck.
Chapter 9 – Graphs A graph G=(V,E) – vertices and edges
Dijkstras Algorithm Named after its discoverer, Dutch computer scientist Edsger Dijkstra, is an algorithm that solves the single-source shortest path problem.
Program ultrasonic range sensor in autonomous mode
Pediatric Dynamometer ABSTRACT The Children’s Hospital of the University of Pennsylvania has long been involved with the study of the correlation between.
Digital Components and Combinational Circuits Sachin Kharady.
Spanning Trees Introduction to Spanning Trees AQR MRS. BANKS Original Source: Prof. Roger Crawfis from Ohio State University.
Automated Bridge Scour Inspection FSU/FAMU College of Engineering Team 7 Proposal 10/27/2010.
7.2 V battery pack and charger Put the battery in the charger station at the end of the lab. period. Red light indicates charging. Ken Youssefi Introduction.
Tigerbot P15201 Detailed Design Review. Mechanical.
Solar Power Array Management for the Solar Racing Team Mark Calotes Ginah Colón Alemneh Haile Nidhi Joshi Michael Lu School of Electrical and Computer.
Dijkstra’s Algorithm Supervisor: Dr.Franek Ritu Kamboj
Lecture 19 Greedy Algorithms Minimum Spanning Tree Problem.
Adapted from “Cooling Systems” – CTAE Information Technology Essentials PROFITT Curriculum.
1 Finding Shortest Paths with A* Search A* search operates similarly to Dijkstra’s algorithm, but extends the cost function to include an estimated distance.
Semester One 2001/2002 Sheffield Hallam University1 What does a PC do? computers collect, process, store, and communicate information Collect via input.
F d a b c e g Prim’s Algorithm – an Example edge candidates choosen.
Instrumented Football Helmet
Lecture 13 Algorithm Analysis
MSU SeaMATE ROV Explorer Class
HOW TO LABEL AND SAVE FLIP VIDEOS FOR PASA TESTING SPRING 2011 Flip for PASA.
Auto-Park for Social Robots By Team Daedalus. Requirements for FVE Functional Receive commands from user via smartphone app Share data with other cars.
A Introduction to Computing II Lecture 16: Dijkstra’s Algorithm Fall Session 2000.
Mechanical Components and Programming Ken Youssefi Introduction to Engineering – E10 1.
Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.
TIRGUL 10 Dijkstra’s algorithm Bellman-Ford Algorithm 1.
The entire system was tested in a small swimming pool. The fully constructed submarine is shown in Fig. 14. The only hardware that was not on the submarine.
CSE 373: Data Structures and Algorithms Lecture 21: Graphs V 1.
Electronic Control Unit (ECU)
The Greedy Method and Text Compression
Motherboard and its component What is Motherboard? Location Function.
Greedy Algorithms / Dijkstra’s Algorithm Yin Tat Lee
Failure types, Codes, Clearing codes
Dijkstra’s Shortest Path Algorithm Neil Tang 03/25/2008
Slide Courtesy: Uwash, UT
1.11: Robot Controller.
CSE 373 Data Structures and Algorithms
Slide Courtesy: Uwash, UT
CSE 417: Algorithms and Computational Complexity
Implementation of Dijkstra’s Algorithm
The Computer’s Hardware
Presentation transcript:

Jonathan Wong Chong

14.8V Polymer Li-Ion Batteries o Only powering thrusters 19v 4Ah Li-Ion External Laptop Battery o Powers main CPU unit o Lasts roughly 2-3 hours o Essentially powers all USB devices as well 12v Li-Ion Box Battery o Regulated to power actuation system

Jonathan Wong Chong

Matthew Neafie

Images from Robert Castle

Matthew Neafie

Gate Parking Torpedo Matthew Neafie

Gate Parking Torpedo Removed Matthew Neafie

The Path Planning algorithm can be viewed as a greedy algorithm because it always chooses the closest vertex in V - S to add to S. //insert all vertices into priority queue //Extract-min (first extraction is simply s) //for each neighbor //RELAX(u,v,w) //update label of neighbor, //decrease-key v.d in priority queue Fibonacci Heap – O(|V|log|V| + E) time Uses map from SLAM, Goal from Task Manager, calls decision-maker

Matthew Neafie

Weighted Total Output Matthew Neafie

Julius Cobb

Daniel Cifredo

AUV Estimated Budget A. Personnel NameJob DescriptionBase/hrHours/wksTotal Jon Wong ChongTeam Lead Lead Electrical Systems$ / Julius Cobb IIITest Engineer$ / Matthew NeafieLead Program Designer$ / Daniel CifredoSecretary Treasurer$ / Subtotal of Personnel B. Fringe Benefits= 15% of A C. Total Personnel Expenses=A+B D. Parts and Materials NameDescriptionQuantity(#of units) Price including estimated taxes and shippingCosts HydrophonesPinger Detection4$3001, Traxxas #2056 Waterproof ServoA servo that is used with the ball drop1$15$16 PVC - 10 ftBuild obstacle course8$5.50$47 PVC connector - elbowBuild obstacle course2$2.50$5 PVC connector - CapBuild obstacle course4$2.50$11 Orange Duct Tape 15 ydBuild obstacle course4$5$21 PVC glueBuild obstacle course3$5$16 Subtotal of Parts and Materials 1, Total Direct Costs 60, Overhead Costs=45% of Direct Costs E. Total Costs 88, F. Travel Costs 1600 G. Shipping Costs 900 H. Total Project Costs 90, Budget Exercise Daniel Cifredo

HydrophonesPinger Detection4$3001, Traxxas #2056 Waterproof ServoA servo that is used with the ball drop1$15$16 PVC - 10 ftBuild obstacle course8$5.50$47 PVC connector - elbowBuild obstacle course2$2.50$5 PVC connector - CapBuild obstacle course4$2.50$11 Orange Duct Tape 15 ydBuild obstacle course4$5$21 PVC glueBuild obstacle course3$5$16 Subtotal of Parts and Materials 1, Budget Exercise Daniel Cifredo

RiskArduino mega board malfunction ProbabilityLow ConsequenceCatastrophic Strategy1.Ensure proper hookups 2.Circuit analysis to keep current under max rating 3.Save all programs in safe locations RiskZotac computer malfunction or damaged ProbabilityLow ConsequenceCatastrophic Strategy1.Ensure all cables properly connected 2.Ensure watertight seal maintained 3.Check battery charge 4.Save all programs in safe locations RiskThrusters draw maximum current ProbabilityVery Low ConsequenceSevere Strategy1.Write code to prevent max draw 2.Circuit Analysis to determine max current draw allowed Risk Assessment - Technical Daniel Cifredo

RiskComputer Vision Fails during use ProbabilityModerate ConsequenceCatastrophic Strategy1.Ensure camera sensors are waterproofed 2.Calibrate camera sensors when change in environment occurs 3.Use OpenCV library RiskCamera code incorrect ProbabilityModerate ConsequenceCatastrophic Strategy1.Develop pseudo-code for camera data 2.Develop testing methods for camera RiskData Storage Process does not work ProbabilityModerate ConsequenceHigh Strategy1.Develop understanding of SQL 2.Check to ensure enough memory is available to store data Risk Assessment - Technical Daniel Cifredo

RiskPath Planning process fails ProbabilityModerate ConsequenceCatastrophic Strategy1.Develop understanding of SQL 2.Develop understanding of OpenCV 3.Verify algorithm for planning path is correct RiskDecision Making process fails ProbabilityModerate ConsequenceCatastrophic Strategy1.Develop understanding of SQL 2.Develop understanding of OpenCV 3.Verify algorithm for determining next step is correct 4.Verify tasks are implemented correctly Risk Assessment - Technical Daniel Cifredo

Jonathan Wong Chong