Methods and systems for location based group “meet-up” venue/time recommendation and poll

Disclosed are methods and systems for locating, filtering, ranking and then providing a selection of potential “meet-up” venue(s) and time(s) recommendations to a group of users of a device having an interface and a display (e.g., a smart phone or a tablet) based on the geographic area delineated by a user and the user's contacts who are invited to the “meet-up”. The methods and systems calculate, filter and rank the most convenient “meet-up” venue and time based on the current location of group members, taking into account a plurality of factors, such as time, distance, schedule, group member's interests, availability, and the like. The methods and systems then provide a selection of the top ranking “meet-up” venues to the group members. Thereafter, the group members vote for the most suitable location among the ranked “meet-up” venues.

BACKGROUND OF THE DISCLOSURE

1. Field of the Disclosure

The present disclosure relates generally to methods and systems for locating, filtering, ranking and then providing a selection of potential “meet-up” venue(s) and time(s) recommendations to a group of users of a device having an interface and a display (e.g., a smart phone or a tablet) based on the geographic area delineated by a user and the user's contacts who are invited to the “meet-up”. The methods and systems calculate and rank the most convenient “meet-up” venue and time based on the current location of group members, taking into account a plurality of factors. Thereafter, the group members vote for the most suitable location among the ranked “meet-up” venues.

2. Background of the Disclosure

Some methods and systems for locating potential meeting venues for a user of a mobile device and his/her contacts are known. Located venues are presented to the group (i.e., the user and his/her contacts) of users having devices with an interface and a display (e.g., a smart phone or a tablet) for a vote on which venue to select. However, one shortcoming of the known methods and systems is that they are applied in limited geographic areas. Another shortcoming of the known methods and systems is that the potential meeting venues are not filtered or ranked as to likelihood of desirability for the group of users.

SUMMARY OF THE DISCLOSURE

It is an object of the present disclosure to provide methods and systems that make it possible to set up ad-hoc group meetings and identify most convenient “meet-up” places based on group members' current location, availability and preferences.

It is also an object of the present disclosure to provide methods and systems to provide users with “meet-up” venues that best fit their collective desires without the need to have long conversations and debates between the users.

It is a further object of the present disclosure to provide methods and systems to provide users with a comprehensive digital profile card to allow users to learn more about the business that is chosen as the recommended “meet-up”.

These and other objects are met according to the present disclosure, as will be more fully described in the paragraphs that follow.

The overall flow of the method that the system performs is: the user creates a “meet-up” request and shares it with a plurality of users' contacts; the users' contacts receive the “meet-up” invitation; the users' contacts can accept or deny the “meet-up” request, and the users who accept the “meet-up” request are presented with potential “meet-up” venues; the users vote on the potential “meet-up” venues; optionally, the users are provided with a “view map” of the potential “meet-up” venues while voting is taking place; and the users are provided with the results of the vote of the winner of the “meet-up” venue. Preferably, the methods and systems also provide each user with time to arrive at the “meet-up” venue from each user's present location. Also preferably, the users are provided with a digital “business card” for the selected “meet-up” venue.

In one embodiment, the present disclosure provides a method that comprises: receiving a “meet-up” request from a user of a device; receiving an identification of a plurality of the user's contacts to receive a transmission of the “meet-up” request to form a group of identified contacts; transmitting the “meet-up” request to the identified contacts; receiving, from each identified contact, an indication of whether the identified contact accepts or declines the “meet-up” request to form a group of accepted contacts (and preferably a group of declined contacts); identifying a point location of each accepted contact; creating a polygon from the identified point locations; identifying the centroid of the polygon; locating potential “meet-up” venues in a geographic area defined by a radius around the centroid; scoring the located potential “meet-up” venues; filtering and ranking the scored potential “meet-up” venues; providing filtered and ranked “meet-up” venue options to the user and the accepted contacts; receiving votes from the user and the accepted contacts relating to “meet-up” venue option selections; identifying the “meet-up” venue receiving the most votes; and providing the identity of the “meet-up” venue receiving the most votes to the user and the accepted contacts. Optionally, the method further includes providing “business card” details relating to the selected “meet-up” venue option receiving the most votes to the user and the accepted contacts. Also optionally, the method further includes providing an indication of the time to the user and the accepted contacts as to how long it will take each to arrive at the selected “meet-up” venue option.

The present disclosure further provides an apparatus/system for identifying and selecting a venue for a user and a group of the user's contacts to “meet-up” that includes a processor and a memory that has instructions that are readable by the processor and cause the processor to: receive a “meet-up” request from a user of a device; receive an identification of a plurality of the user's contacts to receive a transmission of the “meet-up” request to form a group of identified contacts; transmit the “meet-up” request to the identified contacts; receive, from each identified contact, an indication of whether the identified contact accepts or declines the “meet-up” request to form a group of accepted contacts and a group of declined contacts; identify a point location of each accepted contact; create a polygon from the identified point locations; identify the centroid of the polygon; locate potential “meet-up” venues in a geographic area defined by a radius around the centroid; score the located potential “meet-up” venues; filter and rank the scored potential “meet-up” venues; provide the filtered and ranked “meet-up” venue options to the user and the accepted contacts; receive votes from the user and the accepted contacts relating to “meet-up” venue option selections; identify the “meet-up” venue receiving the most votes; and provide the identity of the “meet-up” venue receiving the most votes to the user and the accepted contacts. Optionally, the apparatus/system further causes the processor to provide “business card” details relating to the selected “meet-up” venue option receiving the most votes to the user and the accepted contacts. Also optionally, the apparatus/system further causes the processor to provide an indication of the time to the user and each accepted contact as to how long it will take for each to arrive at the selected “meet-up” venue option.

The present disclosure still further provides a storage device comprising instructions that are readable by a processor and cause the processor to: receive a “meet-up” request from a user of a device; receive an identification of a plurality of the user's contacts to receive a transmission of the “meet-up” request to form a group of identified contacts; transmit the “meet-up” request to the identified contacts; receive, from each identified contact, an indication of whether the identified contact accepts or declines the “meet-up” request to form a group of accepted contacts and a group of declined contacts; identify a point location of each accepted contact; create a polygon from the identified point locations; identify the centroid of the polygon; locate potential “meet-up” venues in a geographic area defined by a radius around the centroid; score the located potential “meet-up” venues; filter and rank the scored potential “meet-up” venues; provide the filtered and ranked “meet-up” venue options to the user and the accepted contacts; receive votes from the user and the accepted contacts relating to “meet-up” venue option selections; identify the “meet-up” venue receiving the most votes; and provide the identity of the “meet-up” venue receiving the most votes to the user and the accepted contacts. Optionally, the storage device further causes the processor to provide “business card” details of the selected “meet-up” venue option receiving the most votes to the user and the accepted contacts. Also optionally, the storage device further causes the processor to provide an indication to the user and the accepted contacts as to how long it will take for each to arrive at the selected “meet-up” venue option.

The methods and apparatus/system herein are applicable to any size number of users and to providing “meet-up” venues in a relatively large geographic area.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Referring toFIG. 1, a system that employs the methods described herein is generally represented by reference numeral100. System100includes a client server180and a user device105that are communicatively coupled to one another via a network175, e.g., the Internet.

User device105includes a user interface110. User interface110includes a keyboard115, a conversation screen (display)120which, in turn, includes a meet up screen130. Together, the components of user interface110provide user device105a mechanism by which system100presents information in visual form to a user and by which the user presents information in electronic form to client server180via communication network175. System100presents the information by way of keyboard115. User device105also includes a cursor control mechanism, such as a mouse, track-ball, joy stick, or a touch-screen, capability of display110that allows a user to manipulate a cursor (not shown) on display110for communicating additional information and command selections to user device105and client server180via network175.

