An advertisement publishing photographing task allocation method, device, equipment and storage medium

Abstract

The application discloses an advertisement publishing photographing task allocation method and device, equipment and storage medium, and relates to the technical field of offline advertisements. The method comprises the following steps: after obtaining the photographing requirement information of an advertiser and containing a plurality of city N photographing schemes, the advertisement publishing photographing task allocation is performed by sequentially executing the judgment, statistics and allocation actions in a loop. Compared with the existing offline advertisement technology, the task allocation result can be obtained, that is, the advertisement publishing position of the advertisement publishing photographing task allocation can be centralized in the building / point position granularity. By considering the coincidence of the selected buildings between the city N photographing schemes, the photographing task dispersion problem can be effectively avoided, the photographing workload of the first-line staff, the manpower cost and the publishing confirmation cost of the advertisement service provider are effectively reduced, the publishing confirmation efficiency is improved, and the method is convenient for practical application and popularization.

Description

Technical Field

[0001] This invention belongs to the field of offline advertising technology, specifically relating to a method, apparatus, device, and storage medium for allocating advertising broadcasting and photography tasks. Background Technology

[0002] With the continuous development and application of offline advertising technology, advertising placement equipment has gradually entered office buildings and residential communities. Obtaining advertising information through these devices has become an indispensable part of people's lives. Taking elevator advertising as an example, elevator advertising is a new type of advertising media, referring to advertisements created and displayed on the inner walls of elevators in urban buildings. Elevator advertising comes in various types, mainly in commercial elevators and building elevators. The forms primarily include smart screens or picture frames installed inside the elevator car, and advertisements directly installed on the elevator doors. Because elevator advertising directly targets its audience, it has become a medium with excellent advertising penetration, an important supplement to existing media, and a channel for market promotion. Elevator advertising can meet the needs of audiences from all walks of life, with varying educational backgrounds and consumer groups, influencing those it can reach. For businesses and enterprises, placing elevator advertisements not only enhances brand awareness and subtly embeds the brand image in consumers' minds, but it is also a means to ensure good promotional results and stable sales, while stimulating and driving demand from target consumers.

[0003] To assure advertisers that their ads are playing correctly at the agreed locations and times, advertising service providers need to provide broadcast photos. These photos contain information such as the playback device, playback screen, time, unique device identifier, and placement environment, which can be used for broadcast confirmation. Currently, the main strategies for confirming the broadcast of advertisements are the "one-floor-multiple-photos" scheme, the "one-floor-one-photos" scheme, and the "one-city-N-photos" scheme. The "one-floor-multiple-photos" scheme means that multiple photos are taken of each advertisement placement location in all selected buildings. The "one-floor-one-photos" scheme means that one photo is taken of each advertisement placement location in each of the selected buildings. The "one-city-N-photos" scheme means that N is the specific number of photos taken (which can be customized, such as 10), and one photo is taken of each advertisement placement location in each of the N selected buildings.

[0004] Currently, when allocating advertising photography tasks based on multiple "one city, N photos" schemes that correspond one-to-one with multiple published advertisements, the main approach is to first assign photography tasks to each selectable building according to the "one building, one photo" scheme. Then, the advertising photography tasks of the top N buildings in descending order of task allocation are taken as the final allocation result. Since this approach does not consider the overlap of selected buildings among the "one city, N photos" schemes, it leads to the dispersion of photography tasks, which in turn increases the workload of frontline staff, the manpower costs of advertising service providers, the publication confirmation costs, and reduces publication confirmation efficiency. Summary of the Invention

[0005] The purpose of this invention is to provide a method, apparatus, computer device, and computer-readable storage medium for allocating advertising broadcast photography tasks, in order to solve the problem that existing offline advertising technologies, when allocating advertising broadcast photography tasks based on a "one city, N photos" scheme, suffer from scattered photography tasks due to the lack of consideration for the overlap of selected properties among the "one city, N photos" schemes.

[0006] To achieve the above objectives, the present invention adopts the following technical solution:

[0007] Firstly, a method for assigning advertising broadcast photography tasks is provided, including the following steps S1 to S4:

[0008] S1. Obtain the advertising owner's photo requirement information, which includes multiple "One City, N Photos" schemes, and then execute step S2. The multiple "One City, N Photos" schemes correspond one-to-one with multiple first advertisements that need to be photographed. Each "One City, N Photos" scheme includes the number of photo requirements for the corresponding advertisement and several selectable advertisement placement locations for the corresponding advertisement. The advertisement placement location refers to a placement point or a building where the advertisement is placed. The placement point refers to the advertising placement point used to broadcast the advertisement. The building where the advertisement is placed refers to a building with at least one of the placement points. N represents a positive integer. The number of buildings to which the several advertisement placement locations belong is greater than or equal to the number of photo requirements for the corresponding advertisement.

[0009] S2. Determine whether there is a city-wide N-photo scheme among the multiple city-wide N-photo schemes. If so, proceed to step S3; otherwise, end the task allocation.

[0010] S3. Based on all the city N-photo schemes with a photo requirement number not equal to zero, count the number of times each advertisement placement appears in all the city N-photo schemes, and then proceed to step S4;

[0011] S4. For each of the city-N photo schemes that includes the advertisement placement position with the most occurrences, assign the advertisement placement photo task of the corresponding advertisement to the advertisement placement position with the most occurrences, decrement the number of photo requirements for the corresponding advertisement by one, remove the advertisement placement position with the most occurrences from the corresponding scheme, and finally return to step S2.

[0012] Based on the above-mentioned invention, a new scheme is provided for allocating advertising photo-taking tasks by considering the overlap of selected properties among the "one city, N photos" schemes. Specifically, after obtaining the advertiser's photo-taking requirements information, which includes multiple "one city, N photos" schemes, the scheme iteratively performs judgment, statistics, and allocation actions to allocate advertising photo-taking tasks. This results in a task allocation outcome that, compared to existing offline advertising technologies, concentrates the advertising placements assigned photo-taking tasks at the property / location granularity level. By considering the overlap of selected properties among the "one city, N photos" schemes, the scheme effectively avoids the problem of scattered photo-taking tasks, effectively reducing the photo-taking workload of frontline staff, the labor costs of advertising service providers, and the costs of placement confirmation, while improving placement confirmation efficiency. This facilitates practical application and promotion.

[0013] In one possible design, prior to step S2, the method further includes:

[0014] Identify the multiple ad placement locations that have been assigned ad placement and photo-taking tasks;

[0015] For each of the multiple "one city, N photos" schemes, if it is determined that there is an advertising position belonging to the multiple advertising positions in the corresponding scheme, then the advertising broadcast photo task of the corresponding advertisement is assigned to the advertising position, the number of photos required for the corresponding advertisement is decremented by one, and the advertising position is removed from the corresponding scheme.

[0016] In one possible design, when the photo-taking requirement information also includes at least one multi-photo scheme for a single floor corresponding to at least one second advertisement requiring photo-taking, and the multi-photo scheme for a single floor includes at least one building with the corresponding advertisement, the multiple advertisement placement locations already assigned to the advertisement photo-taking task are determined, including:

[0017] For each of the at least one-story-multiple-photo schemes, the advertising broadcasting and photography tasks of the corresponding advertisements are respectively assigned to each of the at least one-story-multiple-photo schemes and each of the corresponding advertisements at each of the at least one-story-multiple-photo schemes.

[0018] Based on the task allocation results of advertising publication and photography based on the at least one-story multi-photo scheme, the multiple advertising placement positions that have been assigned advertising publication and photography tasks are determined.

[0019] In one possible design, when the photo-taking requirement information also includes at least one "one-story-one-photo" scheme corresponding one-to-one with at least one third-floor advertisement requiring photo-taking, and the "one-story-one-photo" scheme includes at least one building with the corresponding advertisement, the multiple advertisement placement positions already assigned to advertisement placement photo-taking tasks are determined based on the advertisement placement photo-taking task allocation result based on the at least one "one-story-multiple-photo" scheme, including:

[0020] For each of the at least one-one-photo-per-floor schemes, based on the advertising and photo-taking task allocation results of the at least one-one-photo-per-floor schemes, the number of advertising and photo-taking tasks allocated for each of the at least one advertised properties and each advertised location of the corresponding advertisement is determined.

[0021] For each of the above-mentioned one-on-one-photo schemes, if there is at least one advertising location with a corresponding advertisement and a non-zero maximum number of advertising broadcast photo tasks already assigned, then one advertising broadcast photo task for the corresponding advertisement will be assigned to any one of the at least one advertising location.

[0022] Based on the advertising publication and photography task allocation results based on the at least one-story-multiple-photo scheme and the at least one-story-one-photo scheme, determine the multiple advertising placement positions that have been assigned advertising publication and photography tasks.

[0023] In one possible design, based on the advertising placement and photography task allocation results based on the at least one multi-photo scheme and the at least one-photo scheme, multiple advertising placement positions with assigned advertising placement and photography tasks are determined, including:

[0024] For each of the one-on-one-photo schemes, if the number of advertising broadcast photo tasks assigned to each of the corresponding advertising locations is zero, then based on the known network attributes of each of the corresponding advertising locations, it is determined whether there are any advertising locations that are not connected to the network.

[0025] For each of the above-mentioned one-on-one-photo schemes, if it is determined that there is at least one advertising location that is not connected to the network, then the advertising broadcast photo task of the corresponding advertisement is assigned to any one of the at least one advertising location; otherwise, the advertising broadcast photo task of the corresponding advertisement is assigned to any one of the advertising locations of the corresponding advertisement.

[0026] Based on the advertising publication and photography task allocation results based on the at least one-story-multiple-photo scheme and the at least one-story-one-photo scheme, determine the multiple advertising placement positions that have been assigned advertising publication and photography tasks.

[0027] In one possible design, when the advertisement placement refers to the advertised property, for each of the "One City, N Photos" schemes that includes the advertisement placement with the highest frequency of occurrence, the task of taking a photo of the corresponding advertisement is assigned to the advertisement placement with the highest frequency of occurrence, including:

[0028] For each of the "One City, N Photos" schemes that includes the most frequently advertised properties, the number of advertising publication and photography tasks allocated for each advertising location of the most frequently advertised properties is determined based on the advertising publication and photography task allocation results of the at least one-floor-multiple-photos scheme or the advertising publication and photography task allocation results of the at least one-floor-multiple-photos scheme and the at least one-floor-single-photos scheme.

[0029] For each of the "One City, N Photos" schemes, if the most frequently appearing listed property has at least one listing location with a corresponding advertisement and a non-zero maximum number of advertisement broadcasting and photography tasks already assigned, then one advertisement broadcasting and photography task for the corresponding advertisement will be assigned to any one of the at least one listing location.

[0030] For each of the "One City, N Photos" schemes, if the number of advertising broadcasting and photo-taking tasks assigned to each advertising location of the most frequently appearing listed property is zero, then based on the known network attributes of each advertising location of the most frequently appearing listed property, it is determined whether there are any advertising locations of the most frequently appearing listed property that are not connected to the network.

[0031] For each of the "One City, N Photos" schemes, if it is determined that the most frequently appearing advertised property has at least one advertising location that is not connected to the network, then the task of taking a photo of the advertisement is assigned to any one of the at least one advertising location; otherwise, the task of taking a photo of the advertisement is assigned to any one of the advertising locations of the most frequently appearing advertised property.

[0032] In one possible design, when the advertisement placement location refers to the placement point, for each of the "One City, N Photos" schemes that includes the advertisement placement location with the highest frequency of occurrence, the task of taking one advertisement placement photo for the corresponding advertisement is assigned to the advertisement placement location with the highest frequency of occurrence, including:

[0033] For each of the "One City, N Photos" schemes that includes the most frequently appearing advertising location, based on the current advertising publication and photography task allocation results, it is determined whether the building to which the most frequently appearing advertising location belongs has been allocated an advertising publication and photography task for the corresponding advertisement.

[0034] For each of the "One City, N Photos" schemes, if it is determined that the building to which the advertisement placement with the most occurrences belongs has already been assigned an advertisement placement and photo-taking task, then the assignment of one advertisement placement and photo-taking task to the advertisement placement with the most occurrences will be terminated, and the advertisement placement with the most occurrences will be removed from the corresponding scheme; otherwise, the advertisement placement and photo-taking task will be assigned to the advertisement placement with the most occurrences.

[0035] Secondly, an advertising broadcasting and photography task allocation device is provided, which includes an information acquisition module, a judgment module, a frequency statistics module and a task allocation module.

[0036] The information acquisition module, which is communicatively connected to the judgment module, is used to acquire the photo-taking requirements information of the advertiser, which includes multiple "one city, N photos" schemes, and then trigger the judgment module. The multiple "one city, N photos" schemes correspond one-to-one with multiple first advertisements requiring photo-taking. Each "one city, N photos" scheme includes the number of photo-taking requirements for the corresponding advertisement and several selectable advertisement placement locations. The advertisement placement location refers to a placement point or a building where the advertisement is placed. The placement point refers to the location where the advertisement is placed, and the building where the advertisement is placed refers to a building with at least one placement point. N represents a positive integer, and the number of buildings to which the several advertisement placement locations belong is greater than or equal to the number of photo-taking requirements for the corresponding advertisement.

[0037] The judgment module is communicatively connected to the count statistics module and is used to determine whether there is a city-N-photo scheme with a photo requirement of not being zero among the multiple city-N-photo schemes. If so, the count statistics module is triggered; otherwise, the task allocation ends.

[0038] The frequency statistics module is communicatively connected to the task allocation module. It is used to count the number of times each advertisement placement appears in all the one-city N-photo schemes based on the number of photos required (not equal to zero), and then trigger the task allocation module.

[0039] The task allocation module, which is communicatively connected to the judgment module, is used to allocate the one-time advertisement broadcast photo task of the corresponding advertisement to the advertisement placement with the most frequent occurrence in each of the city N-photo schemes, decrement the number of photo requirements of the corresponding advertisement by one, remove the advertisement placement with the most frequent occurrence from the corresponding scheme, and finally trigger the judgment module.

[0040] In one possible design, it also includes a pre-assigned location determination module and a task pre-assignment module that are connected in communication;

[0041] The assigned location determination module is communicatively connected to the information acquisition module and is used to determine multiple advertising placement locations that have been assigned advertising broadcasting and photography tasks.

[0042] The task pre-allocation module is also communicatively connected to the information acquisition module and the judgment module, respectively. It is used to, for each of the multiple one-city-N-photo schemes, if it is determined that there is an advertising position belonging to the multiple advertising positions in the corresponding scheme, then the task of taking a photo of the corresponding advertisement is assigned to that advertising position, the number of photos required for the corresponding advertisement is decremented by one, and the advertising position is removed from the corresponding scheme.

[0043] Thirdly, the present invention provides a computer device comprising a memory, a processor, and a transceiver connected in sequence for communication, wherein the memory is used to store a computer program, the transceiver is used to send and receive messages, and the processor is used to read the computer program and execute the advertising broadcasting and photography task allocation method as described in the first aspect or any possible design in the first aspect.

[0044] Fourthly, the present invention provides a computer-readable storage medium storing instructions that, when executed on a computer, perform the advertising broadcasting and photography task allocation method as described in the first aspect or any possible design in the first aspect.

[0045] Fifthly, the present invention provides a computer program product containing instructions that, when the instructions are executed on a computer, cause the computer to perform the advertising broadcasting and photography task allocation method as described in the first aspect or any possible design in the first aspect.

[0046] The beneficial effects of the above scheme are:

[0047] (1) This invention creatively provides a new scheme for allocating advertising photo-taking tasks by considering the overlap of selected properties among the "one city, N photos" schemes. That is, after obtaining the advertising owner's photo-taking requirements information that includes multiple "one city, N photos" schemes, the advertising photo-taking tasks are allocated by cyclically performing judgment, statistics and allocation actions. Compared with existing offline advertising technologies, this can achieve a task allocation result that concentrates the advertising placement positions with advertising photo-taking tasks at the granularity of the published properties / locations. By considering the overlap of selected properties among the "one city, N photos" schemes, the problem of scattered photo-taking tasks can be effectively avoided, thereby effectively reducing the photo-taking workload of front-line staff, the manpower costs of advertising service providers and the publication confirmation costs, and improving the publication confirmation efficiency, which is convenient for practical application and promotion. Attached Figure Description

[0048] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0049] Figure 1 This is a flowchart illustrating the advertising broadcasting and photo-taking task allocation method provided in an embodiment of this application.

[0050] Figure 2 An example diagram illustrating the allocation process of the advertising broadcast photo task allocation method provided in this application embodiment.

[0051] Figure 3 A schematic diagram of the advertising broadcasting and photography task allocation device provided in the embodiments of this application.

[0052] Figure 4 A schematic diagram of the structure of a computer device provided in an embodiment of this application. Detailed Implementation

[0053] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the present invention will be briefly introduced below in conjunction with the accompanying drawings and descriptions of the embodiments or the prior art. Obviously, the following description of the structure of the accompanying drawings is only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort. It should be noted that the description of these embodiments is for the purpose of helping to understand the present invention, but does not constitute a limitation of the present invention.

[0054] It should be understood that although the terms "first" and "second", etc., may be used herein to describe various objects, these objects should not be limited by these terms. These terms are only used to distinguish one object from another. For example, the first object may be referred to as the second object, and similarly, the second object may be referred to as the first object, without departing from the scope of the exemplary embodiments of the invention.

[0055] It should be understood that the term "and / or" that may appear in this document is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can mean: A exists alone, B exists alone, or A and B exist simultaneously. Another example is A, B and / or C, which can mean that any one of A, B, and C or any combination thereof exists. The term " / and" that may appear in this document describes another relationship between related objects, indicating that two relationships can exist. For example, A / and B can mean: A exists alone or A and B exist simultaneously. In addition, the character " / " that may appear in this document generally indicates that the related objects before and after it are in an "or" relationship.

[0056] Example:

[0057] like Figure 1 As shown, the advertising broadcasting and photo-taking task allocation method provided in the first aspect of this embodiment can be executed, but is not limited to, by a computer device with certain computing resources, such as a platform server, a personal computer (PC, referring to a multi-purpose computer of a size, price, and performance suitable for personal use; desktop computers, laptops, mini-laptops, tablets, and ultrabooks are all personal computers), a smartphone, a personal digital assistant (PDA), or a wearable device, etc. Figure 1 As shown, the advertising broadcasting and photo-taking task allocation method may include, but is not limited to, the following steps S1 to S4.

[0058] S1. Obtain the advertiser's photo requirements information, including but not limited to multiple "one city, multiple photos" schemes, and then execute step S2. The multiple "one city, multiple photos" schemes correspond one-to-one with multiple first advertisements requiring photo taking. Each "one city, multiple photos" scheme includes, but is not limited to, the number of photo requirements for the corresponding advertisement and several selectable advertisement placement locations. The advertisement placement location refers to a placement point or a building where the advertisement is placed. The placement point refers to an advertising location used for broadcasting the advertisement, and the building where the advertisement is placed refers to a building with at least one of the placement points. N represents a positive integer, and the number of buildings to which the several advertisement placement locations belong is greater than or equal to the number of photo requirements for the corresponding advertisement.

[0059] In step S1, the advertiser refers to the merchants and businesses that place the advertisement. Since the advertising photo-taking task is completed by frontline staff through site visits, preventing the photo-taking task from being dispersed is aimed at individual frontline staff members; that is, the advertising photo-taking task is allocated based on the photo-taking requirements information and is targeted at the same frontline staff member. When the advertisement placement location refers to the advertised property, the specific content of the "One City, N Photos" scheme is as follows: Figure 2 As shown: The multiple "one city, N photos" schemes include Scheme 1, Scheme 2, Scheme 3, and Scheme 4. For Scheme 1, the number of photos required for the corresponding advertisement is 1, and the available advertising placements include optional property CD-04, optional property CD-05, and optional property CD-06. For Scheme 2, the number of photos required for the corresponding advertisement is 1, and the available advertising placements include optional property CD-05, optional property CD-07, and optional property CD-08. For Scheme 3, the number of photos required for the corresponding advertisement is 2, and the available advertising placements include optional property CD-06, optional property CD-08, and optional property CD-09. For Scheme 4, the number of photos required for the corresponding advertisement is 3, and the available advertising placements include optional property CD-05, optional property CD-09, optional property CD-10, and optional property CD-11. When the advertisement placement location refers to the placement point, for different schemes, the several selectable advertisement placement locations can be similarly refined into at least one selectable advertisement placement point under each selectable building. Furthermore, the fact that the number of buildings to which the several advertisement placement locations belong is greater than or equal to the number of photos required for the corresponding advertisement is a prerequisite for achieving "one city, N photos" for the corresponding advertisement. The specific method for obtaining the photo requirement information is a conventional existing method, such as retrieving it by entering keywords such as city, advertising service provider, and photo time period from the advertiser's advertising contract.

[0060] S2. Determine whether there is a city-wide N-photo scheme among the multiple city-wide N-photo schemes. If so, proceed to step S3; otherwise, end the task allocation.

[0061] In step S2, the same applies. Figure 2 For example: In the first round of judgment, the city N-photo scheme with a non-zero photo requirement has schemes 1, 2, 3, and 4; in the second round of judgment, schemes 3 and 4; in the third round of judgment, schemes 3 and 4; in the fourth round of judgment, scheme 4; and so on, the task allocation will end after the fifth round of judgment.

[0062] S3. Based on all the city-wide N-photo schemes with a photo requirement number not equal to zero, count the number of times each advertisement placement appears in all the city-wide N-photo schemes, and then proceed to step S4.

[0063] In step S3, the same applies. Figure 2 For example: After the first round of judgment, the number of times the optional property CD-05 appears is 3 based on schemes 1, 2, 3 and 4; after the second round of judgment, the number of times the optional property CD-09 appears is 2 based on schemes 3 and 4; after the third round of judgment, the number of times the optional property CD-06 appears is 1 based on schemes 3 and 4; after the fourth round of judgment, the number of times the optional property CD-10 appears is 1 based on scheme 4.

[0064] S4. For each of the city-N photo schemes that includes the advertisement placement position with the most occurrences, assign the advertisement placement photo task of the corresponding advertisement to the advertisement placement position with the most occurrences, decrement the number of photo requirements for the corresponding advertisement by one, remove the advertisement placement position with the most occurrences from the corresponding scheme, and finally return to step S2.

[0065] In step S4, the same applies. Figure 2For example: After the first round of judgment, since the optional property CD-05 appears the most frequently, the task of taking one advertisement photo for each of Schemes 1, Scheme 2, and Scheme 4, which contain the optional property CD-05, can be assigned to the optional property CD-05 (specifically, but not limited to, any placement location of the advertisement for the optional property CD-05), and the number of photos required for the corresponding advertisement can be decremented by one. Then, return to step S2 for the second round of judgment; after the second round of judgment, since the optional property CD-05 appears the most frequently, the task of taking one advertisement photo for each of Schemes 1, 2, and 4, which contain the optional property CD-05, can be assigned to the optional property CD-05 (specifically, but not limited to, any placement location of the advertisement for the optional property CD-05). The task of taking one advertisement photo for each optional property CD-05 can be assigned to the optional property CD-05 (specifically, any placement location of the advertisement for the optional property CD-05), and the number of photos required for the advertisement can be decremented by one. Then, return to step S2 for the second round of judgment; after the second round of judgment, since the optional property CD-05 appears the most frequently, the .... Since -09 appears most frequently, for Schemes 3 and 4 that include the optional property CD-09, the task of taking one advertisement photo can be assigned to the optional property CD-09 (specifically, but not limited to any placement location of the advertisement for the optional property CD-09), and the number of photo requirements for the corresponding advertisement can be decremented by one. Then, return to step S2 for the third round of judgment. After the third round of judgment, since the optional property CD-06 appears most frequently (although the same applies to other properties), (There are many, but the most frequent occurrence of the optional property CD-06 can be determined by any selection method). For Schemes 3 and 4, which contain the optional property CD-06, the task of taking one advertisement photo can be assigned to the optional property CD-06 (specifically, but not limited to, any placement location of the advertisement for the optional property CD-06), and the number of photos required for the corresponding advertisement can be decremented by one. Then, return to step S2 for the fourth round of judgment. After the fourth round of judgment, since the optional property C... D-10 appears the most frequently (although other properties appear the same number of times, the most frequent appearance of the optional property CD-10 can be determined by any selection method). For Scheme 4, which includes the optional property CD-10, the task of taking a photo of the advertisement is assigned to the optional property CD-10 (specifically, but not limited to any one of the advertisement placement locations of the optional property CD-10), and the number of photo requirements for the corresponding advertisement is decremented by one. Then, the process returns to step S2 for the fifth round of judgment.Therefore, the properties assigned advertising and photography tasks are ultimately designated as CD-05, CD-06, CD-09, and CD-10. However, if existing offline advertising technology were used for task allocation, the tasks would be assigned to CD-04, CD-05, CD-06, CD-08, CD-09, and CD-10. Compared to existing offline advertising technology, this embodiment reduces the number of properties assigned advertising and photography tasks from 6 to 4 at the property listing granularity. Furthermore, by considering the overlap of selected properties in the "One City, N Photos" scheme, it effectively avoids the problem of scattered photography tasks, effectively reducing the workload of frontline staff, the labor costs of advertising service providers, and the listing confirmation costs, while improving the efficiency of listing confirmation, thus facilitating practical application and promotion. In addition, after obtaining the task allocation results for advertising placement and photography, which includes multiple advertising placement locations, the most convenient advertising placement and photography route can be generated based on the known geographical information of the multiple advertising placement locations. This route can be provided to frontline staff for visiting and taking photos, further reducing the workload of frontline staff and improving the efficiency of placement confirmation.

[0066] In step S4, to effectively avoid the problem of scattered photo-taking tasks at the granularity of the advertisement placement location and ensure the achievement of the goal of taking multiple photos of the advertisement in one city, preferably, when the advertisement placement location refers to the placement location, for each of the multiple photo-taking schemes in one city that includes the advertisement placement location with the most occurrences, the photo-taking task for one advertisement placement is assigned to the advertisement placement location with the most occurrences. This includes, but is not limited to, the following steps S51 to S52: S51. For each of the multiple photo-taking schemes in one city that includes the placement location with the most occurrences... The scheme, based on the current advertising placement and photography task allocation results, determines whether the building to which the advertising placement location with the most occurrences belongs has already been assigned an advertising placement and photography task for the corresponding advertisement; S52. For each of the "One City, N Photos" schemes, if it is determined that the building to which the advertising placement location with the most occurrences belongs has already been assigned an advertising placement and photography task for the corresponding advertisement, then the allocation of one advertising placement and photography task for the corresponding advertisement to the advertising placement location with the most occurrences is terminated, and the advertising placement location with the most occurrences is removed from the corresponding scheme; otherwise, the one advertising placement and photography task for the corresponding advertisement is allocated to the advertising placement location with the most occurrences. For example, for scheme 1, considering that the one advertising placement and photography task for the corresponding advertisement has already been allocated to a certain advertising placement location of the optional building CD-05 before the second round of judgment, if after the second round of judgment it is found that another advertising placement location of the optional building CD-05 has the most occurrences, then in order to ensure that the purpose of "One City, N Photos" for the advertisement is achieved, the allocation of one advertising placement and photography task for the corresponding advertisement to the other advertising placement location will no longer be considered.

[0067] Therefore, based on the advertising photo assignment method described in steps S1 to S4 above, a new scheme is provided for assigning advertising photo assignment tasks by considering the overlap of selected properties among the "one city, N photos" schemes. Specifically, after obtaining the advertiser's photo requirements information, which includes multiple "one city, N photos" schemes, the advertising photo assignment tasks are assigned by cyclically performing judgment, statistics, and assignment actions. This results in a task assignment outcome that, compared to existing offline advertising technologies, concentrates the advertising placements with assigned photo assignment tasks at the property / location granularity. By considering the overlap of selected properties among the "one city, N photos" schemes, the problem of scattered photo assignment tasks can be effectively avoided. This achieves the goals of effectively reducing the photo workload of frontline staff, the labor costs of advertising service providers, and the costs of placement confirmation, while improving placement confirmation efficiency, facilitating practical application and promotion.

[0068] Based on the technical solution of the first aspect mentioned above, this embodiment also provides a possible design for how to combine the prior task allocation results to allocate advertising broadcasting and photography tasks. That is, before step S2, the method also includes, but is not limited to, the following steps S201 to S202.

[0069] S201. Determine the multiple advertising placement positions that have been assigned advertising broadcast photography tasks.

[0070] In step S201, specifically, when the photo-taking requirement information also includes at least one multi-photo scheme for one-to-one correspondence with at least one second advertisement that needs to be photographed and the multi-photo scheme for one-to-one correspondence includes, but is not limited to, at least one building with corresponding advertisements, the multiple advertisement placement positions that have been assigned advertisement photography tasks are determined, including but not limited to the following steps S2011 to S2012.

[0071] S2011. For each of the at least one-story multi-photo schemes, the advertising broadcasting and photography tasks of the corresponding advertisement are respectively assigned to each of the at least one advertised building and each of the corresponding advertisement's advertising locations.

[0072] In step S2011, for example, for a certain multi-photo scheme on the first floor, if the building A where the advertisement is published has 5 advertising locations, then each of these 5 advertising locations can be assigned an advertisement publication and photo-taking task.

[0073] S2012. Based on the advertising publication and photography task allocation results based on the at least one-story multi-photo scheme, determine the multiple advertising placement positions that have been assigned advertising publication and photography tasks.

[0074] S202. For each of the multiple city-N photo schemes, if it is determined that there is an advertising position belonging to the multiple advertising positions in the corresponding scheme, then the advertising broadcast photo task of the corresponding advertisement is assigned to the advertising position, the photo requirement of the corresponding advertisement is decremented by one, and the advertising position is removed from the corresponding scheme.

[0075] In step S202, for example, when the multiple advertising placements include property A, property B, property C, and property D, for a certain multi-photo scheme, if property A exists in the corresponding scheme, then the task of taking photos for one advertisement placement is assigned to property A (specifically, but not limited to any one of the advertising placements of property A), and the number of photos required for the corresponding advertisement is decremented by one, and property A is removed from the corresponding scheme. Furthermore, in order to effectively avoid the problem of scattered photo-taking tasks at the granularity of the advertising placement locations and ensure the achievement of the goal of taking multiple photos of the advertising in one city, preferably, when the advertising placement location refers to the placement location, for each of the multiple one-city-multiple-photo schemes, if it is determined that there is an advertising placement location belonging to the multiple advertising placement locations in the corresponding scheme, then the one-time advertising broadcast photo-taking task of the corresponding advertisement is assigned to that advertising placement location. This includes: for each of the multiple one-city-multiple-photo schemes, if it is determined that there is a placement location belonging to the multiple advertising placement locations in the corresponding scheme, then based on the current advertising broadcast photo-taking task allocation result, it is first determined whether the building to which the placement location belongs has already been assigned an advertising broadcast photo-taking task for the corresponding advertisement. If so, then the assignment of the one-time advertising broadcast photo-taking task of the corresponding advertisement to the placement location is terminated, and the placement location is removed from the corresponding scheme; otherwise, the one-time advertising broadcast photo-taking task of the corresponding advertisement is assigned to the placement location.

[0076] Therefore, based on the aforementioned possible design one, the task allocation for advertising broadcasting and photography can also be combined with the prior task allocation results to further and effectively avoid the problem of scattered photography tasks.

[0077] Based on the aforementioned possible design one technical solution, this embodiment also provides a possible design two for how to combine the one-building-one-photo scheme to obtain the prior task allocation result. That is, when the photo requirement information also includes at least one one-building-one-photo scheme corresponding to at least one third advertisement that needs to be photographed and the one-building-one-photo scheme includes at least one building with the corresponding advertisement, the multiple advertisement placement positions that have been assigned advertisement placement tasks are determined according to the advertisement publication and photo taking task allocation result based on the at least one one-building-one-photo scheme, including but not limited to the following steps S20121 to S20123.

[0078] S20121. For each of the at least one-one-photo-per-floor schemes, based on the advertising publication and photography task allocation results based on the at least one-one-photo-per-floor schemes, determine the number of advertising publication and photography tasks already allocated for each of the at least one-building properties with corresponding advertisements and each publication point of the corresponding advertisement.

[0079] S20122. For each of the one-building-one-photo schemes, if there is at least one advertising location with a corresponding advertisement and a non-zero maximum number of advertising broadcast photo tasks already assigned, then one advertising broadcast photo task for the corresponding advertisement will be assigned to any one of the at least one advertising location.

[0080] S20123. Based on the advertising publication and photography task allocation results based on the at least one-story-multiple-photo scheme and the at least one-story-one-photo scheme, determine the multiple advertising placement positions that have been assigned advertising publication and photography tasks.

[0081] In step S20123, specifically, based on the advertising placement and photography task allocation results of the at least one-story-multiple-photo scheme and the at least one-story-one-photo scheme, multiple advertising placement locations with assigned advertising placement and photography tasks are determined, including but not limited to: first, for each one-story-one-photo scheme, if the number of assigned advertising placement and photography tasks for each placement location of the corresponding advertisement is zero, then based on the known network attributes of each placement location of the corresponding advertisement, it is determined whether there is a placement location for the corresponding advertisement that is not connected to the network; then, for each one-story-one-photo scheme, if it is determined that there is at least one placement location for the corresponding advertisement that is not connected to the network, then one advertising placement and photography task for the corresponding advertisement is assigned to any one of the at least one placement location; otherwise, one advertising placement and photography task for the corresponding advertisement is assigned to any one of the placement locations of the corresponding advertisement; finally, based on the advertising placement and photography task allocation results of the at least one-story-multiple-photo scheme and the at least one-story-one-photo scheme, multiple advertising placement locations with assigned advertising placement and photography tasks are determined.

[0082] Therefore, based on the aforementioned possible design two, the "one floor, one photo" scheme can also be combined to obtain the prior task allocation results, further effectively avoiding the problem of scattered photo-taking tasks.

[0083] Based on the aforementioned possible design one, this embodiment also provides a possible design three for effectively avoiding the dispersion of photo-taking tasks at the granularity of the advertised property location. That is, when the advertised location refers to the advertised property, for each of the city-N photo schemes that includes the advertised location with the most occurrences, the photo-taking task for one advertisement broadcast of the corresponding advertisement is assigned to the advertised location with the most occurrences. This includes, but is not limited to, the following steps S511 to S514.

[0084] S511. For each of the "One City, N Photos" schemes that includes the most frequently advertised properties, determine the number of advertising broadcasting and photography tasks assigned to each advertising location of the most frequently advertised properties based on the advertising broadcasting and photography task allocation results of the at least one-building-multiple-photos scheme.

[0085] S512. For each of the "One City, N Photos" schemes, if the most frequently appearing listed property has at least one listing location with a corresponding advertisement and a non-zero maximum number of advertisement broadcasting and photography tasks already assigned, then one advertisement broadcasting and photography task for the corresponding advertisement will be assigned to any one of the at least one listing location.

[0086] S513. For each of the "One City, N Photos" schemes, if the number of advertising broadcasting and photo-taking tasks assigned to each advertising location of the most frequently appearing listed property is zero, then based on the known network attributes of each advertising location of the most frequently appearing listed property, determine whether there are any advertising locations of the most frequently appearing listed property that are not connected to the network.

[0087] S514. For each of the "One City, N Photos" schemes, if it is determined that the most frequently appearing advertised property has at least one advertising location that is not connected to the network, then the task of taking a photo of the advertisement is assigned to any one of the at least one advertising location; otherwise, the task of taking a photo of the advertisement is assigned to any one of the advertising locations of the most frequently appearing advertised property.

[0088] Therefore, based on the aforementioned possible design three, we can also combine the prior task allocation results obtained from the multi-photo scheme based on the first floor, and further achieve the goal of effectively avoiding the dispersion of photo-taking tasks at the point of publication, based on the granularity of the published buildings.

[0089] Based on the aforementioned possible design two technical solution, this embodiment also provides another possible design four, which aims to effectively avoid the dispersion of photo-taking tasks at the granularity of the advertised property location. That is, when the advertised location refers to the advertised property, for each of the city-N-photo schemes that includes the advertised location with the most occurrences, the photo-taking task for one advertisement broadcast of the corresponding advertisement is assigned to the advertised location with the most occurrences. This includes, but is not limited to, the following steps S521 to S524.

[0090] S521. For each of the "One City, N Photos" schemes that includes the most frequently advertised properties, based on the advertising and photo-taking task allocation results of the at least one-floor-multiple-photos scheme and the at least one-floor-one-photos scheme, determine the number of advertising and photo-taking tasks already allocated for each advertising location of the most frequently advertised properties.

[0091] S522. For each of the "One City, N Photos" schemes, if the most frequently appearing listed property has at least one listing location with a corresponding advertisement and a non-zero maximum number of advertisement broadcasting and photography tasks already assigned, then one advertisement broadcasting and photography task for the corresponding advertisement will be assigned to any one of the at least one listing location.

[0092] S523. For each of the "One City, N Photos" schemes, if the number of advertising broadcasting and photo-taking tasks assigned to each advertising location of the most frequently appearing listed property is zero, then based on the known network attributes of each advertising location of the most frequently appearing listed property, determine whether there are any advertising locations of the most frequently appearing listed property that are not connected to the network.

[0093] S524. For each of the "One City, N Photos" schemes, if it is determined that the most frequently appearing advertised property has at least one advertising location that is not connected to the network, then the task of taking a photo of the advertisement is assigned to any one of the at least one advertising location; otherwise, the task of taking a photo of the advertisement is assigned to any one of the advertising locations of the most frequently appearing advertised property.

[0094] Therefore, based on the aforementioned possible design four, we can also combine the prior task allocation results obtained from the one-floor-multiple-photos-and-one-photos-and-one-floor-photos-and-one ...

[0095] like Figure 3 As shown, the second aspect of this embodiment provides a virtual device for implementing the advertising broadcasting and photography task allocation method described in the first aspect or any possible design in the first aspect, including an information acquisition module, a judgment module, a count module and a task allocation module;

[0096] The information acquisition module, which is communicatively connected to the judgment module, is used to acquire the photo-taking requirements information of the advertiser, which includes multiple "one city, N photos" schemes, and then trigger the judgment module. The multiple "one city, N photos" schemes correspond one-to-one with multiple first advertisements requiring photo-taking. Each "one city, N photos" scheme includes the number of photo-taking requirements for the corresponding advertisement and several selectable advertisement placement locations. The advertisement placement location refers to a placement point or a building where the advertisement is placed. The placement point refers to the location where the advertisement is placed, and the building where the advertisement is placed refers to a building with at least one placement point. N represents a positive integer, and the number of buildings to which the several advertisement placement locations belong is greater than or equal to the number of photo-taking requirements for the corresponding advertisement.

[0097] The judgment module is communicatively connected to the count statistics module and is used to determine whether there is a city-N-photo scheme with a photo requirement of not being zero among the multiple city-N-photo schemes. If so, the count statistics module is triggered; otherwise, the task allocation ends.

[0098] The frequency statistics module is communicatively connected to the task allocation module. It is used to count the number of times each advertisement placement appears in all the one-city N-photo schemes based on the number of photos required (not equal to zero), and then trigger the task allocation module.

