SMART SHOPPING

NAVIGATOR
Group ID : 31
Yogesh Landge
Parag Chimanpure
Ashish Ranjan
Project guide
Category

B80394284
B80394220
B80394211

: Prof. S. B. Tatale
: Sponsored by Persistent System

PROBLEM DEFINITION

To create an application which will improve the

shopping experience of the user and assist him in
various ways such as finding an item in the mall or
what are the best offers in town etc.

To put in simpler words , a shopping guide for

everyone which will save both your time and money.

MOTIVATION

When we step to into mall or a super shop the first

question we get struck upon From where to start
with ?

Hard to control and monitor budget.

Unavailability of desired goods.

Tough to recall all stuffs pre decided earlier.

Irritates when some of the product are out of sight.

Even more it does when we revisit same location

again and again.

FUNDAMENTAL IDEA

An application that runs with android.

Provide user basic functionalities at his place:

Search

for commodities.

Check

for availability, cost.

Select

best in class based upon user ratings.

Prepare
Grab

offers.

Monitor
Rate

wish list.
fiscal budget.

product as per satisfaction.

FUNDAMENTAL IDEA CONTINUE

User assistance at shopping place in following sense.

Provide

complete map

Navigate

w.r.t wish list.

Provide shortest path.
Add/remove product on site.
Check wish list.
Sorted list in accordance to their class & position on
site.
Claim and redeem offers

MATHEMATICAL MODELLING
Let,
A - Smart Shopping Navigator
X Inputs to Smart Shopping Navigator
Y Outputs of Smart Shopping Navigator
fs System functions
sSet of constraints/rules
The Smart Shopping Navigator can be defined
mathematically as,
A = {X, Y, fs| s}
Category of Problem : P- Class Problem

MATHEMATICAL MODELLING

X = { List of Items, List of Offers , Graph of

geographical area,}

Y = { Get Availability, Get Shortest Route, Get

Navigation Directions}

fs = { create_list() , remove_item() ,
get_navigation() , check_review()}

s = { Only available items should be added, Shop

Location should be within the city of current location
..}

FEASIBILITY ANALYSIS

In our project Smart Shopping Navigator the

important problem to compute navigation paths
among different location and choose the best one
among them.

This type of shortest path problems can be efficiently

solved by greedy approach which can generate a
locally optimal solution in reasonable time.

Considering the various shortest path algorithms that

will be used in our project we can say that our
problem will be a P category problem.

ALGORITHMS

Various Shortest Path algorithm can be used in order

to compute optimal path among different locations in
the map. But in order to solve our problem firstly, the
problem is converted into a graph.

The different landmarks in an area is treated as nodes

The distance between the two landmark is the weight

of the edge.

From this we create a graph for a given area and

implement the algorithm to find shortest path.

ALGORITHMS CONTINUE

Dijkstras Algorithm

SPAH or SPSP stands for Single pair Shortest path .

BASIC BLOCKS AND

FUNCTIONALITY
JAVA
CLASSES

ANDROID
BASED GUI

MY SQL
Database

BASIC BLOCKS AND

FUNCTIONALITY

SOFTWARE SPECIFICATIONS

Operating System : Android 4.0 (Ice Cream

Sandwich) or later. But the android app will also
support Android 2.3 or higher versions.

RAM : 512 MB

JAVA SE version 8.0 for front end design.

MYSQL 6.1 for Database Connectivity.

Various Android APIs as needed during

development.

SOFTWARE SPECIFICATIONS

Eclipse LUNA IDE Version 7.

Web Server such as XAMPP 1.8.2.

Kartograph framework.

LIMITATION AND CONSTRAINTS

Dependency on Internet.

Dependency on Intermediate waypoints.

Dedicated server required.

Timely updation required.

CONCLUSION

Shopping has always been one of the most needed

and regularly done job in our daily life. The only
problem that it is always time consuming and
confusing.

So why not change the way of shopping by getting a

powerful PERSONAL SHOPPING ASSISTANT which
will guide us in every step of shopping.

REFRENCES

An Efficient Path Computation Model for Hierarchically Structured

Topographical Road Maps /IEEE TRANSACTIONS ON KNOWLEDGE AND DATA
ENGINEERING, VOL. 14, NO. 5, SEPTEMBER/OCTOBER 2002

Detection of Urban Structures in SAR Images by Robust Fuzzy Clustering

Algorithms: The Example of Street Tracking/IEEE TRANSACTIONS ON
GEOSCIENCE AND REMOTE SENSING, VOL. 39, NO. 10, OCTOBER 2001

https://play.google.com/store/apps/details?id=com.blogspot.hypersynapse.s
a&hl=en

https://itunes.apple.com/us/app/swirl-personal-shopping-assistant/id53219
5613?mt=8

THANK YOU