CN101813489A - Route planning device and route planning method - Google Patents
Route planning device and route planning method Download PDFInfo
- Publication number
- CN101813489A CN101813489A CN200910046423A CN200910046423A CN101813489A CN 101813489 A CN101813489 A CN 101813489A CN 200910046423 A CN200910046423 A CN 200910046423A CN 200910046423 A CN200910046423 A CN 200910046423A CN 101813489 A CN101813489 A CN 101813489A
- Authority
- CN
- China
- Prior art keywords
- point
- module
- distance
- cut
- detecting
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Navigation (AREA)
Abstract
The invention provides a route planning device and a route planning method. The route planning device is arranged in navigation equipment and comprises an input module, a distance measurement module, a sensing module and a planning module. The route planning method is realized through the route planning device and comprises the following steps: an input module receives the setting of a starting point and a terminal point in a navigation route and sends out a route planning request; after receiving the route planning request, the sensing module senses the current available memory of the navigation equipment and obtains the maximum distance of the route planning to serve as a preset value according the available memory; the distance measurement module calculates distance to be measured between the starting point and the terminal point; when the sensing module senses that the distance to be measured exceeds the preset value, the distance measurement module cuts the distance to be measured to ensure that the distance to be measured between the starting point and a cutting point is not more than the preset value; and the route planning module plans the route between the starting point and the cutting point to obtain a route planning result. The invention can avoid faults caused by insufficient memory.
Description
[technical field]
The present invention relates to a kind of path planning apparatus and paths planning method, particularly relate to a kind of path planning apparatus and paths planning method of avoiding occurring mistake because of low memory.
[background technology]
Computing machine makes people's life quick more, light with the development of communicating by letter, the fashionable whole world of auto navigation and mobile office, and become indispensable part in the modern society gradually.In countries such as Japan, the U.S., for convenience of the user, a lot of automakers have just assembled navigation and mobile office equipment when vehicle dispatches from the factory.In China, the development work of similar products is soon at the early-stage.Automobile navigation instrument is that collection computing machine, communication and navigation, cartographic information are the high-tech product of one, and it all possesses the basic function of notebook PC usually, can refute easily and connect network, send fax and data communication; And built-in gps receiver provides the gps antenna interface, loads location navigation software, utilizes the gps satellite signal that receives to provide round-the-clock, full-time location information domain for vehicle, and can show Vehicular behavior at that time on screen.The user can self-defined in advance course, roadside mark and way point, and the route of preserving predefined route or having passed by is so that inquiry once more.By the inquiry electronic chart, the user can understand the geographical environment and the traffic in somewhere, increases the prediction to following journey, and the road that has not had in having found some former maps can upgrade map by " writing down new road ".
But, when existing navigator is grown the path planning of distance, will taking more internal memory, mistake can appear in the low free memory as if navigator this moment.
[summary of the invention]
The object of the present invention is to provide a kind of path planning apparatus and paths planning method of avoiding occurring mistake because of low memory.
For achieving the above object, the invention provides a kind of path planning apparatus, it is located in the navigator; And described path planning apparatus comprises load module, and described load module is used for receiving the concurrent outbound path planning of the setting request of guidance path starting point, terminal point; Described load module connects range finder module, and described range finder module is used for the distance to be calculated between zequin and the terminal point, finds out the distance to be calculated between cut-point and zequin and the cut-point; Described load module and range finder module connect detecting module, and whether described detecting module is used for detecting and waits to calculate distance and exceed predetermined value and obtain the detecting result; Described detecting module connects planning module, when the detecting result when waiting that calculating distance does not exceed predetermined value, carry out the path planning between Origin And Destination or starting point and the cut-point and obtain route programming result through described planning module.
The present invention also provides a kind of paths planning method, and to reach, wherein, described path planning apparatus is located in the navigator, and described path planning apparatus comprises load module, range finder module, detecting module and planning module by path planning apparatus for it; And described paths planning method may further comprise the steps: load module receives the concurrent outbound path planning of the setting request of starting point, terminal point in the guidance path; After detecting module receives the path planning request, detect the current free memory size of navigator, and obtain the ultimate range of path planning as predetermined value according to the free memory size; Treating between range finder module zequin and the terminal point calculated distance and detected describedly when waiting to calculate distance and exceeding predetermined value when detecting module, will wait to calculate that distance is cut apart so that treating between starting point and the cut-point calculated apart from being not more than predetermined value; Seeing through path planning module carries out the path planning between starting point and the cut-point and obtains route programming result.
Compared with prior art, the present invention can be according to the free memory size of navigator, directly plan and will grow,, thereby can avoid mistake occurring because of low memory so that the required internal memory of the planning of the short distance after cutting apart is not more than the free memory of navigator apart from being divided into the laggard walking along the street of short distance.
[description of drawings]
Fig. 1 is the functional-block diagram of path planning apparatus of the present invention.
Fig. 2 is the process flow diagram of paths planning method of the present invention.
Fig. 3 is the detail flowchart of step 20 among Fig. 2.
[embodiment]
See also shown in Figure 1ly, path planning apparatus 200 of the present invention is located in the navigator 100, and path planning apparatus 200 comprises load module 21, and described load module 21 is used for receiving the concurrent outbound path planning of the setting request of guidance path starting point, terminal point; Described load module 21 connects range finder modules 22, and described range finder module 22 is used for the distance to be calculated between zequin and the terminal point, finds out the distance to be calculated between cut-point and zequin and the cut-point; Described load module 21 and range finder module 22 connects detecting modules 23, and whether described detecting module 23 is used for detecting and waits to calculate distance and exceed predetermined value and obtain the detecting result; Described detecting module 23 connects planning modules 24, when the detecting result when waiting that calculating distance does not exceed predetermined value, carry out the path planning between Origin And Destination or starting point and the cut-point and obtain route programming result through described planning module 24.
Please in conjunction with consulting Fig. 1 and Fig. 2 institute, the path planning apparatus of invention paths planning method by Fig. 1 is reaching, and described paths planning method may further comprise the steps:
Step 10: load module 21 receives the concurrent outbound path planning of the setting request of starting point, terminal point in the guidance path, and some via point if the user stops between Origin And Destination, described load module 21 also can receive the setting via point;
Step 20: after detecting module 23 receives the path planning request, the free memory size that detecting navigator 100 is current, and obtain the ultimate range of path planning as predetermined value according to the free memory size;
Step 30: the distance to be calculated between range finder module 22 zequins and the terminal point;
Step 40: whether the described calculation distance for the treatment of of detecting module 23 detectings exceeds predetermined value; When detecting module 23 detect described when waiting to calculate distance and exceeding predetermined value, execution in step 50; When detecting module 23 detect described when waiting to calculate distance and not exceeding predetermined value, execution in step 90;
Step 50: will wait to calculate apart from cutting apart so that the calculation distance treated between starting point and the cut-point is not more than predetermined value by range finder module 22;
Step 60: see through path planning module 24 and carry out the path planning between starting point and the cut-point and obtain route programming result;
Step 70: detecting module 23 detecting navigator 100 apart from the distance of cut-point whether less than preset distance (for example preceding 500 meters of arrival etc.), when detecting module 23 detects navigator 100 apart from the distance of cut-point during less than preset distance, execution in step 80; When detecting module 23 detects navigator 100 when being not less than preset distance apart from the distance of cut-point, continue execution in step 70; The executive condition of step 70 can change according to user's requirement, is not limited to the distance with cut-point, also can be set at the last information point that whether arrives cut-point, whether arrive the schedule time etc.;
Step 80: by range finder module 22 with cut-point as starting point, and return step 20;
Step 90: see through path planning module 24 and carry out path planning between the Origin And Destination obtaining route programming result, and process ends.
Please in conjunction with consulting shown in Fig. 1 and 3, step 50 specifically may further comprise the steps:
Step 51: see through range finder module 22 and find out cut-point between the Origin And Destination, and the distance to be calculated between zequin and the cut-point, wherein, described cut-point is the meta information point (meta information point can according to user's needs set, can be route middle distance mid point nearest information point Origin And Destination between) via point or Origin And Destination nearest apart from starting point;
Step 52: detecting module 23 detectings are waited to calculate distance and whether are exceeded predetermined value; When detecting module 23 detects when waiting to calculate distance and not exceeding predetermined value execution in step 60; When detecting module 23 detects when waiting to calculate distance and exceeding predetermined value execution in step 53;
Step 53: by range finder module 22 with cut-point as terminal point, and return step 51.
The present invention can be according to the free memory size of navigator 100, directly plan and will grow apart from being divided into the laggard walking along the street of short distance, so that the required internal memory of the planning of the short distance after cutting apart is not more than the free memory of navigator 100, thereby can avoid mistake occurring because of low memory.
Claims (10)
1. path planning apparatus, it is located in the navigator; It is characterized in that described path planning apparatus comprises:
Load module, it is used for receiving the concurrent outbound path planning of the setting request of guidance path starting point, terminal point;
Range finder module connects load module, and described range finder module is used for the distance to be calculated between zequin and the terminal point, finds out the distance to be calculated between cut-point and zequin and the cut-point;
Detecting module connects load module and range finder module, and whether described detecting module is used for detecting and waits to calculate distance and exceed predetermined value and obtain the detecting result;
Planning module connects detecting module, when the detecting result when waiting that calculating distance does not exceed predetermined value, carry out the path planning between Origin And Destination or starting point and the cut-point and obtain route programming result through described planning module.
2. paths planning method, to reach, wherein, described path planning apparatus is located in the navigator, and described path planning apparatus comprises load module, range finder module, detecting module and planning module by path planning apparatus for it; It is characterized in that described paths planning method may further comprise the steps:
(1) load module receives the concurrent outbound path planning of the setting request of starting point, terminal point in the guidance path;
(2) after detecting module receives the path planning request, detect the current free memory size of navigator, and obtain the ultimate range of path planning as predetermined value according to the free memory size;
(3) distance to be calculated between range finder module zequin and the terminal point, and wait to calculate distance and whether exceed predetermined value by detecting module detecting is described;
(4) detect describedly when waiting to calculate distance and exceeding predetermined value when detecting module, will wait to calculate that distance is cut apart is not more than predetermined value so that treating between starting point and the cut-point calculated distance;
(5) seeing through path planning module carries out the path planning between starting point and the cut-point and obtains route programming result.
3. paths planning method according to claim 2, it is characterized in that: when detecting module detects described when waiting to calculate distance and not exceeding predetermined value, see through path planning module and carry out path planning between the Origin And Destination obtaining route programming result, and process ends.
4. paths planning method according to claim 2 is characterized in that: after path planning module obtains route programming result, by range finder module with cut-point as starting point, and be back to step (2).
5. paths planning method according to claim 4, it is characterized in that: range finder module with cut-point as starting point before, carry out earlier following step: detecting module detecting navigator apart from the distance of cut-point whether less than preset distance, and when detecting module detects navigator apart from the distance of cut-point during less than preset distance, by range finder module with cut-point as starting point, and be back to step (2).
6. paths planning method according to claim 2 is characterized in that: the idiographic flow of step (4) comprising:
(41) see through range finder module and find out cut-point between the Origin And Destination and the distance to be calculated between zequin and the cut-point;
(42) detecting module detecting is waited to calculate distance and whether is exceeded predetermined value, when detecting module detects when waiting to calculate distance and exceeding predetermined value execution in step (43);
(43) by range finder module with cut-point as terminal point, and return step (41).
7. paths planning method according to claim 6 is characterized in that: when detecting module detects and waits to calculate distance and do not exceed predetermined value in the step (42), and execution in step (5).
8. paths planning method according to claim 2 is characterized in that: described cut-point for apart from starting point nearest via point.
9. paths planning method according to claim 2 is characterized in that: described cut-point is the meta information point of Origin And Destination.
10. paths planning method according to claim 9 is characterized in that: described meta information point is the nearest information point of route middle distance mid point between the Origin And Destination.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910046423A CN101813489A (en) | 2009-02-20 | 2009-02-20 | Route planning device and route planning method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200910046423A CN101813489A (en) | 2009-02-20 | 2009-02-20 | Route planning device and route planning method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101813489A true CN101813489A (en) | 2010-08-25 |
Family
ID=42620804
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200910046423A Pending CN101813489A (en) | 2009-02-20 | 2009-02-20 | Route planning device and route planning method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101813489A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103093686A (en) * | 2011-11-04 | 2013-05-08 | 北京中交兴路信息科技有限公司 | Method and system of electronic map line marking |
| CN105528359A (en) * | 2014-09-29 | 2016-04-27 | 国际商业机器公司 | Method and system for storing trajectory |
| CN108692724A (en) * | 2017-04-10 | 2018-10-23 | 中兴通讯股份有限公司 | A kind of indoor navigation method and device |
| CN111736582A (en) * | 2019-03-19 | 2020-10-02 | 北京奇虎科技有限公司 | Path processing method and device, electronic equipment and computer readable storage medium |
| WO2021103628A1 (en) * | 2019-11-27 | 2021-06-03 | 苏宁云计算有限公司 | Method and apparatus for deleting fence points on electronic fence, and computer device |
| CN114924575A (en) * | 2022-07-21 | 2022-08-19 | 北京建筑大学 | Mobile robot path planning method and device, electronic equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101162150A (en) * | 2006-11-30 | 2008-04-16 | 厦门雅迅网络股份有限公司 | Calculating method for searching multi-city multi-province route using framing data in networking vehicle mounted guidance apparatus |
| CN101257644A (en) * | 2007-03-01 | 2008-09-03 | 明基电通股份有限公司 | Mobile device for downloading map and method thereof |
| CN101294818A (en) * | 2008-04-24 | 2008-10-29 | 凯立德欣技术（深圳）有限公司 | Method for searching interest point along guiding route and navigation system adopting the same |
-
2009
- 2009-02-20 CN CN200910046423A patent/CN101813489A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101162150A (en) * | 2006-11-30 | 2008-04-16 | 厦门雅迅网络股份有限公司 | Calculating method for searching multi-city multi-province route using framing data in networking vehicle mounted guidance apparatus |
| CN101257644A (en) * | 2007-03-01 | 2008-09-03 | 明基电通股份有限公司 | Mobile device for downloading map and method thereof |
| CN101294818A (en) * | 2008-04-24 | 2008-10-29 | 凯立德欣技术（深圳）有限公司 | Method for searching interest point along guiding route and navigation system adopting the same |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103093686A (en) * | 2011-11-04 | 2013-05-08 | 北京中交兴路信息科技有限公司 | Method and system of electronic map line marking |
| CN105528359A (en) * | 2014-09-29 | 2016-04-27 | 国际商业机器公司 | Method and system for storing trajectory |
| CN105528359B (en) * | 2014-09-29 | 2019-05-07 | 国际商业机器公司 | For storing the method and system of travel track |
| CN108692724A (en) * | 2017-04-10 | 2018-10-23 | 中兴通讯股份有限公司 | A kind of indoor navigation method and device |
| CN111736582A (en) * | 2019-03-19 | 2020-10-02 | 北京奇虎科技有限公司 | Path processing method and device, electronic equipment and computer readable storage medium |
| WO2021103628A1 (en) * | 2019-11-27 | 2021-06-03 | 苏宁云计算有限公司 | Method and apparatus for deleting fence points on electronic fence, and computer device |
| CN114924575A (en) * | 2022-07-21 | 2022-08-19 | 北京建筑大学 | Mobile robot path planning method and device, electronic equipment and storage medium |
| CN114924575B (en) * | 2022-07-21 | 2022-09-23 | 北京建筑大学 | Mobile robot path planning method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP6277136B2 (en) | Telematics control device and telematics control method | |
| US9020746B2 (en) | Vehicle-mounted information processing apparatus and information processing method | |
| EP2462409B1 (en) | Method of detecting transportation network database errors and devices thereof | |
| EP2823329B1 (en) | Point of interest database maintenance system | |
| US8825280B2 (en) | Vehicle data storage system, vehicle data storage apparatus, vehicle data storage server, and vehicle data storage method | |
| KR101834723B1 (en) | Vehicle-mounted device and spoofing detection method | |
| EP1985971B1 (en) | Vehicle position information provision device, vehicle position information provision method, and computer program | |
| WO2015002219A1 (en) | Vehicle-mounted device and spoofing detection method | |
| CN101813489A (en) | Route planning device and route planning method | |
| KR102132958B1 (en) | Methods of providing traffic flow messages | |
| KR101757085B1 (en) | Vehicle data collection system, vehicle data collection method, vehicle-mounted device and recording medium | |
| CN102610118A (en) | Bus information acquiring device, bus positioning system and method | |
| CN102155951A (en) | Vehicle navigation system and method | |
| JP2007011558A (en) | Apparatus and method for predicting traffic jam | |
| WO2018141675A1 (en) | Distributed autonomous mapping | |
| GB2445271A (en) | Method and system for determining traffic congestion. | |
| US7865305B2 (en) | Navigation system | |
| US20170205242A1 (en) | Methods of obtaining and using point of interest data | |
| KR20160013147A (en) | Vehicle-mounted device and spoofing detection method | |
| CN105091896A (en) | Driving behavior prompting method, vehicle and electronic device | |
| CN104006814A (en) | Vehicle navigation system and method | |
| CN109859611B (en) | Map data acquisition method, device, equipment and storage medium | |
| JP2009289223A (en) | Traffic situation prediction system, navigator, and server | |
| CN201111630Y (en) | Vehicle mounted information controlling device | |
| CN101650874A (en) | Driver information system and method for operating the same |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20100825 |