[0099] The task allocation module, which is communicatively connected to the judgment module, is used to allocate the one-time advertisement broadcast photo task of the corresponding advertisement to the advertisement placement with the most frequent occurrence in each of the city N-photo schemes, decrement the number of photo requirements of the corresponding advertisement by one, remove the advertisement placement with the most frequent occurrence from the corresponding scheme, and finally trigger the judgment module.

[0100] In one possible design, it also includes a pre-assigned location determination module and a task pre-assignment module that are connected in communication;

[0101] The assigned location determination module is communicatively connected to the information acquisition module and is used to determine multiple advertising placement locations that have been assigned advertising broadcasting and photography tasks.

[0102] The task pre-allocation module is also communicatively connected to the information acquisition module and the judgment module, respectively. It is used to, for each of the multiple one-city-N-photo schemes, if it is determined that there is an advertising position belonging to the multiple advertising positions in the corresponding scheme, then the task of taking a photo of the corresponding advertisement is assigned to that advertising position, the number of photos required for the corresponding advertisement is decremented by one, and the advertising position is removed from the corresponding scheme.

[0103] The working process, working details and technical effects of the aforementioned device provided in the second aspect of this embodiment can be found in the first aspect or any possible design in the first aspect, which describes the advertising broadcasting and photography task allocation method, and will not be repeated here.

[0104] like Figure 4 As shown, the third aspect of this embodiment provides a computer device for executing the advertising broadcasting and photography task allocation method as described in the first aspect or any possible design within the first aspect. The device includes a memory, a processor, and a transceiver connected sequentially in communication. The memory stores a computer program, the transceiver sends and receives messages, and the processor reads the computer program and executes the advertising broadcasting and photography task allocation method as described in the first aspect or any possible design within the first aspect. Specifically, the memory may include, but is not limited to, random-access memory (RAM), read-only memory (ROM), flash memory, first-in-first-out (FIFO) memory, and / or first-in-last-out (FILO) memory, etc.; the processor may include, but is not limited to, a microprocessor of the STM32F105 series. Furthermore, the computer device may also include, but is not limited to, a power module, a display screen, and other necessary components.

[0105] The working process, working details and technical effects of the aforementioned computer device provided in the third aspect of this embodiment can be found in the first aspect or any possible design in the first aspect of the advertising broadcasting and photography task allocation method, which will not be repeated here.

[0106] This fourth aspect of the embodiment provides a computer-readable storage medium storing instructions comprising the advertising broadcasting and photography task allocation method as described in the first aspect or any possible design within the first aspect. Specifically, the computer-readable storage medium stores instructions that, when executed on a computer, perform the advertising broadcasting and photography task allocation method as described in the first aspect or any possible design within the first aspect. The computer-readable storage medium refers to a data storage medium, which may include, but is not limited to, floppy disks, optical disks, hard disks, flash memory, USB flash drives, and / or Memory Sticks. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices.

[0107] The working process, working details and technical effects of the aforementioned computer-readable storage medium provided in the fourth aspect of this embodiment can be found in the advertising broadcasting and photography task allocation method described in the first aspect or any possible design in the first aspect, and will not be repeated here.

[0108] This fifth aspect of the embodiment provides a computer program product containing instructions that, when executed on a computer, cause the computer to perform the advertising broadcasting and photography task allocation method as described in the first aspect or any possible design within the first aspect. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device.

[0109] Finally, it should be noted that the above description is merely a preferred embodiment of the present invention and is not intended to limit the scope of protection of the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.

Claims

1. A method for assigning advertising broadcast photography tasks, characterized in that, It includes the following steps S1 to S4: S1. Obtain the advertising owner's photo requirement information, which includes multiple "One City, N Photos" schemes, and then execute step S2. The multiple "One City, N Photos" schemes correspond one-to-one with multiple first advertisements that need to be photographed. Each "One City, N Photos" scheme includes the number of photo requirements for the corresponding advertisement and several selectable advertisement placement locations for the corresponding advertisement. The advertisement placement location refers to a placement point or a building where the advertisement is placed. The placement point refers to the advertising placement point used to broadcast the advertisement. The building where the advertisement is placed refers to a building with at least one of the placement points. N represents a positive integer. The number of buildings to which the several advertisement placement locations belong is greater than or equal to the number of photo requirements for the corresponding advertisement. S2. Determine whether there is a city-wide N-photo scheme among the multiple city-wide N-photo schemes. If so, proceed to step S3; otherwise, end the task allocation. S3. Based on all the city N-photo schemes with a photo requirement number not equal to zero, count the number of times each advertisement placement appears in all the city N-photo schemes, and then proceed to step S4; S4. For each of the city-N photo schemes that includes the advertisement placement position with the most occurrences, assign the advertisement placement photo task of the corresponding advertisement to the advertisement placement position with the most occurrences, decrement the number of photo requirements for the corresponding advertisement by one, remove the advertisement placement position with the most occurrences from the corresponding scheme, and finally return to step S2.

2. The advertising broadcasting and photography task allocation method according to claim 1, characterized in that, Before step S2, the method further includes: Identify the multiple ad placement locations that have been assigned ad placement and photo-taking tasks; For each of the multiple "one city, N photos" schemes, if it is determined that there is an advertising position belonging to the multiple advertising positions in the corresponding scheme, then the advertising broadcast photo task of the corresponding advertisement is assigned to the advertising position, the number of photos required for the corresponding advertisement is decremented by one, and the advertising position is removed from the corresponding scheme.

3. The advertising broadcasting and photography task allocation method according to claim 2, characterized in that, When the photo-taking requirement information also includes at least one multi-photo scheme for a single floor corresponding to at least one second advertisement requiring photo-taking, and the multi-photo scheme for a single floor includes at least one building with the corresponding advertisement, the multiple advertisement placements that have been assigned advertisement photo-taking tasks are determined, including: For each of the at least one-story-multiple-photo schemes, the advertising broadcasting and photography tasks of the corresponding advertisements are respectively assigned to each of the at least one-story-multiple-photo schemes and each of the corresponding advertisements at each of the at least one-story-multiple-photo schemes. Based on the task allocation results of advertising publication and photography based on the at least one-story multi-photo scheme, the multiple advertising placement positions that have been assigned advertising publication and photography tasks are determined.

