CN114307102A - Running interaction method for multi-person sports - Google Patents
Running interaction method for multi-person sports Download PDFInfo
- Publication number
- CN114307102A CN114307102A CN202111678678.1A CN202111678678A CN114307102A CN 114307102 A CN114307102 A CN 114307102A CN 202111678678 A CN202111678678 A CN 202111678678A CN 114307102 A CN114307102 A CN 114307102A
- Authority
- CN
- China
- Prior art keywords
- running
- path
- user
- competitive
- plan
- 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 60
- 230000003993 interaction Effects 0.000 title claims abstract description 55
- 230000002860 competitive effect Effects 0.000 claims abstract description 60
- 230000002452 interceptive effect Effects 0.000 claims description 7
- 230000006870 function Effects 0.000 description 10
- 238000013461 design Methods 0.000 description 6
- 230000000694 effects Effects 0.000 description 6
- 230000008569 process Effects 0.000 description 5
- 230000004048 modification Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 2
- 206010048909 Boredom Diseases 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 239000003086 colorant Substances 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000037213 diet Effects 0.000 description 1
- 235000005911 diet Nutrition 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Landscapes
- Navigation (AREA)
Abstract
A running interaction method for multi-person competition comprises the steps that a first running user establishes a first running plan task; a first running user sends competition invitation information; at least one running user receives the competition invitation information and accepts the competition invitation; one competitive running user establishes a first planned path graph; after the other competitive running users agree; each competitive running user establishes a running planned path; each competitive running user starts a running program, and when the coverage rate of the motion path and the running planned path reaches a set value, a running task completion report is output; each competitive running user receives running task completion reports of other competitive running users, and competitive ranking report information is generated according to all the received running task completion reports. The invention can improve the competitive interaction fun experience when people perform multi-person running exercise, enables running to be more happy and interesting, and helps people cultivate interest and hobbies of running exercise.
Description
Technical Field
The invention relates to a running application program technology, in particular to a running interaction method for multi-person sports, which enables a user to obtain more fun running experience.
Background
Exercise is an extremely routine and most effective method for improving physical fitness of people, and particularly when the urban living pressure is increased and diet and sleep are difficult to maintain a good state nowadays, the exercise is an extremely low-cost way for maintaining and improving physical fitness of people. Particularly, when people run for exercise, people who have developed a running habit for a long time can keep running state all the time, and most of people who just start running exercise can be wasted due to running boredom and other reasons. For a person running alone, the music can be listened to while running, or the running process can be recorded by using the existing running exercise software while running, so that the running pleasure is increased. However, this simple recording and sharing of complimentary running aids does not provide a very fresh and interesting running experience for the runner. Especially, when a plurality of friends run together, the existing running auxiliary tools do not have the technology capable of realizing multi-person interaction, so that the interactive pleasure of the multi-person running together is greatly reduced.
Disclosure of Invention
The invention solves the technical problem of providing a running interaction method for multi-person sports, which improves the interactive fun experience when people perform multi-person running exercise, makes running more happy and fun and helps people cultivate interest and hobbies of running exercise.
The technical solution of the invention is as follows:
a running interaction method for multi-person competition, wherein running users comprise at least a first running user and a second running user, and the method comprises the following steps:
step one, a first running user establishes a first running plan task;
a first running user sends competition invitation information to other running users and/or a sharing platform;
at least one second running user receives the competition invitation information and selects to accept the competition invitation to become a competition running user;
step two, one of the competitive running users establishes a first planned path graph; and sending the path information to other competitive running users, and after the competitive running users confirm and agree with the first planned path graph;
step three, each competitive running user starts a map program respectively, and establishes a running planned path on a specified map area through a passable road on the map area according to the first planned path graph;
step four, each competitive running user respectively starts a running program, displays respective movement paths on respective map areas according to respective positioning information,
when the coverage rate of the motion path and the running plan path reaches a set value, outputting a task completion signal;
step five, storing a running plan path, a running path and a running parameter according to the task completion signal, and outputting a running task completion report; each task completion signal and the running task completion report are sent to other running users;
and each competitive running user receives task completion signals and running task completion reports of other competitive running users, and generates competitive ranking report information according to all the received task completion signals and running task completion reports.
The running interaction method for multi-person competition, wherein the first running plan task includes a set mileage value, and a difference between the mileage value of a running plan path established by the competitive running user and the set mileage value is within a set range;
the first running plan task comprises a tracing mode, a road finding mode and/or a team forming mode;
in the racing mode, in the fourth step, the map program of each racing running user displays the respective running planned path;
in the way finding mode, in the fourth step, the map program of each competitive running user hides the respective running planned path, and when the positioning information of the competitive running user is superposed with the running planned path in the map, the running planned path of the superposed part is displayed;
and in the team forming mode, in the fourth step, the competitive running users are grouped, at least two competitive running users are arranged in each group, and one section of the running planned path is respectively distributed to the competitive running users in each group.
The running interaction method for multi-user competition, wherein the fourth step further comprises that after the running program is started, the running program outputs path navigation indication information according to the running planned path and the real-time positioning point information; and step two, establishing a plan path graph to establish a plurality of sub-plan path graphs, and combining the specified sub-plan path graphs into the plan path graph.
The running interaction method for multi-person competition as described above includes, in step four, when the running program is stopped and the coverage of the motion path and the running plan path is lower than a set value, establishing an unfinished running plan task, and storing the progress data of the finished running plan path.
The running interaction method for multi-person competition as described above further includes a sixth step of obtaining an unfinished running plan task after the fifth step, and then the fourth step is performed.
The running interaction method for multi-person competition as described above further includes a seventh step of obtaining an incomplete running plan task, establishing a second running plan path on the running plan path of the incomplete running plan task, forming a new running plan path, and going to the fourth step.
The running interaction method for multi-person competition as described above, wherein the movement path is set to a designated color, and when an uncompleted running planning task is obtained and a running program is started, the color of the movement path is set to a color different from the color of the saved movement path.
The running interaction method for multi-person competition as described above, wherein the third step includes setting a planned running mileage value, and the map program establishes a running planned route on a designated map area via passable roads on the map area according to the mileage value within ± 10% of the planned running mileage value and the planned route graph.
The running interaction method for multi-person competition, wherein before the step one, running interaction application is started, and the running application program comprises a map program, a running program, a user module and a sharing module; and logging in the user module.
The running interaction method for multi-person competition further comprises a sharing step of sending the running task completion report to the sharing module, wherein the running task completion report comprises a sharing information data packet formed by combining graph, text and voice information, and the sharing information data packet comprises the plan path graph and/or the running plan path data information; and the sharing information data packet is output by the sharing module to be displayed or shared to other users.
From the above description, it is clear that the present invention has the following advantages:
according to the running interaction method for multi-person competition, the map information of the designated area is combined according to the pattern designated by the runner, a running path similar to the appearance of the pattern is established on the accessible road, the runner can run along the running path, and meanwhile, the running user can run and exercise by sending running task information sharing and inviting other running users to participate in the planned path graph of the runner. Therefore, the user can enable the running motion path to form a pattern which is similar to the pattern appointed by the runner, the appointed pattern shape is drawn on the map in a running mode, and the function that a plurality of people jointly participate in the self design or the appointed pattern to exercise can be realized through sharing and inviting.
Drawings
Fig. 1 is a flowchart illustrating steps of a running interaction method for multi-player competition according to a preferred embodiment of the present invention.
Detailed Description
In order to more clearly understand the technical features, objects, and effects of the present invention, embodiments of the present invention will now be described with reference to the accompanying drawings.
According to the running interaction method for multi-person competition, provided by the invention, people can set the running path by themselves while running, the running path is formed into a shape similar to a pattern which is interested by people, and meanwhile, the competition interaction function of multiple persons can be realized, so that the running interest and experience are increased.
Preferably, in a preferred embodiment of the present invention, please refer to fig. 1, in which the running users of the multi-user competition running interaction method of the present invention include at least a first running user and a second running user, and the method includes the following steps:
s101, a first running user establishes a first running plan task; by establishing the running planning task, the user is allowed to set the running planning task, including the relevant parameters such as time, path, distance and the like, so as to conveniently store and output the relevant data.
A first running user sends competition invitation information to other running users and/or a sharing platform; and sending the competition invitation information to a user who wants to share and other sharing platforms, such as a friend circle and the like, so that other running users can obtain the competition invitation information and obtain the content of the first running plan task of the first running user. The first running user seeks for the joining of other running users by sending and sharing the competition invitation information. At least one second running user receives the competition invitation information, selects to accept the competition invitation, and becomes a competition running user together with the first running user; and when the second running user acquires the competition invitation information, joining the first running plan task to enable a competition activity task to be carried out, wherein the joined other second running users and the first running user are both the competition running user and participate in the first running plan task together.
S102, establishing a first planned path graph by one competitive running user; and sending the path information to other competitive running users, and after the competitive running users confirm and agree with the first planned path graph; preferably, a planned path graph is established under the running planning task, and the planned path graph can be a contour graph or other graphs, and is input by the user or selected from stored existing graphs. In addition, according to specific requirements, whether the confirmation and the consent of other competitive running users are needed or not can be set to be carried out. Of course, it is preferable that the consent of more than a specified number of competitive running users is obtained, and the next step is entered.
S103, each competitive running user starts a map program respectively, and establishes a running planned path on a designated map area through a passable road on the map area according to the first planned path graph; the competitive running user starts a map program and finds a running planned route on the map area, the running planned route being capable of forming a passable road having a shape similar to that of the planned route pattern.
S104, each competitive running user starts a running program, displays respective movement paths on respective map areas according to respective positioning information, and outputs a task completion signal when the coverage rate of the movement paths and the running planned paths reaches a set value; the competitive running user starts a running exercise task of the running planned path by starting a running program, at the moment, the user displays the self motion position on a map in a connection mode through a positioning function to form a motion path, the user follows the guidance of the running planned path, the motion path which is run out can be overlapped with the running planned path, the motion path can gradually form a graphic appearance similar to the graphic of the planned path, and when the coverage rate between the motion path and the running planned path reaches a set value, the running exercise task can be automatically completed. The user greatly improves the running pleasure and experience in the running exercise process, plays a good role in encouraging to insist on running physical exercise in an auxiliary mode, and increases the activity pleasure of people.
S105, storing a running plan path, a running path and a running parameter according to the task completion signal, and outputting a running task completion report; each task completion signal and the running task completion report are sent to other running users; after the running planning task is completed, a running task completion report is obtained by storing the running planning path, the movement path and the movement parameters, and the report can give a running record and summary to the runner. Meanwhile, other running users can also know the progress of the completion of the first running plan task in real time through the first task completion signal of the first running user and the content of the first running task completion report. The first running task completion report may be report data of the whole first running planned path in an interrupted state or completely completed.
And each competitive running user receives task completion signals and running task completion reports of other competitive running users, and generates competitive ranking report information according to all the received task completion signals and running task completion reports.
In the above-mentioned running interaction method for multi-user competition according to the present invention, in a preferred embodiment of the invention, the first running plan task includes a set mileage value, and a difference between the mileage value of a running plan route established by the competitive running user and the set mileage value is within a set range; therefore, competitive running users can compete in running, for example, on the basis of mileage, the users win the game when running more, or the users win the game when finishing specified mileage within a specific time period.
Additionally, the first running plan task includes a tracing mode, a hunting mode, and/or a team forming mode;
in the racing mode, in the fourth step, the map program of each racing running user displays the respective running planned path; this mode is a general race mode for specific speed, mileage or time.
In the way finding mode, in the fourth step, the map program of each competitive running user hides the respective running planned path, and when the positioning information of the competitive running user is superposed with the running planned path in the map, the superposed running planned path is displayed. The mode is an interesting mode for searching the hidden running planning path, and a competitive running user needs to find the hidden running planning path in the running process and then completely cover the hidden running planning path by using the positioning track of the competitive running user, so that the user wins when all the hidden running planning paths are covered completely.
And in the team forming mode, in the fourth step, the competitive running users are grouped, at least two competitive running users are arranged in each group, and one section of the running planned path is respectively distributed to the competitive running users in each group. Through the group competition, each group of competitive running users complete the part of the running planning path which needs to be responsible for each group according to the segmented content, and finally the complete group wins.
Preferably, the running interaction method for multi-person competition of the invention may further include a grading competition mode, for example, when running competition interaction is performed between an adult and a child, the mileage of the first competition running user is greater than the mileage of the second competition running user according to a set grading rule after the same planned path graph is obtained, but the obtained graphs after running is finally completed have the same shape. The classification rule can adopt various reasonable classification rule modes such as age classification, height classification, body type classification and the like, for example, when an adult is set to be 5 kilometers, a child can be set to be 1 kilometer and the like. Therefore, the invention solves the problem that people with different abilities are difficult to run together for competitive interaction, and greatly improves the application range of the competitive interaction for running.
In the preferred embodiment of the running interaction method for multi-user competition of the present invention, after the other running users acquire and receive the running task data of the first running user, the other running users participate in the running task of the same planned path graph, so that the running exercise fun of multi-user participation and interaction is improved.
It should be noted that, in the following description, the first running user, the second running user and other running users of the present invention may be collectively referred to as running users, and the running planning tasks established by the running users may be collectively referred to as running planning tasks; in the invention, the first running user and the second running user can be interchanged and exist equally, and only the running user which establishes the running planning task first is used as the main running user. Of course, there may be more than two running users participating, or the sharing and participation of running tasks may be crossed.
In the above-mentioned running interaction method for multi-user competition according to the present invention, in a preferred embodiment of the present invention, the step four further includes outputting, by the running program, route navigation instruction information according to the running planned route and the real-time location point information after the running program is started. Preferably, after the user designs the running plan path, the running program is started, and the running program can give the user an instruction of entering the running plan path according to the current position of the user and guide the user to complete the coverage of the movement path along the running plan path; is a running exercise task with a navigation function.
In the preferred embodiment of the running interaction method for multi-user competition of the present invention, the plan path graph is established in the second step, so as to establish a plurality of sub-plan path graphs, and the specified sub-plan path graphs are combined into the plan path graph. Preferably, the planned path graph of the present invention can be completed by directly establishing a planned path graph, or can be completed by establishing a plurality of sub-planned path graphs and then combining the sub-planned path graphs. When a user establishes a sub-plan path graph, the user can temporarily quit the running plan task by saving the sub-plan path graph; when the running planning task is started again, the stored branch planning path graphs can be extracted, one or more other branch planning path graphs can be continuously established, and then all the branch planning path graphs are combined to form a planning path graph which is used as a construction basis of the next running planning path. Of course, the user may also combine all the graphics to form the planned path graphic after completing two or more sub-planned path graphics at a time. Therefore, the user can obtain the graph which is finally formed as the running movement path through the design of the planned path graph once, twice or more, thereby not only meeting the aim of slowly constructing the running path graph by the user, but also meeting the psychology of pursuing perfect graphs by the user. Preferably, of course, after one or more sub-plan path graphics are created, the user may make adjustments by deleting or modifying the sub-plan path graphics specified therein. Or directly making modification adjustment on the combined planned path graph.
In a preferred embodiment of the running interaction method for multi-user competition of the present invention, in step four, when the running program is stopped and the coverage of the motion path and the running plan path is lower than a set value, an unfinished running plan task is established, and the completed progress data of the current running plan path is stored. Preferably, in this embodiment, the user may stop the running planning task halfway, and store the completed movement path data by establishing an incomplete running planning task, so as to continue again later. Through the function of being capable of being completed in a segmented manner, the function that a user can complete a running plan task for multiple times is provided, and the requirement that the user can be allowed to complete the running plan task for multiple times when the running plan path established by the user is high in complexity, long in mileage and incapable of being completed at one time is met; it is of course also provided that the user may need to stop exiting (non-general pause) when encountering temporary special circumstances, allowing the user to do other things and then continue to complete the unfinished running planning task.
In the preferred embodiment of the running interaction method for multi-user competition of the present invention, after the fifth step, a sixth step is further included, in which an unfinished running plan task is obtained, and the operation proceeds to the fourth step. According to the invention, the function of resuming the previous unfinished running plan task after the storage is interrupted and quitted is realized through the sixth step, so that the user can obtain the effect of resuming the task after the task is interrupted.
In the preferred embodiment of the running interaction method for multi-user competition of the present invention, after the fifth step, the method further includes a seventh step of obtaining an incomplete running plan task, establishing a second running plan path on the running plan path of the incomplete running plan task to form a new running plan path, and turning to the fourth step. After the fifth step, an unfinished running planning task is obtained, and then in the unfinished running planning task, a second running planning path can be established according to the requirement (the method for establishing the second running planning path can adopt the method for establishing the planned running path), and a new running planning path is formed by combining the second running planning path with the previously saved running planning path, so that the user is allowed to modify the original running planning path by adding the second running planning path according to the requirement when the user interrupts the resumption. Of course, in a preferred embodiment, the user can modify the original running plan path through the second running plan path, and can also directly modify the original running plan path and then perform the operation of step four.
In the preferred embodiment of the running interaction method for multi-user competition of the present invention, the movement path is set to have a designated color, that is, after the positioning point of the user moves, a connecting line trace left on the map has the designated color; and after the unfinished running planning task is acquired and the running program is started, the color of the movement path is set to be different from the color of the saved movement path. That is, the movement path corresponding to the running planning path in the same task can be completed only after running activities are performed for a plurality of times, and the color of the movement path can be set to be different colors every time, so that the user can be very clear and clear when looking up the running task report. Of course, the color of the motion path in the two running activities can be set to be the same according to specific needs.
In the above-mentioned running interaction method for multi-person competition according to the present invention, in a preferred embodiment of the invention, the third step includes setting a planned running mileage value, and the map program establishes a running planned route on a designated map area through passable roads on the map area according to the mileage value within a range of ± 10% of the planned running mileage value and the planned route graph. In the running interaction method for multi-person competition, the mileage value required to run can be preferably set, the distance and the range of the running planned path are limited by setting the mileage value when the running planned path is established according to the planned path graph, namely, the amount of exercise is limited, and meanwhile, the running planned path closest to the planned path graph is constructed in a specified area for a user to finish the running task.
In the above-described running interaction method for multi-user competition according to the present invention, in a preferred embodiment of the present invention, the step one further includes starting a running interaction application, where the running application includes a map program, a running program, a user module, and a sharing module; and logging in the user module. The running interaction method for multi-person competition can be a running interaction application installed on the terminal equipment, and meanwhile, the purpose of improving the running pleasure of the user is achieved through the map program, the running program, the user module and the sharing module. When the user starts to use the running interactive application, the user can start the running interactive application, log in the user module, and store personalized information data content, so that after quitting, the user can log in again to obtain personal related running data, and personalized management and uninterrupted data continuity are achieved.
In a preferred embodiment of the running interaction method for multi-person competition according to the present invention, after the fifth step, a sharing step is further included, in which the running task completion report is sent to the sharing module, the running task completion report includes a sharing information data packet formed by combining graphics, text and voice information, and the sharing information data packet includes the planned path graphics and/or the running planned path data information; and the sharing information data packet is output by the sharing module to be displayed or shared to other users. The running interaction method for multi-person competition comprises a sharing step, and after a running task completion report is obtained, designated report information data can be shared and output to the outside through the sharing module. For example, to disclose the display in a running interaction application and allow other users to view it; or the appointed report information data is sent to other applications or an interactive platform on the network, so that other different users can see the appointed report information data, and the network interactive effect is realized.
It should be understood that the specific order or hierarchy of steps in the processes disclosed is an example of exemplary approaches. Based upon design preferences, it is understood that the specific order or hierarchy of steps in the processes may be rearranged without departing from the scope of the present disclosure. The accompanying method claims present elements of the various steps in a sample order, and are not intended to be limited to the specific order or hierarchy presented.
In the foregoing detailed description, various features are grouped together in a single embodiment for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed embodiments of the subject matter require more features than are expressly recited in each claim. Rather, as the following claims reflect, invention lies in less than all features of a single disclosed embodiment. Thus, the following claims are hereby expressly incorporated into the detailed description, with each claim standing on its own as a separate preferred embodiment of the invention.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. To those skilled in the art; various modifications to these embodiments will be readily apparent, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the disclosure. Thus, the present disclosure is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
What has been described above includes examples of one or more embodiments. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing the aforementioned embodiments, but one of ordinary skill in the art may recognize that many further combinations and permutations of various embodiments are possible. Accordingly, the embodiments described herein are intended to embrace all such alterations, modifications and variations that fall within the scope of the appended claims. Furthermore, to the extent that the term "includes" is used in either the detailed description or the claims, such term is intended to be inclusive in a manner similar to the term "comprising" as "comprising" is interpreted when employed as a transitional word in a claim. Furthermore, any use of the term "or" in the specification of the claims is intended to mean a "non-exclusive or".
Those of skill in the art will further appreciate that the various illustrative logical blocks, units, and steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate the interchangeability of hardware and software, various illustrative components, elements, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design requirements of the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present embodiments.
The various illustrative logical blocks, or elements, described in connection with the embodiments disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor, an Application Specific Integrated Circuit (ASIC), a field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general-purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a digital signal processor and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a digital signal processor core, or any other similar configuration.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may be stored in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. For example, a storage medium may be coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC, which may be located in a user terminal. In the alternative, the processor and the storage medium may reside in different components in a user terminal.
In one or more exemplary designs, the functions described above in connection with the embodiments of the invention may be implemented in hardware, software, firmware, or any combination of the three. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media that facilitate transfer of a computer program from one place to another. Storage media may be any available media that can be accessed by a general purpose or special purpose computer. For example, such computer-readable media can include, but is not limited to, RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to carry or store program code in the form of instructions or data structures and which can be read by a general-purpose or special-purpose computer, or a general-purpose or special-purpose processor. Additionally, any connection is properly termed a computer-readable medium, and, thus, is included if the software is transmitted from a website, server, or other remote source via a coaxial cable, fiber optic cable, twisted pair, Digital Subscriber Line (DSL), or wirelessly, e.g., infrared, radio, and microwave. Such discs (disk) and disks (disc) include compact disks, laser disks, optical disks, DVDs, floppy disks and blu-ray disks where disks usually reproduce data magnetically, while disks usually reproduce data optically with lasers. Combinations of the above may also be included in the computer-readable medium.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are merely exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, 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 (10)
1. A running interaction method for multi-person competition is characterized in that running users comprise at least a first running user and a second running user, and the method comprises the following steps:
step one, a first running user establishes a first running plan task;
a first running user sends competition invitation information to other running users and/or a sharing platform;
at least one second running user receives the competition invitation information and selects to accept the competition invitation to become a competition running user;
step two, one of the competitive running users establishes a first planned path graph; and sending the path information to other competitive running users, and after the competitive running users confirm and agree with the first planned path graph;
step three, each competitive running user starts a map program respectively, and establishes a running planned path on a specified map area through a passable road on the map area according to the first planned path graph;
step four, each competitive running user respectively starts a running program, displays respective movement paths on respective map areas according to respective positioning information,
when the coverage rate of the motion path and the running plan path reaches a set value, outputting a task completion signal;
step five, storing a running plan path, a running path and a running parameter according to the task completion signal, and outputting a running task completion report; each task completion signal and the running task completion report are sent to other running users;
and each competitive running user receives task completion signals and running task completion reports of other competitive running users, and generates competitive ranking report information according to all the received task completion signals and running task completion reports.
2. A running interaction method of multi-person competition as claimed in claim 1, wherein the first running plan task includes a set mileage value, and a difference between the mileage value of the running plan path established by the competitive running user and the set mileage value is within a set range;
the first running plan task comprises a tracing mode, a road finding mode and/or a team forming mode;
in the racing mode, in the fourth step, the map program of each racing running user displays the respective running planned path;
in the way finding mode, in the fourth step, the map program of each competitive running user hides the respective running planned path, and when the positioning information of the competitive running user is superposed with the running planned path in the map, the running planned path of the superposed part is displayed;
and in the team forming mode, in the fourth step, the competitive running users are grouped, at least two competitive running users are arranged in each group, and one section of the running planned path is respectively distributed to the competitive running users in each group.
3. The running interaction method of multi-person competition of claim 1, wherein the step four further comprises, after starting the running program, the running program outputting path navigation instruction information according to the running planned path and the real-time location point information; and step two, establishing a plan path graph to establish a plurality of sub-plan path graphs, and combining the specified sub-plan path graphs into the plan path graph.
4. A running interaction method for multi-person competition as claimed in claim 1, wherein in step four, when the running program is stopped and the coverage rate of the motion path and the running plan path is lower than a set value, an unfinished running plan task is established, and the progress data of the current running plan path is stored.
5. A multi-person interactive running method as claimed in claim 4, further comprising a sixth step after the fifth step of obtaining an unfinished running plan task, and going to the fourth step.
6. A running interaction method of multi-person competition as claimed in claim 4, further comprising a seventh step after the fifth step of obtaining an incomplete running plan task, establishing a second running plan path on the running plan path of the incomplete running plan task to form a new running plan path, and going to the fourth step.
7. A running interaction method for multi-person competition according to claim 5 or 6, wherein the movement path is set to a designated color, and when an unfinished running plan task is acquired and a running program is started, the color of the movement path is set to a color different from that of the saved movement path.
8. A running interaction method for multi-person competition as claimed in claim 1, wherein the third step comprises setting a planned running mileage value, the map program establishes a running planned route via passable roads on a designated map area according to the mileage value within a range of ± 10% of the planned running mileage value and the planned route graphic on the map area.
9. A running interaction method for multi-person competition as claimed in claim 1, wherein the step one further comprises starting a running interaction application, wherein the running application comprises a map program, a running program, a user module and a sharing module; and logging in the user module.
10. A running interaction method according to claim 9, further comprising a sharing step after the fifth step, wherein the running task completion report is sent to the sharing module, the running task completion report includes a sharing information data packet formed by combining graphics, text and voice information, and the sharing information data packet includes the planning path graphics and/or the running planning path data information; and the sharing information data packet is output by the sharing module to be displayed or shared to other users.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111678678.1A CN114307102A (en) | 2021-12-31 | 2021-12-31 | Running interaction method for multi-person sports |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111678678.1A CN114307102A (en) | 2021-12-31 | 2021-12-31 | Running interaction method for multi-person sports |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114307102A true CN114307102A (en) | 2022-04-12 |
Family
ID=81023590
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111678678.1A Pending CN114307102A (en) | 2021-12-31 | 2021-12-31 | Running interaction method for multi-person sports |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114307102A (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20050022583A (en) * | 2003-08-27 | 2005-03-08 | 이소학 | Method of measuring a stride and calculating a quantity of motion based the stride, and apparatus |
| CN104011762A (en) * | 2011-12-23 | 2014-08-27 | 艾肯运动与健康公司 | Competitive Race System |
| CN106669113A (en) * | 2016-12-26 | 2017-05-17 | 咪咕互动娱乐有限公司 | Running path combination method and device |
| CN107516350A (en) * | 2017-08-17 | 2017-12-26 | 杭州青橄榄网络技术有限公司 | Mobile morning run Work attendance method and system based on virtual route |
| CN107861993A (en) * | 2017-10-18 | 2018-03-30 | 北京卡路里信息技术有限公司 | A kind of data processing method and device for running application program |
| CN107861992A (en) * | 2017-10-18 | 2018-03-30 | 北京卡路里信息技术有限公司 | A kind of running route processing method and apparatus |
| CN108458724A (en) * | 2017-12-29 | 2018-08-28 | 青岛真时科技有限公司 | A kind of step-recording method and device |
| CN111162997A (en) * | 2019-12-30 | 2020-05-15 | 欧阳龙江 | Multi-motion-track synchronous recording method, application and terminal |
| CN111178643A (en) * | 2020-01-09 | 2020-05-19 | 广东乐心医疗电子股份有限公司 | Intelligent guide method and system for group sports |
| CN111466621A (en) * | 2020-04-15 | 2020-07-31 | 深圳市吉迩科技有限公司 | Method and system capable of realizing scoring function and aerosol generating device |
-
2021
- 2021-12-31 CN CN202111678678.1A patent/CN114307102A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20050022583A (en) * | 2003-08-27 | 2005-03-08 | 이소학 | Method of measuring a stride and calculating a quantity of motion based the stride, and apparatus |
| CN104011762A (en) * | 2011-12-23 | 2014-08-27 | 艾肯运动与健康公司 | Competitive Race System |
| CN106669113A (en) * | 2016-12-26 | 2017-05-17 | 咪咕互动娱乐有限公司 | Running path combination method and device |
| CN107516350A (en) * | 2017-08-17 | 2017-12-26 | 杭州青橄榄网络技术有限公司 | Mobile morning run Work attendance method and system based on virtual route |
| CN107861993A (en) * | 2017-10-18 | 2018-03-30 | 北京卡路里信息技术有限公司 | A kind of data processing method and device for running application program |
| CN107861992A (en) * | 2017-10-18 | 2018-03-30 | 北京卡路里信息技术有限公司 | A kind of running route processing method and apparatus |
| CN108458724A (en) * | 2017-12-29 | 2018-08-28 | 青岛真时科技有限公司 | A kind of step-recording method and device |
| CN111162997A (en) * | 2019-12-30 | 2020-05-15 | 欧阳龙江 | Multi-motion-track synchronous recording method, application and terminal |
| CN111178643A (en) * | 2020-01-09 | 2020-05-19 | 广东乐心医疗电子股份有限公司 | Intelligent guide method and system for group sports |
| CN111466621A (en) * | 2020-04-15 | 2020-07-31 | 深圳市吉迩科技有限公司 | Method and system capable of realizing scoring function and aerosol generating device |
Non-Patent Citations (1)
| Title |
|---|
| 安风涛 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jones et al. | ONTRACK: Dynamically adapting music playback to support navigation | |
| CN101361092A (en) | Join in-progress on-line game session | |
| US20140171194A1 (en) | Methods, devices, and systems for video gaming | |
| US11911693B2 (en) | Inter-vehicle electronic games | |
| CN105469330B (en) | Intelligent scenic spot tour guide system based on task completion | |
| WO2020129753A1 (en) | Communication method and communication system via avatar | |
| US11673050B2 (en) | Node based world mapping for finite, depth first search | |
| Yarwood et al. | ‘N‐gauging’geographies: craft consumption, indoor leisure and model railways | |
| KR101059974B1 (en) | Offline location interlocking game operating system using mobile communication terminal | |
| CN114307102A (en) | Running interaction method for multi-person sports | |
| CN114323048A (en) | Method for constructing interactive running path | |
| CN114288633A (en) | Running interaction method for multi-person interaction | |
| US20220306159A1 (en) | Method of providing self-driving vehicle-connected tourism service | |
| Wan | O-Mopsi: Location-based orienteering mobile game | |
| CN114323049A (en) | Running interaction method | |
| Henthorn et al. | Rewriting neighbourhoods: Zombies, Run! and the runner as rhetor | |
| KR19990073202A (en) | System for relaying racing games in real time | |
| Loudoun et al. | Making choices in digital play spaces: Children’s experiences | |
| Glas et al. | The politics of game canonization: Tales from the frontlines of creating a national history of games | |
| CN114288632A (en) | Interactive running path covering display method | |
| Akin | Communication with the social environment in multiplayer online games: The Turkey case | |
| JP4219802B2 (en) | Game system | |
| JPH08299594A (en) | Game device | |
| JP2002035430A (en) | Game system by player's other self and game software therefor | |
| Cheremnykh | Gaming the Metaverse: user experience analysis and insights from Fortnite |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20220412 |
|
| WD01 | Invention patent application deemed withdrawn after publication |