Skip to content

navit-gps/navit

Folders and files

NameName
Last commit message
Last commit date
Dec 20, 2024
Dec 20, 2024
Dec 20, 2024
May 25, 2019
May 24, 2022
Dec 27, 2023
Dec 20, 2024
Jan 15, 2021
May 26, 2018
Dec 20, 2024
Dec 12, 2024
Dec 20, 2024
Oct 22, 2022
Aug 31, 2018
Mar 6, 2021
Nov 2, 2019
Apr 24, 2018
Dec 27, 2023
Nov 18, 2018
Mar 6, 2021
Mar 6, 2021
Dec 20, 2024
Oct 28, 2019
Jun 5, 2019
Dec 31, 2015
Jun 5, 2008
May 26, 2018
Mar 7, 2023
Feb 28, 2021
Jan 6, 2021
Sep 26, 2019
Nov 9, 2014
Jul 20, 2018
May 2, 2018
Nov 6, 2019

Repository files navigation

Navit Build Status CodeFactor Translation

A copylefted libre software car-navigation system with its own routing engine.

On an Android tablet
navit on android
On a Linux-based carputer
navit-nuc-osd
Get it on F-Droid Get it on Google Play
Modular design with routing and rendering of one or more vector maps in various formats.
GTK and SDL user-interfaces with touch-screen displays.
Current vehicle position from gpsd or directly from NMEA (GPS) sensors.
Optimal routes and directions spoken in 70+ languages.
Points of interest (POIs) in many formats.

Help and more info available on the wiki.
The Reporting Bugs document helps you file issues.

Maps

OpenStreetMap — display, routing, incomplete street-name search.
Grosser Reiseplaner and compliant maps — full support.
Garmin maps —display, routing, search is being worked on.

GPS Support

Current vehicle position from
— a file or port.
— gpsd (local or remote).
— the location service of several mobile platforms.
— a UDP server (friends tracking) (experimental).

Translation

The Hosted Weblate platform is used to manage translations, which runs Weblate. Translation status

Routing algorithm

Uses LPA* starting at the destination by assigning
a value to each point directly connected to the destination point.
It represents estimated time needed to reach the destination from that point.
A Fibonacci-heap search for the point with the lowest value (to find
a value then assigned to connected points either unevaluated or whose
current value is greater than the new one) is repeated until the origin is found.
Once reaching the origin, the lowest-value points are followed to the destination.

the (experimental) traffic module re-evaluates route-graph portions as segment costs change.
It can process traffic reports and find a way around problems.