Route planning method

• US 20110282573A1
• Filed: 05/12/2010
• Published: 11/17/2011
• Est. Priority Date: 05/12/2010
• Status: Abandoned Application

• Current Assignee: Globalsat Technology Corporation
• Original Assignee: Globalsat Technology Corporation
• Inventors: Ting, Shih-Chieh
• Application Number:
  US12/662,921
• Publication Number:
  US 20110282573A1
• Time in Patent Office: Days
• US Class Current: 701/201
• CPC Class Codes: G01C 21/34 Route searching; Route guidance
• CPC Class Codes: G01C 21/3688 Systems comprising multiple parts or multiple output devices (not client-server), e.g. detachable faceplates, key fobs or multiple output screens
• CPC Class Codes: G01S 19/49 whereby the further system is an inertial position system, e.g. loosely-coupled

Abstract

A route planning method used with an electronic device formed of a processor, a transmission interface, an I/O port and a storage unit and a GPS formed of a CPU, a transmission interface, a storage unit, a display unit, a satellite positioning unit and an antenna is disclosed to input the location data of the predetermined destination into the electronic device through the input/output port of the electronic device so that the processor of the electronic device produces and compresses a route planning data and then transmits the route planning data to the GPS for enabling the GPS to convert the geographic coordinate data of the current location received from the satellite and the compressed route panning data received from the electronic device into a planar or 3D navigation map for display on the display unit thereof.

Claims

1. A route planning method used with an electronic device and a GPS (global positioning system), said electronic device comprising a processor, a transmission interface, an I/O port and a storage unit, said electronic device being controllable to transmit signals to said GPS, said GPS comprising a CPU (central processing unit), a transmission interface, a storage unit, a display unit, a satellite positioning unit and an antenna, the route planning method comprising the steps of:

(A) Input the location data of a predetermined destination into said processor of said electronic device through the input/output port of said electronic device.

(B) The processor of said electronic device produces a route planning data.

(C) The processor of said electronic device compresses said route planning data by means of a route planning data compression algorithm, and then determines whether or not to transmit the compressed route planning data to said GPS, and then proceeds to step (E) when positive, or step (D) when negative.

(D) The processor of said electronic device stores the compressed route planning data in the memory unit of said electronic device and ends the procedure.

(E) The processor of said electronic device transmits the compressed route planning data to the transmission interface of said GPS through the transmission interface of said electronic device.

(F) The CPU of said GPS stores the compressed route planning data in the storage unit of said GPS temporarily.

(G) The satellite positioning unit of said GPS receives satellite signals by means of said antenna for enabling the CPU of said GPS to compute the current geographic coordinate data.

(H) The CPU of said GPS drives said display unit to display the direction of the route, the time and distance required to reach to the destination.

2. The route planning method as claimed in claim 1, wherein said GPS further comprises a supplementary unit electrically connected with said CPU, said supplementary unit being selected from a group consisting of electronic compass and G-sensor.

3. The route planning method as claimed in claim 1, wherein said GPS further comprises an I/O port electrically connected with said CPU for signal transmission with an external device.

4. The route planning method as claimed in claim 1, wherein said GPS further comprises a random access memory electrically connected with said CPU.

5. The route planning method as claimed in claim 1, wherein the transmission interface of said electronic device and the transmission interface of said GPS are wireless designs using RF or Bluetooth technology.

6. The route planning method as claimed in claim 1, wherein the transmission interface of said electronic device and the transmission interface of said GPS are wired designs.

7. The route planning method as claimed in claim 1, wherein said electronic device further comprises a random access memory electrically connected to said processor,

8. The route planning method as claimed in claim 1, wherein the route planning data compression algorithm employed in step (C) comprises the steps of:

(C1) Input the location data of said predetermined destination into said electronic device for enabling said electronic device to produce a route planning data that has a number of recording points set from the start point to the destination.

(C2) Set a predetermined distance (T), a predetermined angle (F) and a predetermined number of compression points (Q) subject to said route planning data.

(C3) Input the start point.

(C4) Calculate the distance (d) between two said recording points to be shifted or the contained angle (θ

) defined by two line segments of three said recording points to be shifted.

(C5) Determine whether or not the distance (d) is greater than or equal to the value of the predetermined distance (T), and then proceed to step (C7) when positive, or step (C6) when negative.

(C6) Determine whether or not the contained angle (θ

) is greater than or equal to the value of the predetermined angle (F), and then proceed to step (C7) when positive, or step (C9) when negative.

(C7) Shift the reference point to the next recording point and add 1 to the value recorded, and then store the recorded value.

(C8) Determine whether or not the calculation of all the recording points of the line has been finished, and then proceed to step (C10) when positive, or step (C9) when negative.

(C9) Return to step (C4) and then shift the reference point to the next recording point, and then calculate the angle and distance again.

(C10) Determine whether or not the cumulative value after compression is greater than the predetermined number of compression points (Q), and then proceed to step (C11) when positive, or step (C13) when negative.

(C11) Zero the predetermined number of compression points (Q).

(C12) Increase the value of the predetermined distance (T) and then return to step (C3).

(C13) End the compression.