You want to visit a new restaurant. You enter your car, turn on your navigation application, and start driving. Just in front of the restaurant you hear the announcement: "You've reached your destination". Is that so?? You have to go through guessing, confusion and frustration until you find a parking. To ease this process we're presenting Natyv.

How it works

First, Natyv finds the route which covers the highest number of roads in the destination area. The user is navigated through this route. Then, Natyv looks for nearby roads known as attractive and navigates the user through them. It also looks for roads known as problematic and avoids navigating through them. Such decisions may be affected by:

  • Deducing a car has just left a parking by identifying its movement just after a navigation application's startup.
  • Statistics about hours known as especially free or crowded for certain streets.
  • Details about roads with parking for local residents only
  • Details about roads with parking prohibition
  • Etc.

Challenges I ran into

Controversies among the team mates about our service's independency and software design, which led to better understanding our united point of view.

Accomplishments that I'm proud of

Creating a proof of concept of an idea we really believe can make a change in people's daily problems of finding parking places. Dealing with unexpected technical challenges such as learning open source infrastructures from scratch while using an unfamiliar operating system for development (mac).

What I learned

  • Team work and collaboration
  • Ability to adjust according to unexpected technical challenges
  • Common mapping tools and methods

What's next for Natyv

We're not planning to stop developing our idea! We're going to present our prototype to navigation applications' owners and propose Natyv service as an extension for them. We want to make a real change in the parking searching domain.

Built With

Share this project: