CN117278940B - Car machine interconnection system based on hicar - Google Patents
Car machine interconnection system based on hicar Download PDFInfo
- Publication number
- CN117278940B CN117278940B CN202311094386.2A CN202311094386A CN117278940B CN 117278940 B CN117278940 B CN 117278940B CN 202311094386 A CN202311094386 A CN 202311094386A CN 117278940 B CN117278940 B CN 117278940B
- Authority
- CN
- China
- Prior art keywords
- route
- alternative route
- vehicle
- vehicles
- alternative
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 claims abstract description 23
- 238000004891 communication Methods 0.000 abstract description 2
- 206010039203 Road traffic accident Diseases 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/024—Guidance services
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/09—Arrangements for giving variable traffic instructions
- G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
- G08G1/0968—Systems involving transmission of navigation instructions to the vehicle
- G08G1/096805—Systems involving transmission of navigation instructions to the vehicle where the transmitted instructions are used to compute a route
- G08G1/096827—Systems involving transmission of navigation instructions to the vehicle where the transmitted instructions are used to compute a route where the route is computed onboard
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/09—Arrangements for giving variable traffic instructions
- G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
- G08G1/0968—Systems involving transmission of navigation instructions to the vehicle
- G08G1/096833—Systems involving transmission of navigation instructions to the vehicle where different aspects are considered when computing the route
- G08G1/096844—Systems involving transmission of navigation instructions to the vehicle where different aspects are considered when computing the route where the complete route is dynamically recomputed based on new data
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
- H04W4/44—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for communication between vehicles and infrastructures, e.g. vehicle-to-cloud [V2C] or vehicle-to-home [V2H]
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
- Y02T10/00—Road transport of goods or passengers
- Y02T10/10—Internal combustion engine [ICE] based vehicles
- Y02T10/40—Engine management systems
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention relates to the technical field of communication, and particularly discloses a car-machine interconnection system based on a hicar, which comprises the following components: the initialization module acquires a destination of a user and selects a route with the shortest distance as an initial navigation route H0; the acquisition module is used for acquiring traffic data, analyzing the vehicle distribution condition in the alternative route according to the traffic data and calculating the accident occurrence probability of the alternative route in a period; the selection module predicts the accident occurrence probability according to the vehicle distribution condition and selects the optimal item in the alternative route as an optimal route H' according to the prediction result; the module is iterated, the optimal route H' =h0 is made, and the above process is repeated when the vehicle reaches the next switching point. According to the traffic data, the real-time accident probability on each alternative route is predicted, so that the optimal route is selected, the accident risk of a user is reduced, and the driving experience of a driver is improved.
Description
Technical Field
The invention relates to the technical field of communication, in particular to a car-machine interconnection system based on hicar.
Background
The vehicle-mounted display is connected with the entertainment system, the information system and the control system of the vehicle, and the intelligent mobile phone or other external devices, so that various functions and services can be conveniently accessed in the driving process of a driver, the mobile phone is arranged on the vehicle-mounted display, and the functions of navigation, video, music, games and the like in the mobile phone can be operated through the display.
In the existing vehicle-machine interconnection system, when in use navigation, the vehicle-machine and the mobile terminal are interconnected, so that the vehicle-machine controls the mobile terminal and displays data information displayed on the mobile terminal, and the mobile terminal obtains corresponding resources. However, this method ignores the problem of optimal selection of driving routes, such as traffic accidents or too high congestion of vehicles on a given route when an intersection is encountered, and the driver does not receive a prompt to change the route, which may cause the driver to experience traffic jam or traffic accidents during driving.
Disclosure of Invention
The invention aims to provide a car-machine interconnection system based on hicar, which solves the following technical problems: and predicting the real-time accident probability on each alternative route according to the traffic data, further selecting an optimal route, and repeating the steps by taking the optimal route as an initial driving route when the next intersection is reached, so that the risk of accident of a user is reduced and the driving experience of a driver is improved.
The aim of the invention can be achieved by the following technical scheme:
car interconnected system based on hicar includes:
the initialization module is used for acquiring a user destination, planning a driving route according to a starting place, wherein the driving route comprises all feasible routes, selecting a feasible route with the shortest distance from the driving routes as an initial navigation route H0, and driving according to the initial navigation route;
the system comprises an acquisition module, a calculation module and a control module, wherein the acquisition module acquires traffic data when a vehicle reaches the next switching point, the switching point is the nearest intersection on an alternative route, the alternative route is all feasible routes passing through the current switching point, and the distribution condition of the vehicle in the alternative route and the accident occurrence probability of the alternative route in a calculation period are analyzed according to the traffic data;
the selection module predicts the accident occurrence probability according to the vehicle distribution condition and selects the optimal item in the alternative route as an optimal route H' according to the prediction result;
the module is iterated, the optimal route H' =h0 is made, and the above process is repeated when the vehicle reaches the next switching point.
As a further scheme of the invention: in the acquisition module, the process of acquiring traffic data comprises the following steps:
the method comprises the steps of obtaining the number of vehicles in a calculated path, dividing the calculated path into a distance section with the length of n being L by taking the current position of the vehicle as a starting point, wherein the calculated path is a path between the current position of the vehicle on an alternative path and the next switching point, the length of the calculated path is n x L+k, k is a constant, and obtaining the number M of the vehicles in the distance section qn ，M qn Representing the number of vehicles in the nth distance segment on the qth alternative route;
calculating the maximum value F of the number of vehicles in n distance segments on each alternative route by a formula, wherein the calculation formula is as follows:
F q ＝max(M q1 ，M q2 ，...，M qn )；
wherein F is q Representing the maximum value of the number of vehicles in the n distance segments on the q-th alternative route, when F q And when the distance is more than or equal to F ', the alternative route is not used as an option for selecting the optimal route, and F' represents the maximum value of the number of vehicles in the preset distance section.
As a further scheme of the invention: in the acquisition module, the process of acquiring the vehicle congestion degree comprises the following steps:
when F q When the number of vehicles in the distance section is less than F ', setting a threshold value F ' of the number of vehicles in the distance section, comparing the number of vehicles in the n distance sections on each alternative route with F ', and respectively assigning different comparison results, wherein the assigned score is denoted as A, and the method is particularly used for calculating by adopting the following linear piecewise function mode:
the vehicle congestion degree C is calculated by a formula, and the calculation formula is as follows:
wherein C is q Indicating the degree of congestion of the vehicle on the q-th alternative route, A q The number of comparison results on the q-th alternative route with a value of 1 is indicated.
As a further scheme of the invention: in the collection module, the process of collecting traffic data further comprises:
the number of times of accidents in a calculation period is obtained, the calculation period is divided into y time periods with the time of the vehicle reaching the switching point as a starting point, the time period is the previous month when the vehicle reaches the switching point, the maximum value G of the number of accidents in y time periods on each alternative route is calculated through a formula, and the calculation formula is as follows:
G q ＝max(S q1 ，S q2 ，...，S qy )；
wherein S is qy Indicating the number of times of accidents in the y unit time T on the q-th alternative route;
when T is q And when the number is more than or equal to T ', the alternative route is not used as an option for selecting the optimal route, and T' represents the maximum value of the preset accident times.
As a further scheme of the invention: in the collection module, the process of collecting traffic data further comprises:
when T is q When the accident probability is less than T', calculating the initial accident probability P of the route through a formula, wherein the initial accident probability P of the route is a ratio of the number of accidents in a calculation period to the number of time periods on an alternative route, and the calculation formula is as follows:
wherein P is q Representing the route initial accident probability on the q-th alternative route.
As a further scheme of the invention: in the judging module, the process of selecting the optimal route comprises the following steps:
setting the real-time accident probability as P ', taking the vehicle congestion degree as a correction coefficient of the route initial accident probability P, and calculating the real-time accident probability P' by a formula, wherein the calculation formula is as follows:
P′ q ＝C q *P q ；
wherein P' q Representing the real-time accident probability on the q-th alternative route;
setting an optimal route as H ', and calculating H' by a formula, wherein the calculation formula is as follows:
H′＝min(P′ 1 ，P′ 2 ，...，P′ q )；
when h=p q When the optimal route representing the moment is the q-th alternative route.
As a further scheme of the invention: when the real-time accident probability of the plurality of feasible routes is the same, the alternative route with the shortest distance is selected.
As a further scheme of the invention: in the data acquisition module, when the length of the calculated path is not an integer multiple of L, that is, k is not equal to L, if the number of vehicles in the length corresponding to k is not less than F ', the alternative route is not an option for selecting the optimal route, and if the number of vehicles in the length corresponding to k is less than F', the number of vehicles in the length corresponding to k is not an option for calculating the maximum value F of the number of vehicles and the degree of congestion C of the vehicle.
As a further scheme of the invention: in the selection module, if F is not less than F 'or T is not less than T' in all the alternative routes, the alternative route with the lowest initial accident probability is selected as the optimal route.
The invention has the beneficial effects that: the initialization module acquires a destination of a user and selects a route with the shortest distance as an initial navigation route; the acquisition module acquires traffic data, wherein the traffic data is an important factor for predicting the probability of real-time accidents; the selection module is used for predicting the accident occurrence probability according to the vehicle distribution condition and selecting an optimal item in the alternative route as an optimal route H' according to a prediction result; the iteration module makes the optimal route H' =H20, and repeats the process when the vehicle reaches the next switching point; according to the traffic data, the real-time accident probability on each feasible route passing through the current intersection and leading to the destination is predicted, the optimal route is further selected, and when the next intersection is reached, the optimal route is used as an initial driving route, the steps are repeated until the destination is reached, the accident risk is reduced, and the driving experience of a driver is improved.
Drawings
The invention is further described below with reference to the accompanying drawings.
Fig. 1 is a schematic diagram of the architecture of the hicar-based vehicle-to-machine interconnect system of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Referring to fig. 1, the present invention is a vehicle-to-machine interconnection system based on hicar, comprising:
the initialization module is used for acquiring a user destination, planning a driving route according to a starting place, wherein the driving route comprises all feasible routes, selecting a feasible route with the shortest distance from the driving routes as an initial navigation route H0, and driving according to the initial navigation route;
the system comprises an acquisition module, a calculation module and a control module, wherein the acquisition module acquires traffic data when a vehicle reaches the next switching point, the switching point is the nearest intersection on an alternative route, the alternative route is all feasible routes passing through the current switching point, and the distribution condition of the vehicle in the alternative route and the accident occurrence probability of the alternative route in a calculation period are analyzed according to the traffic data;
the selection module predicts the accident occurrence probability according to the vehicle distribution condition and selects the optimal item in the alternative route as an optimal route H' according to the prediction result;
the module is iterated, the optimal route H' =h0 is made, and the above process is repeated when the vehicle reaches the next switching point.
Notably, the initialization module acquires the destination of the user and selects the route with the shortest distance as the initial navigation route; the acquisition module acquires traffic data, wherein the traffic data is an important factor for predicting the probability of real-time accidents; the selection module is used for predicting the accident occurrence probability according to the vehicle distribution condition and selecting an optimal item in the alternative route as an optimal route H' according to a prediction result; and the iteration module enables the optimal route H' =H20, and repeats the process when the vehicle reaches the next switching point, so that the risk of accidents of the user is reduced, the life and property safety of the user is protected, and the driving experience is improved.
In another preferred embodiment of the present invention, the collecting module obtains the number of vehicles in a calculation path, and divides the calculation path into n distance segments with length L from the current position of the vehicle, the calculation path is a path between the current position of the vehicle on the alternative path and the next switching point, the length of the calculation path is n×l+k, k is a constant, and the number M of vehicles in the distance segments is obtained qn ，M qn Representing the number of vehicles in the nth distance segment on the qth alternative route;
calculating the maximum value F of the number of vehicles in n distance segments on each alternative route by a formula, wherein the calculation formula is as follows:
F q ＝max(M q1 ，M q2 ，...，M qn )；
wherein F is q Representing the maximum value of the number of vehicles in the n distance segments on the q-th alternative route, when F q And when the distance is more than or equal to F ', the alternative route is not used as an option for selecting the optimal route, and F' represents the maximum value of the number of vehicles in the preset distance section.
In another preferred embodiment of the present invention, in the collecting module, when F q When the number of vehicles in the distance section is less than F ', setting a threshold value F ' of the number of vehicles in the distance section, comparing the number of vehicles in the n distance sections on each alternative route with F ', and respectively assigning different comparison results, wherein the assigned score is denoted as A, and the method is particularly used for calculating by adopting the following linear piecewise function mode:
the vehicle congestion degree C is calculated by a formula, and the calculation formula is as follows:
wherein C is q Indicating the degree of congestion of the vehicle on the q-th alternative route, A q The number of comparison results on the q-th alternative route with a value of 1 is indicated.
It should be further noted that when the user travels along the initial route to the intersection, the user usually faces the problem of route selection, if only the distance is used as a standard, it is obviously unreasonable to select the travel route, for example, the number of vehicles in front of the route is significantly higher than that of other routes, the risk of traffic jam and accident is higher than that of other routes, but the distance of the route is shortest, and the route should be selected to continue traveling, when the vehicle crowding degree is higher, the more vehicles in unit distance are described, the probability of accident is higher, therefore, by obtaining the maximum value F of the number of vehicles and comparing with the preset F ', discarding the routes with F not smaller than F', setting the threshold F 'of the number of vehicles, comparing the number of vehicles in each distance section on each alternative route with the threshold F' of the number of vehicles, and assigning different comparison results to each alternative route, and assigning the number of distance sections with 1 to the total number of distance sections on the alternative route to make the crowding degree as the quotient result.
In another preferred embodiment of the present invention, in the collecting module, the number of times of occurrence of the accident in the calculation period is obtained, and the calculation period is divided into y time periods with a time span of T from a time when the vehicle arrives at the switching point, where the calculation period is a month before the time when the vehicle arrives at the switching point, and the maximum value G of the number of occurrence of the accident in y time periods on each alternative route is calculated by a formula, where the calculation formula is as follows:
G q ＝max(S q1 ，S q2 ，...，S qy )；
wherein S is qy Indicating the number of times of accidents in the y unit time T on the q-th alternative route;
when T is q And when the number is more than or equal to T ', the alternative route is not used as an option for selecting the optimal route, and T' represents the maximum value of the preset accident times.
Another preferred embodiment of the inventionIn an embodiment, in the collecting module, when T q When the accident probability is less than T', calculating the initial accident probability P of the route through a formula, wherein the initial accident probability P of the route is a ratio of the number of accidents in a calculation period to the number of time periods on an alternative route, and the calculation formula is as follows:
wherein P is q Representing the route initial accident probability on the q-th alternative route.
It can be understood that the number of accidents of each alternative route in a plurality of unit time is obtained, the concept of the accident probability is quantized, so that the concept is clear at a glance, and the alternative route with the accident number not smaller than the maximum value of the accident number is not used as the option of the optimal route by setting the maximum value of the accident number.
In another preferred embodiment of the present invention, the judging module performs the following steps:
setting the real-time accident probability as P ', taking the vehicle congestion degree as a correction coefficient of the route initial accident probability P, and calculating the real-time accident probability P' by a formula, wherein the calculation formula is as follows:
P′ q ＝C q *P q ；
wherein P' q Representing the real-time accident probability on the q-th alternative route;
setting an optimal route as H ', and calculating H' by a formula, wherein the calculation formula is as follows:
H′＝min(P′ 1 ，P′ 2 ，...，P′ q )；
when h=p q When the optimal route representing the moment is the q-th alternative route.
It should be noted that the real-time accident probability is obtained by combining the correction coefficient with the initial accident probability, so that the accuracy of the real-time accident probability is improved, the optimal route is selected, and the safety of the user in the driving process is improved.
In another preferred embodiment of the invention, the route candidate with the shortest distance is selected when the real-time accident probability of several possible routes is the same.
In another preferred embodiment of the present invention, in the data acquisition module, when the length of the calculated path is not an integer multiple of L, that is, k+.l, if the number of vehicles in the length corresponding to k is not less than F ', the alternative path is not an option for selecting the optimal path, and if the number of vehicles in the length corresponding to k is less than F', the number of vehicles in the length corresponding to k is not an option for calculating the maximum value F of the number of vehicles and the degree of congestion C of the vehicle.
In another preferred embodiment of the present invention, if F is not less than F 'or T is not less than T' among all the alternative routes, the alternative route having the lowest probability of initial accident is selected as the optimal route.
The foregoing describes one embodiment of the present invention in detail, but the description is only a preferred embodiment of the present invention and should not be construed as limiting the scope of the invention. All equivalent changes and modifications within the scope of the present invention are intended to be covered by the present invention.
Claims (7)
1. Car machine interconnected system based on hicar, characterized by including:
the initialization module is used for acquiring a user destination, planning a driving route according to a starting place, wherein the driving route comprises all feasible routes, selecting a feasible route with the shortest distance from the driving routes as an initial navigation route H0, and driving according to the initial navigation route;
the system comprises an acquisition module, a calculation module and a control module, wherein the acquisition module acquires traffic data when a vehicle reaches the next switching point, the switching point is the nearest intersection on an alternative route, the alternative route is all feasible routes passing through the current switching point, and the distribution condition of the vehicle in the alternative route and the accident occurrence probability of the alternative route in a calculation period are analyzed according to the traffic data;
the selection module predicts the accident occurrence probability according to the vehicle distribution condition and selects the optimal item in the alternative route as an optimal route H' according to the prediction result;
the iteration module makes the optimal route H' =H20, and repeats the process when the vehicle reaches the next switching point;
in the acquisition module, the process of acquiring traffic data comprises the following steps:
the method comprises the steps of obtaining the number of vehicles in a calculated path, dividing the calculated path into a distance section with the length of n being L by taking the current position of the vehicle as a starting point, wherein the calculated path is a path between the current position of the vehicle on an alternative path and the next switching point, the length of the calculated path is n x L+k, k is a constant, and obtaining the number M of the vehicles in the distance section qn ，M qn Representing the number of vehicles in the nth distance segment on the qth alternative route;
calculating the maximum value F of the number of vehicles in n distance segments on each alternative route by a formula, wherein the calculation formula is as follows:
F q ＝max(M q1 ，M q2 ，...，M qn )；
wherein F is q Representing the maximum value of the number of vehicles in the n distance segments on the q-th alternative route, when F q When the distance is more than or equal to F ', the alternative route is not used as an option for selecting the optimal route, and F' represents the maximum value of the number of vehicles in the preset distance section;
the acquisition module further comprises a step of acquiring the vehicle crowding degree, wherein the specific process comprises the following steps:
when F q When the number of vehicles in the distance section is less than F ', setting a threshold value F ' of the number of vehicles in the distance section, comparing the number of vehicles in the n distance sections on each alternative route with F ', and respectively assigning different comparison results, wherein the assigned score is denoted as A, and the method is particularly used for calculating by adopting the following linear piecewise function mode:
the vehicle congestion degree C is calculated by a formula, and the calculation formula is as follows:
wherein C is q Indicating the degree of congestion of the vehicle on the q-th alternative route, A q The number of comparison results on the q-th alternative route with a value of 1 is indicated.
2. The car-machine interconnection system based on hicar according to claim 1, wherein the process of calculating the accident occurrence probability in the acquisition module comprises:
the number of times of accidents in a calculation period is obtained, the calculation period is divided into y time periods with the time of the vehicle reaching the switching point as a starting point, the time period is the previous month when the vehicle reaches the switching point, the maximum value G of the number of accidents in y time periods on each alternative route is calculated through a formula, and the calculation formula is as follows:
G q ＝max(S q1 ，S q2 ，...，S qy )；
wherein S is qy Indicating the number of times of accidents in the y unit time T on the q-th alternative route;
when T is q And when the number is more than or equal to T ', the alternative route is not used as an option for selecting the optimal route, and T' represents the maximum value of the preset accident times.
3. The car-machine interconnection system based on hicar according to claim 1, wherein the process of calculating the accident occurrence probability in the acquisition module comprises:
when T is q When the accident probability is less than T', calculating the initial accident probability P of the route through a formula, wherein the initial accident probability P of the route is a ratio of the number of accidents in a calculation period to the number of time periods on an alternative route, and the calculation formula is as follows:
wherein P is q Representing the route initial accident probability on the q-th alternative route.
4. The vehicle-to-machine interconnection system based on hicar of claim 1, wherein the selecting module selects the optimal route by:
setting the real-time accident probability as P ', taking the vehicle congestion degree as a correction coefficient of the route initial accident probability P, and calculating the real-time accident probability P' by a formula, wherein the calculation formula is as follows:
P′ q ＝C q *P q ；
wherein P' q represents the probability of a real-time accident on the q-th alternative route;
setting an optimal route as H ', and calculating H' by a formula, wherein the calculation formula is as follows:
H′＝min(P 1 ′，P′ 2 ，...，P′ q )；
when h=p' q, the optimal route representing this time is the q-th alternative route.
5. The hicar-based vehicle-to-machine interconnection system of claim 1, wherein the shortest distance alternative route is selected when the real-time accident probability of several viable routes is the same.
6. The hicar based vehicle to machine interconnection system according to claim 1, wherein in the acquisition module, when the length of the calculated path is not an integer multiple of L, i.e., k+.l, if the number of vehicles in the length corresponding to k is not less than F ', the alternative route is not an option when the optimal route is selected, and if the number of vehicles in the length corresponding to k is less than F', the number of vehicles in the length corresponding to k is not an option when the maximum value F of the number of vehicles and the degree of congestion C of the vehicle are calculated.
7. The car-machine interconnection system based on hicar according to claim 1, wherein the selection module selects the alternative route with the lowest initial accident probability as the optimal route if F is not less than F 'or T is not less than T' among all the alternative routes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311094386.2A CN117278940B (en) | 2023-08-29 | 2023-08-29 | Car machine interconnection system based on hicar |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311094386.2A CN117278940B (en) | 2023-08-29 | 2023-08-29 | Car machine interconnection system based on hicar |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117278940A CN117278940A (en) | 2023-12-22 |
| CN117278940B true CN117278940B (en) | 2024-04-05 |
Family
ID=89201708
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311094386.2A Active CN117278940B (en) | 2023-08-29 | 2023-08-29 | Car machine interconnection system based on hicar |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117278940B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2010039992A (en) * | 2008-08-08 | 2010-02-18 | Toyota Central R&D Labs Inc | Driving support device and program |
| EP2551639A1 (en) * | 2011-07-27 | 2013-01-30 | NNG Szoftverfejlesztö Kft. | Routing method for road navigation devices with ranking of route alternatives and road navigation device |
| CN112614338A (en) * | 2020-12-04 | 2021-04-06 | 程东 | Traffic jam prediction control system based on big data |
| WO2022227129A1 (en) * | 2021-04-27 | 2022-11-03 | 山东交通学院 | Road transportation risk assessment method and system for hazardous chemical |
| KR20230032331A (en) * | 2021-08-30 | 2023-03-07 | 주식회사 써브 | System and method for providing route and driving guide through navigation |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI754405B (en) * | 2020-10-05 | 2022-02-01 | 鼎漢國際工程顧問股份有限公司 | Bidirectional interactive traffic control management system |
-
2023
- 2023-08-29 CN CN202311094386.2A patent/CN117278940B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2010039992A (en) * | 2008-08-08 | 2010-02-18 | Toyota Central R&D Labs Inc | Driving support device and program |
| EP2551639A1 (en) * | 2011-07-27 | 2013-01-30 | NNG Szoftverfejlesztö Kft. | Routing method for road navigation devices with ranking of route alternatives and road navigation device |
| CN112614338A (en) * | 2020-12-04 | 2021-04-06 | 程东 | Traffic jam prediction control system based on big data |
| WO2022227129A1 (en) * | 2021-04-27 | 2022-11-03 | 山东交通学院 | Road transportation risk assessment method and system for hazardous chemical |
| KR20230032331A (en) * | 2021-08-30 | 2023-03-07 | 주식회사 써브 | System and method for providing route and driving guide through navigation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117278940A (en) | 2023-12-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7590483B2 (en) | Traffic information management system | |
| US20100312466A1 (en) | Method and device for calculating alternative routes in a navigation system | |
| EP1986171B1 (en) | Apparatus, method, and program for generating road information | |
| JP5895926B2 (en) | Movement guidance device and movement guidance method | |
| JP4506663B2 (en) | Traffic situation prediction apparatus, method and program, route search system, and traffic situation provision system | |
| JP2004220574A (en) | Expression method of road-related information, device and system for implementing the same | |
| US20050140525A1 (en) | Systems and methods of displaying predicted traffic information | |
| CN111861617A (en) | Car pooling information processing method, computer device and computer readable storage medium | |
| US10950123B2 (en) | Traffic control system, traffic information output device, traffic control method, and recording medium | |
| CN113532459A (en) | Predictive navigation route planning method and system | |
| JP6822373B2 (en) | Automatic driving proposal device and automatic driving proposal method | |
| CN111854777B (en) | Updating method of navigation route driving time, navigation method, navigation system and vehicle | |
| CN117278940B (en) | Car machine interconnection system based on hicar | |
| JP2010117231A (en) | Device and system for searching route, device for providing route information, onboard unit, and method and program for searching route | |
| US20120041669A1 (en) | Traffic information management device, traffic information management method, and traffic information management program | |
| JP5459837B2 (en) | Emergency vehicle support device, emergency vehicle support system, and emergency vehicle support method | |
| CN113418531A (en) | Navigation route determination method and device, electronic equipment and computer storage medium | |
| CN110567479B (en) | Shortest path acquisition method considering channel change in congestion | |
| CN116734883A (en) | Road congestion prediction and intelligent pilot system | |
| CN109945883B (en) | Information processing method and device and electronic equipment | |
| CN110579220B (en) | Traffic navigation system and method based on big data | |
| CN114413923B (en) | Driving route recommendation method, device, storage medium and system | |
| CN110440817A (en) | A kind of course guiding method based on lane, device and relevant device | |
| JP7014263B2 (en) | Route setting device | |
| JP4237546B2 (en) | Congestion status display method and in-vehicle information terminal |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |