Adjustable Book Shelf

Team Members :

Ankit Dhawan Vineet Alva

Shohei Shibata Avirul Sharma

Agenda

• List of Accomplishments in Fall 2003

• Design Parameters

• Slide Down Concept

• Plans for this semester

Past Accomplishments

• New project was established

• Problem defined, design parameters set

• Concepts designed

• Ideas were eliminated down to one concept

Design Parameters

• Cost less than $500

• Requires very little muscle force by user

• Hold at least 8 – 10 books

• Makes use of current dorm shelving unit

• All books are attainable from a seated position

Slide Down Bookshelf Design

•An adjustable bookshelf that fits inside the existing shelf.•Slides down at an angle onto the desk.•It will contain about 120lbs of books when fully packed.

Semester Plans

• Reconsider concept from past semester– Cost analysis (must be under $500 per shelf)– Practicality: Is an easier solution achievable?

• Construct several other concepts

• Decision Matrix: make 1st and 2nd choices

• Create mathematical models, 3-d models

• List materials and complete cost analysis

ICMICM

• Objective: To help students with physical disabilities locate the best accessible path between campus locations by drawing a map

Interactive Campus Map

Group MembersGroup Members

• Abdul Zahid

• Avirul Sharma

• Brian Eng

• Saad Sami

Phase of the Design Process

• We are currently in the production phase

- Kiosk mostly completed

• No more costs in the project

- Everything has been purchased

Semester Goals• Install functioning

Kiosk in MSEE Building

• Expand area, and plan improvements

• Resizing existing map• Turn by turn directions• Actual distance

calculations• Voice recognition &

synthesis

Tasks

• Obtain more GPS coordinates to complete the campus coverage

• Develop a method to crop the map for faster loading

• Write code for turn by turn directions

• Improve path drawing algorithm

Web-Interface

• Facilitates channeling of the user input data to the best path implementation routine

• Simple and easy to use

• Easy to maintain for future semesters

• Accessible via home computers, not just kiosk

Nodes in the Map

Node Database

• Database example• For GPS coordinates (Latitude, Longitude)

Node Name GPS Coordinates TYPE Neighbors

1 PHYS 6.285, 1.225 Door 2,4,9,10

2 MSEE(NW) 6.654, 3.256 Door 1,7,9,14

3 MSEE(SE) 6.542, 3.2545 Door 4,5,6

4 INT1 6.021, 3.021 Intersection 1,3,6

This Semester

• Got the new members acquainted with the project

• Briefed the project partner on the current status

Semester Timeline

Questions?

GPS-DVIGlobal Positioning System -

Device for the Visually Impaired

Howard Lityo Sak Mahasuverachai

Ryan Hicks Michael Alexander

Sivanit Ratanadib Bryn Nealis-- Advisor : Prof. Irith Pomeranz-- Advisor : Prof. Irith Pomeranz

Prof. Rajesh SubramanyanProf. Rajesh Subramanyan

-- TA : Juan Pertierra -- TA : Juan Pertierra

Overview

• Introduction

• Team Transition Activities

• Current Status

• Project Partner Meeting

• Semester Plan

Introduction

• Objective : To design and implement a portable device that will enable students who are visually impaired to navigate around campus with the use of the global positioning system.

• Solution : Program – “Campus-NAV” Integrates GPS receiver and PDA to help

user navigate around campus.

Team Transition Activities

• Inform new members

• Built semester plans/Gantt Chart

• Acquired Equipments

• Project Partner meeting

• Skill Session

Team Organization

• Defined sub-groups for each task

GPS-DVI

Device driver & Search Algorithm Voice Output

Howard, Bryn, & Ryan Pete, Michael, & Sak

Current Status

• GPS Receiver– Receive GPS-Coordinates (NMEA-Sentence)

– Testing GUI– Open/Close/Read Port– Display NMEA-Sentence

--Time, Longitude, Latitude, Velocity, GPS-Status etc.

-- unable to update continuously

Pocket PC hp jornada

•

•

•

•

•

•

•

•

•

•

• • • •

•

GPS-DVI System GUI

Enter

Power

1 2 3

4 5 6

7 8 9

0Reset

Current Status

• Voice Output– Verbal response to user’s input

• Text Aloud Software– Creates MP3 file from text input

• Search Algorithm– Finds shortest path from source node to

destination node• Dijkstra’s Algorithm

– Campus Map– Campus Database– Adjacency Matrix

Campus Database• Node x y NumAdjNode AdjNodes Comment• 0 0 0 1 0 Origin• 1 24 1 2 2 17 MSEE • 2 25 1 1 1 Physics • 3 16 1 1 22 EE• 4 16 5 2 22 23 ME• 5 9 1 1 36 EET• 6 9 5 2 35 36 Potr• 7 29 8 2 18 37 CE• 8 36 8 1 18 CIVIL• 9 26 10 1 19 Scheleman• 10 30 16 1 21 BuildX• 11 20 10 2 19 24 Hovd• 12 11 9 2 13 30 SS• 13 9 9 3 12 31 35 ENAD• 14 2 18 1 34 Pshsy• 15 2 14 2 32 33 SC• 16 19 14 1 27 Elliot• 17 24 3 3 1 22 37 Int• 18 32 8 2 7 8 Int• 19 24 10 3 11 20 37 Int• 20 25 12 2 19 21 Int• The GUI displays shortest path from source to destination.

Adjacency Matrix

Project Partner Meeting

• Update project partner with current status

• Received feedback from project partner

• Plan to meet project partner on a regular basis (once in 4 – 6 weeks)

Semester Plan/Gantt Chart

Thank You!