CN106529735A - Supermarket guide device - Google Patents

Supermarket guide device Download PDF

Info

Publication number
CN106529735A
CN106529735A CN201611028888.5A CN201611028888A CN106529735A CN 106529735 A CN106529735 A CN 106529735A CN 201611028888 A CN201611028888 A CN 201611028888A CN 106529735 A CN106529735 A CN 106529735A
Authority
CN
China
Prior art keywords
path
supermarket
node
guide passage
calculating element
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
Application number
CN201611028888.5A
Other languages
Chinese (zh)
Inventor
芦有鹏
陈凡
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Lanzhou Jiaotong University
Original Assignee
Lanzhou Jiaotong University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Lanzhou Jiaotong University filed Critical Lanzhou Jiaotong University
Priority to CN201611028888.5A priority Critical patent/CN106529735A/en
Publication of CN106529735A publication Critical patent/CN106529735A/en
Pending legal-status Critical Current

Links

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
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29—Geographical information databases
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computing arrangements based on biological models
    • G06N3/004—Artificial life, i.e. computing arrangements simulating life
    • G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Operations Research (AREA)
  • Artificial Intelligence (AREA)
  • Development Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • Remote Sensing (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • General Business, Economics & Management (AREA)
  • Health & Medical Sciences (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Game Theory and Decision Science (AREA)
  • Biomedical Technology (AREA)
  • Biophysics (AREA)
  • Computational Linguistics (AREA)
  • Evolutionary Computation (AREA)
  • General Health & Medical Sciences (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The present invention provides a supermarket guide device. The device comprises a touch display, an electronic map and a control system. The electronic map marks all commodity category names. After a user selects a commodity that needs to be bought, the control system calculates a best route according to a location of the user. The device provided by the present invention can greatly save time of the user for looking of the commodity in the supermarket, so as to facilitate shopping.

Description

A kind of supermarket's guide passage apparatus
Technical field
The present invention relates to a kind of guide passage technical field, specifically a kind of supermarket's guide passage apparatus.
Background technology
With the development of society, shopping mall supermarket has already taken up increasingly consequence in resident living, and With the quickening pace of modern life, increasing client proposes to be quickly found out through most short path and oneself wants telling for commodity Ask, client selects the article oneself wanted in the time that large supermarket often only takes less than half, more times be then with Carry out pathfinding, especially numerous male clients, greatly want to determine the current location of oneself by intellectual technology, target business The position of product and buying are to the shortest path required for all end articles, the mesh avoided detours time-consuming so as to reach 's.
The content of the invention
It is an object of the invention to overcome above-mentioned deficiency, there is provided a kind of supermarket's guide passage apparatus, can according to the demand of client, By being input into destination, shortest path is obtained, it is time-consuming, it is convenient to do shopping.
The object of the present invention is achieved like this：A kind of supermarket's guide passage apparatus, including touch display, electronic chart and control System processed, touch display be used for show electronic chart and be connected with control system,
Control system includes information acquisition unit, path-calculating element and path output unit, path-calculating element respectively with letter Breath acquiring unit and path output unit connection, information acquisition unit for electronic chart obtain user current location node and Target location node, path-calculating element is for drawing current location node to target location node by genetic algorithm for solving Optimal path, path output unit are shown to touch display for optimal path is exported.
Further, path-calculating element also includes information conversion module, and information conversion module is for by electronic map information It is converted into mathematical model.
Preferably, genetic algorithm is calculated using matlab softwares.
Wherein, path-calculating element calculates optimal path and comprises the following steps：
Step 1, it is divided into n sections using integer arranging and encoding mode to the chromosome of the supermarket for having n node, each of which section correspondence The numbering of node；
Step 2, initialization population is set according to supermarket size；
Step 2, fitness function is set up, and calculate fitness, the computing formula of fitness function is：
Wherein knFor an effective chromosome, DkikjFor node kiTo node kjDistance；
Step 3, the chromosome for selecting fitness high are produced random whole in two [1, n] interval using part mapping crossover operation Number, determines two positions；
Step 4, the book between two positions determined in step 3 is intersected, randomly select 2 points of exchange positions, produce novel species Group；
Step 5, judge whether new population meets end condition, i.e., whether meet maximum algebraically, if meeting, terminate to calculate and will As a result exported by path output unit, if being unsatisfactory for, execution step 2 is until meet end condition.
It is an advantage of the current invention that：The present invention very big can must save the time that user finds commodity in supermarket, by touching Screen is touched, user can learn the shortest path of all items needed for oneself, so as to facilitate client.
Description of the drawings
Fig. 1 is supermarket's guide passage apparatus outside drawing of the present invention；
Fig. 2 is supermarket's guide passage apparatus initial interface schematic diagram of the present invention；
Fig. 3 is the optimal path computation flow chart of the present invention；
Fig. 4 is supermarket's guide passage apparatus path display schematic diagram of the present invention.
Specific embodiment
The invention will be further described below in conjunction with the accompanying drawings.
Supermarket guide passage apparatus outside drawing of the accompanying drawing 1 for the present invention, including touch display, electronic chart and control system, Initial interface schematic diagram of the accompanying drawing 2 for the touch display of supermarket's guide passage apparatus, touch display are used for showing electronic chart simultaneously It is connected with control system, control system includes information acquisition unit, path-calculating element and path output unit, path computing list Unit is connected with information acquisition unit and path output unit respectively, and information acquisition unit is current for obtaining user in electronic chart Nodes of locations and target location node, path-calculating element is for drawing current location node to target by genetic algorithm for solving The optimal path of nodes of locations, path output unit show to touch display that for optimal path is exported path is counted Calculating unit also includes information conversion module, and information conversion module is for being converted into mathematical model by electronic map information.
Wherein, path-calculating element calculates optimal path and comprises the following steps, as shown in Figure 3：First, by using whole Its chromosome, such as to the supermarket for having n node, is divided into n sections by number arranging and encoding mode, and each of which section is corresponding node Numbering, such as 10 nodes, then { 1246397 10 85 } be an effective chromosome, initialize Population Size according to Supermarket's size setting, basic settings is 100, and its fitness function returns the distance of porch for covering just all nodes Inverse, such as k1k2……knFor an effective chromosome, DkikjFor node kiTo node kjDistance, then fitness function be, the target of optimization is the dyeing for selecting fitness function as big as possible Body, using part mapping crossover operation, that is, the random integers produced in two [1, n] interval determine two positions, to two positions Middle number is intersected, and Mutation Strategy exchanges its position using randomly selecting at 2 points, is performed then to evolve and is reversed operation to increase Plus local search ability, that is, produce the random integers in two [1, n] interval and determine two positions, and by which to change place, when Meet the maximum algebraically of setting, genetic manipulation terminates, determines optimal path and be shown to touch screen, as shown in Figure 4.
Finally it should be noted that：Obviously, above-described embodiment is only intended to clearly illustrate the application example, and and The non-restriction to embodiment.For those of ordinary skill in the field, can also do on the basis of the above description Go out the change or variation of other multi-forms.There is no need to be exhaustive to all of embodiment.And thus drawn Among protection domain of the obvious change or variation that Shen goes out still in the application type.

Claims (4)

1. a kind of supermarket's guide passage apparatus, it is characterised in that including touch display, electronic chart and control system, the touch Display be used for show the electronic chart and be connected with the control system,
The control system includes information acquisition unit, path-calculating element and path output unit, the path-calculating element It is connected with described information acquiring unit and the path output unit respectively, described information acquiring unit is for obtaining in electronic chart Take user current location node and target location node, the path-calculating element is for drawing currently by genetic algorithm for solving Optimal path of the nodes of locations to target location node, the path output unit are touched for optimal path output is arrived Display shows.
2. a kind of supermarket's guide passage apparatus according to claim 1, it is characterised in that the path-calculating element also includes letter Breath conversion module, described information conversion module is for being converted into mathematical model by the electronic map information.
3. a kind of supermarket's guide passage apparatus according to claim 1, it is characterised in that the genetic algorithm is soft using matlab Part is calculated.
4. a kind of supermarket's guide passage apparatus according to claim 3, it is characterised in that the path-calculating element calculates optimum Path comprises the following steps：
Step 1, it is divided into n sections using integer arranging and encoding mode to the chromosome of the supermarket for having n node, each of which section correspondence The numbering of node；
Step 2, initialization population is set according to supermarket size；
Step 3, fitness function is set up, and calculate fitness, the computing formula of fitness function is：
Wherein knFor an effective chromosome, DkikjFor node kiTo node kjDistance；
Step 4, the chromosome for selecting fitness high are produced random whole in two [1, n] interval using part mapping crossover operation Number, determines two positions；
Step 5, the book between two positions determined in step 3 is intersected, randomly select 2 points of exchange positions, produce novel species Group；
Step 6, judge whether new population meets end condition, i.e., whether meet maximum algebraically, if meeting, terminate to calculate and will As a result exported by path output unit, if being unsatisfactory for, execution step 3 is until meet end condition.
CN201611028888.5A 2016-11-22 2016-11-22 Supermarket guide device Pending CN106529735A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611028888.5A CN106529735A (en) 2016-11-22 2016-11-22 Supermarket guide device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611028888.5A CN106529735A (en) 2016-11-22 2016-11-22 Supermarket guide device

Publications (1)

Publication Number Publication Date
CN106529735A true CN106529735A (en) 2017-03-22

Family

ID=58353160

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611028888.5A Pending CN106529735A (en) 2016-11-22 2016-11-22 Supermarket guide device

Country Status (1)

Country Link
CN (1) CN106529735A (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103198366A (en) * 2013-04-09 2013-07-10 北京理工大学 Multi-target route planning method considering target node timeliness
CN104142151A (en) * 2014-07-31 2014-11-12 上海闻泰电子科技有限公司 Navigation method
CN105096006A (en) * 2015-08-24 2015-11-25 国网天津市电力公司 Method for optimizing a routing of an intelligent ammeter distributing vehicle

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103198366A (en) * 2013-04-09 2013-07-10 北京理工大学 Multi-target route planning method considering target node timeliness
CN104142151A (en) * 2014-07-31 2014-11-12 上海闻泰电子科技有限公司 Navigation method
CN105096006A (en) * 2015-08-24 2015-11-25 国网天津市电力公司 Method for optimizing a routing of an intelligent ammeter distributing vehicle

Similar Documents

Publication Publication Date Title
Xie et al. Global optimal consensus for multi-agent systems with bounded controls
Zheng et al. Distributed consensus of heterogeneous multi-agent systems with fixed and switching topologies
Huang et al. Finite-time lag synchronization of delayed neural networks
US6145751A (en) Method and apparatus for determining a thermal setpoint in a HVAC system
CN101877138B (en) Animation planning method and device of dynamic diagram
Wen et al. Distributed leader-following consensus for second-order multi-agent systems with nonlinear inherent dynamics
JP2016538615A (en) Main knowledge point recommendation method and system
KR20200012044A (en) Modification of three-dimensional garments using gestures
Hu et al. Interventional bipartite consensus on coopetition networks with unknown dynamics
Eppstein The lattice dimension of a graph
CN101799838B (en) Method for seeking mapping scheme between tasks and nodes of network on chip
CN105634974B (en) Route determining methods and device in software defined network
Cruz et al. Items-mapping and route optimization in a grocery store using Dijkstra's, Bellman-Ford and Floyd-Warshall Algorithms
Riehl et al. Incentive-based control of asynchronous best-response dynamics on binary decision networks
JP7220324B1 (en) Systems, methods and programs for grading
Mao et al. Walk proximal gradient: An energy-efficient algorithm for consensus optimization
Sakurama et al. Necessary and sufficient condition for average consensus of networked multi-agent systems with heterogeneous time delays
Tversky On abstraction and ambiguity
Zhang et al. New Dv-distance method based on path for wireless sensor network
Smith et al. Target assignment for robotic networks: Asymptotic performance under limited communication
CN105898711A (en) Geomagnetic-datum-line-based positioning method and apparatus
CN106529735A (en) Supermarket guide device
JP5733939B2 (en) Information provision system
Kiefner Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology
JPWO2016129218A1 (en) Information display system, method and program for analysis

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20170322