CN106052709A - Congestion information processing method and device - Google Patents
Congestion information processing method and device Download PDFInfo
- Publication number
- CN106052709A CN106052709A CN201610324042.XA CN201610324042A CN106052709A CN 106052709 A CN106052709 A CN 106052709A CN 201610324042 A CN201610324042 A CN 201610324042A CN 106052709 A CN106052709 A CN 106052709A
- Authority
- CN
- China
- Prior art keywords
- congested
- congestion
- length
- comparison result
- programme path
- 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
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/36—Input/output arrangements for on-board computers
- G01C21/3667—Display of a road map
- G01C21/3673—Labelling using text of road map data items, e.g. road names, POI names
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/36—Input/output arrangements for on-board computers
- G01C21/3691—Retrieval, searching and output of information related to real-time traffic, weather, or environmental conditions
- G01C21/3694—Output thereof on a road map
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- Automation & Control Theory (AREA)
- Biodiversity & Conservation Biology (AREA)
- Environmental Sciences (AREA)
- Environmental & Geological Engineering (AREA)
- Ecology (AREA)
- Life Sciences & Earth Sciences (AREA)
- Atmospheric Sciences (AREA)
- Navigation (AREA)
Abstract
The invention discloses a congestion information processing method and device, which are used to improve the resource utilization rate. The method comprises the following steps: obtaining a route planning request from a terminal, wherein the route planning request comprises a start point and a destination; according to the route planning request, generating at least one planned route; obtaining the congestion information of congestion sections of each planned route, wherein the congestion information is used to indicate the congestion degree; according to a preset time interval, comparing the congestion information to generate a comparison result, which is used to indicate the state change of congestion degree; and sending the comparison result back to the terminal.
Description
Technical field
The application relates to the communications field, particularly to the processing method and processing device of a kind of congestion information.
Background technology
Digital navigation map, i.e. numerical map, be to utilize computer technology, the map storing in a digital manner and consulting.
Digital navigation map is a set of for the software of navigation in GPS device.It is mainly used in planning and the navigation feature in path
Realization.Digital navigation map from composition form, by road, background, annotation and information point (Point of Interest,
POI) composition, can also have a lot of specialty content certainly, and such as 3D crossing actual scene enlarged drawing and three-dimensional building thing etc. can
It is considered the characteristic part of digital navigation map.From function performance, digital navigation map need locating and displaying, index,
Path computing and the function of guiding.
Digital navigation map enters the life of people the most comprehensively.During using navigation, user opens correspondence
After APP, can by function of search or on navigation map the formal character starting point of labelling and destination, click starts
Navigation, digital navigation map is according to the selection of user, for user's intelligent planning path (showing 3 paths) the most simultaneously.Wherein,
Each paths all can show the information such as distance total length, required time, traffic lights number and congested link length.Arrival is blocked up
During section, also can be particularly shown estimated time of passing.
But, terminal, can not be in time on this congested link of user feedback when showing the information such as estimated time of passing
Congestion state situation of change, and terminal is still in consuming electricity during above-mentioned estimated time of passing showing, and takies
Internet resources, cause the wasting of resources.
Summary of the invention
The embodiment of the present application provides the processing method and processing device of a kind of congestion information, is used for improving resource utilization.
The embodiment of the present application first aspect provides the processing method of a kind of congestion information, and the method includes:
Obtaining the route planning request that terminal sends, described route planning request comprises origin and destination；
At least one programme path is generated according to described route planning request；
Obtaining the congestion information in congested section in the first programme path, described congestion information is used for indicating Congestion Level SPCC；
Described congestion information compared process according to default time interval, generate comparison result；Described comparison is tied
Fruit is for indicating the state of Congestion Level SPCC to change；
Described comparison result is fed back to described terminal.
The embodiment of the present application second aspect provides the processing means of a kind of congestion information, and this device includes:
Processing unit, for obtaining the route planning request that terminal sends, described route planning request comprises origin
And destination；
At least one programme path is generated according to described route planning request；
Obtaining the congestion information in congested section in the first programme path, described congestion information is used for indicating Congestion Level SPCC；
Described congestion information compared process according to default time interval, generate comparison result；Described comparison is tied
Fruit is for indicating the state of Congestion Level SPCC to change；
Transmit-Receive Unit, for feeding back to described terminal by described comparison result.
As can be seen from the above technical solutions, the embodiment of the present application has the advantage that by between according to the default time
In to the first programme path, the congestion information in congested section is compared process, generates for indicating the state of Congestion Level SPCC to become
The comparison result changed, and described comparison result is fed back to terminal；Terminal is energy while the information such as display estimated time of passing
Enough obtain the state situation of change of Congestion Level SPCC on congested link, thus improve the utilization rate of resource.
Accompanying drawing explanation
One organizational structure schematic diagram of the processing system of the congestion information that Fig. 1 provides for the application；
One organizational structure schematic diagram of the server that Fig. 2 provides for the application；
One schematic flow sheet of the processing method of the congestion information that Fig. 3 provides for the application；
One schematic diagram of the state change of the Congestion Level SPCC that Fig. 4 provides for the application；
Another schematic diagram of the state change of the Congestion Level SPCC that Fig. 5 provides for the application；
Another schematic diagram of the state change of the Congestion Level SPCC that Fig. 6 provides for the application；
Another schematic diagram of the state change of the Congestion Level SPCC that Fig. 7 provides for the application；
Another schematic diagram of the state change of the Congestion Level SPCC that Fig. 8 provides for the application；
Another schematic diagram of the state change of the Congestion Level SPCC that Fig. 9 provides for the application；
One organizational structure schematic diagram of the processing means of the congestion information that Figure 10 provides for the application.
Detailed description of the invention
In order to make those skilled in the art be more fully understood that the application scheme, below in conjunction with in the embodiment of the present application
Accompanying drawing, is clearly and completely described the technical scheme in the embodiment of the present application, it is clear that described embodiment is only
The embodiment of the application part rather than whole embodiments.Based on the embodiment in the application, ordinary skill people
The every other embodiment that member is obtained under not making creative work premise, all should belong to the model of the application protection
Enclose.
The (if present) such as term " first " in the description and claims of this application and above-mentioned accompanying drawing, " second "
It is for distinguishing similar object, without being used for describing specific order or precedence.Should be appreciated that the number of so use
According to exchanging in the appropriate case, in order to the embodiments described herein can with the content except here illustrating or describing with
Outer order is implemented.Additionally, term " includes " and " having " and their any deformation, it is intended that cover non-exclusive bag
Contain, such as, contain series of steps or the process of unit, method, system, product or equipment is not necessarily limited to clearly to list
Those steps or unit, but can include that the most clearly list or intrinsic for these processes, method, product or equipment
Other step or unit.
As it is shown in figure 1, be the processing system configuration diagram of congestion information in the embodiment of the present application.This system includes terminal
And server.Server refers to a management resource and provides the user the computer software of service, be generally divided into file server,
Database server and apps server.Computer or the computer system of running above software are also referred to as server.
Server needs to respond the service request that terminal sends, and processes, and the most in general server should possess the service of undertaking
And ensure the ability of service.Server includes hardware layer, and wherein, hardware layer can include multiple hardwares, such as processor (as
CPU) and internal memory, storage device (hard disk and/or internal memory can be included), it is also possible to include the equipment such as network interface card.Wherein, network interface card is work
Make the networking component in physical layer, be that LAN connects computer and the interface of transmission medium, can not only realize and LAN
Physical connection between transmission medium and signal of telecommunication coupling, the encapsulation of the transmission and reception, frame that further relate to frame is visited with opening, medium
Ask coding and decoding and the function etc. of data buffer storage of control, data.Terminal typically refers to those and centralized host computer system
" mute " subscriber equipment that (such as IBM mainframe computer) is connected.Terminal receives input through keyboard from user, and these inputs is sent out
Give host computer system.The input through keyboard of this user of host computer system processes and order, then output returns and shows at this eventually
On the screen of end.This terminal can be to include mobile phone, panel computer, PDA (Personal Digital Assistant, individual
Digital assistants), the arbitrarily terminal unit such as POS (Point of Sales, point-of-sale terminal) and vehicle-mounted computer.
Server side in Fig. 1 can be realized by the server 200 in Fig. 2, the organizational structure signal of this server 200
Figure is as in figure 2 it is shown, include processor 202 and memorizer 204, it is also possible to include bus 208 and communication interface 206.
Wherein, processor 202, memorizer 204 and communication interface 206 can by bus 208 realize each other logical
Letter connect, it is also possible to by be wirelessly transferred wait other means realize communicate.
Memorizer 204 can include volatile memory (English: volatile memory), such as random access memory
Device (English: random-access memory, abbreviation: RAM)；Memorizer 204 can also include nonvolatile memory (English
Literary composition: non-volatile memory), such as read only memory (English: read-only memory, abbreviation: ROM), flash memory
Reservoir (English: flash memory), hard disk (English: hard disk drive, abbreviation: HDD) or solid state hard disc (English:
Solid state drive, abbreviation: SSD)；Memorizer 204 can also include the combination of the memorizer of mentioned kind.Passing through
When software realizes the technical scheme that the application provides, in the processing method realizing the congestion information that the application Fig. 3 provides
The program code that server side performs preserves in memory 204, and is performed by processor 202.
Server 200 is by communication interface 206 and cloud server communication.
Processor 202 can be central processor CPU.
This processor 202 obtains the route planning request that terminal sends, and wherein, described route planning request comprises starting point
Point and destination；This processor 202 generates at least one programme path according to described route planning request；This processor 202
Obtaining the congestion information in congested section in the first programme path, wherein, described congestion information is used for indicating Congestion Level SPCC；This process
Described congestion information is compared process by device 202 according to default time interval, generates the state for indicating Congestion Level SPCC
The comparison result of change, and described comparison result is fed back to described terminal；Terminal is in information such as display estimated time of passings
The state situation of change of Congestion Level SPCC on congested link can be obtained simultaneously, thus improve the utilization rate of resource.
Optionally, this processor 202 obtains the congestion information in congested section in the first programme path, it may include:
This processor 202 obtains in the first programme path congested section in the first congested length in the first moment with second
The second congested length in moment, wherein, after being engraved in described first moment when described second；
Described congestion information is compared process by this processor 202 according to default time interval, it may include:
This processor 202 relatively described first congested length and the size of described second congested length, generate congested length
The comparison result of change.
Optionally, when described first congested length is more than described second congested length, described comparison result is congested journey
Degree increases the weight of；
When the congested length in described first moment is less than the congested length in described second moment, described comparison result is for gathering around
Plug degree is alleviated.
Optionally, this processor 202 can also include:
This processor 202 records congested time started in congested section in described first programme path and current congestion is long
Degree；The congested persistent period in described congested section is calculated according to the described congested time started；And by described current congestion length and
The described congested persistent period feeds back to described terminal.
Optionally, this processor 202 can also include:
This processor 202 generates congestion report according to the congestion information in congested section in described first programme path, and will
Described congestion report is sent to described terminal；Wherein, described congestion report is for indicating the congestion cause of congestion events.
Present invention also provides the processing method of a kind of congestion information, the server side in Fig. 1 and the server in Fig. 2
200 perform the method when running, and its schematic flow sheet is as shown in Figure 3.
402, obtaining the route planning request that terminal sends, described route planning request comprises origin and destination
Point.
Such as, user uses terminal and runs electronic navigation APP, can select in the interface of this electronic navigation APP
Beginning place and destination, this origin or destination can be that this user is arrived by the GPS functional localization of this terminal
Particular location, it is also possible to be that this user is by touching or click on the map of display, the optional position being marked in interface.Initial
Place or choosing of destination can also be by the function of search input in electronic navigation APP or the concrete positions found
Put, this origin or destination are chosen mode herein and be not construed as limiting.In selected good origin and destination also
After confirmation, this terminal to server sends the route planning request on the basis of this origin and destination.
404, at least one programme path is generated according to described route planning request.
In step 402, terminal to server sends the route planning request on the basis of this origin and destination
After, this server generates at least one programme path according to this route planning request, and this server can be according to the preference of user
Arrange (such as avoid blocking up, do not walk at a high speed and few charge etc.) be user's intelligent recommendation programme path (bar number does not limits, it is generally preferable to
It is three and recommends programme path).User can determine final route according to self-demand in the programme path recommended.
406, obtaining the congestion information in congested section in the first programme path, described congestion information is used for indicating congested journey
Degree.
In step 404, server generates at least one programme path according to described route planning request, this server meeting
The congestion information in the congested section in extraction programme path, if the most congested, does not extracts.This congestion information is used for indicating congested
Congestion Level SPCC in section；Such as, this congestion information can be that the vehicle in the congested length in congested section or congested section is close
Degree (such as the quantity of the congested vehicle in congested section).Wherein, this first programme path can be in step 404 or
A plurality of, if a plurality of, obtain the most respectively congested section in every programme path corresponding congestion information.
Optionally, in obtaining the first programme path after the congestion information in congested section, it is also possible to comprise the steps:
Record congested time started and the current congestion length in congested section in described first programme path；
The congested persistent period in described congested section is calculated according to the described congested time started；
Described current congestion length and described congested persistent period are fed back to described terminal.
It should be noted that after server generates at least one programme path according to described route planning request, for
Congested section in programme path, congested in the congested time started in this congested section of server record and current congestion section
Length (the most congested 500 meters)；This server according to the described congested time started calculate described congested section congested continue time
Between (such as the timing when congested beginning, continuing timing when congested releasing, this congested persistent period can arrive end after congested releasing
Only).Described current congestion length and described congested persistent period are fed back to described terminal by this server.Specifically can be by literary composition
The modes such as word, image, animation and sound feed back to terminal, and described current congestion length and described congested persistent period are shown by terminal
Show in the interface of electronic navigation APP.If server generates a plurality of programme path, obtain the most respectively in every programme path
Congested time started that congested section is corresponding and current congestion length, finally by the current congestion length of every programme path with gather around
The plug persistent period feeds back to described terminal.
Optionally, in obtaining the first programme path after the congestion information in congested section, it is also possible to comprise the steps:
Generating congestion report according to the congestion information in congested section in described first programme path, described congestion report is used for
The congestion cause of instruction congestion events；
Described congestion report is sent to described terminal.
It should be noted that server can (such as traffic system be broadcasted other transport services and is put down from traffic system platform
Platform) obtain the congestion information in congested section in described first programme path.Can also be by collecting what other subscriber equipmenies were uploaded
In this first programme path congested section congestion information (such as, user A finds that in the first programme path certain section blocks up,
Congested scene is uploaded to server platform) by editor's document or picture.This server is gathered around according in described first programme path
The congestion information in plug section generates congestion report, and this congestion report is (such as, congested former for the congestion cause indicating congestion events
Because accident generation, repair the roads closing or interim restricted driving etc.).
408, described congestion information compared process according to default time interval, generate comparison result.Described ratio
To result for indicating the state of Congestion Level SPCC to change.
It should be noted that server can be by contrast intervals (such as per half a minute) this first planning road
In line, the congestion information in congested section generates comparison result.Described comparison result is used for indicating the state of Congestion Level SPCC to change, because of
This, can by this comparison result judge congested be in which in stage (such as block up increasingly severe or be not changed in or
Alleviate).
Optionally, step 406 obtains the congestion information in congested section in the first programme path, it may include:
Obtain in the first programme path congested section in the first congested length in the first moment with in the second of the second moment
Congested length, wherein, after being engraved in described first moment when described second；
Described congestion information is compared process by step 408 according to default time interval, it may include:
Relatively described first congested length and the size of described second congested length, generates the comparison knot of congested length change
Really.
Optionally, when described first congested length is more than described second congested length, described comparison result is congested journey
Degree increases the weight of；
When the congested length in described first moment is less than the congested length in described second moment, described comparison result is for gathering around
Plug degree is alleviated.
Such as, as shown in Figure 4, congested road in the first moment (such as moment t1) programme path A (the first programme path)
Section is interval (such as a～b interval physical length is 500 meters) for a～b, and in server acquisition programme path A, congested section is when t1
The the first congested length (interval 500 meters of a～b) carved.As it is shown in figure 5, the second moment (such as moment t2) after instant tl
In programme path A (the first programme path), congested section is a～c is interval (such as a～c interval physical length is 800 meters), service
In device acquisition programme path A, congested section is in the first congested length (interval 800 meters of a～c) in t2 moment.This server compares institute
State the first congested length (interval 500 meters of a～b) and the size of described second congested length (interval 800 meters of a～c), generate congested
The comparison result of length change.Such as, in shown in Fig. 5, the first congested length (interval 500 meters of a～b) is less than the second congested length
(interval 800 meters of a～c), then it represents that traffic congestion scope is expanding, and Congestion Level SPCC is increasingly severe.The most such as, as shown in Figure 6,
In one moment (such as moment t1) programme path A (the first programme path), congested section is d～interval (such as d～the e interval reality of e
A length of 500 meters of border), server obtains the congested section the first congested length in the t1 moment in programme path A, and (d～e is interval
500 meters).As it is shown in fig. 7, in the second moment (such as moment t2) programme path A (the first programme path) after instant tl
Congested section is d～f is interval (such as d～f interval physical length is 300 meters), and server obtains congested section in programme path A
The first congested length (interval 300 meters of d～f) in the t2 moment.(d～e is interval for the more described first congested length of this server
500 meters) and the size of described second congested length (interval 300 meters of d～f), generate the comparison result of congested length change.Example
As, during Fig. 7 is shown, the first congested length (interval 500 meters of d～e) is more than the second congested length (interval 300 meters of d～f), then it represents that
Traffic congestion scope is reducing, and Congestion Level SPCC is being alleviated.
Wherein, the time interval that described congestion information is compared by server can set according to practical situation, such as
The time interval in t1 moment and t2 moment is 15 seconds or 30 seconds etc..
410, described comparison result is fed back to described terminal.
The comparison result being used for indicating the state of Congestion Level SPCC to change is fed back to terminal by server, and terminal can be by this ratio
Result is shown in the user interface to inform user.For example, it is possible to fed back by modes such as word, image, animation and sound
To terminal.Such as, as shown in Figure 8, in the electronic navigation APP user interface of this terminal, demonstrate that programme path A is in the t2 moment
Information interval for congested section a～c: as congestion state is increasingly severe, the congested persistent period is 30 minutes, congested a length of
2.3 kilometers, congestion cause is vehicle accident；Fig. 8 is being expanded by the congested scope that indicates that contrary arrow is vivider.
The most such as, as it is shown in figure 9, demonstrate congested in the t2 moment of programme path A in the electronic navigation APP user interface of this terminal
The information that section d～f is interval: if congestion state is in alleviation, the congested persistent period is 20 minutes, congested a length of 1.3 kilometers,
Congestion cause is road construction.Fig. 9 is being reduced by the congested scope that indicates that arrow in opposite directions is vivider.User passes through
The information of this interface display, can understand the congestion state situation of change on congested section in time, thus select reasonably planning
Route is gone on a journey.
In the embodiment of the present application, by according to the default time interval congested letter to section congested in the first programme path
Cease process of comparing, generate the comparison result for indicating the state of Congestion Level SPCC to change, and described comparison result is fed back
To terminal；Terminal can obtain the state change of Congestion Level SPCC on congested link while the information such as display estimated time of passing
Situation, thus improve the utilization rate of resource.
With a concrete application scenarios, the processing method of the congestion information that the application provides is illustrated below.
User runs the electronic navigation APP installed on mobile phone, can select starting point in the interface of this electronic navigation APP
Point and destination, after confirming to submit to, origin and destination that server is submitted to according to user are user's intelligent recommendation
A plurality of programme path, such as route A, route B and route C, and anticipated used time, distance to route A, route B and route C respectively
The congested length in the congested section in overall length and each route carries out statistical computation, and calculated result is shown to this APP's
In user interface, to inform user.Simultaneously server according to default time interval (the most every 30 seconds) respectively to route A, road
In line B and route C, the congested length in congested section is added up.It is assumed that in 9: 30 timesharing, respectively to route A, route B and road
The result that in line C, the congested length in congested section carries out adding up is 500 meters, 600 meters and 500 meters.When 9: 30: 30, point
The other result adding up the congested length in congested section in route A, route B and route C is 500 meters, 700 meters and 400 meters,
From statistics result it can be seen that route A congested link congested length in 30 seconds do not change, Congestion Level SPCC is without bright
Aobvious change；In route B, congested link congested length in 30 seconds is become 700 meters from 600 meters, and Congestion Level SPCC increases the weight of；Route C gathers around
Stifled section congested length in 30 seconds is become 400 meters from 500 meters, and Congestion Level SPCC is alleviated.On the other hand, server can also be according to
The traffic density in congested section in route A, route B and route C is united by time interval (the most every 30 seconds) respectively that preset
Meter also can reach equal effect.Such as, in 9: 30 timesharing, respectively to the car in congested section in route A, route B and route C
The result that quantity carries out adding up is 20,30 and 50.When 9: 30: 30, respectively to route A, route B and route
The result that in C, the vehicle fleet size in congested section carries out adding up is 20,50 and 40, from the result of statistics it can be seen that road
In line A, congested link vehicle fleet size in 30 seconds does not change, and Congestion Level SPCC is without significant change；Congested link in route B
In 30 seconds, vehicle fleet size is become 50 from 30, and Congestion Level SPCC increases the weight of；In route C congested link in 30 seconds vehicle fleet size by
50 become 40, and Congestion Level SPCC is alleviated.Wherein, user while switching route A, route B and route C, Congestion Level SPCC
State change is also displayed on the information interface that each route is corresponding；Or user can by the interactive operation of setting (such as
Long by congested section) check congested details.Above, user can understand the change of the congestion state on each route in time
Situation, thus select rational programme path to go on a journey.
The embodiment of the present application additionally provides the processing means 600 of congestion information, and the processing means 600 of this congestion information is permissible
Realized by the server 200 shown in Fig. 2, it is also possible to (English: application-specific by special IC
Integrated circuit, abbreviation: ASIC) realize, or PLD is (English: programmable logic
Device, abbreviation: PLD) realize.Above-mentioned PLD can be that CPLD is (English: complex
Programmable logic device, abbreviation: CPLD), FPGA, GAL is (English: generic array
Logic, GAL) or its combination in any abbreviation:.The processing means 600 of this congestion information is for realizing the congestion information shown in Fig. 3
Processing method in server side perform method.When being realized the processing method of the congestion information shown in Fig. 3 by software, this is gathered around
The processing means 600 of plug information can also be software module.
The organizational structure schematic diagram of the processing means 600 of congestion information as shown in Figure 10, including: processing unit 602 with receive
Bill unit 604.
When processing unit 602 works, execution following steps:
Obtaining the route planning request that terminal sends, described route planning request comprises origin and destination；
At least one programme path is generated according to described route planning request；
Obtaining the congestion information in congested section in the first programme path, described congestion information is used for indicating Congestion Level SPCC；
Described congestion information compared process according to default time interval, generate comparison result；Described comparison is tied
Fruit is for indicating the state of Congestion Level SPCC to change.
When Transmit-Receive Unit 604 works, execution following steps:
Described comparison result is fed back to described terminal.
In the embodiment of the present application, processing unit 602 according to default time interval to section congested in the first programme path
Congestion information compare process, generate the comparison result for indicating the state of Congestion Level SPCC change, Transmit-Receive Unit 604 general
Described comparison result feeds back to terminal；Terminal can obtain on congested link while the information such as display estimated time of passing and gather around
The state situation of change of plug degree, thus improve the utilization rate of resource.
Optionally, described processing unit 602 obtains the congestion information in congested section in the first programme path, it may include: obtain
Take the congested section the first congested length in the first moment and the second congested length in the second moment in the first programme path, its
In, after being engraved in described first moment when described second；
Described congestion information is compared process by described processing unit 602 according to default time interval, it may include: ratio
More described first congested length and the size of described second congested length, generate the comparison result of congested length change.
Optionally, when described first congested length is more than described second congested length, described comparison result is congested journey
Degree increases the weight of；
When the congested length in described first moment is less than the congested length in described second moment, described comparison result is for gathering around
Plug degree is alleviated.
Optionally, described processing unit 602 also executes the following steps:
Record congested time started and the current congestion length in congested section in described first programme path；
The congested persistent period in described congested section is calculated according to the described congested time started.
Described Transmit-Receive Unit 604 also executes the following steps:
Described current congestion length and described congested persistent period are fed back to described terminal.
Optionally, described processing unit 602 also executes the following steps:
Generating congestion report according to the congestion information in congested section in described first programme path, described congestion report is used for
The congestion cause of instruction congestion events.
Described Transmit-Receive Unit 604 also executes the following steps:
Described congestion report is sent to described terminal.
The associated description of said apparatus can the corresponding associated description refering to embodiment of the method part and effect understand,
This place does not do and too much repeats.
Those skilled in the art is it can be understood that arrive, for convenience and simplicity of description, and the system of foregoing description,
The specific works process of device and unit, is referred to the corresponding process in preceding method embodiment, does not repeats them here.
In several embodiments provided herein, it should be understood that disclosed system, apparatus and method are permissible
Realize by another way.Such as, device embodiment described above is only schematically, such as, and described unit
Dividing, be only a kind of logic function and divide, actual can have other dividing mode, the most multiple unit or assembly when realizing
Can in conjunction with or be desirably integrated into another system, or some features can be ignored, or does not performs.Another point, shown or
The coupling each other discussed or direct-coupling or communication connection can be the indirect couplings by some interfaces, device or unit
Close or communication connection, can be electrical, machinery or other form.
The described unit illustrated as separating component can be or may not be physically separate, shows as unit
The parts shown can be or may not be physical location, i.e. may be located at a place, or can also be distributed to multiple
On NE.Some or all of unit therein can be selected according to the actual needs to realize the mesh of the present embodiment scheme
's.
It addition, each functional unit in each embodiment of the application can be integrated in a processing unit, it is also possible to
It is that unit is individually physically present, it is also possible to two or more unit are integrated in a unit.Above-mentioned integrated list
Unit both can realize to use the form of hardware, it would however also be possible to employ the form of SFU software functional unit realizes.
If described integrated unit realizes and as independent production marketing or use using the form of SFU software functional unit
Time, can be stored in a computer read/write memory medium.Based on such understanding, the technical scheme of the application is substantially
The part that in other words prior art contributed or this technical scheme completely or partially can be with the form of software product
Embodying, this computer software product is stored in a storage medium, including some instructions with so that a computer
Equipment (can be personal computer, server, or the network equipment etc.) performs the complete of method described in each embodiment of the application
Portion or part steps.And aforesaid storage medium includes: USB flash disk, portable hard drive, read only memory (ROM, Read-Only
Memory), random access memory (RAM, Random Access Memory), magnetic disc or CD etc. are various can store journey
The medium of sequence code.
The above, above example only in order to the technical scheme of the application to be described, is not intended to limit；Although with reference to front
State embodiment the application has been described in detail, it will be understood by those within the art that: it still can be to front
State the technical scheme described in each embodiment to modify, or wherein portion of techniques feature is carried out equivalent；And these
Amendment or replacement, do not make the essence of appropriate technical solution depart from the spirit and scope of the application each embodiment technical scheme.
Claims (10)
1. the processing method of a congestion information, it is characterised in that including:
Obtaining the route planning request that terminal sends, described route planning request comprises origin and destination；
At least one programme path is generated according to described route planning request；
Obtaining the congestion information in congested section in the first programme path, described congestion information is used for indicating Congestion Level SPCC；
Described congestion information compared process according to default time interval, generate comparison result；Described comparison result is used
State change in instruction Congestion Level SPCC；
Described comparison result is fed back to described terminal.
Method the most according to claim 1, it is characterised in that
The congestion information in congested section in described acquisition the first programme path, including:
Obtain the first congested length in the first moment of congested section in the first programme path and second congested in the second moment
Length, wherein, after being engraved in described first moment when described second；
Described process of described congestion information being compared according to default time interval, including:
Relatively described first congested length and the size of described second congested length, generates the comparison result of congested length change.
Method the most according to claim 2, it is characterised in that
When described first congested length is more than described second congested length, described comparison result is that Congestion Level SPCC increases the weight of；
When the congested length in described first moment is less than the congested length in described second moment, described comparison result is congested journey
Degree is alleviated.
4. according to the method described in any one of claims 1 to 3, it is characterised in that described method also includes:
Record congested time started and the current congestion length in congested section in described first programme path；
The congested persistent period in described congested section is calculated according to the described congested time started；
Described current congestion length and described congested persistent period are fed back to described terminal.
5. according to the method described in any one of claims 1 to 3, it is characterised in that described method also includes:
Generating congestion report according to the congestion information in congested section in described first programme path, described congestion report is used for indicating
The congestion cause of congestion events；
Described congestion report is sent to described terminal.
6. the processing means of a congestion information, it is characterised in that including:
Processing unit, for obtaining the route planning request that terminal sends, described route planning request comprises origin and mesh
Place；
At least one programme path is generated according to described route planning request；
Obtaining the congestion information in congested section in the first programme path, described congestion information is used for indicating Congestion Level SPCC；
Described congestion information compared process according to default time interval, generate comparison result；Described comparison result is used
State change in instruction Congestion Level SPCC；
Transmit-Receive Unit, for feeding back to described terminal by described comparison result.
Device the most according to claim 6, it is characterised in that
Described processing unit is the congestion information in congested section in acquisition the first programme path, including:
Described processing unit, for obtaining congested section in the first programme path in the first congested length in the first moment with the
The second congested length in two moment, wherein, after being engraved in described first moment when described second；
Described processing unit for described congestion information being compared process according to default time interval, including:
Described processing unit, for relatively described first congested length and the size of described second congested length, generates congested length
The comparison result of degree change.
Device the most according to claim 7, it is characterised in that
When described first congested length is more than described second congested length, described comparison result is that Congestion Level SPCC increases the weight of；
When the congested length in described first moment is less than the congested length in described second moment, described comparison result is congested journey
Degree is alleviated.
9. according to the device described in any one of claim 6 to 8, it is characterised in that
Described processing unit, is additionally operable to record congested time started and the current congestion in congested section in described first programme path
Length；
The congested persistent period in described congested section is calculated according to the described congested time started；
Described Transmit-Receive Unit, is additionally operable to described current congestion length and described congested persistent period are fed back to described terminal.
10. according to the device described in any one of claim 6 to 8, it is characterised in that
Described processing unit, is additionally operable to generate congestion report according to the congestion information in congested section in described first programme path,
Described congestion report is for indicating the congestion cause of congestion events；
Described Transmit-Receive Unit, is additionally operable to described congestion report is sent to described terminal.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610324042.XA CN106052709A (en) | 2016-05-16 | 2016-05-16 | Congestion information processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610324042.XA CN106052709A (en) | 2016-05-16 | 2016-05-16 | Congestion information processing method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106052709A true CN106052709A (en) | 2016-10-26 |
Family
ID=57176339
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610324042.XA Pending CN106052709A (en) | 2016-05-16 | 2016-05-16 | Congestion information processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106052709A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107451690A (en) * | 2017-07-28 | 2017-12-08 | 深圳市益鑫智能科技有限公司 | A kind of intelligent route planning system |
| WO2022089162A1 (en) * | 2020-10-30 | 2022-05-05 | 腾讯科技（深圳）有限公司 | Path display method and related apparatus |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1637382A (en) * | 2003-12-26 | 2005-07-13 | 爱信艾达株式会社 | Methods of displaying predicted traffic information and navigation apparatus |
| CN101141406A (en) * | 2007-10-17 | 2008-03-12 | 杭州华三通信技术有限公司 | Distributed flow control method, system and device |
| CN101311983A (en) * | 2007-05-25 | 2008-11-26 | 株式会社电装 | Congestion information display device |
| CN102272807A (en) * | 2009-01-28 | 2011-12-07 | 爱信艾达株式会社 | Navigation device, probe information transmission method, computer-readable storage medium that storing probe information transmission program, and traffic information generation device |
| CN102346042A (en) * | 2011-03-31 | 2012-02-08 | 北京腾瑞万里信息技术有限公司 | Real time road condition based route planning method and service equipment thereof |
| JP2012127976A (en) * | 2012-03-22 | 2012-07-05 | Pioneer Electronic Corp | Route information display apparatus, route information display method, and route information display program |
| CN103245347A (en) * | 2012-02-13 | 2013-08-14 | 腾讯科技（深圳）有限公司 | Intelligent navigation method and system based on road condition prediction |
| CN103674045A (en) * | 2012-09-07 | 2014-03-26 | 罗克&阿尔株式会社 | Communication-based navigation system searching route by sensing traffic volume change |
| CN104123833A (en) * | 2013-04-25 | 2014-10-29 | 北京搜狗信息服务有限公司 | Road condition planning method and device thereof |
| CN104755306A (en) * | 2012-07-11 | 2015-07-01 | 罗伯特·博世有限公司 | Method for operating a driver assistance system for a vehicle and a driver assistance system for a vehicle |
| CN104848871A (en) * | 2015-06-09 | 2015-08-19 | 刘光明 | Map having traffic condition change trend, and drive route |
| CN105074387A (en) * | 2013-03-29 | 2015-11-18 | 爱信艾达株式会社 | Travel support system, travel support method, and computer program |
| CN105466443A (en) * | 2015-12-24 | 2016-04-06 | 魅族科技（中国）有限公司 | Navigation method and terminal |
| CN105489043A (en) * | 2015-11-30 | 2016-04-13 | 华南理工大学 | Real-time path planning method based on vehicular ad-hoc network |
-
2016
- 2016-05-16 CN CN201610324042.XA patent/CN106052709A/en active Pending
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1637382A (en) * | 2003-12-26 | 2005-07-13 | 爱信艾达株式会社 | Methods of displaying predicted traffic information and navigation apparatus |
| CN101311983A (en) * | 2007-05-25 | 2008-11-26 | 株式会社电装 | Congestion information display device |
| CN101141406A (en) * | 2007-10-17 | 2008-03-12 | 杭州华三通信技术有限公司 | Distributed flow control method, system and device |
| CN102272807A (en) * | 2009-01-28 | 2011-12-07 | 爱信艾达株式会社 | Navigation device, probe information transmission method, computer-readable storage medium that storing probe information transmission program, and traffic information generation device |
| CN102346042A (en) * | 2011-03-31 | 2012-02-08 | 北京腾瑞万里信息技术有限公司 | Real time road condition based route planning method and service equipment thereof |
| CN103245347A (en) * | 2012-02-13 | 2013-08-14 | 腾讯科技（深圳）有限公司 | Intelligent navigation method and system based on road condition prediction |
| JP2012127976A (en) * | 2012-03-22 | 2012-07-05 | Pioneer Electronic Corp | Route information display apparatus, route information display method, and route information display program |
| CN104755306A (en) * | 2012-07-11 | 2015-07-01 | 罗伯特·博世有限公司 | Method for operating a driver assistance system for a vehicle and a driver assistance system for a vehicle |
| CN103674045A (en) * | 2012-09-07 | 2014-03-26 | 罗克&阿尔株式会社 | Communication-based navigation system searching route by sensing traffic volume change |
| CN105074387A (en) * | 2013-03-29 | 2015-11-18 | 爱信艾达株式会社 | Travel support system, travel support method, and computer program |
| CN104123833A (en) * | 2013-04-25 | 2014-10-29 | 北京搜狗信息服务有限公司 | Road condition planning method and device thereof |
| CN104848871A (en) * | 2015-06-09 | 2015-08-19 | 刘光明 | Map having traffic condition change trend, and drive route |
| CN105489043A (en) * | 2015-11-30 | 2016-04-13 | 华南理工大学 | Real-time path planning method based on vehicular ad-hoc network |
| CN105466443A (en) * | 2015-12-24 | 2016-04-06 | 魅族科技（中国）有限公司 | Navigation method and terminal |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107451690A (en) * | 2017-07-28 | 2017-12-08 | 深圳市益鑫智能科技有限公司 | A kind of intelligent route planning system |
| WO2022089162A1 (en) * | 2020-10-30 | 2022-05-05 | 腾讯科技（深圳）有限公司 | Path display method and related apparatus |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108053673A (en) | A kind of road conditions forecasting procedure, storage medium and server | |
| Guo et al. | Ecosky: Reducing vehicular environmental impact through eco-routing | |
| CN109754594A (en) | A kind of road condition information acquisition method and its equipment, storage medium, terminal | |
| CN110375760A (en) | Route determination method, apparatus, equipment and medium | |
| CN105825699B (en) | Road conditions display methods and device | |
| CN106170826A (en) | The monitoring method and system of cab-getter's number | |
| CN103412910A (en) | Methods and devices for building tag library and searching users | |
| CN105760950B (en) | There is provided or obtain the method, apparatus and forecasting system of prediction result | |
| CN104200696A (en) | Traffic information pushing method and device | |
| CN107798403A (en) | A kind of share-car order processing method, server, terminal device and system | |
| CN104391869A (en) | Electronic map data updating method and device | |
| CN108288201A (en) | The method and device of stroke expense bill is provided in net about vehicle system for target user | |
| CN109859505A (en) | Early warning processing method, device, server and medium for high-speed station | |
| CN106126519A (en) | The methods of exhibiting of media information and server | |
| Liebenau et al. | The UK's digital road to recovery | |
| CN106052709A (en) | Congestion information processing method and device | |
| CN113805827B (en) | Screen projection display method and device, electronic equipment and storage medium | |
| CN110083666B (en) | Server device, information collection system, information collection method, and recording medium | |
| CN107948290A (en) | A kind of share-car information issuing method and server | |
| CN114676911A (en) | Method and device for determining driving route of transport vehicle | |
| CN108663062B (en) | Path planning method and system | |
| US20130338981A1 (en) | Efficient evaluation of network robustness with a graph | |
| CN113312529A (en) | Data visualization method and device, computer equipment and storage medium | |
| CN115080388B (en) | Automatic driving system-oriented simulation test scene generation method | |
| CN114640619B (en) | Space-based network topology design method based on average communication distance and related equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20161026 |