CN113781132A - Online shopping guide method and device - Google Patents
Online shopping guide method and device Download PDFInfo
- Publication number
- CN113781132A CN113781132A CN202010543102.3A CN202010543102A CN113781132A CN 113781132 A CN113781132 A CN 113781132A CN 202010543102 A CN202010543102 A CN 202010543102A CN 113781132 A CN113781132 A CN 113781132A
- Authority
- CN
- China
- Prior art keywords
- user
- grid
- site
- determining
- value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 53
- 238000009877 rendering Methods 0.000 claims abstract description 16
- 238000013507 mapping Methods 0.000 claims description 19
- 238000004422 calculation algorithm Methods 0.000 claims description 8
- 238000004590 computer program Methods 0.000 claims description 5
- 230000008569 process Effects 0.000 description 17
- 238000010586 diagram Methods 0.000 description 16
- 238000004891 communication Methods 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 239000002184 metal Substances 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 229920000642 polymer Polymers 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0639—Item locations
-
- 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/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Radar, Positioning & Navigation (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Remote Sensing (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Accounting & Taxation (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Finance (AREA)
- General Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Automation & Control Theory (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Navigation (AREA)
Abstract
The application provides an online shopping guide method and device, wherein the method comprises the following steps: when a request that a user sends a query to reach a path of a selected item is received, acquiring a plan view of an online store to which the item belongs; the plan is divided into grids according to a preset step length, and the attribute information of the grids comprises: the site and status; determining the position of the corresponding grid of the article in the plan; acquiring the current position information of the user, and determining the position of a grid corresponding to the user in the plan according to the current position information of the user; determining a shortest path between a site corresponding to the user and a site corresponding to the article based on the sites of the grid whose state is passable; and rendering the locus passed by the shortest path to the shortest path, and outputting the shortest path to the user. The method can reduce the cost and improve the user experience.
Description
Technical Field
The invention relates to the technical field of internet, in particular to an online shopping guide method and device.
Background
At present, some off-line store shopping guide is completed manually, and the store needs to bear corresponding cost by configuring a relative number of shopping guide personnel based on the size of the scale of the store and the specificity of goods.
Because the income of the shopping guide personnel is influenced by the commodity transaction rate, excessive recommendation to the user exists, and the user is lost; as the shopping guide personnel need to memorize a large amount of information, errors can be made in the shopping guide process, and the experience of the user and the commodity transaction rate in stores are reduced.
In the process of realizing the application, the inventor finds that the offline shopping guide mode increases the operation cost of stores, and the user experience is low.
Disclosure of Invention
In view of this, the present application provides an online shopping guide method and apparatus, which can reduce cost and improve user experience.
In order to solve the technical problem, the technical scheme of the application is realized as follows:
in one embodiment, there is provided an online shopping guide method, comprising:
when a request that a user sends a query to reach a path of a selected item is received, acquiring a plan view of an online store to which the item belongs; the plan is divided into grids according to a preset step length, and the attribute information of the grids comprises: the site and status;
determining the position of the corresponding grid of the article in the plan;
acquiring the current position information of the user, and determining the position of a grid corresponding to the user in the plan according to the current position information of the user;
determining a shortest path between a site corresponding to the user and a site corresponding to the article based on the sites of the grid whose state is passable;
and rendering the locus passed by the shortest path to the shortest path, and outputting the shortest path to the user.
In another embodiment, there is provided an online shopping guide apparatus, including: the device comprises a receiving unit, an acquisition unit, a first determination unit, a second determination unit, a third determination unit, a rendering unit and an output unit;
the receiving unit is used for receiving a request;
the acquiring unit is used for acquiring a plan view of an offline store to which the item belongs when the receiving unit receives a request that a user sends an inquiry to reach a path of the selected item; the plan is divided into grids according to a preset step length, and the attribute information of the grids comprises: the site and status;
the first determining unit is configured to determine a position of a grid corresponding to the article in the plan view acquired by the acquiring unit;
the second determining unit is configured to acquire current location information of the user, and determine, according to the current location information of the user, a location of a grid corresponding to the user in the plan acquired by the acquiring unit;
the third determining unit is configured to determine, based on the location of the grid whose state is passable, a shortest path between the location corresponding to the user determined by the first determining unit and the location corresponding to the article determined by the second determining unit;
the rendering unit is configured to render the shortest path from the position point through which the shortest path determined by the third determining unit passes;
and the output unit is used for outputting the shortest path rendered by the rendering unit to the user.
In another embodiment, an electronic device is provided that includes a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the online shopping guide method when executing the program.
In another embodiment, a computer-readable storage medium is provided, having stored thereon a computer program, which when executed by a processor, performs the steps of the online shopping guide method.
According to the technical scheme, the shortest path between the user position information and the position information of the article is determined by positioning the position information of the user and the position information of the article selected by the user, and the position point of the grid corresponding to the configured plan and the state of the grid, and is recommended to the user, so that an online shopping guide mode based on offline stores is realized, the cost can be reduced, and the user experience is improved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive labor.
FIG. 1 is a schematic diagram of an online shopping guide system according to an embodiment of the present application;
FIG. 2 is a schematic diagram of an online shopping guide process according to an embodiment of the present application;
FIG. 3 is a schematic diagram of an online shopping guide process according to an embodiment of the present application;
FIG. 4 is a schematic diagram of a process for determining a shortest path according to an embodiment of the present application;
fig. 5 is a schematic diagram of determining a location a of a user and a location B corresponding to an article in a plan view in an embodiment of the present application;
fig. 6 is a schematic diagram of identification of a site in a grid adjacent to a grid corresponding to the site a in the embodiment of the present application;
FIG. 7 is a schematic diagram of sites involved in the path determination from site A to site B in the present example;
FIG. 8 is a schematic diagram of an apparatus for implementing the above technique in an embodiment of the present application;
fig. 9 is a schematic physical structure diagram of an electronic device according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims, as well as in the drawings, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are, for example, capable of operation in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprising" and "having," as well as any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements explicitly listed, but may include other steps or elements not explicitly listed or inherent to such process, method, article, or apparatus.
The technical solution of the present invention will be described in detail with specific examples. Several of the following embodiments may be combined with each other and some details of the same or similar concepts or processes may not be repeated in some embodiments.
The embodiment of the application provides an online shopping guide method which is applied to a scene of online shopping guide for offline stores.
Referring to fig. 1, fig. 1 is a schematic view of an online shopping guide system in an embodiment of the present application. The system comprises: the system comprises a user using end, a store management end and a server end;
the user using end provides an interface for selecting articles for the user, and the user can directly search by browsing or search for required articles; after the user selects an item, a query may be sent for a path to the selected item to obtain the item; in practical application, the store can also recommend the articles for the user at the user end in a recommending and promoting way.
The store management end maintains and manages the position information and the mapping relation according to the changes of shelves, articles and even wall bodies of the whole store on a plan view of the store; such as the management of the related information of the position change of the article, the addition of new article, the reduction of article, the movement of the shelf, the addition of the shelf, the reduction of the shelf, etc.
Each store can independently generate a required plan according to actual needs. The specific process of generating the plan of the offline store is as follows:
the size of the plan is matched with the actual area of the store, and the plan is subjected to grid division according to a preset step length, such as a square, a rectangle and the like with fixed length, which is not limited in the embodiment of the application, and the square is taken as an example below; the preset step size can also be selected according to the actual arrangement of the store, which is not limited in the embodiment of the present application.
Each mesh has its own attribute information: the site and status;
the location points are coordinates of grids, each grid can comprise a plurality of coordinates according to the setting of the preset step length, and in specific implementation, the coordinates of the same position are selected as the location points of the grids for different grids, such as the coordinates of the central point of the grid and one vertex of the grid.
Any point in the plane graph can be used as a coordinate origin, and for convenience, the coordinates of the upper left vertex or the lower left vertex can be selected as the origin to determine the position of each grid;
the state of the grids is a passable state and an impassable state, wherein the grids corresponding to the passable state are grids capable of walking through, and the grids corresponding to the impassable state are grids corresponding to the positions of walls, placed articles or shelves.
The mapping relation between the grids and the goods shelves and the walls can be configured;
if the goods are placed on the goods shelf, the placing position of the goods on the goods shelf is set, and the placing position can be front, back, upper, lower and the like of the goods shelf.
If the article is placed on the ground, the placement position does not need to be configured.
In specific implementation, a store manager can mark the attribute information of each grid in batches according to the actual shelf placement position, the article placement position, the store boundary parameters and other reference systems of the store.
Such as shelf placement positions, article placement positions and the like can be placed at corresponding positions of the plane graph in a dragging mode, and then the attribute information of the grids is recorded.
The method further comprises:
when any one of the following information in the store is updated, the mapping relation between the article and the grid state information are reset:
item updates, shelf updates, wall updates.
The server analyzes the related content of the shop floor plan, the attribute information of the grids and the like and the mapping relation between the articles and the grids, and calculates the shortest path between the two sites; and responding the shortest path to the user using end, and pushing the related information of the recommended and promoted articles to the user using end.
The process of implementing online shopping guide by the server in the embodiment of the present application is described in detail below with reference to the accompanying drawings.
Example one
Referring to fig. 2, fig. 2 is a schematic diagram of an online shopping guide process according to an embodiment of the present application. The method comprises the following specific steps:
The user searches for the needed articles through browsing selection or searching selection at the client using end, and can send a request for inquiring a path reaching the selected articles to the server end through a mode of inputting related characters or through a set button.
If the item is selected in a searching mode, such as searching by using categories, the mapping relation between the item and the item category information also needs to be recorded.
Here, a plan view corresponding to the article is acquired, including attribute information of a grid of the plan view: the location and status.
The information corresponding to the plan comprises the mapping relation between the grids and the items in the offline store;
determining the positions of the corresponding grids of the article in the plan view in the step, which comprises the following steps:
determining a corresponding grid of the article in the plan according to the mapping relation;
and determining the corresponding position of the article according to the position of the grid.
The user can be positioned by the GPS, the corresponding grid is mapped in the plane map according to the positioned two-dimensional coordinate information, and the position point of the grid is used as the position point corresponding to the user.
When the shortest path between the two sites is determined, the grids with the states of being capable of being communicated are selected according to the states of the grids, and the shortest path calculation is carried out, so that a user can reach the position of the selected article along the calculated path.
And when the shortest path is output to the user, if the article corresponds to the placing position, the placing position of the article is output.
If the articles can be placed on the ground, the articles are placed on the ground; the goods can be placed on the goods shelf, and the placing positions of the goods are output according to the relation between the placing positions of the goods shelf and the goods, so that the user can conveniently and quickly obtain the goods.
In the embodiment, the shortest path between the user position information and the position information of the article is determined by positioning the position information of the user, the position information of the article selected by the user, the position point of the grid corresponding to the configured plan view and the state of the grid, and the shortest path is recommended to the user, so that an online shopping guide mode based on offline stores is realized, the cost can be reduced, and the user experience is improved.
Example two
Referring to fig. 3, fig. 3 is a schematic diagram of an online shopping guide process according to an embodiment of the present application. The method comprises the following specific steps:
The user searches for the needed articles through browsing selection or searching selection at the client using end, and can send a request for inquiring a path reaching the selected articles to the server end through a mode of inputting related characters or through a set button.
If the item is selected in a searching mode, such as searching by using categories, the mapping relation between the item and the item category information also needs to be recorded.
Here, a plan view corresponding to the article is acquired, including attribute information of a grid of the plan view: the location and status.
The information corresponding to the plan comprises the mapping relation between the grids and the items in the offline store;
determining the positions of the corresponding grids of the article in the plan view in the step, which comprises the following steps:
determining a corresponding grid of the article in the plan according to the mapping relation;
and determining the corresponding position of the article according to the position of the grid.
The user can be positioned by the GPS, the corresponding grid is mapped in the plane map according to the positioned two-dimensional coordinate information, and the position point of the grid is used as the position point corresponding to the user.
And step 304, based on the positions of the grid with the state of being capable of being passed, determining the shortest path between the position corresponding to the user and the position corresponding to the article by using a routing algorithm.
When the shortest path between the two sites is determined, the grids with the states of being capable of being communicated are selected according to the states of the grids, and the shortest path calculation is carried out, so that a user can reach the position of the selected article along the calculated path.
The specific implementation process of determining the shortest path between the location corresponding to the user and the location corresponding to the article by using a routing algorithm based on the location of the grid whose state is passable is as follows:
referring to fig. 4, fig. 4 is a schematic flowchart of determining a shortest path in the embodiment of the present application. The method comprises the following specific steps:
The first set stores sites of the grid that may or may not pass along the way.
If the parent node of the current site is the site C, because the site D of the grid adjacent to the grid corresponding to the current site exists in the first set and the current G value of the site D is greater than the G value recalculated by the current site, the site D is updated to the parent node of the current site and the F value of the site D is recalculated, that is, the G value of the site D is updated to the G value recalculated by the current site, thereby obtaining the updated F value.
If the current G value of site D is 24 and the G value recalculated while passing through the current node is 14, the F value of site D is calculated using the G value of 14.
The second set is used to store the processed sites, i.e., the sites that are past the current site.
Determining an F value corresponding to the locus, comprising:
determining an F value as the sum of a G value and an H value, wherein the G value is a movement cost corresponding to the movement from a position corresponding to a user to the position where the F value is determined; the H value is the estimated cost of moving from the location at which the F value was determined to the location corresponding to the item.
Determination of H value heuristics are used in the examples of the present application, but other methods may be used, which are not limited in the examples of the present application.
And step 408, determining the position with the minimum F value as the current position.
When the minimum F value is determined, if the minimum F value corresponds to a plurality of sites, determining that the site added to the first set last is the site with the minimum F value.
The following describes a process for determining a shortest path in an embodiment of the present application with specific examples, with reference to the accompanying drawings:
referring to fig. 5, fig. 5 is a schematic diagram of determining a location a of a user and a location B corresponding to an article in a plan view in the embodiment of the present application.
In fig. 5, a point a is a point of a user, and a point B is a point corresponding to an article; the three black meshes in fig. 5 are non-passable meshes, and the non-black meshes are passable meshes.
Initially, the first set and the second set are empty sets.
The process of determining the shortest path from location a to location B in this embodiment is as follows:
the method comprises the following steps that firstly, a site A is added into a first set as a current site, and the site A is moved into a second set as the site A does not need to be subjected to father node updating.
The first group of users deposits locations along the grid that may or may not pass by.
The second set stores the processed nodes, i.e., the nodes that have been the current nodes.
Second, adding sites (sites A1, A2, A3, A4, A5, A6, A7, and A8) adjacent to the grid corresponding to site A, which are passable and not in the grids of the first and second sets, to the first set, and setting site A as a parent node of the sites added to the first set.
Referring to fig. 6, fig. 6 is a schematic diagram illustrating the identification of a site in a grid adjacent to a grid corresponding to the site a in the embodiment of the present application.
In fig. 6, position a1, position a2, position A3, position a4, position a5, position a6, position a7 and position A8.
The neighboring cells of one cell in the embodiment of the present application refer to eight neighboring cells of the cell.
Third, the position of the grid adjacent to the grid corresponding to the position a in the first set and having the smallest F value is determined as a position a 5.
Determining the corresponding F value of each site, comprising:
determining an F value as the sum of a G value and an H value, wherein the G value is a movement cost corresponding to the position (position point A) moved from a position corresponding to a user to the position with the determined F value; the H value is the estimated cost of moving from the location at which the F value was determined to the location corresponding to the item (location B).
The G, H and F values for each site are given below:
for simplicity, in the embodiment of the present application, the moving cost of the transverse direction and the longitudinal direction is set to 10, and the moving cost of the diagonal line is 14, because the actual diagonal moving distance is the square root of 2, or is approximately 1.414 times of the moving cost of the transverse direction or the longitudinal direction, so that the calculation is convenient and simple by using 10 and 14, and the calculation can be performed according to the proportional relation of the square roots of 1 and 2.
For the grid corresponding to the point a, the G value corresponding to the point of the grid adjacent in the horizontal direction or the vertical direction is 10, and the G values corresponding to the points of the grid adjacent in the diagonal direction are 14.
The H value is obtained by estimating the distance of site a from site B, moving only laterally and longitudinally, and ignoring the impassable grid. Thus, if the distance from the point A5 to the point B is 3 squares, the H value is determined to be 30, the distance from the point A3 to the point B is 4 squares, and the H value is determined to be 40, the F value, the G value and the H value corresponding to the following points are calculated based on the algorithm:
position A1 having a G value of 14, H value of 60 and F value of 74;
position A2 having a G value of 10, an H value of 50 and an F value of 60;
position A3 having a G value of 14, H value of 40 and F value of 54;
position A4 having a G value of 10, an H value of 50 and an F value of 60;
position A5 having a G value of 10, H value of 30 and F value of 40;
position A6 having a G value of 14, H value of 60 and F value of 74;
position A7 having a G value of 10, an H value of 50 and an F value of 60;
the G value at site A8 is 14, H value is 40 and F value is 54.
From the values of the above adjacent sites, the site having the smallest F value was identified as site A5.
Fourthly, taking the site A5 as a current site, and determining that the parent node of the site A5 does not need to be updated; move site A5 into the second pool.
Since site a2, site A3, site a7 and site A8 are already in the first set, and it is necessary to check which of the paths reached through these sites a2, A3, a7 or A8 added to the first set is more optimal, in the embodiment of the present application, a G value is used for determining, taking site A3 as an example, which now has a G value of 14, and if site A3 is reached through the current grid (the grid corresponding to site a 5), the G value will be 20, obviously 20 is greater than 14, and thus is not a more optimal path;
g value judgment is carried out on the site A2, the site A7 and the site A8, and the judgment is not a more optimal path, so that the parent node of the site A5 does not need to be updated.
The sites currently included in the second set are: A. a5.
Fifth, since the sites adjacent to the grid corresponding to site a5, accessible, and not present in the grids of the first and second sets, the sites that already exist in the first set and adjacent to site a5 (site a2, site A3, site a7, and site A8) are used to determine the site with the smallest F value.
The sites of the grid adjacent to the grid corresponding to site a5 are site a, site a2, site A3, site a7, site A8, and the sites corresponding to the three black grids;
wherein site a is already in the second set and no additional first binding is required, site a2, site A3, site a7, and site A8 are already in the first set and no additional first set is required, and the three black squares are non-passable squares, and therefore sites corresponding to the three black squares are also not required to be added to the first set.
And it has been calculated that the F values for position a2, position A3, position a7 and position A8 are as follows:
position A2 having a G value of 10, an H value of 50 and an F value of 60;
position A3 having a G value of 14, H value of 40 and F value of 54;
position A7 having a G value of 10, an H value of 50 and an F value of 60;
the G value at site A8 is 14, H value is 40 and F value is 54.
Sixthly, determining that the position A8 is the position with the minimum F value as the current position, determining that the position of the grid corresponding to the position A8 in the first set is A7, and determining that the G value of the position A7 passing through the position A8 is larger than the original value of the position A7, determining that the parent node of the position A8 does not need to be updated, and moving the position A8 into the second set.
Referring to fig. 7, fig. 7 is a schematic diagram of sites involved in the path determination from site a to site B in the present embodiment.
From the F values at position a2, position A3, position a7 and position A8 it can be seen that the F values at position A3 and position A8 are the same, for which case position A8 added after the first set (in this example position A8 is added after position A3 to the first set) is selected as the position with the smallest F value.
The sites currently included in the second set are: A. a5 and A8.
Seventh, adding sites (sites A9, A10) that are adjacent to the grid corresponding to site A8, that are feasible and not in the grids of the first and second sets to the first set, and setting site A8 as a parent node of site A9 and site A10.
The grid adjacent to the grid corresponding to the site A8 includes: site a, site a5, site a7, site a9, site a10, and black squares to the right and upper right of the grid corresponding to site A8;
where site a, site a5 are in the second set, site a7 is in the first set, and two black grids are not accessible, site a11 is a grid under the wall that cannot be moved directly from the current square to that square without crossing the corner, and therefore, needs to go down first and then to that square, with the collection going around the corner.
Thus, positions A9, A10 were added to the first pool.
And eighthly, determining F values corresponding to the later added position A9 and the position A10, and taking the position A10 as the current position because the F value corresponding to the position A10 is the minimum.
The sites of the lattice adjacent to the lattice corresponding to site A8 in the first set are site a7, site a9, site a 10;
since site a7 previously existed in the first pool, site a9, site a10 are current, i.e. sites added to the first pool later; the F value corresponding to position A7 is not taken into account.
F values at position a9 and position a10 are as follows:
position A9 having a G value of 20, H value of 60 and F value of 80;
the G value at position A10 is 24, H50 and F74.
The ninth step, moving site a10 into the second set, determining that the parent node of site a10 does not need to be updated, and adding a site that is adjacent to the grid corresponding to site a10, is passable, and is not on the grids of the first and second sets (site a11) into the first set, setting site a10 to be the parent node of site a 11.
And step ten, determining the site A11 as the site with the minimum F value as the current node, and adding the current node into the second set.
The eleventh step adds sites (sites a12 and a13) that are adjacent to the grid corresponding to site a11, that are feasible and not in the grids of the first and second sets to the first set, and sets site a11 to be the parent of site a12 and site a 13.
And a twelfth step of determining the site A13 as the site with the minimum F value, taking the site as the current node, and adding the current node into the second set.
A thirteenth step of adding sites (sites a14 and a15) adjacent to the grid corresponding to site a13, accessible and not in the grids of the first and second sets, to the first set, and setting site a13 as a parent node of site a14 and site a 15.
And fourteenth, determining the site A14 as the site with the minimum F value, taking the site as the current node, and adding the current node into the second set.
Fifteenth, adding sites (sites a16, a17, a18, a19, and B) adjacent to the grid corresponding to site a14, that are accessible and not in the grids of the first set and the second set to the first set, and setting site a14 to be a parent node of site a16, site a17, site a18, site a19, and site B.
Sixthly, determining the position B as the position with the minimum F value, taking the position B as the current node, and adding the position B into the second set.
The tenth to sixteenth steps determine the rule of the current location and determine whether to update the parent node of the current location similarly to other current locations, which is not described in detail in the embodiments of the present application.
Seventeenth, determining the position B as the position corresponding to the article, and finishing the path determination.
The sites in the second set include: site a, site a5, site A8, site a10, site a11, site a13, site a14, site B.
Eighteen, gradually searching corresponding father nodes from the position points corresponding to the articles until the position points corresponding to the users are searched, and generating the shortest path between the position points corresponding to the users and the position points corresponding to the articles by using the searched father nodes.
Through the steps, the father node of the site B is the site A14, the father node of the site A14 is the site A13, the father node of the site A13 is the site A11, the father node of the site A11 is the site A10, the father node of the site A10 is the site A8, the father node of the site A8 is the site A5, and the father node of the site A5 is the site A.
The determined shortest path sequentially passes through the following positions: site a, site a5, site A8, site a10, site a11, site a13, site a14, site B.
When the parent node of the current node is not updated in the route searching process, the shortest path can be directly generated by using the position points in the second set.
Thus, the shortest path is determined.
In the embodiment, the shortest path between the user position information and the position information of the article is determined by positioning the position information of the user and the position information of the article selected by the user, and the position point of the grid corresponding to the configured plan view and the state of the grid through a routing algorithm, and is recommended to the user, so that an online shopping guide mode based on offline stores is realized, the cost can be reduced, and the user experience is improved.
The online shopping guide can provide an accurate route for the user, so that the list rate of articles in stores can be improved;
due to the fact that online shopping guide is adopted, a line is objectively provided for the user, excessive recommendation of the online shopping guide to the user is avoided, and user experience can be improved.
The overall control of the shopping process by the user is improved, so that the viscosity of the customer is improved.
Based on the same inventive concept, the embodiment of the application also provides an online shopping guide device. Referring to fig. 8, fig. 8 is a schematic structural diagram of an apparatus applied to the above technology in the embodiment of the present application. The device comprises: a configuration unit 801, a receiving unit 802, an acquisition unit 803, a first determination unit 804, a second determination unit 805, a third determination unit 806, a rendering unit 807, and an output unit 808;
a configuration unit 801, configured to perform mesh division on the planar graph according to a preset step length, where the attribute information of the mesh includes: the site and status;
a receiving unit 802, configured to receive a request;
an obtaining unit 803, configured to obtain a plan view configured by the configuration unit 801 of an offline store to which an item belongs when the receiving unit 802 receives a request that a user sends an inquiry to reach a route of the selected item;
a first determining unit 804, configured to determine a location of a grid corresponding to the article in the plan view acquired by the acquiring unit 803;
a second determining unit 805, configured to obtain current location information of the user, and determine, according to the current location information of the user, a location of a grid corresponding to the user in the plan view obtained by the obtaining unit 803;
a third determining unit 806, configured to determine, based on the location of the grid whose state is passable, a shortest path between the location corresponding to the user determined by the first determining unit 804 and the location corresponding to the item determined by the second determining unit 805;
a rendering unit 807 for rendering the locus through which the shortest path determined by the third determining unit 806 passes to the shortest path;
an output unit 808, configured to output the shortest path rendered by the rendering unit 807 to the user.
Preferably, the first and second liquid crystal films are made of a polymer,
a configuration unit 801, further configured to configure a mapping relationship between the grid in the plan view and the items in the offline store;
a first determining unit 804, specifically configured to determine, according to the mapping relationship configured by the configuration unit 801, a grid corresponding to the article in the plan view; and determining the corresponding position of the article according to the position of the grid.
Preferably, the first and second electrodes are formed of a metal,
the configuration unit 801 is further used for configuring the mapping relationship between the grids and the shelves and the walls; if the articles are placed on the goods shelf, setting the placing positions of the articles on the goods shelf;
an output unit 808, further configured to output the placement position of the article if the configuration unit 808 configures the placement position corresponding to the article when the shortest path is output to the user.
The configuration unit 801 is further configured to reset the mapping relationship between the items and the grid state information when any one of the following information in the store is updated: item updates, shelf updates, wall updates.
Preferably, the first and second electrodes are formed of a metal,
the third determining unit 806 is specifically configured to determine a shortest path by using a routing algorithm when determining the shortest path between the location corresponding to the user and the location corresponding to the article.
The units of the above embodiments may be integrated into one body, or may be separately deployed; may be combined into one unit or further divided into a plurality of sub-units.
In another embodiment, an electronic device is also provided, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, and the processor implements the steps of the online shopping guide method when executing the program.
In another embodiment, a computer-readable storage medium is also provided having stored thereon computer instructions that, when executed by a processor, may implement the steps in the online shopping guide method.
Fig. 9 is a schematic physical structure diagram of an electronic device according to an embodiment of the present application. As shown in fig. 9, the electronic device may include: a Processor (Processor)910, a communication Interface (Communications Interface)920, a Memory (Memory)930, and a communication bus 940, wherein the Processor 910, the communication Interface 920, and the Memory 930 communicate with each other via the communication bus 940. Processor 910 may invoke logic instructions in memory 930 to perform the following method:
when a request that a user sends a query to reach a path of a selected item is acquired, acquiring a plan view of an online store to which the item belongs; the plan is divided into grids according to a preset step length, and the attribute information of the grids comprises: the site and status;
determining the position of the corresponding grid of the article in the plan;
acquiring the current position information of the user, and determining the position of a grid corresponding to the user in the plan according to the current position information of the user;
determining a shortest path between a site corresponding to the user and a site corresponding to the article based on the sites of the grid whose state is passable;
and rendering the locus passed by the shortest path to the shortest path, and outputting the shortest path to the user.
Furthermore, the logic instructions in the memory 930 may be implemented in software functional units and stored in a computer readable storage medium when the logic instructions are sold or used as independent products. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (11)
1. An online shopping guide method, comprising:
when a request that a user sends a query to reach a path of a selected item is received, acquiring a plan view of an online store to which the item belongs; the plan is divided into grids according to a preset step length, and the attribute information of the grids comprises: the site and status;
determining the position of the corresponding grid of the article in the plan;
acquiring the current position information of the user, and determining the position of a grid corresponding to the user in the plan according to the current position information of the user;
determining a shortest path between a site corresponding to the user and a site corresponding to the article based on the sites of the grid whose state is passable;
and rendering the locus passed by the shortest path to the shortest path, and outputting the shortest path to the user.
2. The method of claim 1, further comprising:
configuring a mapping relationship of a grid in a plan view and items in the offline store;
the determining the position of the corresponding grid of the article in the plan view comprises:
determining a corresponding grid of the article in the plan according to the mapping relation;
and determining the corresponding position of the article according to the position of the grid.
3. The method of claim 2, wherein when configuring the mapping of the grid in the floor plan to the items in the offline store, the method further comprises:
configuring the mapping relation between grids and the goods shelves and the walls;
if the articles are placed on the goods shelf, setting the placing positions of the articles on the goods shelf;
and when the shortest path is output to the user, if the article corresponds to the placing position, the placing position of the article is output.
4. The method of claim 3, further comprising:
when any one of the following information in the store is updated, the mapping relation between the article and the grid state information are reset:
item updates, shelf updates, wall updates.
5. The method of claim 1, wherein determining the shortest path between the location corresponding to the user and the location corresponding to the item uses a routing algorithm to determine the shortest path.
6. The method of claim 5, wherein determining the shortest path using a routing algorithm comprises:
step 1, acquiring a site corresponding to a user as a current site, and adding the current site into a first set;
step 2, determining whether grid positions adjacent to the grid corresponding to the current position exist in the first set, and if so, executing step 3, wherein the current G values of the grid positions adjacent to the current position are larger than the G values recalculated by the current position; otherwise, executing step 4;
step 3, updating the position points with the current G value larger than the G value recalculated with the current position point to be father nodes of the current position point, and recalculating the F value of the father nodes of the current position point after updating;
step 4, moving the current position point into a second set;
step 5, determining whether a position of a grid which is adjacent to the grid corresponding to the current position, can be passed through and is not in the first set and the second set exists in the plan, if so, executing step 6; otherwise, executing step 7;
step 6, adding the positions of grids which are adjacent to the grids corresponding to the current position in the plan view, can be passed and are not in the first set and the second set into the first set, and setting the current position as a father node of the position which is newly added into the first set; determining the F value corresponding to the site newly added into the first set; executing the step 8;
step 7, obtaining an F value corresponding to a position point of a grid adjacent to the grid corresponding to the current position point in the first set;
step 8, determining the position with the minimum F value as the current position;
step 9, determining whether the current position is the position of the grid corresponding to the article; if yes, executing step 10; otherwise, executing step 2;
step 10, moving the current location point into the second set, gradually searching the corresponding father node from the location point corresponding to the article until the location point corresponding to the user is found, and generating the shortest path between the location point corresponding to the user and the location point corresponding to the article by using the found father node.
7. The method of claim 6,
determining an F value corresponding to the locus, comprising: determining an F value as the sum of a G value and an H value, wherein the G value is a movement cost corresponding to the movement from a position corresponding to a user to the position where the F value is determined; the H value is the estimated cost of moving from the location where the F value is determined to the location corresponding to the item;
the method further comprises:
when determining the position corresponding to the minimum F value, if the F values corresponding to the positions of the two grids are the same and the corresponding F value in the positions of the grids adjacent to the current position is the minimum, determining the position added into the first set after determination as the position with the minimum F value.
8. An online shopping guide device, comprising: the device comprises a receiving unit, an acquisition unit, a first determination unit, a second determination unit, a third determination unit, a rendering unit and an output unit;
the receiving unit is used for receiving a request;
the acquiring unit is used for acquiring a plan view of an offline store to which the item belongs when the receiving unit receives a request that a user sends an inquiry to reach a path of the selected item; the plan is divided into grids according to a preset step length, and the attribute information of the grids comprises: the site and status;
the first determining unit is configured to determine a position of a grid corresponding to the article in the plan view acquired by the acquiring unit;
the second determining unit is configured to acquire current location information of the user, and determine, according to the current location information of the user, a location of a grid corresponding to the user in the plan acquired by the acquiring unit;
the third determining unit is configured to determine, based on the location of the grid whose state is passable, a shortest path between the location corresponding to the user determined by the first determining unit and the location corresponding to the article determined by the second determining unit;
the rendering unit is configured to render the shortest path from the position point through which the shortest path determined by the third determining unit passes;
and the output unit is used for outputting the shortest path rendered by the rendering unit to the user.
9. The apparatus of claim 8,
the third determining unit is specifically configured to determine a shortest path by using a routing algorithm when determining the shortest path between the location corresponding to the user and the location corresponding to the article.
10. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method according to any of claims 1-7 when executing the program.
11. A computer-readable storage medium, on which a computer program is stored, which program, when being executed by a processor, is adapted to carry out the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010543102.3A CN113781132A (en) | 2020-06-15 | 2020-06-15 | Online shopping guide method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010543102.3A CN113781132A (en) | 2020-06-15 | 2020-06-15 | Online shopping guide method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113781132A true CN113781132A (en) | 2021-12-10 |
Family
ID=78835018
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010543102.3A Pending CN113781132A (en) | 2020-06-15 | 2020-06-15 | Online shopping guide method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113781132A (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2010151539A (en) * | 2008-12-24 | 2010-07-08 | Mic Ware:Kk | Map information processing device, method for processing map information, and program |
| CN103697895A (en) * | 2014-01-09 | 2014-04-02 | 西安电子科技大学 | Method for determining optimal path of flight vehicle based on self-adaptive A star algorithm |
| CN104008670A (en) * | 2014-06-10 | 2014-08-27 | 山东建筑大学 | Path planning system in garage and path planning method |
| CN104199878A (en) * | 2014-08-21 | 2014-12-10 | 西安闻泰电子科技有限公司 | Game engine shortest path search method and game engine system |
| CN105469166A (en) * | 2015-12-30 | 2016-04-06 | 西安理工大学 | Supermarket shopping guide system based on wifi indoor positioning technology |
| CN107687859A (en) * | 2017-09-06 | 2018-02-13 | 电子科技大学 | Most short method for searching based on A star algorithms |
| CN109978243A (en) * | 2019-03-12 | 2019-07-05 | 北京百度网讯科技有限公司 | Track of vehicle planing method, device, computer equipment, computer storage medium |
| CN110309437A (en) * | 2019-06-26 | 2019-10-08 | 京东数字科技控股有限公司 | A kind of information-pushing method and device |
| CN110399997A (en) * | 2018-11-02 | 2019-11-01 | 北京京东尚科信息技术有限公司 | Paths planning method, system, electronic equipment, the storage medium of more transit points |
| CN110717003A (en) * | 2019-09-27 | 2020-01-21 | 四川长虹电器股份有限公司 | Intelligent shopping cart autonomous navigation and automatic following method based on path planning |
| CN110930180A (en) * | 2019-11-04 | 2020-03-27 | 苏宁云计算有限公司 | Data analysis method and system based on regional membership marketing scene and computer equipment |
-
2020
- 2020-06-15 CN CN202010543102.3A patent/CN113781132A/en active Pending
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2010151539A (en) * | 2008-12-24 | 2010-07-08 | Mic Ware:Kk | Map information processing device, method for processing map information, and program |
| CN103697895A (en) * | 2014-01-09 | 2014-04-02 | 西安电子科技大学 | Method for determining optimal path of flight vehicle based on self-adaptive A star algorithm |
| CN104008670A (en) * | 2014-06-10 | 2014-08-27 | 山东建筑大学 | Path planning system in garage and path planning method |
| CN104199878A (en) * | 2014-08-21 | 2014-12-10 | 西安闻泰电子科技有限公司 | Game engine shortest path search method and game engine system |
| CN105469166A (en) * | 2015-12-30 | 2016-04-06 | 西安理工大学 | Supermarket shopping guide system based on wifi indoor positioning technology |
| CN107687859A (en) * | 2017-09-06 | 2018-02-13 | 电子科技大学 | Most short method for searching based on A star algorithms |
| CN110399997A (en) * | 2018-11-02 | 2019-11-01 | 北京京东尚科信息技术有限公司 | Paths planning method, system, electronic equipment, the storage medium of more transit points |
| CN109978243A (en) * | 2019-03-12 | 2019-07-05 | 北京百度网讯科技有限公司 | Track of vehicle planing method, device, computer equipment, computer storage medium |
| CN110309437A (en) * | 2019-06-26 | 2019-10-08 | 京东数字科技控股有限公司 | A kind of information-pushing method and device |
| CN110717003A (en) * | 2019-09-27 | 2020-01-21 | 四川长虹电器股份有限公司 | Intelligent shopping cart autonomous navigation and automatic following method based on path planning |
| CN110930180A (en) * | 2019-11-04 | 2020-03-27 | 苏宁云计算有限公司 | Data analysis method and system based on regional membership marketing scene and computer equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104992241B (en) | A kind of picking path generating method, generating means and corresponding Warehouse Management System | |
| US20180218441A1 (en) | System for providing optimal shopping routes in retail store and method of using same | |
| US10102564B2 (en) | System for adjusting map navigation path in retail store and method of using same | |
| US10445691B2 (en) | System for improving order batching using location information of items in retail store and method of using same | |
| CN109117429B (en) | Database query method and device and electronic equipment | |
| CN105677765B (en) | Recommend the method and system of desired functional sequence to user | |
| US9595062B2 (en) | Methods and systems for rendering an optimized route in accordance with GPS data and a shopping list | |
| US10810542B2 (en) | Systems and methods for fulfilment design and optimization | |
| US8321260B2 (en) | Product assortment planning system and method utilizing scaled performance metric values | |
| CN108876024A (en) | Path planning, path real-time optimization method and device, storage medium | |
| US20190272491A1 (en) | Inventory placement recommendation system | |
| CN110471904A (en) | A kind of store commodity data management method, device and storage medium | |
| CN109447549A (en) | A kind of method and relevant apparatus that material position is determining | |
| US20190304006A1 (en) | System and method for web-based map generation | |
| CN105894179B (en) | Service state transfer method and system based on dynamic programming | |
| Das et al. | Order fulfillment under pick failure in omnichannel ship-from-store programs | |
| CN108898340A (en) | The calculation method and system of logistics freight charges | |
| CN113781132A (en) | Online shopping guide method and device | |
| US9070094B2 (en) | Techniques for optimizing a shopping agenda | |
| CN108009874A (en) | Method and device for recommending shopping routes | |
| CN105760375A (en) | Gantt chart display method and system | |
| CN109255563A (en) | The determination method and apparatus in the storage space region of article | |
| CN111288991B (en) | Path planning method, device, robot and computer readable storage medium | |
| CN110222861B (en) | Path planning method, path planning device, storage medium and electronic equipment | |
| US20140108194A1 (en) | Techniques for optimizing a shopping agenda |
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 |