CN117726049B - Regional walking time length determining method, electronic equipment and storage medium - Google Patents
Regional walking time length determining method, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN117726049B CN117726049B CN202410175729.6A CN202410175729A CN117726049B CN 117726049 B CN117726049 B CN 117726049B CN 202410175729 A CN202410175729 A CN 202410175729A CN 117726049 B CN117726049 B CN 117726049B
- Authority
- CN
- China
- Prior art keywords
- walking time
- target
- preset
- determining
- list
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 34
- 238000012163 sequencing technique Methods 0.000 claims description 2
- 230000006870 function Effects 0.000 description 7
- 238000002955 isolation Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000001680 brushing effect Effects 0.000 description 2
- 239000013307 optical fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000007619 statistical method Methods 0.000 description 1
Landscapes
- Mobile Radio Communication Systems (AREA)
- Measurement Of The Respiration, Hearing Ability, Form, And Blood Characteristics Of Living Organisms (AREA)
Abstract
The invention provides a regional walking time length determining method, electronic equipment and a storage medium, and relates to the field of regional walking time length determining, wherein the method comprises the following steps: acquiring first time and second time of each target historical user corresponding to the target area to obtain a time data set list T; determining the initial walking time corresponding to each target historical user to obtain an initial walking time list CT; determining target historical users corresponding to each preset subarea in the target area according to the preset subarea data corresponding to each target historical user so as to obtain a target historical user list set QW; determining an initial walking time length list set HT according to the CT and the QW; if f (j) is not less than NE, determining a target walking time corresponding to QW j according to HT j; the distance factor is implicitly considered in the determined target walking time length of each preset subarea, so that the determined target walking time length of each preset subarea is accurate.
Description
Technical Field
The present invention relates to the field of determining a walking time of an area, and in particular, to a method for determining a walking time of an area, an electronic device, and a storage medium.
Background
In the civil aviation field, in order to facilitate the planning of security check time by users, the airport generally provides walking time from the security check gate to each boarding gate, and the provided walking time is usually estimated time of the airport or the walking time from the security check gate to each boarding gate is the same; the position distribution of each gate in the airport is different, some gates are very close to the security gate, some gates are very far away from the security gate, and when the airport predicts the walking time from the security gate to each gate, the actual distance factor between each gate and the security gate is not considered, so that the walking time provided by the airport may be greatly different from the actual walking time of the user.
Disclosure of Invention
Aiming at the technical problems, the invention adopts the following technical scheme:
According to a first aspect of the present application, there is provided a method of determining a walking time of an area, the method comprising the steps of:
S100, acquiring the first time of executing a first preset task and the second time of executing a second preset task of each target historical user corresponding to a target area to obtain a time data set list T= (T 1,T2,…,Ti,…,Tn), i=1, 2, … and n; wherein T i is the time data set corresponding to the ith target historical user, and n is the number of the target historical users; t i=（Ti,1,Ti,2）,Ti,1 is the first time corresponding to the ith target historical user, and T i,2 is the second time corresponding to the ith target historical user; the target historical user is a historical user executing a preset action within a preset time period before the corresponding target task is ended; the first preset task and the second preset task are associated different preset tasks.
S200, determining the initial walking time corresponding to each target historical user according to T to obtain an initial walking time list CT= (CT 1,CT2,…,CTi,…,CTn); wherein, CT i is the initial walking time corresponding to the first target history user; CT i=Ti,2-Ti,1 -TE, TE is a preset correction duration.
S300, determining target historical users corresponding to each preset subarea in the target area according to the preset subarea data corresponding to each target historical user to obtain a target historical user list set QW= (QW 1,QW2,…,QWj,…,QWm), j=1, 2, … and m; the target historical user list QW j includes all target historical users corresponding to the jth preset sub-area in the target area, and m is the number of preset sub-areas in the target area.
S400, determining an initial walking time list set HT= (HT 1,HT2,…,HTj,…,HTm) of the subarea according to CT and QW; wherein, HT j is the sub-region initial walking time list corresponding to QW j; HT j=（HTj,1,HTj,2,…,HTj,r,…,HTj,f（j））,r=1,2,…,f（j）;HTj,r is the initial step length of the (r) th target historical user in the sub-region initial step length list corresponding to QW j, and f (j) is the number of initial step lengths in the sub-region initial step length list corresponding to QW j.
S500, traversing HT, and if f (j) is not less than NE, determining a target walking time corresponding to QW j according to HT j; NE is a preset number of foot lengths threshold.
According to another aspect of the present application, there is also provided a non-transitory computer readable storage medium having stored therein at least one instruction or at least one program, the at least one instruction or the at least one program being loaded and executed by a processor to implement the above-mentioned regional walking time length determination method.
According to another aspect of the present application, there is also provided an electronic device comprising a processor and the above-described non-transitory computer-readable storage medium.
The invention has at least the following beneficial effects:
According to the regional walking time determining method, the first time and the second time of each target historical user corresponding to the target region are obtained, and the walking time corresponding to each target historical user can be determined; determining a target historical user corresponding to each preset subarea in the target area according to the preset subarea data corresponding to each target historical user, and further determining a target walking time corresponding to each preset subarea according to the walking time of the target historical user corresponding to each preset subarea; when determining the target walking time length corresponding to each preset subarea, according to the initial walking time length corresponding to all target historical users corresponding to each preset subarea, the initial walking time length is related to the walking distance of the target historical users; therefore, the determined target walking time length of each preset subarea implicitly considers the distance factor, so that the determined target walking time length of each preset subarea is accurate.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flowchart of a method for determining a walking time of an area according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to fall within the scope of the invention.
It should be noted that the aspects described herein may be embodied in a wide variety of forms and that any specific structure and/or function described herein is merely illustrative. Based on the present disclosure, one skilled in the art will appreciate that one aspect described herein may be implemented independently of any other aspect, and that two or more of these aspects may be combined in various ways. For example, an apparatus may be implemented and/or a method practiced using any number of the aspects set forth herein. In addition, such apparatus may be implemented and/or such methods practiced using other structure and/or functionality in addition to one or more of the aspects set forth herein.
A method for determining the walking time length of an area will be described with reference to a flowchart of the method for determining the walking time length of an area described in fig. 1.
The regional walking time length determining method comprises the following steps:
S100, acquiring the first time of executing a first preset task and the second time of executing a second preset task of each target historical user corresponding to a target area to obtain a time data set list T= (T 1,T2,…,Ti,…,Tn), i=1, 2, … and n; wherein T i is the time data set corresponding to the ith target historical user, and n is the number of the target historical users; t i=（Ti,1,Ti,2）,Ti,1 is the first time corresponding to the ith target historical user, and T i,2 is the second time corresponding to the ith target historical user; the target historical user is a historical user executing a preset action within a preset time period before the corresponding target task is ended; the first preset task and the second preset task are associated different preset tasks.
In this embodiment, the target area is an airport isolation area, and the distance from the security gate to each gate in the airport isolation area is different, so that the walking time of the user from the security gate to each gate is also different; the first time is the time when the user starts the security check, namely, the time when the boarding pass is brushed at the security check gate; the second time is the boarding time of the user, namely the boarding pass brushing time at the corresponding boarding gate; executing the preset action can be understood as brushing boarding pass at the security gate, and executing the preset action can generate a first time corresponding to the target historical user.
The method comprises the steps that the first time and the second time of each user in a target area in a preset historical time period can be obtained, each historical user corresponds to a corresponding flight, and the flight corresponds to a preset boarding time; determining a historical user performing security check in a preset time period before the corresponding boarding time in all the historical users as a target user; the preset time period may be 5 minutes; it can be appreciated that after the user performs a security check 5 minutes before their corresponding boarding time, the boarding time is already relatively short from the preset boarding time, and the user should theoretically not stay in the isolation area, arrive at the corresponding boarding gate at the normal walking speed, and the obtained first time and second time have more reference value.
S200, determining the initial walking time corresponding to each target historical user according to T to obtain an initial walking time list CT= (CT 1,CT2,…,CTi,…,CTn); wherein, CT i is the initial walking time corresponding to the first target history user; CT i=Ti,2-Ti,1 -TE, TE is a preset correction duration.
In this embodiment, when the user arrives at the boarding gate, the boarding gate is not immediately able to be swiped, and queuing is required under normal conditions, so that queuing time exists between the arrival of the user at the boarding gate and the swiping of the boarding gate, that is, a preset correction time TE; the TE is set to enable the initial walking time corresponding to each determined target historical user to be more accurate; TE can be obtained by statistical analysis of a large number of data samples, for example, TE is 3min.
S300, determining target historical users corresponding to each preset subarea in the target area according to the preset subarea data corresponding to each target historical user to obtain a target historical user list set QW= (QW 1,QW2,…,QWj,…,QWm), j=1, 2, … and m; the target historical user list QW j includes all target historical users corresponding to the jth preset sub-area in the target area, and m is the number of preset sub-areas in the target area.
In this embodiment, the preset sub-area is a boarding gate, and the boarding pass information corresponding to each target historical user includes preset sub-area data, so that the target historical user corresponding to each preset sub-area in the target area can be determined according to the preset sub-area data corresponding to each target historical user, so as to obtain a target historical user list set QW.
S400, determining an initial walking time list set HT= (HT 1,HT2,…,HTj,…,HTm) of the subarea according to CT and QW; wherein, HT j is the sub-region initial walking time list corresponding to QW j; HT j=（HTj,1,HTj,2,…,HTj,r,…,HTj,f（j））,r=1,2,…,f（j）;HTj,r is the initial step length of the (r) th target historical user in the sub-region initial step length list corresponding to QW j, and f (j) is the number of initial step lengths in the sub-region initial step length list corresponding to QW j.
It can be understood that, since the number of target history users corresponding to each preset sub-region is different in this embodiment, f (j) does not refer to a specific function or a function result value, but refers to a value that may be different according to the specific value of j, for example, when j=1, f (j) =300; when j=2, f (j) =400; when j=3, f (j) =300.
S500, traversing HT, and if f (j) is not less than NE, determining a target walking time corresponding to QW j according to HT j; NE is a preset number of foot lengths threshold.
Further, step S500 may include the steps of:
s510, sorting all the initial walking time lengths in HT j according to the size of each initial walking time length in HT j to obtain an intermediate walking time length list YT j=（YTj,1,YTj,2,…,YTj,r,…,YTj,f（j） corresponding to HT j; wherein YT j,r is the r-th intermediate walking time length obtained by sequencing all the initial walking time lengths in HT j; YT j,k≥YTj,k+1; k=1, 2, …, f (j) -1.
In this embodiment, since the walking speed of each target historical user corresponding to the QW j is different, the initial walking time periods in the HT j are not identical, and all the initial walking time periods in the HT j can be ordered in order from the big to the small to obtain the YT j.
S520, determining a first target value lq= (f (j) -1)/P according to f (j); wherein P is a preset average score; p < NE.
In this embodiment, NE may be 50, and p may be 10 or 20; the first target value represents the position in YT j where the subsequently determined target foot-time length is located.
S530, if LQ is an integer, determining YT j,NQ as a target walking time corresponding to QW j; otherwise, obtaining a second target valueAnd a third target value ft=mod (LQ); wherein/>Mod () is a preset remainder function, which is a preset rounding function down.
S540, determining target walking time length SC j=YTj,XH+（YTj,XH-YTj,XH+1) multiplied by FT corresponding to QW j according to YT j, XH and FT.
In this embodiment, there are users with particularly slow walking, and the initial walking time periods corresponding to these users cannot represent the walking time periods required by most users, so that the initial walking time periods of these users need to be filtered out; when p=10, the determined target walking time SC j corresponding to QW j is greater than 90% of the initial walking time in YT j, i.e., 90% of users can walk from the security gate to QW j in SC j; thereby making the target walking time SC j corresponding to QW j more reasonable.
Further, after step S500, the method further includes the steps of:
s600, if f (j) < NE, acquiring a preset subarea QW' j adjacent to the QW j.
In this embodiment, there may be some special reasons for the airport, which cause some gates to be in a closed state for a long time, and the number of corresponding target historical users is also very small; for example, if the number of target historical users corresponding to a gate is 10, it is necessary to acquire the gate adjacent to the gate.
Further, QW' j may be determined by the following steps:
S601, determining a target walking time corresponding to each preset subarea according to QW to obtain a first target walking time list TU= (TU 1,TU2,…,TUj,…,TUm); TU j is the target foot time corresponding to QW j.
S602, deleting TU j in the TU to obtain a second target walking time list TU '= (TU' 1,TU'2,…,TU'a,…,TU'm-1), a=1, 2, …, m-1; TU' a is the a-th target walking time length in the second target walking time length list obtained by deleting TU j in TU.
S603, obtaining the walking time difference of each target walking time in TU j and TU' to obtain a first walking time difference list delta TU= (delta TU 1,ΔTU2,…,ΔTUa,…,ΔTUm-1); wherein Δtu a is the difference in walking time between TU j and TU' a; ΔTU a=|TUj-TU'a |.
S604, the minimum two walking time differences delta KA and delta KB in delta TU are obtained.
In this embodiment, the preset sub-area adjacent to the QW j may be one, that is, QW j is the preset sub-area at the first position or the preset sub-area at the last position in the target area; the number of preset sub-regions adjacent to the QW j may be two, that is, one preset sub-region on each side of the QW j, so that the minimum two walking time differences Δka and Δkb in Δtu are obtained.
S605, if the absolute value of the preset subarea corresponding to the delta KA-delta KB is smaller than the absolute value of the PA, determining the preset subarea corresponding to the delta KA and the preset subarea corresponding to the delta KB as QW' j; otherwise, acquiring a first target walking time difference mg=min (Δka, Δkb); PA is a preset difference threshold of the step length difference; MIN () is a preset minimum function.
S606, determining the preset subarea corresponding to the MG as QW' j.
In this embodiment, PA is a small value, for example, 5s; if |delta KA-delta KB| < PA, two preset subareas adjacent to QW j are indicated, namely, the preset subarea corresponding to delta KA and the preset subarea corresponding to delta KB; if |delta KA-delta KB| is not less than PA, the preset subarea adjacent to QW j is one, namely, the preset subarea corresponding to the smaller walking time difference in delta KA and delta KB is the preset subarea adjacent to QW j; thus, the adjacent preset sub-regions of the QW j are determined.
Further, QW' j may also be determined by:
S700, obtaining a target character ZF j corresponding to the QW j; the ZF j is obtained according to a preset identifier corresponding to the QW j.
In this embodiment, each preset sub-region generally corresponds to a preset identifier, and preset sub-regions of different layers are distinguished by using different preset characters; for example, a103, a104, B115, B116, etc.; in general, preset sub-areas with preset marks of A103 and A104 are located on the same layer, and preset sub-areas with preset marks of B115 and B116 are located on the same layer; therefore, by acquiring the character at the preset position of the preset mark, the target character ZF j corresponding to the QW j, for example, the target character is a or B, can be acquired.
S710, obtaining target characters corresponding to each preset sub-region except the QW j to obtain a target character list lu= (LU 1,LU2,…,LUb,…,LUm-1), b=1, 2, …, m-1; wherein LU b is the target character corresponding to the b-th preset sub-region except QW j.
S720, traversing LU, if LU b=ZFj, determining the preset sub-region corresponding to LU b as a candidate preset sub-region to obtain candidate preset sub-region list hx= (HX 1,HX2,…,HXc,…,HXd), c=1, 2, …, d; wherein HX c is the determined c candidate preset sub-area, and d is the number of the determined candidate preset sub-areas.
It will be appreciated that the predetermined sub-region of the different layer from the QW j will certainly not be adjacent to the QW j, and therefore, by the above steps, a portion of the predetermined sub-region which is unlikely to be adjacent to the QW j can be excluded, thereby reducing the subsequent calculation amount and improving the determination efficiency of the adjacent predetermined sub-region.
S730, obtaining a target walking time corresponding to each preset subarea in HX to obtain a third target walking time list FR= (FR 1,FR2,…,FRc,…,FRd); wherein FR c is the target foot length corresponding to HX c.
S740, acquiring the walking time difference of each target walking time in BP j and FR to obtain a second walking time difference list delta DP= (delta DP 1,ΔDP2,…,ΔDPc,…,ΔDPd); wherein Δdp c is the difference in walking time between BP j and FR c; BP j is the target foot length corresponding to QW j.
S750, obtaining the minimum two walking time differences delta KP and delta KQ in the delta DP.
S760, if the absolute value of the delta KP-delta KQ is smaller than the absolute value of the PA, determining a preset subarea corresponding to the delta KP and the delta KQ as QW' j; otherwise, acquiring a second target walking time difference MG' =min (Δkp, Δkq); PA is a preset difference threshold of the step length difference; MIN () is a preset minimum function.
S770, determining the preset sub-region corresponding to the MG 'as QW' j.
In this embodiment, after excluding a part of the preset sub-area unlikely to be adjacent to the QW j, the method for determining the QW' j in the subsequent steps S730-S770 is the same as that in steps S601-S606, and will not be repeated here.
S610, adding each initial walking time in the sub-region initial walking time list corresponding to QW 'j to HT j to obtain a supplementary initial walking time list HT' j corresponding to QW j.
S620, determining the target walking time length corresponding to the QW j according to the HT' j.
Each initial step length in the initial step length list corresponding to QW' j is added to HT j such that the number of initial step lengths in HT j is greater than NE, thereby determining a target step length corresponding to QW j according to the method in steps S510-S540, and making the determined target step length corresponding to QW j more accurate.
Further, after step S600 and before step S610, the method further includes the steps of:
S607, the number NUM of initial walk time lengths corresponding to QW' j is acquired.
S608, if NUM is more than or equal to NE, proceeding to step S610; otherwise, the preset walking time length corresponding to the QW j is determined as the target walking time length corresponding to the QW j.
In this embodiment, the number NUM of initial walking durations corresponding to QW' j may be smaller than NE, and if NUM < NE, the preset walking duration corresponding to QW j is determined as the target walking duration corresponding to QW j; the preset walking time length corresponding to the QW j is a preset estimated walking time length, the accuracy of the preset walking time length relative to the target walking time length corresponding to the QW j is relatively low, and the preset walking time length is used as standby data when the target walking time length corresponding to the QW j cannot be determined according to the method in the steps, so that the situation that the target walking time length corresponding to the QW j cannot be determined is avoided.
Furthermore, although the steps of the methods in the present disclosure are depicted in a particular order in the drawings, this does not require or imply that the steps must be performed in that particular order, or that all illustrated steps be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step to perform, and/or one step decomposed into multiple steps to perform, etc.
Embodiments of the present invention also provide a non-transitory computer readable storage medium that may be disposed in an electronic device to store at least one instruction or at least one program for implementing one of the methods embodiments, the at least one instruction or the at least one program being loaded and executed by the processor to implement the methods provided by the embodiments described above.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium would include the following: an electrical connection having one or more wires, a portable disk, a hard disk, random Access Memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
The computer readable signal medium may include a data signal propagated in baseband or as part of a carrier wave with readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations of the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of remote computing devices, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., connected via the Internet using an Internet service provider).
Embodiments of the present invention also provide an electronic device comprising a processor and the aforementioned non-transitory computer-readable storage medium.
An electronic device according to this embodiment of the application. The electronic device is merely an example, and should not impose any limitations on the functionality and scope of use of embodiments of the present application.
The electronic device is in the form of a general purpose computing device. Components of an electronic device may include, but are not limited to: the at least one processor, the at least one memory, and a bus connecting the various system components, including the memory and the processor.
Wherein the memory stores program code that is executable by the processor to cause the processor to perform steps in various embodiments described herein.
The storage may include readable media in the form of volatile storage, such as Random Access Memory (RAM) and/or cache memory, and may further include Read Only Memory (ROM).
The storage may also include a program/utility having a set (at least one) of program modules including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each or some combination of which may include an implementation of a network environment.
The bus may be one or more of several types of bus structures including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures.
The electronic device may also communicate with one or more external devices (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device, and/or with any device (e.g., router, modem, etc.) that enables the electronic device to communicate with one or more other computing devices. Such communication may be through an input/output (I/O) interface. And, the electronic device may also communicate with one or more networks such as a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the Internet, through a network adapter. The network adapter communicates with other modules of the electronic device via a bus. It should be appreciated that although not shown, other hardware and/or software modules may be used in connection with an electronic device, including but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID systems, tape drives, data backup storage systems, and the like.
From the above description of embodiments, those skilled in the art will readily appreciate that the example embodiments described herein may be implemented in software, or may be implemented in software in combination with the necessary hardware. Thus, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (may be a CD-ROM, a U-disk, a mobile hard disk, etc.) or on a network, including several instructions to cause a computing device (may be a personal computer, a server, a terminal device, or a network device, etc.) to perform the method according to the embodiments of the present disclosure.
Embodiments of the present invention also provide a computer program product comprising program code for causing an electronic device to carry out the steps of the method according to the various exemplary embodiments of the invention as described in the specification, when said program product is run on the electronic device.
While certain specific embodiments of the invention have been described in detail by way of example, it will be appreciated by those skilled in the art that the above examples are for illustration only and are not intended to limit the scope of the invention. Those skilled in the art will also appreciate that many modifications may be made to the embodiments without departing from the scope and spirit of the invention.
Claims (6)
1. A method for determining a zone step length, the method comprising the steps of:
S100, acquiring the first time of executing a first preset task and the second time of executing a second preset task of each target historical user corresponding to a target area to obtain a time data set list T= (T 1,T2,…,Ti,…,Tn), i=1, 2, … and n; wherein T i is the time data set corresponding to the ith target historical user, and n is the number of the target historical users; t i=（Ti,1,Ti,2）,Ti,1 is the first time corresponding to the ith target historical user, and T i,2 is the second time corresponding to the ith target historical user; the target historical user is a historical user executing a preset action within a preset time period before the corresponding target task is ended; the first preset task and the second preset task are associated different preset tasks;
S200, determining the initial walking time corresponding to each target historical user according to T to obtain an initial walking time list CT= (CT 1,CT2,…,CTi,…,CTn); wherein, CT i is the initial walking time corresponding to the first target history user; CT i=Ti,2-Ti,1 -TE, TE is a preset correction time length;
S300, determining target historical users corresponding to each preset subarea in the target area according to the preset subarea data corresponding to each target historical user to obtain a target historical user list set QW= (QW 1,QW2,…,QWj,…,QWm), j=1, 2, … and m; the target historical user list QW j comprises all target historical users corresponding to the j-th preset subarea in the target area, and m is the number of the preset subareas in the target area;
S400, determining an initial walking time list set HT= (HT 1,HT2,…,HTj,…,HTm) of the subarea according to CT and QW; wherein, HT j is the sub-region initial walking time list corresponding to QW j; HT j=（HTj,1,HTj,2,…,HTj,r,…,HTj,f（j））,r=1,2,…,f（j）;HTj,r is the initial walking time length of the r target historical user in the sub-region initial walking time length list corresponding to QW j, and f (j) is the number of initial walking time lengths in the sub-region initial walking time length list corresponding to QW j;
S500, traversing HT, and if f (j) is not less than NE, determining a target walking time corresponding to QW j according to HT j; NE is a preset threshold value of the number of walking time;
Step S500 includes the steps of:
S510, sorting all the initial walking time lengths in HT j according to the size of each initial walking time length in HT j to obtain an intermediate walking time length list YT j=（YTj,1,YTj,2,…,YTj,r,…,YTj,f（j） corresponding to HT j; wherein YT j,r is the r-th intermediate walking time length obtained by sequencing all the initial walking time lengths in HT j; YT j,k≥YTj,k+1; k=1, 2, …, f (j) -1;
S520, determining a first target value lq= (f (j) -1)/P according to f (j); wherein P is a preset average score; p is less than NE;
S530, if LQ is an integer, determining YT j,LQ as a target walking time corresponding to QW j; otherwise, a second target value xh= And a third target value ft=mod (LQ); wherein/>Mod () is a preset remainder function, which is a preset downward rounding function;
S540, determining target walking time length SC j=YTj,XH+（YTj,XH-YTj,XH+1) multiplied by FT corresponding to QW j according to YT j, XH and FT;
After step S500, the method further comprises the steps of:
s600, if f (j) < NE, acquiring a preset sub-region QW' j adjacent to the QW j;
s610, adding each initial walking time in the sub-region initial walking time list corresponding to QW 'j to HT j to obtain a supplementary initial walking time list HT' j corresponding to QW j;
s620, determining a target walking time length corresponding to the QW j according to the HT' j;
QW' j is determined by the following steps:
S601, determining a target walking time corresponding to each preset subarea according to QW to obtain a first target walking time list TU= (TU 1,TU2,…,TUj,…,TUm); TU j is the target walking time corresponding to QW j;
S602, deleting TU j in the TU to obtain a second target walking time list TU '= (TU' 1,TU'2,…,TU'a,…,TU'm-1), a=1, 2, …, m-1; TU' a is the a-th target walking time length in the second target walking time length list obtained by deleting TU j in TU;
S603, obtaining the walking time difference of each target walking time in TU j and TU' to obtain a first walking time difference list delta TU= (delta TU 1,ΔTU2,…,ΔTUa,…,ΔTUm-1); wherein Δtu a is the difference in walking time between TU j and TU' a; ΔTU a=|TUj-TU'a |;
s604, acquiring the minimum two walking time differences delta KA and delta KB in delta TU;
S605, if the absolute value of the preset subarea corresponding to the delta KA-delta KB is smaller than the absolute value of the PA, determining the preset subarea corresponding to the delta KA and the preset subarea corresponding to the delta KB as QW' j; otherwise, acquiring a first target walking time difference mg=min (Δka, Δkb); PA is a preset difference threshold of the step length difference; MIN () is a preset minimum function;
s606, determining the preset subarea corresponding to the MG as QW' j.
2. The regional walking time length determination method according to claim 1, characterized in that after step S600 and before step S610, the method further comprises the steps of:
S607, acquiring the number NUM of initial walking time corresponding to QW' j;
S608, if NUM is more than or equal to NE, proceeding to step S610; otherwise, the preset walking time length corresponding to the QW j is determined as the target walking time length corresponding to the QW j.
3. The method for determining the walking time length of an area according to claim 1, wherein the time length of the preset time period is 5min.
4. The method for determining a walking time length of a region according to claim 1, wherein TE is 3min.
5. A non-transitory computer readable storage medium having stored therein at least one instruction or at least one program, wherein the at least one instruction or the at least one program is loaded and executed by a processor to implement the zone stride length determination method of any one of claims 1-4.
6. An electronic device comprising a processor and the non-transitory computer-readable storage medium of claim 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410175729.6A CN117726049B (en) | 2024-02-08 | 2024-02-08 | Regional walking time length determining method, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410175729.6A CN117726049B (en) | 2024-02-08 | 2024-02-08 | Regional walking time length determining method, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117726049A CN117726049A (en) | 2024-03-19 |
| CN117726049B true CN117726049B (en) | 2024-04-26 |
Family
ID=90207377
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410175729.6A Active CN117726049B (en) | 2024-02-08 | 2024-02-08 | Regional walking time length determining method, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117726049B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107111794A (en) * | 2015-01-11 | 2017-08-29 | 微软技术许可有限责任公司 | Prediction and the changeability using the travel time in Map Services |
| CN107331149A (en) * | 2016-04-29 | 2017-11-07 | 株式会社日立制作所 | The method and apparatus for predicting time of vehicle operation |
| JP2018205191A (en) * | 2017-06-06 | 2018-12-27 | 富士通株式会社 | Route search program, route search device, and route search method |
| CN112163701A (en) * | 2020-09-23 | 2021-01-01 | 佳都新太科技股份有限公司 | Station hub transfer management method and device |
| CN113536128A (en) * | 2021-07-22 | 2021-10-22 | 青岛海信网络科技股份有限公司 | Recommendation method for transportation hub transfer mode and electronic equipment |
-
2024
- 2024-02-08 CN CN202410175729.6A patent/CN117726049B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107111794A (en) * | 2015-01-11 | 2017-08-29 | 微软技术许可有限责任公司 | Prediction and the changeability using the travel time in Map Services |
| CN107331149A (en) * | 2016-04-29 | 2017-11-07 | 株式会社日立制作所 | The method and apparatus for predicting time of vehicle operation |
| JP2018205191A (en) * | 2017-06-06 | 2018-12-27 | 富士通株式会社 | Route search program, route search device, and route search method |
| CN112163701A (en) * | 2020-09-23 | 2021-01-01 | 佳都新太科技股份有限公司 | Station hub transfer management method and device |
| CN113536128A (en) * | 2021-07-22 | 2021-10-22 | 青岛海信网络科技股份有限公司 | Recommendation method for transportation hub transfer mode and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117726049A (en) | 2024-03-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10453448B2 (en) | Method and device for managing dialogue based on artificial intelligence | |
| US10832659B2 (en) | Intent authoring using weak supervision and co-training for automated response systems | |
| US10216834B2 (en) | Accurate relationship extraction with word embeddings using minimal training data | |
| CN105786796A (en) | Segmenting words using scaled probabilities | |
| US11401698B2 (en) | Method and apparatus for controlling excavator | |
| CN112527281B (en) | Operator upgrading method and device based on artificial intelligence, electronic equipment and medium | |
| US20220108147A1 (en) | Predictive microservices activation using machine learning | |
| US20210018326A1 (en) | Arrival predictions based on destination specific model | |
| CN117726049B (en) | Regional walking time length determining method, electronic equipment and storage medium | |
| CN113947095A (en) | Multilingual text translation method and device, computer equipment and storage medium | |
| CN116235246A (en) | Speech response system-personalized linguistic AI engine based on personalized vocabulary and user profile | |
| US20210263771A1 (en) | Method, device and computer program product for determining execution progress of task | |
| US20090132444A1 (en) | Constrained line search optimization for discriminative training of hmms | |
| CN109670124A (en) | A kind of method for page jump, device, equipment and storage medium | |
| CN113421646A (en) | Method and device for predicting duration of illness, computer equipment and storage medium | |
| US20230169389A1 (en) | Domain adaptation | |
| Qiu et al. | Mining frequent trajectory patterns in road network based on similar trajectory | |
| CN108768742A (en) | Network establishing method and device, electronic equipment, storage medium | |
| CN114067792A (en) | Control method and device of intelligent equipment | |
| CN116962086B (en) | File security detection method and system | |
| CN113917919B (en) | Control method and control device for interaction between protection net and mobile robot | |
| KR102446565B1 (en) | Method, device and system for management and processing service request | |
| CN114417462B (en) | Control method and control device of building dismantling machine based on Internet of things regulation and control | |
| CN116962087B (en) | Auxiliary information distribution method, electronic equipment and storage medium | |
| CN111145866B (en) | Dose determination method, device, computer equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |