Nothing Special   »   [go: up one dir, main page]

CN112001538A - Travel route planning method and system based on movement steps - Google Patents

Travel route planning method and system based on movement steps Download PDF

Info

Publication number
CN112001538A
CN112001538A CN202010828559.9A CN202010828559A CN112001538A CN 112001538 A CN112001538 A CN 112001538A CN 202010828559 A CN202010828559 A CN 202010828559A CN 112001538 A CN112001538 A CN 112001538A
Authority
CN
China
Prior art keywords
planning
route
spot
condition
exercise
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
CN202010828559.9A
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.)
Mashangyou Technology Co ltd
Original Assignee
Mashangyou Technology Co ltd
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 Mashangyou Technology Co ltd filed Critical Mashangyou Technology Co ltd
Priority to CN202010828559.9A priority Critical patent/CN112001538A/en
Publication of CN112001538A publication Critical patent/CN112001538A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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
    • G06Q50/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10Services
    • G06Q50/14Travel agencies

Landscapes

  • Business, Economics & Management (AREA)
  • Tourism & Hospitality (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Health & Medical Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Development Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Navigation (AREA)

Abstract

The invention discloses a travel route planning method and system based on movement steps, relates to the technical field of route planning, and solves the technical problem of unreasonable route planning for tourism. The method and the system can intelligently plan the tour route for the user according to the motion index of the user, reasonably plan the play route, improve the play experience, and simultaneously improve the convenience, comfort and interestingness of the life of the user.

Description

Travel route planning method and system based on movement steps
Technical Field
The disclosure relates to the technical field of route planning, in particular to a travel route planning method and system based on movement steps.
Background
With the improvement of living standard of people, the travel vacation is a common thing, so that not only can the local humanistic emotion be known, but also the mood can be relaxed. At present, when each scenic spot or scenic spot plays, although there are some scenic spot small traffic, most tourists still rely on a walking mode to plan a tour route suitable for the tourists, and the problem that people urgently need to solve is solved. Because the amount of exercise at ordinary times of user is relatively fixed, but when going out and playing, because the distance between different sight spots is difficult accurate estimation, lead to playing the route to plan improperly for the amount of exercise in the in-process of playing increases, thereby often feels and plays tiredly, influences and plays experience.
Disclosure of Invention
The invention provides a travel route planning method and system based on movement steps, and the technical purpose of the travel route planning method and system is to reasonably plan a play route and improve play experience.
The technical purpose of the present disclosure is achieved by the following technical solutions:
a travel route planning method based on exercise steps comprises the following steps:
acquiring the exercise step number of the user every day in a period, and acquiring the exercise index of the user according to the exercise step number;
setting a planning condition;
the motion index and the step number B between the planning condition and the scenic spot are calculatednComparing to obtain a comparison result;
carrying out route planning according to the comparison result;
the exercise index V is (T-Tn-Tm)/N-2, V represents the exercise index, Tn is the minimum value of the exercise steps of the user in one cycle, Tm is the maximum value of the exercise steps of the user in one cycle, N represents the number of days of one cycle, and T is the sum of the exercise steps of the user in one cycle.
Further, the planning conditions include:
a first planning condition, namely a maximum value Tm of the motion steps in one period;
the second planning condition is willing to accept the small traffic service provided by the scenic spot;
and the third planning condition is not willing to accept the small traffic service provided by the scenic spot.
Further, the comparing of the exercise index with the planning condition comprises:
if the motion index V is larger than the first planning condition, reminding to reset the first planning condition;
and if the motion index V is less than or equal to the first planning condition, planning a route.
Further, the route planning comprises:
when B is presentnWhen the value is less than or equal to V, the scenery spot J is pointediHarmonious spot JjAdding the route into route planning;
when B is presentnWhen the number is larger than V, inquiring the scenic spot JiHarmonious spot JjWhether there is small traffic between them, if there is no small traffic and BnWhen the first planning condition is less than or equal to the first planning condition, the scenic spot J is determinediHarmonious spot JjAdding the route into route planning; if there is small traffic and the second planning condition is met, the scenic spot J is determinediHarmonious spot JjAdding the route into route planning; if there is small traffic and the third planning condition is met, the scenic spot JiHarmonious spot JjThen no route planning is added.
Wherein, BnIndicating a sight JiHarmonious spot JjThe number of steps between, i, j represents the number of the scenic spots, and are all positive integers.
A travel route planning system based on athletic steps, comprising:
the acquiring unit is used for acquiring the exercise step number of the user every day in a period and acquiring the exercise index of the user according to the exercise step number;
a setting unit that sets a planning condition;
a comparison unit for comparing the motion index with the step number B between the planning conditions and the scenic spotsnComparing to obtain a comparison result;
the planning unit is used for planning a route according to the comparison result;
the exercise index V is (T-Tn-Tm)/N-2, V represents the exercise index, Tn is the minimum value of the exercise steps of the user in one cycle, Tm is the maximum value of the exercise steps of the user in one cycle, N represents the number of days of one cycle, and T is the sum of the exercise steps of the user in one cycle.
Further, the setting unit includes:
the first setting module is used for setting a first planning condition, and the first planning condition comprises the following steps: the maximum value Tm of the number of movement steps in one period;
a second setting module, configured to set a second planning condition, where the second planning condition includes: willing to accept the small traffic service provided by the scenic spot;
a third setting module, configured to set a third planning condition, where the third planning condition includes: are reluctant to accept the small traffic services offered by scenic spots.
Further, the comparing of the exercise index with the planning condition comprises:
if the motion index V is larger than the first planning condition, reminding to reset the first planning condition;
and if the motion index V is less than or equal to the first planning condition, planning a route.
Further, the planning unit includes:
a first planning module, when BnWhen the value is less than or equal to V, the scenery spot J is pointediHarmonious spot JjAdding the route into route planning;
a second planning module, when BnWhen the number is larger than V, inquiring the scenic spot JiHarmonious spot JjWhether there is small traffic between them, if there is no small traffic and BnWhen the first planning condition is less than or equal to the first planning condition, the scenic spot J is determinediHarmonious spot JjAdding the route into route planning; if there is small traffic and the second planning condition is met, the scenic spot J is determinediHarmonious spot JjAdding the route into route planning; if there is small traffic and the third planning condition is met, the scenic spot JiHarmonious spot JjThen no route planning is added.
Wherein, BnIndicating a sight JiHarmonious spot JjThe number of steps between, i, j represents the number of the scenic spots, and are all positive integers.
The beneficial effect of this disclosure lies in: according to the tourism route planning method and system based on the movement steps, the movement steps of the user in one period are obtained every day, the movement index of the user is obtained according to the movement steps, and then the movement index, the planning condition and the steps among the scenic spots are planned by combining the preset planning condition. The method and the system can intelligently plan the tour route for the user according to the motion index of the user, reasonably plan the play route, improve the play experience, and simultaneously improve the convenience, comfort and interestingness of the life of the user.
Drawings
FIG. 1 is a flow chart of the disclosed method;
FIG. 2 is a schematic view of the disclosed system;
fig. 3 is a flow chart of route planning.
Detailed Description
The technical scheme of the disclosure will be described in detail with reference to the accompanying drawings. In the description of the present disclosure, it is to be understood that the terms "first", "second", and "third" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implying any number of technical features indicated, but merely as distinguishing between different components.
Fig. 1 is a flowchart of the present disclosure, as shown in fig. 1, acquiring exercise steps of a user every day in a period, and obtaining an exercise index of the user according to the exercise steps; after the planning condition is set, the motion index is compared with the planning condition and the steps between the scenic spots to obtain a comparison result, and finally, the route planning is carried out according to the comparison result. Wherein, the motion index V is (T-Tn-Tm)/N-2, V represents the motion index, Tn is the minimum value of the number of motion steps of the user in one cycle, Tm is the maximum value of the number of motion steps of the user in one cycle, N represents the number of days of one cycle, and T is the sum of the number of motion steps of the user in one cycle.
Generally, the time duration of one period can be freely set, the time duration of the period is not recommended to be set too short in order to plan a more appropriate playing route, and if the period is short and there are cases where the number of steps of the movement of one day in the period is particularly large or small, the obtained movement index is not objective enough, so the time duration of one period is generally set to be at least 1 month.
The planning conditions comprise a first planning condition, a second planning condition and a third planning condition, wherein the first planning condition is the maximum value Tm of the movement steps in one period, the second planning condition is that the small traffic service provided by the scenic spot is willing to be accepted, and the third planning condition is that the small traffic service provided by the scenic spot is unwilling to be accepted.
Fig. 2 is a schematic diagram of the system of the present disclosure, where the system includes an obtaining unit, a setting unit, a comparing unit, and a planning unit, the setting unit includes a first setting module, a second setting module, and a third setting module, the planning unit includes a first planning module and a second planning module, and the functions of the modules are referred to in the method of the present disclosure and are not repeated.
Fig. 3 is a flow chart of route planning, and as shown in fig. 3, the motion index is first compared with planning conditions: if the motion index V is larger than the first planning condition, reminding to reset the first planning condition; and if the motion index V is less than or equal to the first planning condition, starting to plan the route.
The specific route planning comprises the following steps: when B is presentnWhen the value is less than or equal to V, the scenery spot J is pointediHarmonious spot JjAdding the route into route planning; when B is presentnWhen the number is larger than V, inquiring the scenic spot JiHarmonious spot JjWhether there is small traffic between them, if there is no small traffic and BnWhen the number of the scenic spots is less than or equal to the first planning condition, the scenic spot J is determinediHarmonious spot JjAdding the route into route planning; if there is small traffic and the second planning condition is met, the scenic spot J is determinediHarmonious spot JjAdding the route into route planning; if there is small traffic and the third planning condition is met, the scenic spot JiHarmonious spot JjThen no route planning is added. Wherein, BnIndicating a sight JiHarmonious spot JjThe number of steps between, i, j represents the number of the scenic spots, and are all positive integers.
The foregoing is an exemplary embodiment of the present disclosure, and the scope of the present disclosure is defined by the claims and their equivalents.

Claims (8)

1. A travel route planning method based on exercise steps is characterized by comprising the following steps:
acquiring the exercise step number of the user every day in a period, and acquiring the exercise index of the user according to the exercise step number;
setting a planning condition;
the motion index and the step number B between the planning condition and the scenic spot are calculatednComparing to obtain a comparison result;
carrying out route planning according to the comparison result;
the exercise index V is (T-Tn-Tm)/N-2, V represents the exercise index, Tn is the minimum value of the exercise steps of the user in one cycle, Tm is the maximum value of the exercise steps of the user in one cycle, N represents the number of days of one cycle, and T is the sum of the exercise steps of the user in one cycle.
2. The method for travel route planning based on number of moving steps according to claim 1, wherein the planning condition comprises:
a first planning condition, namely a maximum value Tm of the motion steps in one period;
the second planning condition is willing to accept the small traffic service provided by the scenic spot;
and the third planning condition is not willing to accept the small traffic service provided by the scenic spot.
3. The method of claim 2, wherein the comparing the exercise index to the planning criteria comprises:
if the motion index V is larger than the first planning condition, reminding to reset the first planning condition;
and if the motion index V is less than or equal to the first planning condition, planning a route.
4. The method for travel route planning based on number of athletic steps as claimed in claim 3, wherein the route planning comprises:
when B is presentnWhen the value is less than or equal to V, the scenery spot J is pointediHarmonious spot JjAdding the route into route planning;
when B is presentnWhen the number is larger than V, inquiring the scenic spot JiHarmonious spot JjWhether there is small traffic between them, if there is no small traffic and BnWhen the first planning condition is less than or equal to the first planning condition, the scenic spot J is determinediHarmonious spot JjAdding the route into route planning; if there is small traffic and the second planning condition is met, the scenic spot J is determinediHarmonious spot JjAdding the route into route planning; if there is small traffic and the third planning condition is met, the scenic spot JiHarmonious spot JjThen no route planning is added.
Wherein, BnIndicating a sight JiHarmonious spot JjThe number of steps between, i, j represents the number of the scenic spots, and are all positive integers.
5. A travel route planning system based on exercise steps, comprising:
the acquiring unit is used for acquiring the exercise step number of the user every day in a period and acquiring the exercise index of the user according to the exercise step number;
a setting unit that sets a planning condition;
a comparison unit for comparing the motion index with the step number B between the planning conditions and the scenic spotsnComparing to obtain a comparison result;
the planning unit is used for planning a route according to the comparison result;
the exercise index V is (T-Tn-Tm)/N-2, V represents the exercise index, Tn is the minimum value of the exercise steps of the user in one cycle, Tm is the maximum value of the exercise steps of the user in one cycle, N represents the number of days of one cycle, and T is the sum of the exercise steps of the user in one cycle.
6. The athletic step-based travel route planning system of claim 5, wherein the setting unit comprises:
the first setting module is used for setting a first planning condition, and the first planning condition comprises the following steps: the maximum value Tm of the number of movement steps in one period;
a second setting module, configured to set a second planning condition, where the second planning condition includes: willing to accept the small traffic service provided by the scenic spot;
a third setting module, configured to set a third planning condition, where the third planning condition includes: are reluctant to accept the small traffic services offered by scenic spots.
7. The athletic step-based travel route planning system of claim 6, wherein the comparison of the athletic index to the planning criteria comprises:
if the motion index V is larger than the first planning condition, reminding to reset the first planning condition;
and if the motion index V is less than or equal to the first planning condition, planning a route.
8. The athletic step-based travel route planning system of claim 7, wherein the planning unit comprises:
a first planning module, when BnWhen the value is less than or equal to V, the scenery spot J is pointediHarmonious spot JjAdding the route into route planning;
a second planning module, when BnWhen the number is larger than V, inquiring the scenic spot JiHarmonious spot JjWhether there is small traffic between them, if there is no small traffic and BnWhen the first planning condition is less than or equal to the first planning condition, the scenic spot J is determinediHarmonious spot JjAdding the route into route planning; if there is small traffic and the second planning condition is met, the scenic spot J is determinediHarmonious spot JjAdding the route into route planning; if there is small traffic and the third planning condition is met, the scenic spot JiHarmonious spot JjThen no route planning is added.
Wherein, BnIndicating a sight JiHarmonious spot JjThe number of steps between, i, j represents the number of the scenic spots, and are all positive integers.
CN202010828559.9A 2020-08-18 2020-08-18 Travel route planning method and system based on movement steps Pending CN112001538A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010828559.9A CN112001538A (en) 2020-08-18 2020-08-18 Travel route planning method and system based on movement steps

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010828559.9A CN112001538A (en) 2020-08-18 2020-08-18 Travel route planning method and system based on movement steps

Publications (1)

Publication Number Publication Date
CN112001538A true CN112001538A (en) 2020-11-27

Family

ID=73473267

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010828559.9A Pending CN112001538A (en) 2020-08-18 2020-08-18 Travel route planning method and system based on movement steps

Country Status (1)

Country Link
CN (1) CN112001538A (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105277189A (en) * 2014-06-30 2016-01-27 高德软件有限公司 Route pushing method and device
CN107045528A (en) * 2017-01-10 2017-08-15 深圳市金立通信设备有限公司 A kind of method and terminal reminded of going on a journey
CN107679661A (en) * 2017-09-30 2018-02-09 桂林电子科技大学 A kind of individualized travel route planing method of knowledge based collection of illustrative plates
CN107747947A (en) * 2017-10-23 2018-03-02 电子科技大学 A kind of collaboration itinerary based on user's history GPS track recommends method
CN108829852A (en) * 2018-06-21 2018-11-16 桂林电子科技大学 A kind of individualized travel route recommended method

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105277189A (en) * 2014-06-30 2016-01-27 高德软件有限公司 Route pushing method and device
CN107045528A (en) * 2017-01-10 2017-08-15 深圳市金立通信设备有限公司 A kind of method and terminal reminded of going on a journey
CN107679661A (en) * 2017-09-30 2018-02-09 桂林电子科技大学 A kind of individualized travel route planing method of knowledge based collection of illustrative plates
CN107747947A (en) * 2017-10-23 2018-03-02 电子科技大学 A kind of collaboration itinerary based on user's history GPS track recommends method
CN108829852A (en) * 2018-06-21 2018-11-16 桂林电子科技大学 A kind of individualized travel route recommended method

Similar Documents

Publication Publication Date Title
US11253786B2 (en) Virtual league platform of a sport activity
CN103647671B (en) A kind of intelligent perception network management and its system based on Gur Game
CN106657581B (en) E-book reading plan recommendation system and method
US10124234B2 (en) System and method for tracking the usage of athletic equipment
CN110119822B (en) Scenic spot management, journey planning method, client and server
US20170340246A1 (en) System and method to recognize activities performed by an individual
US10042893B2 (en) System and method for personal and peer performance ranking of outdoor activities
CN107423837A (en) The Intelligent planning method and system of tourism route
CN103647800A (en) Method and system of recommending application resources
CN107122584B (en) Outdoor exercise planning system and method based on big data
WO2022217685A1 (en) Method and system for intelligent path planning of tourist attractions
CN111402085A (en) Big data-based travel customization system
US20220299334A1 (en) Recommendation information providing method and recommendation information providing system
CN101401140A (en) Method and apparatus for assisting behavioural change
CN110941776A (en) Scenic spot guide system based on mobile intelligent terminal
CN105872246A (en) Anti-addiction method, anti-addiction device and terminal
CN109473156A (en) Exercise suggestion method and device
CN112001538A (en) Travel route planning method and system based on movement steps
CN112199611A (en) Intelligent scenic spot recommendation method based on AIoT and computer vision
CN112017749B (en) Intelligent runway system for residential communities
CN117909575B (en) Digital recommendation method and system for tourist attractions in historical urban area
CN111584020B (en) Personal healthy life big data acquisition and analysis system
CN117094695B (en) Exercise training course planning and arranging method and system
JP2004121745A (en) Health support device
CN117633372B (en) Scenic spot playing path optimization method, system, terminal and medium based on Internet of things

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
AD01 Patent right deemed abandoned
AD01 Patent right deemed abandoned

Effective date of abandoning: 20240712