User device also includes a GPS receiver/transmitter135, a memory140, and an application module145as a component of memory140. User device105can be implemented, for example, as, preferably, a portable device. The portable device can be, for example, a tablet or a cell phone.

User device also includes a processor150that is an electronic device configured of logic circuitry that responds to and executes instructions.

Memory140is a tangible computer-readable storage device encoded with a computer program. In this regard, memory140stores data and instructions readable and executable by processor150for controlling the operation of processor150. Memory140can be implemented in a RAM, a hard drive, a ROM, or a combination thereof.

The term “module” is used herein to denote a functional operation that can be embodied either as a stand-alone component or as an integrated configuration of a plurality of subordinate components. Thus, application module145can be implemented as a single module or as a plurality of modules that operate in cooperation with one another. Moreover, although application module145are described herein as being installed in memory140, and therefore being implemented in software, it could be implemented in any of hardware (e.g., electronic circuitry), firmware, software, or a combination thereof.

Also, although application module145is indicated as already being loaded into memory140, it can be configured on a storage device (not shown) for subsequent loading into memory140. Storage device (not shown) could be a tangible computer-readable storage medium that stores application module145thereon. Examples of suitable storage devices include a compact disk, a magnetic tape, a read only memory, an optical storage media, a hard drive or a memory unit consisting of multiple parallel hard drives, and a universal serial bus (USB) flash drive. Alternatively, a storage device can be a random access memory, or other type of electronic storage device, located on a remote storage system (not shown) and coupled to client server180and user device105via network175.

Group member1155, group member2160, and group member3165employ a user device105and are communicatively coupled to one another and to the user via network175. AlthoughFIG. 1shows group member1155, group member2160, and group member3165as being in direct communication with network175, it will be understood that group member1155, group member2160, and group member3165can communicate with network175via a user device105that is, generally, configured as described above.

Referring toFIGS. 2A-2D, the appearance at various stages of user's conversation screen120is shown according to the present disclosure.

InFIG. 2A, a user uses device105to have a chat210with a group220(“The Breakfast Club”). User enters via keyboard115a request230(“Anyone up for dinner?”) to group220to meet up via conversation screen120. The request is made via an application installed on device105to communicate with group220. Of course, the user could select individuals in his/her contact list to whom to send the “meet-up” request rather than a pre-selected group, such as group220. As mentioned, the application has conversation screen120with which the user interacts with people and groups in his/her contact list. As is typical in such user devices105, the user can send messages, images or videos through conversation screen120. The present disclosure introduces elements that go beyond the limitations of the standard conversation screen120.

The application provides the user with a “meet-up” 240 option. When “meet-up”240is selected, the user can add a “meet-up” request to contacts such as group220, or any plurality of groups and/or individuals in his/her contact list through “meet-up” screen250. The user proceeds to create the “meet-up” details260by entering a description of the “meet-up”. The user can name the “meet-up”261(e.g., “Dinner Party”) via keyboard115, can choose the type of “meet-up”262(e.g., Restaurant, Movie, Coffee Shops, etc.) via a drop down menu263, can select the best fit by location264(e.g., “Close By”) by switching on the “best fit by location” button265, can select when266the “meet-up” time will be set, either by using a drop down menu267or set the “meet-up” for the “earliest possible” time by switching on the “earliest possible” button268. As is known in the art, a user's contact list is stored in memory140on user device105, and once “meet-up” screen250is filled, the user can add contacts with whom the “meet-up” request will be shared via an “Add” on “meet-up” screen250, and share the “meet-up” details260with his/her “added” contacts/groups270. “Add” button269sends the “meet-up” request to contacts/group members. Application module145sends “meet-up” details260to server180over communication network175.

