U.S. patent application number 10/884357 was filed with the patent office on 2006-01-05 for travel planning for social networks.
Invention is credited to Denis Khoo.
Application Number | 20060004590 10/884357 |
Document ID | / |
Family ID | 35515129 |
Filed Date | 2006-01-05 |
United States Patent
Application |
20060004590 |
Kind Code |
A1 |
Khoo; Denis |
January 5, 2006 |
Travel planning for social networks
Abstract
A method and system is described for providing a traveler with
the ability to query an electronic social network for travel
related information. The traveler, and related individuals, enter
future travel plans into the system. The traveler leverages this
information by querying the system to determine which related
individuals will be at the same travel location for a future date.
The traveler is also able to query the system to determine when
next a related individual will be at a particular location. The
travel can also query the system to determine where related
individuals will be for a future date.
Inventors: |
Khoo; Denis; (Arcadia,
CA) |
Correspondence
Address: |
DENIS KHOO
9729 CAMINO REAL
ARCADIA
CA
91007
US
|
Family ID: |
35515129 |
Appl. No.: |
10/884357 |
Filed: |
July 2, 2004 |
Current U.S.
Class: |
705/319 ;
705/6 |
Current CPC
Class: |
G06Q 99/00 20130101;
G06Q 50/01 20130101; G06Q 10/025 20130101 |
Class at
Publication: |
705/001 ;
705/006 |
International
Class: |
G06F 17/60 20060101
G06F017/60 |
Claims
1. A method for a traveler to identify the location of a related
individual, comprising the steps of: identifying said related
individual through the use of an electronic social network;
inputting by said related individual the related individual's
anticipated location for a future date; requesting by said traveler
the location of said related individual for said future date; and
relaying said related individual's anticipated location to said
traveler for said future date.
2. The method of claim 1 wherein the step of relaying said related
individual's anticipated location to said traveler is displayed
graphically on a map.
3. The method of claim 1 wherein said related individual is zero
degree of separation from said traveler.
4. The method of claim 1 wherein said related individual is one
degree of separation from said traveler.
5. A method for a traveler to identify the location of a related
individual, comprising the steps of: identifying said related
individual through the use of an online social network; inputting
by said related individual the related individual's anticipated
location for the related individual's anticipated future date;
inputting by said traveler the traveler's anticipated location for
the traveler's anticipated future date; and determining if said
traveler's anticipated location and said related individual's
anticipated location are geographically within a defined maximum
distance of one another, and if said traveler's anticipated future
date and said related individual's anticipated future date are the
same.
6. The method of claim 5 further comprising the step of: relaying
the identity of said related individual to said traveler if said
determination is true.
7. The method of claim 5 wherein the location is the city and
state.
8. The method of claim 5 wherein the location is the zip code.
9. The method of claim 5 wherein the location is the city and
country.
10. The method of claim 5 wherein said defined limit is defined by
said traveler.
11. The method of claim 5 wherein said defined limit is defined in
miles.
12. The method of claim 5 wherein said defined limit is defined in
kilometers.
13. The method of claim 5 wherein said related individual is zero
degree of separation from said traveler.
14. The method of claim 5 wherein said related individual is one
degree of separation from said traveler.
15. A method for a traveler to identify the next date a related
individual will be near a particular location, comprising the steps
of: identifying said related individual through the use of an
online social network; inputting by said related individual the
related individual's anticipated location for a future date;
requesting by said traveler the next date when said related
individual will be at said particular location; and relaying, to
said traveler, the said next date when said related individual will
be within a defined maximum distance from said particular
location.
16. The method of claim 15 wherein said related individual is zero
degree of separation from said traveler.
17. The method of claim 15 wherein said related individual is one
degree of separation from said traveler.
18. The method of claim 15 wherein said particular location is the
city and state.
19. The method of claim 15 wherein said particular location is the
zip code.
20. The method of claim 15 where said defined maximum distance is
defined by said traveler.
Description
BACKGROUND OF THE INVENTION
[0001] 1. Field of the Invention
[0002] The present invention relates generally to travel planning,
and more particularly, to travel planning in conjunction with an
electronic social network.
[0003] 2. Description of the Related Art
[0004] Several decades ago, most people considered traveling out of
town a rare event. However, in today's high tech and fast paced
environment, individuals find themselves traveling much more
frequently for both business and pleasure. Also contributing to the
increase in out of town travel is the lowered cost of travel and
the increased efficiency of travel. Individuals now have several
modes of travel to choose from, including car, boat, train, and
plane.
[0005] Travelers, especially business travelers, are finding
themselves traveling alone and for extended periods. They are also
finding that they are traveling to destinations completely foreign
and unfamiliar to them. Whether or not they are traveling alone,
travelers typically would like the opportunity to find and meet
with related individuals, such as friends, family members, business
associates, or even friends of friends while at their travel
destination.
[0006] Typically, in order to accomplish this task, the traveler
would first have to perform the step 100 of keeping track of
related individuals by using a paper or electronic organizer. Upon
completing the step 110 of determining travel plans, the traveler
must then perform the step 120 of contacting each related
individual in order to determine if that related individual will be
at the same location within the same date range. If the related
individual's contact information is out of date, the traveler needs
to take the additional step 150 of figuring out the updated contact
information. Once the step 140 of contacting the related individual
is completed, the traveler can determine whether or not the related
individual will be at the same location within the same date range.
If so, the traveler can then take the step 170 of noting this and
making arrangements to meet with the related individual.
[0007] There is a need for a more convenient way of allowing a
traveler to discover related individuals that a traveler can meet
with. A traveler should be able to easily discover which related
individuals, if any, will be at the destination at the same time
that the traveler will be. The traveler should not have to
personally contact every friend, family member, business associate,
etc., to discover this information as they would today. Once the
traveler discovers which related individuals will be in the same
geographical proximity on a given date, the traveler can then
contact those related individuals and make arrangements to
meet.
[0008] In order to achieve the goals stated above, the present
invention leverages the popularity of online social networks. There
are several online social networks on the internet today, such as
Friendster, Orkut, and Plaxo. An online social network allows an
individual to easily keep track of relationships that the
individual has with other people by leveraging the internet. Each
individual maintains his or her own account profile on the online
social network, and defines who his or her related individuals are.
Once defined, the online social network retains the
relationship.
[0009] FIG. 2a, FIG. 2b, FIG. 2c, FIG. 2d, and FIG. 2e represent
relationship diagrams to provide a better understanding of online
social networks. In this example, all relationships are
symmetrical, meaning if User A 200 is a related individual of User
B 210, then User B 210 must be a related individual of User A 200.
An online social network need not have such a symmetrical
relationship. In FIG. 2a, User A 200 defines his relationship with
three related individuals, User B 210, User C 220, and User D 230.
Each of these three related individuals have their own relationship
to their own related individuals. The relationship diagram in FIG.
2b reveals User B's 210 related individuals. As shown, User B's
related individuals are User A 200, User C 220, User E 240, and
User F 250. FIG. 2c shows that User C's 220 related individuals are
User A 200, User B 210, User F 250, and User G 260. FIG. 2d shows
that User D's 230 related individuals are User A 200, User G 260,
User H 270, User 1280, and User J 290. In FIG. 2e, User A's 200
related individuals are shown, with up to one degree of separation.
User A's 200 related individuals at zero degree of separation
include User B 210, User C, 220, and User D 230. User A's 200
related individuals at one degree of separation include User E 240,
User F 250, User G 260, User H 270, User 1280, and User J 290.
[0010] The advantages of an electronic social network are numerous.
An electronic social network is able to maintain a list of related
individuals for a member. Since an electronic social network stores
a relationship (or link) to a related individual from a member,
data about a related individual is managed by the related
individual. For example, the electronic social network keeps a link
between User A and User B. If User A's phone number changes, there
is no need for User B to make the update. User A updates his/her
phone number on the electronic social network, and the update is
automatically reflected to User B. Similarly, the electronic social
network also has a link between User A and User C, and thus User C
would also sees User A's new phone number. Another advantage of an
electronic social network is the ability to see related individuals
at multiple levels of separation. Users of the electronic social
network can see friends of friends, or others within one degree of
separation. Of course, viewing users at more than one degree of
separation is also possible.
SUMMARY OF THE INVENTION
[0011] The present invention provides a method for travelers to
easily discover where related individuals were, is, and will be
geographically located. A related individual is an individual with
whom the traveler has a relationship with, such as a friend of the
traveler, a relative of the traveler or a business associate of the
traveler. A related individual can also include a friend of a
friend. Using an electronic social network, the traveler will
identify related individuals with zero degree of separation, and
perhaps their relationships. The traveler's related individuals
will inform the system of their present and future whereabouts.
This will allow the traveler to discover where related individuals
are currently located, and where they will be located for any given
future date. The traveler can also inform the system about his/her
current and future whereabouts, and let the system determine which
related individuals will be nearby for the present and future
respectively.
BRIEF DESCRIPTION OF THE DRAWINGS
[0012] A more complete appreciation of the invention and many of
the advantages thereof will be readily obtained as the same becomes
better understood by reference to the detailed description when
considered in connection with the accompanying drawings,
wherein:
[0013] FIG. 1 is a flowchart diagram of the prior art.
[0014] FIG. 2a is relationship diagram of an electronic social
network.
[0015] FIG. 2b is relationship diagram of an electronic social
network.
[0016] FIG. 2c is relationship diagram of an electronic social
network.
[0017] FIG. 2d is relationship diagram of an electronic social
network.
[0018] FIG. 2e is relationship diagram of an electronic social
network.
[0019] FIG. 3 is a flowchart diagram of an embodiment of the
present invention.
[0020] FIG. 4 is a technical block diagram of an embodiment of the
present invention.
[0021] FIG. 5 is a detailed technical block server diagram of an
embodiment of the present invention.
[0022] FIG. 6 is a user interface diagram for inputting the social
network user's future travel plans.
[0023] FIG. 7 is a user interface diagram for requesting the future
location of related individuals.
[0024] FIG. 8 is a view for reporting the location of related
individuals.
[0025] FIG. 9 is a user interface diagram for requesting the future
location of related individuals within a map view.
[0026] FIG. 10 is a map view for reporting the location of related
individuals.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
System Overview
[0027] FIG. 4 is a high level technical diagram of an embodiment of
the present invention. A traveler interacts with the system by
using a client application 400 which is connected to the internet
420 and communicates with the server 430. Similarly, one or more
related individual of the traveler also use a client application
410 which is connected to the internet 420 and communicates with
the server 430. The server 430 contains application logic for
inputting travel plans and using this data for advanced reporting.
The server 430 is also used to manage all logic involved with an
electronic social network. All persistent data is stored by the
server 430 onto a data storage device 440 such as a database.
Methodology
[0028] FIG. 3 is a flow chart of an embodiment of the present
invention. In the first step 300, a traveler uses a client
application 400 to interface with an electronic social network
running on the server 430 to maintain his/her relationship with
related individuals. Data about the traveler and related
individuals, along with their relationships are persisted in the
data storage device 440. In the next step 310, related individuals,
using a client application 410, input their current location and
future travel plans into the system, which ultimately gets
registered by the server 430 and stored onto the data storage 440.
Related individuals are able to add, remove, and edit future travel
plans. Related individuals can also modify their current
location.
[0029] In step 320, the traveler makes plans to travel or is
considers traveling. The traveler's destination or intended
destination, if any, is designated as location A on the date X. The
traveler enters this information into the system via the client
application 400.
[0030] With travel plans in mind, the traveler may be curious about
which related individuals he/she can meet with while at location A.
In this system, the traveler is able to query for this information
in three different fashions. First is via step 330 whereby the
traveler queries the system to determine which related individuals
will also be at location A on date X. In step 360, the system
returns a list of all related individuals who will be at location A
on date X. The system will return an empty list if it cannot find
any related individuals that will also be at location A on date
X.
[0031] The second means by which the traveler can query the system
is via step 340 whereby the traveler queries the system to discover
when in the future related individuals will be at location A. If
the traveler is flexible, the traveler will be able to use this
information to influence when the traveler decides to travel to
location A. In step 370, the system returns a report revealing the
related individuals who will be at location A sometime in the
future, and the dates when they will be at location A.
[0032] The third means by which the traveler can query the system
is via step 350 whereby the traveler queries the system to see
where related individuals will be on date X. This allows the
traveler to see where the traveler's related individuals will be
for a future date. In step 380, the system returns with information
revealing the location of related individuals for date X. This can
be displayed in a list format or can be displayed on a map for
easier viewing.
COMPREHENSIVE EXAMPLE
[0033] FIG. 4 shows at a high level how the users interact with the
system of this invention, and how different pieces of the system
are interconnected. The traveler interacts with this system via a
client application 400, and similarly, the related individuals
interact with this system via a client application 410. The
traveler's client application 400 and related individuals' client
application 410 both connect to a server 430 by going over the
internet 420. The server 430 uses a data storage device 440 for
data persistence.
[0034] FIG. 5 is a detailed technical diagram of an embodiment of
the present invention. The server 430 contains several modules
where business logic resides for handling an electronic social
network and for handling travel related functions. The business
logic modules responsible for the electronic social network include
Account Management 500, Related Individual Edit 510, and Related
Individual Retrieve 520. The modules responsible for the travel
related functions include Travel Plan Edit 530 and View Travel
Reports 540.
[0035] The Account Management module 500 is used to manage basic
account features for each member of the electronic social network.
Basic account features include creating a new account, modifying an
existing account, logging into an existing account, and removing an
existing account. Some properties of an account include username,
password, first name, last name, address, phone number, photos,
interests, work information, email address, and credit card
information. Anytime a user performs account related functionality,
it is the responsibility of the Account Management module 500 to
handle the request. Account information is persisted on the data
storage 440.
[0036] The Related Individual Edit module 510 allows a member of
the electronic social network to add a relationship to a related
individual, edit a relationship to a related individual, and remove
a relationship to a related individual. Typically, in order to have
a relationship to a particular related individual on the electronic
social network, that particular related individual must be a member
and have an account set up with the electronic social network. The
electronic social network member uses the Related Individual Edit
module 510 to manage only related individuals within zero degree of
separation from the member. The electronic social network member
need not manage related individuals within degrees of separation of
one or more, as this is handled by the system automatically.
Relationships to a related individual are persisted on the data
storage 440.
[0037] The Related Individual Retrieval module 520 handles the
request of returning a list of related individuals for a particular
member. The request may specify the degrees of separation. For
example, a social network member may request all related
individuals within zero degree of separation, which would prompt
module 520 to return all related individuals for which the social
network member has a direct relationship with. In another example,
a social network member may request all related individuals within
one degree of separation, which would prompt module 520 to return
all related individuals for which the social network member has a
direct relationship with, along with all related individuals that
they have a direct relationship with.
[0038] The Travel Plan Edit module 530 allows a member of the
social network to add a travel plan, edit a travel plan, and remove
a travel plan. A travel plan includes properties such as the
beginning date, ending date, destination, and purpose of travel.
All travel plan data is persisted on the data storage 440 connected
to the server 430.
[0039] The View Travel Reports module 540 is responsible for
handling various requests related to discovering the location of a
related individual for a future date. There are three major types
of request that the module 540 can accept. First is a request for
all related individuals at a specified location for a specified
date. Second is the location of related individuals for a specified
date. Third is the future date when a related individual will be at
a specified location.
[0040] FIG. 6 shows a user interface for users of an electronic
social network to enter their future travel plans. This user
interface would be displayed on the traveler's client application
400 or the related individuals' client application 410. The
traveler and related individuals are able to enter their future
plans using this interface, which accomplishes step 310 and step
320. On this user interface 600, users can enter the date and time
range for their future travel plans, plus the location where they
will be traveling to. Travel location can be entered using a
variety of information, such as city, state, and country, or zip
code, or even the longitude and latitude. In this embodiment, the
purpose for travel is also selectable, and a name can be assigned
to each travel plan entered.
[0041] In step 330, the traveler is able to discover related
individuals in the same future location at the same future time.
The user interface for inputting this query is displayed in FIG. 7.
The user interface 700 allows the traveler to specify his/her
future travel plan by selecting it from a drop down menu 710. The
traveler is also able to specify the maximum degrees of separation
to search for via the drop down 720. For example, if the traveler
chooses "0" as a selection here, the system will limit search
results to only related individuals with zero degrees of separation
from the traveler. The traveler is also able to specify the maximum
distance a related individual can be from the traveler by entering
the maximum distance in the textbox 730. FIG. 8 is a display of a
sample result from the query performed via the user interface 700.
As shown, the system returns a list of related individuals who will
be near the same future location and same future time as the
traveler. The search result includes the related individual's name
810, along with the location where the related individual will be
located 820. The search result also shows the specific future dates
830 for when these related individuals will be in the same future
location. This search result satisfies step 360.
[0042] In step 350, the traveler is able to query the system to see
where related individuals will be at on a future date. One method
of doing so is by submitting a query as shown in FIG. 9. The user
interface 900 allows the traveler to specify a future date 910, and
the maximum degrees of separation 920. FIG. 10 shows a graphical
search result for the query submitted from the user interface 900.
FIG. 10 shows where each related individual will be for the future
date specified. Each related individual is plotted on a map, which
provides a much more user friendly view for the traveler. The map
may be customized to show the entire globe, or to be zoomed into
one geographical area. This search result satisfies step 380.
[0043] With such a system, a traveler is given the opportunity to
efficiently schedule meetings and get together with related
individuals. These related individuals, as mentioned earlier, may
be friends, co-workers, business associates, relatives, etc. The
advantage of being able to meet with a related individual while
traveling may be advantageous from a business viewpoint, and may
also make the travels more enjoyable. In many cases, travelers will
find themselves scheduling their travel plans around their related
individuals' travel plans. The system allows for this capability as
well. With this system, travelers will no longer have to miss an
opportunity to meet and get together with related individuals. With
this system, travelers will no longer waste time seeking related
individuals when planning to travel.
[0044] Although the present invention has been described in detail
with respect to certain embodiments and examples, variations and
modifications exist which are within the scope of the present
invention as defined in the following claims.
* * * * *