CN113704379B - Travel route generation method, system and storage medium based on full route - Google Patents
Travel route generation method, system and storage medium based on full route Download PDFInfo
- Publication number
- CN113704379B CN113704379B CN202111059211.9A CN202111059211A CN113704379B CN 113704379 B CN113704379 B CN 113704379B CN 202111059211 A CN202111059211 A CN 202111059211A CN 113704379 B CN113704379 B CN 113704379B
- Authority
- CN
- China
- Prior art keywords
- path
- travel
- user
- scenic spot
- destination
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 230000008569 process Effects 0.000 claims description 14
- 230000004308 accommodation Effects 0.000 claims description 10
- 238000004590 computer program Methods 0.000 claims description 3
- 238000012790 confirmation Methods 0.000 abstract description 3
- 238000012545 processing Methods 0.000 abstract description 3
- 238000004364 calculation method Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 238000013459 approach Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000001788 irregular Effects 0.000 description 2
- 238000012216 screening Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 230000000739 chaotic effect Effects 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- 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
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
- G06Q30/0635—Processing of requisition or of purchase orders
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/12—Hotels or restaurants
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/14—Travel agencies
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Tourism & Hospitality (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Primary Health Care (AREA)
- General Health & Medical Sciences (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Health & Medical Sciences (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Development Economics (AREA)
- Remote Sensing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Navigation (AREA)
Abstract
The invention relates to the field of data processing, in particular to a travel journey generation method, system and storage medium based on a full journey. The method, system and storage medium perform the steps of: s1, acquiring electronic map data and scenic spot associated data; s2, acquiring a departure place, a destination and a traffic mode of a user; s3, establishing a round-trip direct path, and marking one or more scenic spots located on the round-trip direct path as intermediate nodes; s4, generating a going-away playing path; s5, generating a return play path; s6, generating an order for confirmation by a user; and S7, confirming and paying the order, and placing the order to the public platform according to the order. The invention takes the round trip whole journey of the trip as a deployment object, takes the quick path of the round trip whole journey as a planning basis, takes the place of a scenic spot on the quick path as a reference variable, and can reserve various tickets in the trip after order information is finished, thereby ensuring the convenience and certainty of free trip planning.
Description
Technical Field
The invention relates to the field of data processing, in particular to a travel journey generation method, system and storage medium based on a full journey.
Background
With the development of information and the convenience of traffic at present, people often select travel as a mode of entertainment relaxation in leisure time, and compared with the prior art of buying service packages from travel agencies, more and more people select themselves to arrange travel formation, commonly called free travel, which has higher freedom degree and can be selected according to own interests, time and economic conditions in aspects of routes, scenic spots, accommodation and the like. When a general user performs free travel scheduling, the user usually searches through a network, and the user generally selects a destination which has never been visited to travel, so that the user needs to search for a large amount of peripheral information about the strange destination, such as routes, accommodations, scenic spots, catering and the like, and search and compare the time, price, convenience and the like of each element, so that a large amount of time is required, and the rationality of the travel cannot be guaranteed.
To solve this problem, some existing travel service institutions or online platforms, and mobile phone applications also put forward some ways to assist people in planning their journey. For example, a travel route is planned for the user by acquiring information of a destination, a play time, a consumption grade, a travel mode and the like of the user. The document with the application number of 201810235806. X discloses a method for constructing a plurality of travel routes according to departure places, destinations and midway travel points of tourists, drawing an initial recommended travel route by taking the travel points as route points, sending the initial recommended travel route to a user for the user to screen the points of interest, and connecting all the points of interest in series according to the starting points, the ending points and the screening results of the user to finally obtain an optimized route. The method has the advantages that the interest points of possible routes between the starting point and the destination point are displayed on the map, the route is recommended according to the interest points of the routes and then screened by a user, the interest points of the routes can be selected on the travel route by the user, the travel planning in the middle between the starting place and the destination point is provided, the travel content is well enriched, the travel planning is relatively suitable for free travel, but the method also has some problems, for example, the initial recommended travel route is planned according to the travel interest points, most of the travel interest points are in suburbs or mountain areas with unique natural landscapes, the traffic of the initial recommended travel route formed by connecting the interest points in series is inconvenient compared with the common highways, the traffic inconvenience of the whole route is further aggravated, the user consumes a large amount of time in the traffic process, and the effective travel time is greatly compressed; the tourist interest points are generally established according to scenic spots, the distribution of the scenic spots is irregular on a map, a plurality of recommended lines which are tortuous and complicated are obtained by determining the recommended tourist travel lines according to the irregular scenic spot positions, the recommended lines are overlapped and crossed, and the difficulty of viewing and selecting by a user is great. Therefore, the scheme can enrich the travel content in practical application, but the difficulty of selection is high in practical application of a user, and the travel efficiency is greatly reduced by adopting the route design mode.
In other travel route planning strategies, a reference journey is provided for the user by combining key information input of the user and big data analysis of travel related industry and traffic information, and the following problems still exist although the selection difficulty of the user can be reduced:
firstly, the thought or algorithm of the travel planning is basically consistent with the thought of the travel agency for designing the travel route, the planned route has little difference with the products provided by the travel agency, the user can not save more cost under the condition of adopting the same traffic, accommodation, catering and other conditions, the efficiency is lower than that of following the group, and the characteristics of free following of free running cannot be reflected;
secondly, the user selected items often cannot actually achieve purchasing operation during actual purchasing, taking a user traveling in public transportation as an example, after the existing recommendation system recommends a journey for the user, the user can reserve tickets, hotels, scenic spot tickets and the like according to the journey, but in a traveling season, the user cannot reserve required tickets, and the planned route is an invalid route in fact;
thirdly, some platforms need to collect privacy information such as occupation, income level, consumption preference and the like of users for more accurate route recommendation, and as non-supervision end application, the privacy information is not collected as a calculation basis, so that information leakage risks exist.
Disclosure of Invention
In a first aspect, the present invention provides a travel itinerary generation method based on a full itinerary that has a high degree of freedom of deployment, is itinerary efficient, and does not collect unnecessary information.
The method comprises the following steps:
s1, acquiring electronic map data and scenic spot associated data, and marking scenic spots in the electronic map data according to the electronic map data and the scenic spot associated data to obtain scenic spot marked electronic map data, wherein the scenic spot associated data at least comprises scenic spot position data;
s2, acquiring a departure place, a destination and a traffic mode of a user;
s3, establishing a round trip direct path which takes a departure place as a starting point and an ending point and takes a destination as a passing point according to the destination and the departure place, wherein the round trip direct path comprises a round trip path from the departure place to the destination and a round trip path from the destination to the departure place, and selecting one or more scenic spots on the round trip direct path as intermediate nodes to mark on the round trip direct path according to scenic spot marking electronic map data;
s4, the user selects part of intermediate nodes from the travel path, and a travel path is generated according to the selected intermediate nodes, the departure place and the destination, wherein the travel path comprises the travel path and the intra-node path of the intermediate nodes selected by the user;
S5, the user selects part of the remaining intermediate nodes from the return path, and generates a return play path according to the selected remaining intermediate nodes, the destination and the departure place, wherein the return play path comprises a return path and a node internal path of the remaining intermediate nodes selected by the user;
s6, acquiring ticket information required by the whole travel process of the user, calling order information of a public platform according to the selected intermediate node and the destination on the round-trip direct path, generating an order for the user to confirm, and if the calling order information fails, recording a failure reason and returning to the step S3;
s7, if the user needs to modify the order, returning to the step S3 to reselect the intermediate node; if the user confirms and pays the order, placing the order to the public platform according to the order, generating a travel record and returning to the user; if the order was not placed, return to step S3 and reselect the intermediate node.
By adopting the method, when a user selects a travel destination, the round trip process is taken as a deployment object, the quick path of the round trip process is taken as a planning basis, the place of a scenic spot on the quick path is taken as a reference variable, the recommended path is obtained by combining the factors of the aspects, so that the user can select whether the destination needs to be added in the travel process, the intermediate node reserved by the user is added into the travel after the selection, the travel deployment is completed, the traffic convenience of the travel route of the user is ensured, the flexibility of the deployment of the midway destination can be provided, the order information is generated by combining the deployed travel, various ticketing in the travel can be reserved after the order information is completed, the deployed travel can be realized in reality, and the convenience and the certainty of free travel planning are ensured.
In one possible implementation, the departure point in step S2 includes a starting departure point and a transit departure point, which arrives directly from the starting departure point and is within a threshold range of the preset distance destination.
At this time, when the distance from the starting place to the destination is far, a route which directly reaches the destination is firstly planned in path planning, so that the problem that the planned route does not conform to the normal planning mode of daily travel due to the fact that the route is long along the way and the passing scenic spots are too many and the route is split into a plurality of small routes is avoided.
In one possible implementation manner, the step S3 of establishing a round trip direct path with the departure point as a starting point and an ending point and the destination as a passing point according to the destination and the departure point further includes the steps of:
s31, taking a departure place as a starting point, taking a destination as an end point, and taking a traffic mode as a reference to establish a travel path;
s32, taking a destination as a starting point, taking a departure place as an end point, and taking a traffic mode as a reference to establish a return path;
s33, combining the forward path and the return path into a round trip direct path by taking the destination as a connection point.
By adopting the method, the general calculation mode that the existing electronic map can only calculate the one-way path is avoided, and conditions are provided for effectively establishing the full-travel deployment.
In one possible implementation, step 3 further includes the steps of:
s34, reverse selection association is established between the same intermediate nodes on the forward path and the return path, and the same intermediate nodes on the forward path and the return path cannot be selected simultaneously according to the reverse selection association.
If a tourist goes through a certain intermediate node to play in the going-way path, the intermediate node is not normally moved out in the returning process, so that the alternative options listed in the returning process not only increase the responsibility of the alternative options, but also belong to the invalid options, are easily selected by misoperation, establish reverse selection association and further reduce the alternative options, and the selection operation of a user is more convenient and effective.
In one possible implementation, the generating the outgoing play path in step S4 according to the selected intermediate node, the departure place and the destination further includes the steps of:
s41, dividing the path of going path into a plurality of path segments along the intermediate node;
s42, taking a front section end path point and a rear section start path point of adjacent path sections in the forward path as a starting point and a finishing point, and taking a selected scenic spot in a region corresponding to the intermediate node as a secondary intermediate node to generate an intermediate path;
S43, combining the path segments of the travel path and the intermediate path to generate a travel play path.
In one possible implementation, generating the return play path in step S5 according to the selected remaining intermediate nodes, destination and departure place further includes the steps of:
s51, dividing a return path into a plurality of path segments along the rest intermediate nodes;
s52, taking a front section tail path point and a rear section start path point of adjacent path sections in the return path as a starting point and a finishing point, and taking a selected scenic spot in a region corresponding to the intermediate node as a secondary intermediate node to generate an intermediate path;
s53, combining the multiple path segments of the return path and the intermediate path to generate a return play path.
In a possible implementation manner, the scenic spot related information further includes scenic spot grading information, and in step S3, one or more scenic spots located on the round-trip direct path are selected as intermediate nodes according to the electronic map data of the scenic spot label, and the scenic spot is selected as the priority of the intermediate nodes according to the grade of the scenic spot grading information when the scenic spot is marked on the round-trip direct path.
In a possible implementation manner, the scenic spot related information further includes scenic spot surrounding corresponding accommodation point data, the accommodation options are contained in the intermediate node marks, and after the user selects the accommodation options, the user reads the scenic spot surrounding corresponding accommodation point data for selection.
On the other hand, the invention also provides a travel journey generating system based on the full journey, which is characterized by comprising the following steps:
the data center module is provided with an electronic map unit and a scenic spot data unit and is used for storing electronic map data and scenic spot associated data respectively;
the input module is used for receiving ticket information and operation information required by the departure place, the destination, the traffic mode, the whole journey of the travel of the user which are input by the user;
the round trip route generation module reads the electronic map data of the data center module according to the departure place, the destination and the traffic mode input by the user in the input module and generates a round trip direct route;
the node deployment module is used for reading the scenic spot related data of the data center and the round trip direct path generated by the round trip path generation module, and marking the scenic spot or scenic spots on the round trip direct path as intermediate nodes;
the order generation module is used for calling order information of the public platform according to the operation information of a user on the intermediate node on the round-trip direct path on the input module;
and the order payment module is used for paying the order information according to the operation information of the user on the input module.
In another aspect, the present invention also provides a storage medium storing a computer program comprising program instructions which, when executed by a processor, cause the processor to perform the method of the first aspect.
Drawings
Fig. 1 is a flowchart of a first embodiment of the present invention.
Fig. 2 is a flow chart of a third embodiment of the present invention.
Fig. 3 is a flow chart of a fourth embodiment of the present invention.
Fig. 4 is a detailed flowchart of step S4 in the first to fourth embodiments of the present invention.
Fig. 5 is a detailed flowchart of step S5 in the first to fourth embodiments of the present invention.
Fig. 6 is a schematic block diagram of a fifth embodiment of the present invention.
Detailed Description
The first embodiment of the invention provides a travel itinerary generating method based on a full itinerary, which has high deployment freedom, effective itinerary and does not collect unnecessary information. The method comprises the following steps:
s1, acquiring electronic map data and scenic spot associated data, and marking scenic spots in the electronic map data according to the electronic map data and the scenic spot associated data to obtain scenic spot marked electronic map data, wherein the scenic spot associated data at least comprises scenic spot position data;
The electronic map data can be derived from various commercial platforms, such as a hundred-degree map and a high-land map, and are provided with an open platform for providing basic data for secondary development, and the electronic map data in the embodiment is mainly used for planning traffic and matching scenic spots, so that the acquired electronic map data can be subjected to data reduction processing at first, map information which is irrelevant to travel, such as an industrial area, a residential area, an office area, a school, a government, a hospital and the like, is deleted, and the loading speed of the electronic map data can be greatly improved after the related data is deleted because the related data of the reserved road and scenic spots only occupy a small proportion of the whole electronic map data.
One of the basic functions of the scenic spot association data is to record scenic spot location data, although the electronic map data already contains the geographical location information of the scenic spot, but the scenic spot on the path cannot be automatically displayed when the electronic map data is used for path planning, so in this embodiment, the scenic spot association data is used as an independent data source, the province, city, county etc. data of a certain path can be obtained after the electronic map data is obtained, and the scenic spot traversed by the path can be obtained by searching the location data in the scenic spot association data.
Meanwhile, in the scenic spot association data, reference information such as ticket prices of the mounting scenic spots, weather in a future period and the like can be mounted for reference by a user, and in principle, all stored and called information is public information, and purchase amount and evaluation information of all tourist portals or forums are not collected through technical means such as web crawlers and the like to carry out heat analysis on the scenic spots.
S2, acquiring a departure place, a destination and a traffic mode of a user;
the acquisition of the departure place and the destination of the user is a prerequisite condition for path planning, the acquisition of the traffic mode is a reference condition for path planning, the acquisition mode can provide a filling or selecting form for the user through a client interface, and the current position of the user can be directly acquired as the departure place through acquiring positioning information. In the aspect of traffic mode selection, the main purpose of the embodiment is to reasonably provide the travel arrangement for the user, improve the efficiency and the guiding precision, so that the existing traffic modes with low requirements on time planning, such as riding and walking, can be temporarily ignored.
S3, establishing a round trip direct path which takes a departure place as a starting point and an ending point and takes a destination as a passing point according to the destination and the departure place, wherein the round trip direct path comprises a round trip path from the departure place to the destination and a round trip path from the destination to the departure place, and selecting one or more scenic spots on the round trip direct path as intermediate nodes to mark on the round trip direct path according to scenic spot marking electronic map data;
In this step, establishing a round trip direct path is a major feature that is different from the existing trip planning method.
Firstly, the existing planning generally plans a trip route, route points are added in the trip route, and the main destination of the tourist is arranged at the end of the trip, so that if the mode is not well controlled, the condition that the middle trip greatly compresses the playing time of the destination is caused, and the difficulty of the user trip arrangement is improved. According to the round trip of the user as a whole, according to the planning mode, the user can arrange the destination at the first playing position, play the destination at other approach points in the process of the round trip, and also can arrange the destination at the middle section of the trip, play the destination at each approach point in the round trip diagram, so that the flexibility of the user in the arrangement of the round trip is greatly improved.
And secondly, the direct path shows that the route planning takes the departure place and the destination as main basis, no matter how the route planning is calculated or the route arriving efficiency is better than the existing route planning mode taking the scenic spots as the basis, because the scenic spot distribution is disordered, other routes (such as a route, a railway and a highway) can just pass through all scenic spots or main scenic spots between two places except self-driving, the route planning is split into various short-distance and different-direction scattered routes, the efficiency of the routes is greatly reduced, various passing modes can be utilized most efficiently by generating the direct path, the travel efficiency is improved, the time spent by the user in the way is saved, and more time is used for scenic spot sightseeing and other play activities.
S4, the user selects part of intermediate nodes from the outgoing path, and an outgoing playing path is generated according to the selected intermediate nodes, the departure place and the destination, wherein the outgoing playing path comprises the outgoing path and the intra-node path of the intermediate nodes selected by the user.
After marking the intermediate nodes in step S3, the tourist may select one or some intermediate nodes selectively, or may not select all intermediate nodes, so that a selection process is required for the user, so that in step S4, selection data of the user for the intermediate nodes on the travel path is collected, and local one or more scenic spots may be included in the intermediate nodes, and at this time, intra-node data may be further generated according to the electronic map data, so as to guide travel activities of the user in the intermediate nodes on the travel path.
S5, the user selects part of the remaining intermediate nodes from the return path, and a return play path is generated according to the selected remaining intermediate nodes, the destination and the departure place, wherein the return play path comprises the return path and the intra-node path of the remaining intermediate nodes selected by the user.
Similarly, in step S5, selection data of the user for the intermediate node on the return path is collected, where the intermediate node may include one or more local scenic spots, and at this time, intra-node data may be further generated according to the electronic map data, so as to guide the travel activity of the user in the intermediate node on the return path.
It should be noted that, the execution sequence between the steps S4 and S5 is not necessarily limited, the step S4 may be executed first, then the step S5 may be executed first, then the step S4 may be executed, and the intermediate node selection environments of the forward path and the return path may be displayed on one interface at the same time. For example, the forward path and the return path are represented by two opposite arrows, with each intermediate node candidate listed in the order traversed alongside the respective arrow.
S6, ticket information required by the whole journey of the travel of the user is obtained, and order information of a public platform is called according to the selected intermediate node and the destination on the round trip direct path to generate an order for the user to confirm;
after steps S4 and S5, the result of the destination scenic spot and the intermediate scenic spot selected by the user is determined, at this time, in order to enable the user to truly realize travel according to the established route, the user who makes a round trip through public transportation needs to purchase or reserve tickets for each scenic spot, and further needs to reserve air tickets, train tickets, bus tickets, and the like, so as to avoid the problem that the predetermined route is invalid because the user cannot purchase tickets or corresponding traffic tickets cannot be purchased until the travel is completed, in this embodiment, after the step S4 and the step S5 are completed, the scenic spot selection of the user is acquired, and referring to the traffic mode selected by the user in the step S2, the ticket information required by the user in the whole journey is analyzed through step S6, and then the corresponding ticket is retrieved from the public platform for selling the ticket information, including time, price and other data for retrieving the ticket information, and the order form is generated for confirmation by the user according to the data, if the order retrieving information fails, the ticket corresponding to indicate that the order information is completed, the purchase condition may be completed or the purchase condition is failed, and the order is required to be effectively stopped, and the step S is required to be normally stopped, and the step 3 is required to be returned for the purchase condition is effectively lost.
When order information of the public platform is called, the order information on the public portal can be read through a server or application, for example, related information is queried and read from a carrying process and 12306, or a background data interface with scenic spots, airlines and traffic departments is established, related order information is directly read from the background of ticket issuers, and when the conditions are not met, the order of a user can be split, related order information is queried manually and fed back to the user side in a centralized manner.
S7, if the user needs to modify the order, returning to the step S3 to reselect the intermediate node; and if the user confirms and pays the order, placing the order to the public platform according to the order, generating a travel record and returning to the user.
After the user obtains the order, the corresponding scenic spot or traffic information on the bill may need to be modified due to the relation of time or price, at this time, the operation of deleting, modifying, adding and the like on the intermediate node may be returned to step S3, then a new order confirmation is generated through S4-S6, when the user does not need to modify the order or after the modification of the order is completed, the user can confirm the order and make concentrated payment, and after the payment is successful, the complete travel record may be returned to the user as a fixed travel deployment as a reference and guide.
In general, in the first embodiment, when a user selects a travel destination, the round trip process of travel is taken as a deployment object, the quick path of the round trip process is taken as a planning basis, the place of a scenic spot on the quick path is taken as a reference variable, the above factors are combined to obtain a recommended path, so that the user can select whether the destination needs to be added during travel, and after selection, the intermediate node reserved by the user is added to a trip, thereby completing the deployment of the trip, ensuring the traffic convenience of the travel route of the user, providing the flexibility of deployment of the midway destination, simultaneously combining the deployed trip to generate order information, and reserving various tickets in the trip after the completion of the order information, thereby ensuring that the deployed trip can be realized in reality and ensuring the convenience and certainty of free-running trip planning.
However, the first embodiment described above is effective when the distance between the departure point and the destination is relatively short, i.e., the feasibility is relatively high, for example, when the departure point and the destination are separated by only two cities, if there are two famous sceneries in one city, then it is relatively convenient for the user to make a reasonable choice as the intermediate node mark. However, if the intermediate nodes are marked in the first embodiment, the intermediate nodes are densely covered on the round-trip direct path from Shanghai to Guilin, and the intermediate nodes can be screened under the selection of the user, but the selection items are too many, so that the user has great inconvenience in terms of difficulty in making the selection or complexity of the selection operation, and the user cannot play each scenic spot through, so that even if a few scenic spots wanted by the user exist in the plurality of intermediate nodes at this time, a large number of invalid options still exist for the user to select, and the user is unfavorable for making an accurate judgment. In order to solve this problem, a second embodiment is further proposed on the basis of the first embodiment described above.
In a second embodiment, the departure place in step S2 includes a starting departure place and a transit departure place, which is directly reached from the starting departure place and is within a threshold range of a preset distance destination. Specifically, a place is selected as a transit origin within a threshold range around a destination, the transit origin is generally a relatively concentrated transportation hub near the destination, for example, a high-speed rail station with an airport or more running lines, and if a plurality of similar places are near the destination, a place located in the direction from the starting place to the destination is selected as the transit origin, so that the total mileage of travel can be reduced, and the transportation cost can be reduced. Therefore, on the journey, the method can directly reach the transit origin from the initial origin through a direct or transfer mode, the middle does not need to be deployed with any intermediate node, then the transit origin is used as the origin for calculating the round trip direct path, and the intermediate node is deployed in the journey between the transit origin and the destination, so that the number of the intermediate nodes can be greatly reduced, and the reasonable selection by a user is more convenient. According to the scheme, the travel deployment from Shanghai to Guangxi Guilin can be directly planned, namely, shanghai is taken as an initial departure place, and is taken as a transit departure place, at the moment, a round trip direct path from Nanning to Guilin is planned, as Nanning and Guilin are separated by Liuzhou City, scenic spots of Liuzhou City are queried in scenic spot association data for user selection, and after the user selection, a travel play path from Nanning to Liuzhou entrance, liuzhou entrance to scenic spots, scenic spots to Liuzhou exit and Liuzhou exit to Guilin is generated; likewise, a route from Guilin to Nanning can be planned as a return play route. The deployment mode can avoid that nodes are deployed for users to select in each city along the way from Shanghai to Guangxi, at least more than twenty nodes can be deployed in the whole course, and the selection recommendation is too chaotic and difficult to choose for users, so that the problem can be solved by transferring to the starting place.
In the second embodiment, when the distance between the starting departure point and the destination is long, a route directly reaching the destination is firstly planned in path planning, so that the problem that the planned route does not conform to the normal planning mode of daily travel due to the fact that the route is divided into a plurality of small routes due to overlong route and too many scenic spots is avoided.
In the conventional general electronic map, only a single-way path is planned after setting the starting point and the ending point, and although the directions of the starting point and the ending point can be exchanged, only one of the going-way and the returning-way is selected for displaying, because the first embodiment is to plan the travel based on the whole going-way and the returning-way, if only a comparison reference inconvenient for the user can be displayed in one way, in order to solve the problem, a third embodiment is further proposed on the basis of the first embodiment, and on the basis of the first embodiment, in step S3, a round-trip direct path is established from the starting point and the ending point as the starting point and from the destination as the passing point, and further comprising the steps of:
s31, taking a departure place as a starting point, taking a destination as an end point, and taking a traffic mode as a reference to establish a travel path;
S32, taking a destination as a starting point, taking a departure place as an end point, and taking a traffic mode as a reference to establish a return path;
s33, combining the forward path and the return path into a round trip direct path by taking the destination as a connection point.
After steps S31-S33, the single-way paths are acquired respectively, and then the single-way paths are combined to form a complete overall path, so that a general calculation mode that the conventional electronic map can only calculate the single-way paths is avoided, and conditions are provided for effectively establishing the overall-journey deployment. By traffic means reference is meant that the establishment of a route requires the selection of a route according to the travel means, such as route selection, high-speed rail, highway, public transportation, etc., and when the travel means is different, the established routes for going and returning are also different.
It should be noted that, in this embodiment, the forward path, the return path and the round trip direct path are not limited to paths of graphic display in normal navigation, and since the embodiments of the present invention are mainly for deploying a trip for a user, and are not intended to navigate the user, and do not need to display directions, positions, and the like in real time, each path may be in a form of a route map, or may be in a form of a general list, and each node to be traversed may be displayed in sequence, and detailed information may be represented as additional information of each node.
Since the tourist plays the journey through a certain intermediate node in the journey path, the intermediate node is not usually moved to the journey in the condition of the journey, so that the alternative item listed in the journey not only increases the responsibility of the alternative item, but also belongs to the invalid item and is easily selected by misoperation, in order to simplify the alternative item, and facilitate the convenient and accurate operation of the user, a fourth embodiment is further provided on the basis of the third embodiment, and step 3 in the fourth embodiment further comprises the steps of:
s34, reverse selection association is established between the same intermediate nodes on the forward path and the return path, and the same intermediate nodes on the forward path and the return path cannot be selected simultaneously according to the reverse selection association.
The reverse selection association is established, and the alternatives can be further reduced, so that the selection operation of the user is more convenient and effective. That is, the same intermediate node on the forward path and the return path cannot be selected at the same time, and only one intermediate node can be selected, that is, the intermediate node is added on the forward path or added on the return path for the user to select the forward path through the intermediate node, and when a certain intermediate node is added on the forward path, the selection of the intermediate node on the forward path is canceled when the intermediate node is selected again on the return path, and vice versa.
In the above embodiments, the following technical solutions may be adopted for detailed routing after adding the intermediate node.
For example, the generating the outgoing play path in step S4 according to the selected intermediate node, departure place and destination further includes the steps of:
s41, dividing the path of going path into a plurality of path segments along the intermediate node;
s42, taking a front section end path point and a rear section start path point of adjacent path sections in the forward path as a starting point and a finishing point, and taking a selected scenic spot in a region corresponding to the intermediate node as a secondary intermediate node to generate an intermediate path;
s43, combining the path segments of the travel path and the intermediate path to generate a travel play path.
Still taking a high-speed rail or other train as an example, combining the technical scheme of the second embodiment, firstly planning a route from an initial departure place A directly to a transit departure place B through high speed, so as to establish a round trip direct path from the transit departure place B to a destination C, marking intermediate nodes D and E for user selection based on the direct path, when the user selects the intermediate node E, determining an arrival site E1 and an departure site E2 of the intermediate node E according to the site condition of the intermediate node E, establishing a path of E1-F-E2 according to the position of a secondary intermediate node scenic spot F in the intermediate node E, and combining the intermediate path with the whole path to form a travel play path of A-B-E1-F-E2-C. After the path is established, ticket information required by each section can be obtained, such as a-B high-speed rail ticket, a B-E1 train or bus ticket, a scenic spot F ticket, F-E2 train or bus ticket, E2-C high-speed rail ticket and the like. Wherein E1 and E2 can be the same site or different sites, according to local actual traffic line conditions.
Likewise, generating the return play path in step S5 based on the selected remaining intermediate nodes, destination and departure point further comprises the steps of:
s51, dividing a return path into a plurality of path segments along the rest intermediate nodes;
s52, taking a front section tail path point and a rear section start path point of adjacent path sections in the return path as a starting point and a finishing point, and taking a selected scenic spot in a region corresponding to the intermediate node as a secondary intermediate node to generate an intermediate path;
s53, combining the multiple path segments of the return path and the intermediate path to generate a return play path.
In the above embodiments, for selecting one or more scenic spots located on the round-trip direct path according to the scenic spot marking electronic map data as the intermediate node marking, a screening of the selected scenic spot is required for the user's travel experience, that is, a more well-known scenic spot with higher game level is recommended to the user as much as possible. In order to actually and objectively recommend the alternative options, the scenic spot related information in the above embodiments further includes scenic spot classification information, and in step S3, one or more scenic spots located on the round-trip direct path are selected as intermediate nodes according to the electronic map data of the scenic spot label, and the priorities of the intermediate nodes are selected according to the level of the scenic spot classification information when the scenic spot is marked on the round-trip direct path. The scenic spot grading information of the whole country can be obtained from the tourist directory of the national culture and tourist department, and the supervision department can adjust the grading condition of the scenic spots according to the actual running condition of each scenic spot regularly, so that the scenic spot grading information has a credible basis. According to the grading condition in the travel directory, when selecting intermediate nodes, it is preferable to select intermediate nodes with 5A scenic spots, intermediate nodes without 5A scenic spots, intermediate nodes with 4A scenic spots, and so on. In the same intermediate node, there are a plurality of peers Jing Oushi, all enumerated for selection by the user. Meanwhile, a play time reference item can be added to each scenic spot, the sum of the play time reference items of all scenic spots under each intermediate node is the play time reference item of the intermediate node, all the play time reference items are added, and the total time required by traffic is added, namely the total time required by the journey, so that a user can reasonably add or delete the intermediate node or scenic spots in the intermediate node by referring to the time and the situation of the user. The intermediate nodes and the scenic spots are in association selection relation, a user selects the intermediate nodes through selecting the scenic spots, namely, at least one scenic spot is selected by the user under one intermediate node, the intermediate node is used as the intermediate node for path calculation in the subsequent route planning, otherwise, the intermediate node only plays a role in marking recommendation and does not participate in path planning.
In addition, when the user often needs to stay locally at an intermediate node or destination, in order to further meet the needs of this part of conditions, the scenic spot related information described in the above embodiments further includes stay point data corresponding to the surrounding area of the scenic spot, where the intermediate node mark includes stay options, and after the user selects the stay options, the user reads the stay point data corresponding to the surrounding area of the scenic spot for selection.
A fifth embodiment of the present invention further provides a travel route generation system based on a full route, comprising:
the data center module 1 is provided with an electronic map unit 11 and a scenic spot data unit 12, and is used for storing electronic map data and scenic spot associated data respectively;
the input module 2 is used for receiving ticket information and operation information required by the departure place, the destination, the traffic mode, the whole journey of the travel of the user which are input by the user;
the round trip route generation module 3 reads the electronic map data of the data center module according to the departure place, the destination and the traffic mode input by the user in the input module 2 and generates a round trip direct route;
the node deployment module 4 reads the scenic spot related data of the data center and the round trip direct path generated by the round trip path generation module, and marks the scenic spot or scenic spots on the round trip direct path as an intermediate node;
The order generation module 5 calls the order information of the public platform according to the operation information of the user on the intermediate node on the round trip direct path on the input module;
the order payment module 6 pays order information according to the operation information of the user on the input module.
The above respective modules realize the functions described in the above first to fourth embodiments through data interaction between the modules and the units included therein, and a description thereof will not be repeated here.
A sixth embodiment of the present invention also provides a storage medium storing a computer program comprising program instructions which, when executed by a processor, cause the processor to perform the method of any of the first to fourth embodiments.
The foregoing description is only of the preferred embodiments of the present invention and is not intended to limit the scope of the invention, and all equivalent structures or equivalent processes using the descriptions and drawings of the present invention or directly or indirectly applied to other related technical fields are included in the scope of the invention.
Claims (10)
1. The travel route generation method based on the full route is characterized by comprising the following steps:
S1, acquiring electronic map data and scenic spot associated data, and marking scenic spots in the electronic map data according to the electronic map data and the scenic spot associated data to obtain scenic spot marked electronic map data, wherein the scenic spot associated data at least comprises scenic spot position data;
s2, acquiring a departure place, a destination and a traffic mode of a user;
s3, establishing a round trip direct path which takes a departure place as a starting point and an ending point and takes a destination as a passing point according to the destination and the departure place, wherein the round trip direct path comprises a round trip path from the departure place to the destination and a round trip path from the destination to the departure place, and selecting one or more scenic spots on the round trip direct path as intermediate nodes to mark on the round trip direct path according to scenic spot marking electronic map data;
s4, the user selects part of intermediate nodes from the travel path, and a travel path is generated according to the selected intermediate nodes, the departure place and the destination, wherein the travel path comprises the travel path and the intra-node path of the intermediate nodes selected by the user;
s5, the user selects part of the remaining intermediate nodes from the return path, and generates a return play path according to the selected remaining intermediate nodes, the destination and the departure place, wherein the return play path comprises a return path and a node internal path of the remaining intermediate nodes selected by the user;
S6, acquiring ticket information required by the whole travel process of the user, calling order information of a public platform according to the selected intermediate node and the destination on the round-trip direct path, generating an order for the user to confirm, and if the calling order information fails, recording a failure reason and returning to the step S3;
s7, if the user needs to modify the order, returning to the step S3 to reselect the intermediate node; if the user confirms and pays the order, placing the order to the public platform according to the order, generating a travel record and returning to the user; if the order was not placed, return to step S3 and reselect the intermediate node.
2. The full travel itinerary generating method according to claim 1, wherein the departure place in step S2 comprises a starting departure place and a transit departure place, the transit departure place being directly reached from the starting departure place and being within a preset threshold range of distance destination.
3. The full-travel-based travel route generation method according to claim 1, wherein the step S3 of establishing a round-trip direct route from the departure point as a start point and an end point and from the destination point as a pass point according to the destination point and the departure point further comprises the steps of:
S31, taking a departure place as a starting point, taking a destination as an end point, and taking a traffic mode as a reference to establish a travel path;
s32, taking a destination as a starting point, taking a departure place as an end point, and taking a traffic mode as a reference to establish a return path;
s33, combining the forward path and the return path into a round trip direct path by taking the destination as a connection point.
4. The full travel itinerary generating method according to claim 1, wherein the step 3 further comprises the steps of:
s34, reverse selection association is established between the same intermediate nodes on the forward path and the return path, and the same intermediate nodes on the forward path and the return path cannot be selected simultaneously according to the reverse selection association.
5. The full travel distance generation method according to claim 1, wherein the generation of the travel distance play path according to the selected intermediate node, the departure place and the destination in step S4 further comprises the steps of:
s41, dividing the path of going path into a plurality of path segments along the intermediate node;
s42, taking a front section end path point and a rear section start path point of adjacent path sections in the forward path as a starting point and a finishing point, and taking a selected scenic spot in a region corresponding to the intermediate node as a secondary intermediate node to generate an intermediate path;
S43, combining the path segments of the travel path and the intermediate path to generate a travel play path.
6. The full travel distance generation method according to claim 1, wherein the generation of the return travel distance from the selected remaining intermediate nodes, destination and departure point in step S5 further comprises the steps of:
s51, dividing a return path into a plurality of path segments along the rest intermediate nodes;
s52, taking a front section tail path point and a rear section start path point of adjacent path sections in the return path as a starting point and a finishing point, and taking a selected scenic spot in a region corresponding to the intermediate node as a secondary intermediate node to generate an intermediate path;
s53, combining the multiple path segments of the return path and the intermediate path to generate a return play path.
7. The full-travel-route-based travel route generation method according to claim 1, wherein the scenic spot association information further includes scenic spot classification information, and wherein in step S3, one or more scenic spot locations located on the round-trip direct path are selected as intermediate nodes according to the scenic spot classification information when the scenic spot locations are marked on the round-trip direct path as intermediate nodes according to the scenic spot classification information.
8. The full travel itinerary generating method according to claim 1, wherein the scenic spot related information further comprises scenic spot data corresponding to the surrounding of the scenic spot, the intermediate node mark comprises accommodation options, and the user reads the accommodation spot data corresponding to the surrounding of the scenic spot for selection after selecting the accommodation options.
9. Travel route generation system based on full route, characterized by comprising:
the data center module is provided with an electronic map unit and a scenic spot data unit and is used for storing electronic map data and scenic spot associated data respectively;
the input module is used for receiving ticket information and operation information required by the departure place, the destination, the traffic mode, the whole journey of the travel of the user which are input by the user;
the round trip route generation module reads the electronic map data of the data center module according to the departure place, the destination and the traffic mode input by the user in the input module and generates a round trip direct route;
the node deployment module is used for reading the scenic spot related data of the data center and the round trip direct path generated by the round trip path generation module, and marking the scenic spot or scenic spots on the round trip direct path as intermediate nodes;
The order generation module is used for calling order information of the public platform according to the operation information of a user on the intermediate node on the round-trip direct path on the input module;
and the order payment module is used for paying the order information according to the operation information of the user on the input module.
10. A storage medium, characterized in that: the storage medium storing a computer program comprising program instructions which, when executed by a processor, cause the processor to perform the method of any one of claims 1-8.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202111059211.9A CN113704379B (en) | 2021-09-10 | 2021-09-10 | Travel route generation method, system and storage medium based on full route |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202111059211.9A CN113704379B (en) | 2021-09-10 | 2021-09-10 | Travel route generation method, system and storage medium based on full route |
Publications (2)
Publication Number | Publication Date |
---|---|
CN113704379A CN113704379A (en) | 2021-11-26 |
CN113704379B true CN113704379B (en) | 2023-08-29 |
Family
ID=78659742
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202111059211.9A Active CN113704379B (en) | 2021-09-10 | 2021-09-10 | Travel route generation method, system and storage medium based on full route |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN113704379B (en) |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114418681A (en) * | 2022-01-14 | 2022-04-29 | 安徽中科美络信息技术有限公司 | Order distribution method and system in global trip |
CN116720924A (en) * | 2023-06-28 | 2023-09-08 | 上海百胜软件股份有限公司 | Transaction processing method, device, electronic equipment and storage medium |
CN116579514B (en) * | 2023-07-12 | 2023-09-26 | 湖南师范大学 | Self-driving tour planning method and system based on role collaborative recommendation |
CN117522501B (en) * | 2023-08-28 | 2024-07-23 | 广东美亚商旅科技有限公司 | Informationized labeling method and system for user air ticket order management |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106886837A (en) * | 2017-02-21 | 2017-06-23 | 携程旅游网络技术(上海)有限公司 | Free walker stroke based on time planning recommends method |
CN109063923A (en) * | 2018-08-21 | 2018-12-21 | 湖北文理学院 | A kind of tourism route planing method based on economic cost |
CN110060182A (en) * | 2019-03-16 | 2019-07-26 | 深圳壹账通智能科技有限公司 | Tourist image design method for tracing, device, computer equipment and storage medium |
CN110648027A (en) * | 2019-09-30 | 2020-01-03 | 福州林景行信息技术有限公司 | Self-driving tour digital line interactive generation system and working method thereof |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
TW200725320A (en) * | 2005-12-22 | 2007-07-01 | Mitac Int Corp | Itinerary planning system and method |
-
2021
- 2021-09-10 CN CN202111059211.9A patent/CN113704379B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106886837A (en) * | 2017-02-21 | 2017-06-23 | 携程旅游网络技术(上海)有限公司 | Free walker stroke based on time planning recommends method |
CN109063923A (en) * | 2018-08-21 | 2018-12-21 | 湖北文理学院 | A kind of tourism route planing method based on economic cost |
CN110060182A (en) * | 2019-03-16 | 2019-07-26 | 深圳壹账通智能科技有限公司 | Tourist image design method for tracing, device, computer equipment and storage medium |
CN110648027A (en) * | 2019-09-30 | 2020-01-03 | 福州林景行信息技术有限公司 | Self-driving tour digital line interactive generation system and working method thereof |
Non-Patent Citations (1)
Title |
---|
基于旅游文记的旅游景点推荐及行程路线规划系统;胡乔楠;《中国优秀硕士学位论文全文数据库 (信息科技辑)》;2016年(第2期);I138-2059 * |
Also Published As
Publication number | Publication date |
---|---|
CN113704379A (en) | 2021-11-26 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN113704379B (en) | Travel route generation method, system and storage medium based on full route | |
KR101022148B1 (en) | Navigation system, route search server, route search method, program and computer readable medium having program | |
Yang et al. | A decade of transit oriented development policies in Brisbane, Australia: Development and land-use impacts | |
CN103620345B (en) | Route is provided by information gathering and retrieval | |
KR101724211B1 (en) | System and method for providing smart travel services | |
KR102008478B1 (en) | Method for providing a one-stop travel service comprising travel route and travel products | |
Sevtsuk et al. | Predicting pedestrian flow along city streets: A comparison of route choice estimation approaches in downtown San Francisco | |
JP6190627B2 (en) | Information processing system, information processing server, information processing method, and information processing program | |
WO2021002218A1 (en) | Computer system, storage medium, and program | |
Tan et al. | Reviews on interrelationship between transportation and tourism: Perspective on sustainability of urban tourism development | |
CN114049181B (en) | OTA-based dynamic travel accommodation processing method, system and storage medium | |
JP5425455B2 (en) | Travel plan creation support device and travel plan creation support system using the same | |
Su et al. | The multimodal trip planning system of intercity transportation in Taiwan | |
CN114580796A (en) | Tour attribute path planning method | |
JP4851402B2 (en) | Information distribution system, information distribution server, portable terminal device, and information distribution method | |
KR102118172B1 (en) | Smart tour information providing system using public transportation and method thereof | |
KR100826906B1 (en) | A travel map system which uses internet | |
JPH10318770A (en) | Optimum path search system | |
JP2022064058A (en) | Server device and program | |
JP6666507B1 (en) | Computer system and program | |
JP5600389B2 (en) | Travel plan creation support device, travel plan creation support system, and travel plan creation support program | |
JP2021189818A (en) | Computer system and program | |
KR20210070000A (en) | Smart Scheduling System for Planning a Trip | |
JP2020193911A (en) | Information processing system, information processing program, information processing device, and information processing method | |
JP6364535B2 (en) | Information processing system, information processing server, information processing method, and information processing program |
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 | ||
TA01 | Transfer of patent application right |
Effective date of registration: 20230802 Address after: Room 1601, No. 555, Dongfeng East Road, Yuexiu District, Guangzhou, Guangdong 510,000 Applicant after: Guangzhou Meiying Information Technology Co.,Ltd. Address before: 528000 building 17, east gate, South xingkaixuan International District, No. 10 Xingchen Road, Chancheng District, Foshan City, Guangdong Province Applicant before: Qu Ping |
|
TA01 | Transfer of patent application right | ||
GR01 | Patent grant | ||
GR01 | Patent grant |