As shown inFIG. 3A, when user shares “meet-up” details260with “added” contacts/groups270, each receives a “meet-up” invitation310in conversation screen120. “Meet-up” invitation310includes the suggested meet up time320and the option to accept/decline330meet up invitation310. At this point, as shown inFIG. 3B, each “added” contact/group220who accepts340meet up invitation310receives an indication of “voting on location soon”350. Server180then sends requests over communication network175to the “accept”330“added” “meet-up” member devices (e.g.,155,160,165) to share the “meet-up” members155,160,165current locations via GPS receiver/transmitter135on each “meet-up” “accepted” member's155,160,165user device105.

After server180receives all “accepted” member155,160,165user device105locations, server180performs scoring calculation for type of “meet-up”262and thereafter filters and ranks the most convenient locations in the area close by to all the participants and will provide options. In addition, as part of the calculation, the server also performs calculation and recommends on the most convenient time for the “meet-up” based on the time it takes for the group members to get to the location.

Cx=16⁢A⁢∑i=0n-1⁢⁢(xi+xi+1)⁢(xi⁢yi+1-xi+1⁢yi)Cy=16⁢A⁢∑i=0n-1⁢⁢(yi+yi+1)⁢(xi⁢yi+1-xi+1⁢yi)
and where A is the polygon's signed area,

Sever180creates a radius based geo-fence. The radius is a size sufficient to make a circle containing the polygon, around the centroid of the polygon. This creates an area in which to look for the recommended venues. Based on type of “meet-up”262, server180locates a list of “N” venues that are in the geo-fence that are possible “meet-up” venues around centroid point Cx, Cy using APIs that provide identities of possible venues and the locations of each around the centroid point Cx, Cy.

In addition, server180holds a database (not numbered) that has information about users and business. Among other information, the database of server180holds each “meet-up” “accepted” member's155,160,165(of course, each “meet-up” “accepted” member's155,160,165identity can change for each “meet-up”) venue preferences (including “black lists” of undesirable venues), price range preferences and voting history (providing “historical preference”, referred to below), as well as “business cards” for venues that include information such as, operating hours, menu (for restaurants), movie schedule (for cinemas), business review, business location, and the like.

Server180performs basic scoring by ranking the list of “N” venues based on the average time it takes for each of the “accepted” members155,160,165to arrive at each of the list of “N” venues. Server180determines the location point Xi, Yi=the location of each group member ‘i’. Server180collects a list of Vj, location of venue j (taken from the returned list of “N” venues), and calculates Dij, the distance between group member ‘i’ and venue ‘j’. Continuing, server180calculates the average Dj, i.e., the average distance between the group members and venue “j”

Average⁢⁢Dj=(∑i=0∞⁢⁢Dij)⁢/⁢n|.
The list of ‘Average Dj’ is sorted in ascending order (with shortest “Average Dj” ranked highest) by the distance from the specified venue. The following formula is used to calculate the time/distance scoring: If (“average (avg.) time distance”>60), then the time distance score =0. If (0<“avg. time distance”<60), then the time distance score=60 −avg. time distance. After all venues are sorted by the average time distance, the server proceeds to performing advanced ranking.

The first step of advanced ranking is to filter out locations that should not be presented to “accepted” members155,160,165using the following criteria (among other possible criteria) from the information contained in the database on server180. One criterion can be operating hours—if the location is currently closed (received via the APIs that provide identities of possible venues and the locations of each around the centroid point Cx, Cy), it is filtered out. Another criterion can be price ranges—if the location is out of a user's desired price range preference, it is filtered out. A third criterion can be dislikes—if a location is in a user's black lists, it is filtered out.

The second step of advanced ranking is to re-rank the remaining list factoring in additional parameters using, e.g., the information in the database on server180. For example, re-ranking the remaining venues “j” can be based on the following additional parameters (or others). One additional parameter can be “accepted” members'155,160,165“preferences”, and for each “match” between a user's preference and the venue “j”, the venue “j” gets 1 point in the scoring. Another additional parameter can be “accepted” members'155,160,165“historical experience” with the venue “j”, and for each historical “vote for” the venue “j” by an “accepted” member155,160,165, the venue “j” gets 2 points in the scoring. A third additional parameter can be “location reviews”, and using reviews that are generally between 1 to 5 stars, for each star the venue “j” has, the venue gets 1 point in the scoring.

A subset of the locations receiving the highest score(s) as a result of the scoring, filtering and ranking are sent back by server180to the “accepted” members155,160and165over communication network175for a vote. The subset of locations can be any number but, usually, is limited to two (2) or three (3) locations so that conversation screens120of user devices105do not become overcrowded and difficult to view. Also, a small subset of locations provides for a more definitive vote result, as too many locations could “split the vote” into a non-definitive result. The systems and methods of the disclosure are capable of supporting a group “meet-up” in a relative large geographic area. Therefore, the scoring, ranking and filtering are essential to prevent overloading the users with too many options.

Referring toFIG. 3C, in the example shown, the top two locations, Pasta Mia370and Lemon Café380, receiving the highest scores, as a result of the scoring, filtering and ranking, are presented on conversation screen120of “accepted” members user devices105for a vote as to “Where do you guys want to go tonight?” In addition, each “accepted” member is provided with a “time to location” unique to that “accepted” member. In the user device105conversation screen120shown inFIG. 3C, Lemon Café380is indicated as having an 8 minute walk “time to location” and Pasta Mia370is indicated as having a five minute drive “time to location”. “Accepted” members vote on their desired location by touching the icon for Pasta Mia370or the icon for Lemon Café380. As an additional option, the locations for Pasta Mia370and Lemon Café380can be seen on a geographic representation by touching the “view on map” option390. If “view on map”390is touched, a “view map” as shown inFIG. 3Eis presented on user device105conversation screen120. As voting progresses, the icons for Pasta Mia370and Lemon Café380change to indicate the number of votes obtained for each, as shown in FIG.FIG. 3D.

In the embodiment shown inFIG. 3F, the icons change in size and indicate the total votes “for” as voting progresses. A larger icon alone, without an indication of the total votes “for” could also indicate a larger vote total. Other changes could be provided for, such as a change in color or location of the icon on the user's displays. Touching “view results”395on conversation screen120presents the full poll results, including how each member of the group voted, as shown inFIG. 3F. As also indicated inFIG. 3F, one group member did not vote and can receive a “nudge”400to prompt the non-voting group member to vote. As a result, the location that receives most of the votes is, therefore, chosen as the “meet-up” location. Further, the group members receive the chosen location's “business card” details405as additional information, as shown inFIG. 3G. The additional information on the chosen location can include: for restaurants, food reviews, menus, directions, and the like; for movie theatres, movie reviews, show time schedules, directions, and the like; and for how to get there shops of any kind, a catalog of products, current sales/deals, coupons, and the like.

In addition, after the location is selected by the result of the vote, the system and method recommends the most suitable time to meet based on the following logic. “Meet-up” time=time now+(the time it takes to the most distant team member to arrive to the location).

EXAMPLE

User A has 3 contacts: contact B, contact C and contact D. User A forms a group with contact B, contact C and contact D. User A creates a “meet-up” of the type: “restaurant” and shares it with group members.

The highest ranked locations R1, R5 and R4 are presented to the group members for a vote. Users A, and contacts B and C vote for R1. Contact D votes for R5. As a result, R1 is chosen as the “meet-up” location. “Meet-up” time is set for current time +the time it takes to the most distant of user/contacts to arrive to the location=>10:00+20 minutes=>10:20

The terms “comprises” or “comprising” are to be interpreted as specifying the presence of the stated features, integers, steps or components, but not precluding the presence of one or more other features, integers, steps or components or groups thereof.

It should be understood that various alternatives, combinations and modifications could be devised by those skilled in the art. For example, steps associated with the processes described herein can be performed in any order, unless otherwise specified or dictated by the steps themselves. The present disclosure is intended to embrace all such alternatives, modifications and variances that fall within the scope of the appended claims.