4. The advertising broadcasting and photography task allocation method according to claim 3, characterized in that, When the photo-taking requirement information also includes at least one one-photo-per-floor plan corresponding to at least one third-level advertisement requiring photo-taking, and the one-photo-per-floor plan includes at least one building with corresponding advertisements, the multiple advertisement placements that have been assigned advertisement placement tasks are determined based on the advertisement placement photo-taking task allocation results based on the at least one one-photo-per-floor plan, including: For each of the at least one-one-photo-per-floor schemes, based on the advertising and photo-taking task allocation results of the at least one-one-photo-per-floor schemes, the number of advertising and photo-taking tasks allocated for each of the at least one advertised properties and each advertised location of the corresponding advertisement is determined. For each of the above-mentioned one-on-one-photo schemes, if there is at least one advertising location with a corresponding advertisement and a non-zero maximum number of advertising broadcast photo tasks already assigned, then one advertising broadcast photo task for the corresponding advertisement will be assigned to any one of the at least one advertising location. Based on the advertising publication and photography task allocation results based on the at least one-story-multiple-photo scheme and the at least one-story-one-photo scheme, determine the multiple advertising placement positions that have been assigned advertising publication and photography tasks.

5. The advertising broadcasting and photography task allocation method according to claim 4, characterized in that, Based on the advertising placement and photography task allocation results of the at least one-story-multiple-photo scheme and the at least one-story-single-photo scheme, determine multiple advertising placement positions that have been assigned advertising placement and photography tasks, including: For each of the one-on-one-photo schemes, if the number of advertising broadcast photo tasks assigned to each of the corresponding advertising locations is zero, then based on the known network attributes of each of the corresponding advertising locations, it is determined whether there are any advertising locations that are not connected to the network. For each of the above-mentioned one-on-one-photo schemes, if it is determined that there is at least one advertising location that is not connected to the network, then the advertising broadcast photo task of the corresponding advertisement is assigned to any one of the at least one advertising location; otherwise, the advertising broadcast photo task of the corresponding advertisement is assigned to any one of the advertising locations of the corresponding advertisement. Based on the advertising publication and photography task allocation results based on the at least one-story-multiple-photo scheme and the at least one-story-one-photo scheme, determine the multiple advertising placement positions that have been assigned advertising publication and photography tasks.

6. The advertising broadcasting and photography task allocation method according to claim 3, 4, or 5, characterized in that, When the advertisement placement refers to the advertised property, for each of the "One City, N Photos" schemes that includes the advertisement placement with the highest frequency of occurrence, the task of taking one advertisement broadcast photo for the corresponding advertisement is assigned to the advertisement placement with the highest frequency of occurrence, including: For each of the "One City, N Photos" schemes that includes the most frequently advertised properties, the number of advertising publication and photography tasks allocated for each advertising location of the most frequently advertised properties is determined based on the advertising publication and photography task allocation results of the at least one-floor-multiple-photos scheme or the advertising publication and photography task allocation results of the at least one-floor-multiple-photos scheme and the at least one-floor-single-photos scheme. For each of the "One City, N Photos" schemes, if the most frequently appearing listed property has at least one listing location with a corresponding advertisement and a non-zero maximum number of advertisement broadcasting and photography tasks already assigned, then one advertisement broadcasting and photography task for the corresponding advertisement will be assigned to any one of the at least one listing location. For each of the "One City, N Photos" schemes, if the number of advertising broadcasting and photo-taking tasks assigned to each advertising location of the most frequently appearing listed property is zero, then based on the known network attributes of each advertising location of the most frequently appearing listed property, it is determined whether there are any advertising locations of the most frequently appearing listed property that are not connected to the network. For each of the "One City, N Photos" schemes, if it is determined that the most frequently appearing advertised property has at least one advertising location that is not connected to the network, then the task of taking a photo of the advertisement is assigned to any one of the at least one advertising location; otherwise, the task of taking a photo of the advertisement is assigned to any one of the advertising locations of the most frequently appearing advertised property.

7. The advertising broadcasting and photography task allocation method according to claim 1, characterized in that, When the advertisement placement location refers to the placement point, for each of the "One City, N Photos" schemes that includes the advertisement placement location with the most occurrences, the corresponding advertisement's one-time advertisement placement and photography task is assigned to the advertisement placement location with the most occurrences, including: For each of the "One City, N Photos" schemes that includes the most frequently appearing advertising location, based on the current advertising publication and photography task allocation results, it is determined whether the building to which the most frequently appearing advertising location belongs has been allocated an advertising publication and photography task for the corresponding advertisement. For each of the "One City, N Photos" schemes, if it is determined that the building to which the advertisement placement with the most occurrences belongs has already been assigned an advertisement placement and photo-taking task, then the assignment of one advertisement placement and photo-taking task to the advertisement placement with the most occurrences will be terminated, and the advertisement placement with the most occurrences will be removed from the corresponding scheme; otherwise, the advertisement placement and photo-taking task will be assigned to the advertisement placement with the most occurrences.

8. An advertising broadcasting and photography task allocation device, characterized in that, It includes an information acquisition module, a judgment module, a frequency statistics module, and a task allocation module; The information acquisition module, which is communicatively connected to the judgment module, is used to acquire the photo-taking requirements information of the advertiser, which includes multiple "one city, N photos" schemes, and then trigger the judgment module. The multiple "one city, N photos" schemes correspond one-to-one with multiple first advertisements requiring photo-taking. Each "one city, N photos" scheme includes the number of photo-taking requirements for the corresponding advertisement and several selectable advertisement placement locations. The advertisement placement location refers to a placement point or a building where the advertisement is placed. The placement point refers to the location where the advertisement is placed, and the building where the advertisement is placed refers to a building with at least one placement point. N represents a positive integer, and the number of buildings to which the several advertisement placement locations belong is greater than or equal to the number of photo-taking requirements for the corresponding advertisement. The judgment module is communicatively connected to the count statistics module and is used to determine whether there is a city-N-photo scheme with a photo requirement of not being zero among the multiple city-N-photo schemes. If so, the count statistics module is triggered; otherwise, the task allocation ends. The frequency statistics module is communicatively connected to the task allocation module. It is used to count the number of times each advertisement placement appears in all the one-city N-photo schemes based on the number of photos required (not equal to zero), and then trigger the task allocation module. The task allocation module, which is communicatively connected to the judgment module, is used to allocate the one-time advertisement broadcast photo task of the corresponding advertisement to the advertisement placement with the most frequent occurrence in each of the city N-photo schemes, decrement the number of photo requirements of the corresponding advertisement by one, remove the advertisement placement with the most frequent occurrence from the corresponding scheme, and finally trigger the judgment module.

9. A computer device, characterized in that, The device includes a memory, a processor, and a transceiver connected in sequence for communication. The memory is used to store computer programs, the transceiver is used to send and receive messages, and the processor is used to read the computer programs and execute the advertising broadcasting and photo-taking task allocation method as described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that... The computer-readable storage medium stores instructions that, when executed on a computer, perform the advertising broadcasting and photography task allocation method as described in any one of claims 1 to 7.

Images