CN106197455B - A kind of real-time dynamic multipath mouth path navigation quantum searching method of urban road network - Google Patents
A kind of real-time dynamic multipath mouth path navigation quantum searching method of urban road network Download PDFInfo
- Publication number
- CN106197455B CN106197455B CN201610605008.XA CN201610605008A CN106197455B CN 106197455 B CN106197455 B CN 106197455B CN 201610605008 A CN201610605008 A CN 201610605008A CN 106197455 B CN106197455 B CN 106197455B
- Authority
- CN
- China
- Prior art keywords
- value
- path
- quantum
- state
- path navigation
- 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
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/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Navigation (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a kind of real-time dynamic multipath mouth path navigation quantum searching methods of urban road network, the value at cost for the generation that influences each other when the preference value of route influence generation and vehicle operation is combined using road itself and forms comprehensive assessment index value of utility, the quality of path navigation scheme is assessed using the size of value of utility, and using the value of utility of all path navigation schemes of quantum calculation parallel computation, go out satisfactory path navigation scheme using quantum searching effective search.The present invention has fully considered the various factors for influencing the coast is clear, and quantify finally integration to the influence degree of traffic by various factors and obtain value of utility, uses the quality of value of utility accurate judgement path navigation scheme.Introduce quantum calculation and quantum searching simultaneously so that the result of calculation of value of utility can be obtained in real time, and thus obtain suitable path navigation scheme, under the premise of meeting each driver's individual interest so that the traffic congestion of entire city road network is obviously improved.
Description
Technical field
The invention belongs to computer science and intelligent transportation system technical field, and in particular to a kind of urban road network is real
When dynamic multipath mouth path navigation quantum searching method.
Background technology
The increasingly congestion of big and medium-sized cities traffic network, the time cost generated by congestion, management cost and economic cost are more next
Bigger, traffic congestion increases the resident trip time, affects the working efficiency and quality of life of people, constrains city hair
Exhibition, increases energy consumption and exhaust emissions, exacerbates environmental pollution, and the congestion problems for solving urban road network benefit the nation profit
The people.However urban road network pattern has been difficult to change, path resource is limited, efficient path navigation and rational path resource
Distribution becomes the main path for solving city road network congestion.
Path navigation can be divided into static path navigation and dynamic route navigation, and static path navigation is referred to physically
The reason conditions such as information and traffic rules are to constrain to seek shortest path, and dynamic route navigation is on the basis that static path navigates
On, in due course adjustment is carried out to the optimal traffic route planned in advance until arriving at most in conjunction with real-time traffic information
Optimal path is obtained eventually.Currently, the ripe path guiding system for the application that puts goods on the market is mostly based on static path navigation, mainly
There are dijkstra's algorithm, Lee algorithms, Floyd algorithms, blind search, A* heuritic approaches etc., however in face of there are numerous shakinesses
Determine the traffic reality of factor, user is simultaneously not content with existing system.Although static path navigation can be quickly found individually
The optimal path of vehicle, but due to coordinating to be difficult to avoid the congestion of road part and other Local resources relatively not busy between shortage vehicle
When setting, and traffic accident and traffic jam occurs, static path navigation cannot change route in time according to traffic information in real time.
Therefore it is most important to alleviating road traffic congestion to provide dynamic path navigation in real time for vehicle.Vehicle dynamic path navigation base
Future traffic flow is predicted in history, current traffic information data, and for adjusting and updating best row in time
Bus or train route line, to effectively reduce, a passage is blocked up and traffic accident.The importance of traffic forecast gradually highlights in dynamic route navigation,
More and more researchers' application kalman filter methods, Time Series Method, neural network, Markov predictions and ash
Color prediction theory etc. has made intensive studies traffic information predicting.Although with flourishing for network, reality is provided for vehicle
When path navigation information be not difficult to accomplish, but simple dynamic realtime prediction flow model limits the accurate of real-time prediction model
Property, cause the processing capacity to real-time traffic emergency poor, and complicated dynamic realtime prediction model Consideration is many
More, computation complexity exponentially increases with road network scale increase, therefore current still immature, the Duo Shuoting of dynamic route navigation
Stay in theory stage.The accuracy of dynamic realtime prediction model and the contradiction of complexity limit the development of dynamic route navigation.
Invention content
In order to solve the above technical problem, the present invention provides a kind of urban road network real-time dynamic multipath mouth paths to lead
Boat quantum searching method assesses path navigation side by considering the various factors of influence traffic and quantifying these factors with this
Case obtains the navigation scheme that traffic congestion can be effectively relieved, and urban road network path resource utilization rate is maximized.
The technical solution adopted in the present invention is：A kind of real-time dynamic multipath mouth path navigation quantum of urban road network is searched
True road network is mapped to illustraton of model R (B, E) by Suo Fangfa, and wherein B indicates junction node set, Bi(i=1,2 ..., r) table
Show that single junction node, r are total crossing numbers, E indicates the section set with direction；Assuming that having n vehicle, either car in the road network
W has current starting point PsWith destination terminal Pd, then certain feasible path of the vehicle be expressed as with continuous adjacent junction node
{Ps,...,Pi,...,Pd}；Each car selects a feasible path, the driving path of all vehicles to form a feasible path collection
Close FPSn, i.e. a path navigation scheme；
It is characterized in that, the described method comprises the following steps：
Step 1：According to vehicle number n, the optional path of terminal information and each car, initialization vehicle collection { v1,v2,...,
vnAnd optional path collectionWherein viIndicate i-th vehicle,Indicate an optional path of i-th vehicle；
Step 2：To vehicle and its optional path 0,1 ..., biProgress quantum coding | 0>,|1>,...,|2n×h-1>,
Determine that quantum state can completely represent all path navigation schemes；Wherein biIndicate the optional path number of i-th vehicle, h expressions pair
The minimum number of bits that optional path coding needs；
Step 3：The independent multiplication factor α of each influence factor is determined according to traffic informationi,βj, determine that value of utility calculates function
U(x)；Wherein each path navigation scheme corresponds to independent variable x values；
Step 4：Prepare the equal power superposition state of path navigation scheme | x>, calculate the corresponding effectiveness of each path navigation scheme x
Value | U (x) |, obtain effectiveness value function waits power superposition state | U (x)>；
Step 5：The empirical value k for determining value of utility, to the equal power superposition state of effectiveness value function | U (x)>Quantum searching is carried out,
Search out the value of utility met the requirements | Us>；
Step 6：Export the value of utility U met the requirementssAnd corresponding path navigation scheme, path is carried out to each car and is led
Boat.
Preferably, effectiveness value function U (x) described in step 3 is：
U (x)=Fr (x) × (α 1 × Rs (x)+α 2 × Sl (x)+α 3 × Ls (x)+α 4 × Os (x) 5 × Fd of+α (x))-(β 1
×Ta(x)+β2×Tc(x)+β3×De(x)+β4×Oc(x)+β5×Tl(x))
Wherein Fr (x) indicates whether section can be arrived at, and takes 1 expression reachable, takes 0 expression unreachable；Rs (x) indicates section shape
Condition, value [0,1]；Sl (x) indicates rate limitation, value [0,1]；Ls (x) indicates section illuminating position, value [0,1]；Os
(x) indicate driver to the obedient extent of system recommendation, value [0,1]；Fd (x) indicates driver to the familiarity in section, value
[0,1]；Ta (x) indicates that the road that traffic accident or temporary control of burst etc. are brought influences, value [0,1]；Tc (x) indicates institute
The time cost that routing diameter expends, value [0, ∞]；De (x) indicate that selected path expends apart from cost, value [0, ∞]；Oc
(x) the oil mass cost that selected path is expended, value [0, ∞] are indicated；Tl (x) indicates the influence of traffic lights, value [0,1]；αi(i
=1,2 ..., 5), βi(i=1,2 ..., 5) the corresponding independent multiplication factor of each influence factor is indicated respectively.
Preferably, the specific implementation of step 4 includes following sub-step：
Step 4.1：The power superposition state such as quantum of initial argument's path navigation scheme is prepared using Hadamard gateWherein N indicates quantum state sum；
Step 4.2：The corresponding unitary transformation circuit U of design functionU(x)And it can be used for the auxiliary quantum for realizing that function calculates
Bit | z>；
Step 4.3：Input path navigation scheme waits power superposition state, parallel computation function U (x)：
Step 4.4：Obtain the equal power superposition state of effectiveness value function | U (x)>.
Preferably, the specific implementation of step 5 includes following sub-step：
Step 5.1：It provides and instructs function f (y) for determine target state, and corresponding quantum wire is set；
The equal power superposition state of effectiveness value function | U (x)>After instructing criteria function, the state that functional value f (x) is 1 is
Target state；
Step 5.2：Target state is added up, obtain target state number m and calculates aggreggate utility value target state | Ua>；
Wherein, aiIndicate target state, | ai>Indicate the quantum form of target state；
Step 5.3：According to | Ua>It determines and instructs inquiry O, determine that O is converted；
O=I-2 | Ua><Ua|；
Wherein I is indicated and | Ua>The identical equal power superposition state of quantum digit,<Ua| indicate | Ua>Conjugate vector；
Step 5.4：Superposition state is weighed according to equalDetermine that D is converted；
Wherein,It is the equal power superposition state of all basic status,H indicates Hadamard transformation, for making
It is standby to wait power superposition state,Indicate that preparing n × h wait weighs superposition state；N indicates quantum state sum, | i>Indicate i-th of quantum
State；
Step 5.5：Determine that a G converts G=DO by O transformation and D transformation；
Step 5.6：To the equal power superposition state of effectiveness value function | U (x)>It carries outSecondary G transformation, round tables
Show immediate integer；
Step 5.7：Observe the value of utility state of output | Uout>And corresponding path navigation scheme | xout>, within the time limit
Search out the value of utility met the requirements | Us>；
Step 5.8：Export value of utility state | Us>Corresponding path navigation scheme xsIn the guidance path chosen for each car.
Preferably, the specific implementation of step 5.7 includes following sub-step：
Step 5.7.1：Output after the completion of being converted to G is observed, and obtains value of utility UoutWith current search used time
ts；
Step 5.7.2：If ts<tmax, then following step 5.7.3, wherein t are executedmaxExpression can guarantee path navigation reality
The maximum navigation time interval of when property；Otherwise, following step 5.7.5 is executed；
Step 5.7.3：If Uout<K, then ts=ts+tc, and turn round and execute the step 5.7.2, wherein tcIt indicates to execute
RGQS methods required time；Otherwise, following step 5.7.4 is executed；
Step 5.7.4：If fruit Uout<km, then k=Uout, ts=ts+tc, and turn round and execute the step 5.7.2, wherein km
Indicate the ideal value of utility rule of thumb set；Otherwise, following step 5.7.5 is executed；
Step 5.7.5：Us=Uout, export Us。
The present invention constructs the real-time dynamic multipath mouth traffic model of a urban road network, by the various of urban transportation
Influence factor is integrated into the quality that value of utility is used for assessing path navigation scheme；It introduces quantum calculation and quantum searching solves effectiveness
The real-time calculating of value and search problem can carry out after initial road conditions determine with algorithm provided by the invention in real time
It calculates and search obtains suitable value of utility and corresponding suitable path navigation scheme, provide path for all vehicles and lead
Boat so that the traffic in entire city is effectively relieved and urban highway traffic resource utilization is maximized.
Description of the drawings
Fig. 1 is the true road network and model mapping graph of the embodiment of the present invention.
Fig. 2 is the RGQS method flow diagrams of the embodiment of the present invention.
Fig. 3 is the UVCQC algorithm flow charts of the embodiment of the present invention.
Fig. 4 is the UVCQC algorithm quantum parallelism calculating process schematic diagrames of the embodiment of the present invention.
Fig. 5 is the RNUQS algorithm schematic diagrames of the embodiment of the present invention.
Fig. 6 be the embodiment of the present invention RNUQS algorithms in G transformation andThe geometric representation of secondary G transformation.
Specific implementation mode
Understand for the ease of those of ordinary skill in the art and implement the present invention, with reference to the accompanying drawings and embodiments to this hair
It is bright to be described in further detail, it should be understood that implementation example described herein is merely to illustrate and explain the present invention, not
For limiting the present invention.
In order to which traffic congestion is effectively relieved, while real-time path navigation is provided for driving vehicle, the present invention proposes a kind of
The real-time dynamic multipath mouth path navigation quantum searching method of urban road network.This method be directed to city road network in Multiple Intersections it is big
The calculating that vehicle carries out path value of utility is measured, factor needed to be considered is very more, includes not only objective attribute of the driver to road
And subjective preferences, it is also necessary in view of the accident etc. being likely to occur on the corresponding Expenses Cost of route selection and road
Uncertain factor.Influence factor and path navigation scheme calculate and search in real time using quantum calculation and quantum searching,
It obtains suitable value of utility and corresponding path navigation scheme realizes entire city while meeting driving vehicle individual interests
The maximization of city's road network path resource utilization rate.
True road network (such as Fig. 1 (a)) is mapped to illustraton of model R (B, E) (such as Fig. 1 (b)) by the present invention, and B is node, and E is section
Vector arrows with direction between point, the figure that R is made of B and E.Crossing in Fig. 1 (a) is mapped as the node in Fig. 1 (b) successively
B1,B2,...,B12, the section in Fig. 1 (a) is mapped as vector arrows of the Fig. 1 (b) with direction, and the true road network in Fig. 1 (a) reflects
It penetrates as the figure R in Fig. 1 (b).Each node B indicates a crossing in Fig. 1 (a), node Bi(i=1,2 ..., r) indicate i-th
A crossing, wherein r are total crossing numbers, and each vector arrows E indicates a section.Assuming that having n vehicle, either car in the road network
W has current starting point PsWith destination terminal Pd, then certain feasible path of the vehicle can be expressed as with continuous adjacent crossing
{Ps,...,Pi,...,Pd}.Each car selects a feasible path, the driving path of all vehicles to form a feasible path collection
Close FPSn, i.e. a path navigation scheme.Since vehicle number and each car feasible path number are very much, therefore path navigation scheme
Enormous amount, problem to be solved of the present invention can be converted into search optimal path, that is, find out best FPSn.True
Road network in constantly change due to road conditions, the search process of path navigation scheme must be in certain period of time in real time more
Newly, it just can guarantee the validity of path navigation scheme, it is therefore necessary to which guarantee searches out optimal path and real within the limited time
When update.
The present invention evaluates the quality of path navigation scheme with value of utility U, and there are many factors for influencing value of utility size, both wrapped
Include constant, such as number of track-lines, section rate limitation, traffic lights duration, driver be to recommending the obedient extent of navigation scheme,
It is integrated into including continually changing factor at any time, such as the distance of optional path, time-consuming, road conditions, the constant factor present invention
The factor of preference value P, variation are integrated into value at cost C, shown in the calculation formula such as formula (1) of value of utility.
U=P-C (1)
Value of utility U is the important indicator for evaluating path navigation scheme quality, i.e., when path navigation scheme determines, U values
It is to determine, and U values are bigger, path navigation scheme is better.To be known by formula (1), U values depend on preference value P and value at cost C,
The influence factor of preference value is as shown in table 1, and the influence factor of value at cost is as shown in table 2, when path navigation scheme determines, U values
It is determined by the factor in Tables 1 and 2.
The influence factor and parameter definition of 1 preference value P of table
The influence factor and parameter definition of 2 value at cost C of table
Various factors is different the influence degree of value of utility U in Tables 1 and 2, therefore during calculating U values,
Each factor will assign corresponding weights according to city size and path navigation target.The factor of being to determine property of preference value P, table 1
Defining influences the factor of preference value, after any vehicle determines starting point and destination, what preference value was to determine.As a result, certain
Shown in the preference value P calculation formula in section such as formula (2).
P=Fr × (5 × Fd of α 1 × Rs+ α 2 × Sl+ α 3 × Ls+ α 4 × Os+ α) (2)
Wherein αi(i=1,2 ..., be 5) the corresponding independent multiplication factor of each influence factor respectively, value is advised with city
Mould, the setting of decision objective are related, and multiplication factor numerical value is bigger, and the factor is more important, and the influence to value of utility U is bigger, same
In one traffic network, what all factor values were to determine.In any bar optional path, the preference value in each section is cumulative to be
The preference value in the path, preference value is bigger, indicates that the path is more excellent.
For every road, what the size of preference value P was to determine, the size of value at cost C not only with the path of selection
Itself is related, it is also contemplated that influencing each other between vehicle, table 2 defines the influence factor of value at cost.It is determined in a vehicle
After path, the value of Ta, De and Tl can be calculated accordingly, but oil mass cost Oc is by time cost Tc, distance costs De and row
Speed synthesis is sailed to determine, and the value of time cost Tc is not readily available and calculates, since the time of cost is not only by path length
Degree influences, and also the congestion level in the sections path Zhong Ge influences, and the congestion coefficient of vehicle number and road on section has directly
Relationship, the congestion coefficient of road and the average overall travel speed of road are in inverse correlation.For some specific section, can pass through
The number of vehicles being currently running estimates the average overall travel speed by the section, and the present invention is indicated with traffic congestion coefficient gamma
The congestion on road, average overall travel speed of the vehicle on road and traffic congestion coefficient are closely bound up, section actual vehicle number
For n, threshold capacity is H, and congestion capacity is L, then shown in the calculating of congestion coefficient gamma such as formula (3).
After time cost Tc is determined, oil mass cost Oc and value at cost C can also be calculated.When all vehicles can walking along the street
After diameter determines, the value at cost C of any paths can be calculated such as formula (4).
C=β1×Ta+β2×Tc+β3×De+β4×Oc+β5×Tl (4)
Wherein, βi(i=1,2 ..., 5) be each influence factor for influencing value at cost C independent multiplication factor, value and city
City's scale, decision objective setting are related, their size has respectively represented influence degree of each influence factor to value at cost C,
Represent its importance degree.When certain path cost value C is smaller, the path is more excellent, and the cumulative value at cost of all vehicles is most
The value at cost of the whole path navigation scheme.
Value of utility U can weigh the quality of a path navigation scheme, and high usage value is also that a traffic system is well transported
Capable important feature.When the driving path (i.e. a kind of path navigation scheme) of all vehicles determines, you can to calculate its effectiveness
Value, the average utility value of vehicle represent the quality of vehicle route navigation scheme, and value of utility is higher, and navigation scheme is better, traffic
Situation is better.After the value of utility U of be possible to navigation scheme is obtained, optimum utility value U is selectedmaxPath navigation scheme
Vehicle guidance is carried out, best communication navigation is realized.However for a large size city road network, all possible path is led
Boat scheme number is huge, when carrying out calculating search using common computer, due to the limitation of calculating speed and search speed,
It cannot achieve the real-time of entire road network vehicle scheduling.Best navigation scheme is searched out in finite time just has practical application
Value.Therefore, the present invention proposes a kind of real-time dynamic multipath mouth path navigation quantum searching method RGQS of urban road network, such as
Shown in Fig. 2, RGQS method flows are see table 3；RGQS methods are by UVCQC algorithms and RUNQS Algorithm constitutions.Quantum computer and
Row ability and the search capability of quantum search algorithm breach the limitation of calculating speed and search speed, realize entire road network
The real-time of path navigation.
3 RGQS method flows of table
If total n vehicle in road network, number is respectively V1,V2,...,Vn, either car ViThere is the beginning and end of itself,
Optional path has one or several between beginning and end, these paths are that the driver that meets that system is driver's selection wants
The path asked, if the optional path number of this n vehicle is respectively b1,b2,...,bn, path crossing set expression, Vi,jIndicate i-th
The j-th strip path of vehicle, a path navigation scheme are exactly that the set of a paths is extracted for each car, are such as gathered(wherein, ai(i=1,2 ..., n) indicates any bar optional path in i-th vehicle) it is a kind of road
Diameter navigation scheme.
Path navigation scheme is corresponded with its value of utility, and path navigation scheme is independent variable x, and value of utility U is function,
Functional relation is indicated as shown in formula (5).
U (x)=P (x)-C (x) (5)；
Wherein, independent variable x value ranges areThe form bits 0 and 1 of x in a computer indicate, each x
Value uniquely represent a path navigation scheme, for clearer expression, the binary digit of path navigation scheme x needs to indicate
Go out the path selected by each car, then the optional path of each car is both needed to the binary digit of certain amount to indicate, takes satisfaction should
Formula max { b1,b2,...,bn}≤2hMinimum h values encode x, and the number of path of each car needs h binary representations, altogether
N × h binary systems are needed to indicate path navigation scheme number, if vehicle number scale is 1000, the path of each car is encoded with 3,
3000 are then needed to indicate a kind of path navigation scheme, the space for storing these schemes needs is 23000A bit.Classic computer
It can not store, it is even more impossible to calculate.And quantum computer possesses remarkable performance in data storage and concurrent operation, due to folded
Add the presence of state, is 2 on the data theory that 3000 quantum bits can store3000Bit, for classic computer, amount
The storage capacity of sub- computer can solve the storage problem of path navigation scheme almost without the upper limit, and quantum calculation
The superior performance of machine is (to all independents variable while to operate, operation one parallel computation of continuous variable truly
It is secondary to obtain all functional values).Therefore the parallel computation problem of value of utility can be solved.
The base unit stored in quantum computer is state, there was only 0 and 1 two kind of state in classic computer, and in quantum meter
There are superposition states in calculation machine, that is, exist can it is both non-zero nor 1 superposition state, therefore one 3000 in classic computer
Binary system is only capable of indicating a kind of path navigation scheme xi, and 3000 quantum bits can indicate 2 in quantum computer3000Kind road
Diameter navigation scheme, as long as the quantum state is not observed, it is believed that this 23000Kind path navigation scheme is stored simultaneously, quantum meter
Calculation machine is very suitable for the storage to these continuous variables, and each path navigation scheme all exists with same probability, this
Probability indicates in quantum mechanics with probability amplitude σ, square σ of some path navigation scheme probability amplitude2Equal to the path navigation side
The probability that case can be exported (in the probability that output end is observed).
The present invention indicates path navigation scheme with independent variable x, and function U (x) indicates the value of utility of the navigation scheme, in quantum
It in computer, is both indicated with quantum state, is stored respectively with two registers, independent variable x initialization is as shown in formula (6).
As shown in figure 3, path navigation scheme is determined by the starting and terminal point information of vehicle number n and vehicle, binary system can be used
Coding schedule shows that all path navigation schemes, the sum of navigation scheme are less than or equal to 2n×h, enable S=2n×h, therefore with S quantum
State can completely represent all path navigation schemes.The grade of independent variable x weighs superposition state (i.e. all path navigation schemes)
The input of quantum calculation, in formula (6)Indicate probability amplitude σ (its square of σ existing for path navigation scheme2Indicate respective path
The probability of navigation scheme), S state indicates that N number of path navigation scheme x values, wherein S=N, all path navigation schemes exist respectively
Existing probability in superposition state isQuantum state in formula (6) is shorthand, such as state | 0>ReallyAll states
Total bit be n × h, n indicates vehicle number, and h binary representations are used in the wherein selectable path of each car, such as i-th
A h full 0 indicates that the path selected by i-th vehicle is first (number 0), this S quantum state illustrates all roads comprehensively
Diameter navigation scheme, the storage and input of path navigation scheme can be with effective solutions.The calculating of function U (x) in UVCQC algorithms
As shown in formula (7).
Carrying out different quantum calculations needs different quantum wires, quantum wire that need to be determined according to function, in quantum meter
Unitary transformation U must be used in calculation machine when operation functionf, subscript f refers to certain function, and different unitary transformations uses different
Quantum wire also needs in quantum computer by an auxiliary quantum bit | z>To realize unitary transformation and obtain function having
Shown in body calculating process such as formula (8).
In this transformation, for a specific output, input is unique.
As shown in Figure 3, it is determined that after value of utility function U (x), suitable quantum wire and auxiliary quantity need to be set according to U (x)
Sub- bit realizes that unitary transformation, each state, that is, independent variable x correspond to a utility function value U (x), and all independents variable are performed simultaneously
Same operation, the parallel calculating for completing value of utility, its calculating process such as formula (9) institute can be obtained by quantum-mechanical property
Show.
It is run in the specific circuit of quantum calculation shown in primary result such as formula (10).Fig. 4 be UVCQC algorithms quantum simultaneously
Row calculates primary process.
All U values are stored in another register, it is assumed that are observed in independent variable one end | i>, then storage U values
Also collapse is register | U (i)>, after observing i, the values that observe of register of storage U values is that the probability of U (i) is 1, anti-mistake
As being also.By analyzing above, it is as shown in table 4 that UVCQC algorithm flows can be obtained.
4 UVCQC algorithms of table
The aforementioned acquisition and calculating for solving each influence factors of value of utility U, although however quantum computer can carry out simultaneously
Row calculates, but the extraction of result is but not easy to, and must singly export, i.e., quantum computer can calculate all
The value of utility of navigation scheme, but collapse is bound to when output end is observed, the value of utility that may finally obtain output only has one
It is a.And city road network path navigation problem is only needed to obtain a kind of best path navigation scheme, therefore only need to obtain
A corresponding value of utility (optimum utility value).It is aforementioned to have obtained the unordered value of utility of magnanimity, and quantum meter at present
The calculation machine data unordered to magnanimity have scanned for efficient algorithm, i.e. quantum search algorithm.But quantum search algorithm
It can only solve to have determined the feelings of target state (target state refers to the state for needing to search for, the referred to corresponding state of optimum utility value)
Condition, and success can not be absolutely searched for, in order to adapt to the solution of practical problem, the present invention proposes a kind of road network value of utility amount
Sub- searching algorithm RNUQS, it is therefore an objective to from the quantum superposition state of aforementioned obtained effectiveness value function | U (x)>In search and conform to
The value of utility asked, and obtain corresponding path navigation scheme.
The equal power superposition state of aforementioned acquisition value of utility, path navigation problem are converted into an optimal result search problem, search
The collection of rope be combined into | U>}={ | U (0)>,|U(1)>,...,|U(N-1)>, the number of value of utility state is S, and target state (needs
The state of output) it is Umax(maximum value of utility), target state is unknown, therefore cannot directly be obtained by quantum search algorithm
Maximum value of utility and corresponding path navigation scheme, the present invention propose a kind of RNUQS algorithms.In true road network, no
The minimum value of utility that will produce congestion may be considered a fixed empirical value k, then the value of utility more than empirical value k
To export as a result, it is assumed that the value of utility number more than empirical value k is m, then any one of this m is satisfied by output bars
Part.
Target state number is m, is used for determining that the function of target state is known as instructing function in RNUQS algorithms, enables y=U (x),
What RNUQS was used instructs shown in function such as formula (11).
Effectiveness value function state | U (x)>After instructing criteria function, the state that functional value f (x) is 1 is target state, and m is a
Target state is locked therewith, and whether RNUQS algorithms are 1 to judge whether the state is target state, RNUQS by the corresponding functional value of state
Algorithm can correctly be exported by promoting target probability of state width.
It examines whether each value of utility is target state with instructing function in search process, then passes through Grover transformation and expand
Big target probability of state width improves the probability of target value of utility state output, as shown in figure 5, G indicates Grover transformation in figure, below
Elaboration in abbreviation G transformation, it is to carry out primary specific Quantum Iteration to carry out a G transformation, is converted by the G of certain algebraically
Afterwards, target value of utility probability of state increases to a certain extent, finally with close to 1 probability output, to obtain suitable target
Value of utility state.
Wherein, inquiry is instructed in G=DO, O expression, it is assumed that | Ua>It is target state, unitary will be executed after instructing inquiry and is become
Change I-2 | Ua><Ua|, this operation will not be executed if it is non-targeted state, so shown in the calculating of O such as formula (12).
O=I-2 | Ua><Ua| (12)
Shown in the calculating of D such as formula (13).
WhereinIt is the equal power superposition state of all basic status,H indicates that Hadamard transformation (is used
Hadamard gate is realized), for the power superposition state such as preparing,Indicate that preparing n × h wait weighs superposition state.Initial equal power
A bit, non-targeted value of utility state is then reduced some the increase of target value of utility probability of state width superposition state after G is converted every time, warp
After crossing the G transformation of certain iterations, the output probability of target value of utility state can be observed in output end, be obtained close to 1 at this time
Suitable value of utility.
A G converts role in order to better understand, and a G converts the amount that can regard quantum state as in two-dimensional space
Son transformation, is divided into two steps, is O transformation and D transformation respectively.As Fig. 6 (a) be a G convert geometric representation, Fig. 6 (b) be into
RowThe geometric representation of secondary G transformation, | Ua>It is target state, the superposition of projective representation of the current superposition state in target state
The output probability width of target state in state often passes through a G and converts, and original state rotates 2 θ angles to target state, as shown in Fig. 6 (a),Shown in process such as Fig. 6 (b) of secondary G transformation, angle [alpha] is arbitrary acute angle, the angle, θ phase of Fig. 6 (a) and 6 (b) in Fig. 6 (a)
Deng ()。
In Fig. 6 (a),It is that superposition state is weighed in initial waiting, | Ut>Indicate arbitrary current state, all G transformation is all pair | Ut>
It is converted, | Ua>The sum of all target states is indicated, shown in calculating process such as formula (14).
aiIndicate target state,Indicate | Ua>Orthogonal state, with | Ua>Vertically, | Ut>WithAngle be set as α,WithAngle be θ, wait power superposition stateIn target state | Ua>On projection (probability amplitude) be Meaning is to wait
Observe that target probability of state is sin under power superposition state2θ=m/N, current state be | Ut>, converted by a G, current state transformation
For O | Ut>, | Ut>With O | Ut>AboutSymmetrically, O | Ut>Converted using a D, be transformed to G | Ut>, O | Ut>With G | Ut>It closes
InSymmetrically, it is not difficult to calculate according to angular relationship, G | Ut>With | Ut>Angle be 2 θ, it is unrelated with α, often pass through G and convert,
Current 2 θ of state rotated counterclockwise by angle.
Due to value of utility state | U>The power superposition state such as it is initially in, after i G transformation, withAngle become (2i+
1) θ, in order to make target state close to 1 probability output, (2i+1) θ ≈ 1 should be made, wherein It calculatesRound indicates immediate integer, therefore need to only carry out i transformation and can search
Suitable target value of utility, required time complexity are only
From the calculating of i values can be seen that due to i can only round numbers, can finally obtain target probability of state and only connect very much
Nearly 1, therefore the possibility for thering is output to malfunction, in actual path navigation, mistake is not allowed to.For this problem, originally
Invention proposes a kind of quantum error detection strategy (Quantum Error Detection Strategy, QEDS), QEDS strategic processes
As shown in table 5.Empirical value k only can guarantee that there are one appropriate outputs, but output can not ensure to optimize enough, in actual conditions
In can set an ideal empirical value km, repeatedly searched for, in the maximum time limit t for meeting real-timemaxUnder the premise of,
Search as multiple as possible, if used time of search is tc, it is t currently to have spent the times(being initially 0).
Table 5 QEDS strategies
RNUQS algorithm flows proposed by the present invention are as shown in table 6 as a result,.
6 RNUQS algorithms of table
It should be understood that the part that this specification does not elaborate belongs to the prior art.
It should be understood that the above-mentioned description for preferred embodiment is more detailed, can not therefore be considered to this
The limitation of invention patent protection range, those skilled in the art under the inspiration of the present invention, are not departing from power of the present invention
Profit requires under protected ambit, can also make replacement or deformation, each fall within protection scope of the present invention, this hair
It is bright range is claimed to be determined by the appended claims.
Claims (5)
1. a kind of real-time dynamic multipath mouth path navigation quantum searching method of urban road network, model is mapped to by true road network
Scheme R (B, E), wherein B indicates junction node set, BiIndicate single junction node, i=1,2 ..., r；R is total crossing number, E
Indicate the section set with direction；Assuming that there is n vehicle in the road network, either car w has current starting point PsWith destination end
Point Pd, then certain feasible path of the vehicle be expressed as { P with continuous adjacent junction nodes,...,Pi,...,Pd}；Each car is selected
A feasible path is selected, the driving path of all vehicles forms a feasible path set FPSn, i.e. a path navigation scheme；
It is characterized in that, the described method comprises the following steps：
Step 1：According to vehicle number n, the optional path of terminal information and each car, initialization vehicle collection { v1,v2,...,vn}
And optional path collectionWherein viIndicate i-th vehicle,Indicate one in all optional paths of i-th vehicle；
Step 2：To vehicle and its optional path 0,1 ..., biProgress quantum coding | 0>,|1>,...,|2n×h-1>, it determines
Quantum state can completely represent all path navigation schemes；Wherein biIndicate that the optional path number of i-th vehicle, h are indicated to optional
The minimum number of bits that path code needs；
Step 3：The independent multiplication factor α of each influence factor is determined according to traffic informationi,βj, determine that value of utility calculates function U
(x)；Wherein each path navigation scheme corresponds to independent variable x values；
Step 4：Prepare the equal power superposition state of path navigation scheme | x>, calculate the corresponding value of utilities of each path navigation scheme x | U
(x) |, obtain the equal power superposition state of effectiveness value function | U (x)>；
Step 5：The empirical value k for determining value of utility, to the equal power superposition state of effectiveness value function | U (x)>Carry out quantum searching, search
Go out the value of utility met the requirements | Us>；
Step 6：Export the value of utility U met the requirementssAnd corresponding path navigation scheme, path navigation is carried out to each car.
2. the real-time dynamic multipath mouth path navigation quantum searching method of urban road network according to claim 1, special
Sign is that effectiveness value function U (x) described in step 3 is：
U (x)=Fr (x) × (α 1 × Rs (x)+α 2 × Sl (x)+α 3 × Ls (x)+α 4 × Os (x) 5 × Fd of+α (x))-(1 × Ta of β
(x)+β2×Tc(x)+β3×De(x)+β4×Oc(x)+β5×Tl(x))
Wherein Fr (x) indicates whether section can be arrived at, and takes 1 expression reachable, takes 0 expression unreachable；Rs (x) indicates section situation,
Value [0,1]；Sl (x) indicates rate limitation, value [0,1]；Ls (x) indicates section illuminating position, value [0,1]；Os (x) tables
Show obedient extent of the driver to system recommendation, value [0,1]；Fd (x) indicates driver to the familiarity in section, value [0,1]；
Ta (x) indicates that the road that the traffic accident of burst or temporary control are brought influences, value [0,1]；Tc (x) indicates selected path consumption
The time cost taken, value [0, ∞]；De (x) indicate that selected path expends apart from cost, value [0, ∞]；Oc (x) is indicated
The oil mass cost that selected path is expended, value [0, ∞]；Tl (x) indicates the influence of traffic lights, value [0,1]；αi、βiTable respectively
Show the corresponding independent multiplication factor of each influence factor, i=1,2 ..., 5.
3. the real-time dynamic multipath mouth path navigation quantum searching method of urban road network according to claim 1, special
Sign is that the specific implementation of step 4 includes following sub-step：
Step 4.1：The power superposition state such as quantum of initial argument's path navigation scheme is prepared using Hadamard gateWherein N indicates quantum state sum；
Step 4.2：The corresponding unitary transformation circuit U of design functionU(x)And it can be used for the auxiliary quantum bit for realizing that function calculates | z
>；
Step 4.3：Input path navigation scheme waits power superposition state, parallel computation function U (x)：
Step 4.4：Obtain the equal power superposition state of effectiveness value function | U (x)>.
4. the real-time dynamic multipath mouth path navigation quantum searching method of urban road network according to claim 1, special
Sign is that the specific implementation of step 5 includes following sub-step：
Step 5.1：It provides and instructs function f (y) for determine target state, and corresponding quantum wire is set；
The equal power superposition state of effectiveness value function | U (x)>After instructing criteria function, the state that functional value f (x) is 1 is target
State；
Step 5.2：Target state is added up, obtain target state number m and calculates aggreggate utility value target state | Ua>；
Wherein, aiIndicate target state, | ai>Indicate that the quantum form of i-th of target state, m indicate target state sum；
Step 5.3：According to | Ua>It determines and instructs inquiry O, determine that O is converted；
O=I-2 | Ua><Ua|；
Wherein I is indicated and | Ua>The identical equal power superposition state of quantum digit,<Ua| indicate | Ua>Conjugate vector；
Step 5.4：Superposition state is weighed according to equalDetermine that D is converted；
Wherein,It is the equal power superposition state of all basic status,H indicates Hadamard transformation, for preparing
Superposition state is weighed,Indicate that preparing n × h wait weighs superposition state；N indicates quantum state sum, | i>Indicate i-th of quantum state；
Step 5.5：Determine that a G converts G=DO by O transformation and D transformation；
Step 5.6：To the equal power superposition state of effectiveness value function | U (x)>It carries outSecondary G transformation, round are indicated most
Close integer；
Step 5.7：Observe the value of utility state of output | Uout>And corresponding path navigation scheme | xout>, searched within the time limit
Go out the value of utility met the requirements | Us>；
Step 5.8：Export value of utility state | Us>Corresponding path navigation scheme xsIn the guidance path chosen for each car.
5. the real-time dynamic multipath mouth path navigation quantum searching method of urban road network according to claim 4, special
Sign is that the specific implementation of step 5.7 includes following sub-step：
Step 5.7.1：Output after the completion of being converted to G is observed, and obtains value of utility UoutWith current search used time ts；
Step 5.7.2：If ts< tmax, then following step 5.7.3, wherein t are executedmaxExpression can guarantee path navigation real-time
Maximum navigation time interval；Otherwise, following step 5.7.5 is executed；
Step 5.7.3：If Uout< k, then ts=ts+tc, and turn round and execute the step 5.7.2, wherein tcIt indicates to execute primary
The urban road network real-time dynamic multipath mouth path navigation quantum searching method required time；Otherwise, it executes following
Step 5.7.4；
Step 5.7.4：If fruit Uout< km, then k=Uout, ts=ts+tc, and turn round and execute the step 5.7.2, wherein kmIt indicates
The ideal value of utility rule of thumb set；Otherwise, following step 5.7.5 is executed；
Step 5.7.5：Us=Uout, export Us。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610605008.XA CN106197455B (en) | 2016-07-28 | 2016-07-28 | A kind of real-time dynamic multipath mouth path navigation quantum searching method of urban road network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610605008.XA CN106197455B (en) | 2016-07-28 | 2016-07-28 | A kind of real-time dynamic multipath mouth path navigation quantum searching method of urban road network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106197455A CN106197455A (en) | 2016-12-07 |
| CN106197455B true CN106197455B (en) | 2018-11-13 |
Family
ID=57495529
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610605008.XA Active CN106197455B (en) | 2016-07-28 | 2016-07-28 | A kind of real-time dynamic multipath mouth path navigation quantum searching method of urban road network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106197455B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108597246B (en) * | 2017-12-11 | 2020-10-13 | 武汉大学 | Method for solving real-time problem of path selection to avoid local congestion |
| CN108827335B (en) * | 2018-08-22 | 2021-05-14 | 北京理工大学 | Shortest path planning method based on one-way search model |
| CN111126611B (en) * | 2019-12-09 | 2023-04-18 | 南京师范大学 | High-speed traffic distribution simulation quantum computing method considering destination selection |
| CN111291892B (en) * | 2020-01-17 | 2023-01-17 | 深圳大学 | Quantum parallel search method |
| CN111369819B (en) * | 2020-03-02 | 2021-12-14 | 腾讯科技（深圳）有限公司 | Method and device for selecting driving object |
| CN111623790B (en) * | 2020-05-26 | 2022-04-12 | 武汉大学深圳研究院 | Rapid path planning method for dynamic urban traffic network |
| CN111862660B (en) * | 2020-07-23 | 2023-10-10 | 中国平安财产保险股份有限公司 | Real-time path planning method and related equipment based on utility compensation mechanism |
| CN113048997B (en) * | 2021-03-10 | 2022-08-05 | 重庆第二师范学院 | Driving suggestion method, system, storage medium and server based on big data |
| CN113191028B (en) * | 2021-06-30 | 2021-12-31 | 深圳坤湛科技有限公司 | Traffic simulation method, system, program, and medium |
| CN114659536B (en) * | 2022-03-21 | 2023-06-16 | 深圳市创互科技有限公司 | Navigation system and method based on quantum communication |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103336799B (en) * | 2013-06-18 | 2017-11-14 | 上海工程技术大学 | Railway traffic transfer plan querying method and device based on adaptive quantum ant colony |
| CN104406593A (en) * | 2014-12-03 | 2015-03-11 | 广西民族大学 | Method for determining optimal route of airway of unmanned aerial vehicle |
| CN104616498B (en) * | 2015-02-02 | 2017-01-25 | 同济大学 | Markov chain and neural network based traffic congestion state combined prediction method |
-
2016
- 2016-07-28 CN CN201610605008.XA patent/CN106197455B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN106197455A (en) | 2016-12-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106197455B (en) | A kind of real-time dynamic multipath mouth path navigation quantum searching method of urban road network | |
| CN105513400B (en) | The method of Dynamic Programming trip route | |
| CN105608896B (en) | Traffic bottlenecks recognition methods in urban traffic network | |
| Yu et al. | Optimizing bus transit network with parallel ant colony algorithm | |
| CN111898793B (en) | Path selection method considering user perception difference in combined travel mode | |
| Yu et al. | A multi-modal route planning approach with an improved genetic algorithm | |
| Zhao et al. | Dynamic path planning of emergency vehicles based on travel time prediction | |
| CN108597246A (en) | A method of Path selection real time problems are solved to avoid local congestion | |
| CN107103169B (en) | Traffic network balance calculation method for meeting travel continuation requirements | |
| CN109039886B (en) | Network dynamic route computing method, device and equipment | |
| CN107578132A (en) | A kind of garbage truck method for obtaining path based on immune optimization | |
| CN111862595B (en) | Speed prediction method, system, medium and device based on road network topological relation | |
| CN114399125B (en) | Motorcade optimal trajectory control method and device, electronic equipment and storage medium | |
| Osaba et al. | Multi-objective optimization of bike routes for last-mile package delivery with drop-offs | |
| Xia et al. | Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs | |
| Xi et al. | Hmdrl: Hierarchical mixed deep reinforcement learning to balance vehicle supply and demand | |
| Zhang et al. | Golden ratio genetic algorithm based approach for modelling and analysis of the capacity expansion of urban road traffic network | |
| CN113903171B (en) | Vehicle crowd sensing node optimization method based on spatial-temporal characteristics of highway network | |
| CN115511226A (en) | Vehicle path optimization method based on improved differential evolution algorithm | |
| Shi et al. | An adaptive route guidance model considering the effect of traffic signals based on deep reinforcement learning | |
| Makhdomi et al. | A greedy approach for increased vehicle utilization in ridesharing networks | |
| CN114139765A (en) | Bus transfer network optimization method and device and electronic equipment | |
| Jiang et al. | Assessing urban road network capacity considering parking supply and parking pricing | |
| Kiliç et al. | A public transit network route generation algorithm | |
| Kim et al. | Finding realistic shortest path in road networks with lane changing and turn restriction |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |