JP2005228020A - Schedule management system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To facilitate cooperation with an electronic map in a schedule management system. <P>SOLUTION: In the schedule management system, a server 200 registers and manages the schedule of each user in a schedule DB 212 in response to an operation from a portable telephone 100. A position DB 232 stores keywords such as schedule items or destination designations used when the schedule of each user is registered and latitudes and longitudes by associating them with other. When a user designates the location of the schedule based on those keywords, the server 200 refers to the location DB 232 to specify the latitude and longitude. Furthermore, a time required for movement between schedules is estimated based on the latitude and longitude information, and the registration validity/invalidity of a new schedule is judged. Also, as for the new schedule whose time or location is not designated, the time and location when and where the new schedule is efficiently executable are automatically set based on the already registered schedule. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to a schedule management apparatus that manages a schedule using an electronic map.

  A portable terminal such as a PDA or a mobile phone may have a function of managing a user's schedule. In such a function, the user's behavior is electronically managed by schedule data including the time and place where the schedule should be performed. In recent years, a schedule management function and an electronic map are being linked.

  For example, Patent Document 1 discloses a device that determines whether or not a user's current position is within a range that can reach a predetermined destination at a specified time and notifies the result. Patent Document 2 discloses a navigation device that can display a route from a current position to a destination specified by an input schedule and a time margin.

JP 2000-283786 A JP 2000-258173 A

  In order to link the schedule management function with the electronic map, it is necessary to input the destination of each schedule in a manner that can be specified on the electronic map, such as latitude and longitude. Conventionally, however, the input of the destination has not been sufficiently studied, and there is a possibility that the input of the destination becomes very complicated.

  Further, as another problem, the conventional technique does not consider the time required for movement between a plurality of schedules, and there is a possibility that a schedule that cannot be actually performed may be registered.

  As described above, in the related art, there is room for improvement in terms of convenience and practicality regarding the linkage between the schedule management function and the electronic map. An object of the present invention is to solve such problems and improve convenience and practicality in a schedule management apparatus using an electronic map.

  The present invention can be configured as a schedule management apparatus for managing a schedule. The first schedule management device of the present invention can refer to a database in which keywords representing schedule contents are associated with position information that can be used for route search. Then, based on the keyword input in the operation for registering the schedule, the position information obtained by referring to the above-described database is set as a place for executing the schedule (hereinafter referred to as “destination”). To do. The keyword can be set in various ways. For example, a name of a destination, a word representing an action such as “business trip” or “meeting”, a name of a partner who performs the action, and the like can be used. The position information can be given in various formats that can specify the position of the destination on the electronic map data for route search. For example, the position information may be latitude and longitude, or coordinates in a coordinate system unique to the electronic map data. It may be a value. According to the first schedule management device, the location information of the destination can be easily input by using the above-described database, and convenience can be improved.

  The database may be shared by a plurality of users, or may be a database unique to each user. In any case, it is preferable that each user can customize. The database may be stored locally in the schedule management apparatus, or may be centrally managed by a server or the like. In the latter case, each schedule management apparatus refers to the database via a communication line such as a network.

  The second schedule management device of the present invention manages schedule data including position information indicating a place for executing a schedule and time information indicating a time at which the schedule should be executed. Registration of schedule data is performed in the following procedure. When the schedule management device inputs new schedule data according to the user's operation, the schedule management device estimates the travel time between each schedule based on the new schedule data and other schedule data already registered. It is determined whether or not the schedule data can be registered. For example, it can be determined that registration is possible when the travel time between schedules can be secured. When it is determined that registration is possible, new schedule data is registered. According to the second schedule management device, since the movement time between schedules is taken into account in determining whether registration is possible, it is possible to suppress the possibility of registering an inexecutable schedule.

  In the second schedule management device, the travel time can be estimated by various methods. For example, the travel time may be estimated based on the distance between the destinations of each schedule, or may be estimated based on the route search. Good. When using transportation on the way, you may consider the schedule. By using a route search and a transportation diagram, it is possible to improve the estimation accuracy of the travel time.

  In the second schedule management device, the current time and the current position may be input, and the time to depart from the current position may be notified based on the managed schedule data. This notification can be performed by estimating the travel time from the current position to the destination of the schedule scheduled after the current time and specifying the time at which the current position should depart. By doing so, the user can be supported so that the user can act according to the registered schedule.

  In the second schedule management device, as the schedule data, it is possible to register both a time designation schedule in which the time is specified and a time indefinite schedule in which the time is not specified, and a function for setting a time for executing the time indefinite schedule is provided. Also good. Examples of the time indefinite schedule include bank transfer and administrative procedures. For example, it is possible to estimate the travel time between the time indefinite schedule and each other time designation schedule and set the time based on the estimation result. By doing so, it is possible to set the schedule so that the time indefinite schedule is efficiently performed between the time designation schedules.

  In the first and second schedule management apparatuses of the present invention, the position information may be information specifying one point, or a position indefinite schedule in which a plurality of locations can be selected may be allowed. The position indefinite schedule includes, for example, a schedule that can be executed by any bank, such as bank transfer. When the position indefinite schedule is allowed, the travel time from the position designation schedule may be estimated, and a place where the position indefinite schedule should be executed may be set based on the estimation result. By doing so, it is possible to efficiently perform the position indefinite schedule together with the position designation schedule. The schedule management apparatus of the present invention may allow an indefinite schedule for both time and place. In such a case, both the position where the schedule should be executed and the time may be set automatically.

  The position information of the position indefinite schedule can be specified in various formats. For example, point group information for specifying a plurality of points, section information for specifying a linear or curved area, and a two-dimensional area are specified. Any form of region information can be taken. The point cloud information includes, for example, names that collectively refer to various stores that are scattered like a bank. As section information, a name and sections, such as a national highway and a railroad, are included, for example. The area information includes a municipality name and other administrative boundary names, information indicating an area within a certain distance range from a specific point, and the like.

  The present invention may be configured as a schedule management system capable of linking schedules of a plurality of users. The schedule management system can be realized by centrally managing the database and schedule data described in the first and second schedule management apparatuses with a server. In such a schedule management system, for example, the time setting for the time indefinite schedule may be performed with reference to the schedule of another user, or the location setting for the position indefinite schedule may be performed. By doing so, it is possible to smoothly wait for other users, or to easily set a schedule common to other users, and to improve practicality.

  The present invention does not have to include all the various features described above, and various configurations can be realized by omitting some or combining them appropriately. For example, the above-described first and second schedule management devices may be integrated. Further, the present invention is configured not only as an aspect as a schedule management apparatus but also as an aspect of a control method for the schedule management apparatus, a computer program for realizing such control, a computer-readable recording medium recording such a computer program, and the like. May be. Here, as a recording medium, a flexible disk, a CD-ROM, a magneto-optical disk, an IC card, a ROM cartridge, a punch card, a printed matter on which a code such as a barcode is printed, an internal storage device of a computer (RAM, ROM, etc. Various types of computer-readable media such as a memory) and an external storage device can be used.

Embodiments of the present invention will be described in the following order.
A. System configuration:
B. Schedule registration process:
C. Scheduled time notification process:
D. Variation:

A. System configuration:
FIG. 1 is an explanatory diagram showing a schematic configuration of a schedule management system as an embodiment. The schedule management system includes a server 200 that provides a function as a schedule management device and a mobile phone 100 that functions as a terminal device. Both are connected by wireless or other networks. Although an example in which two mobile phones 100 are connected is shown in the figure, any number of mobile phones 100 can be connected.

  Each user can register a schedule in the server 200 by operating the mobile phone 100. The server 200 supports the registration of the schedule and manages the schedule of each user. In addition, the schedule time is notified to assist the user in executing the schedule.

  In the figure, functional blocks of the mobile phone 100 and the server 200 are shown together. The mobile phone 100 is equipped with a control unit incorporating a CPU and a memory, and these functional blocks are configured by software by the CPU executing a predetermined program. Similarly, the functional blocks of the server 200 are configured by software by installing a predetermined program. At least some of the functional blocks in the mobile phone 100 and the server 200 can be configured in hardware.

  In the mobile phone 100, each functional block shown in the figure implements the following functions under the control of the main control unit 110. The communication unit 120 controls communication with the server 200 via the network. The information transmitted from the mobile phone 100 to the server 200 includes, for example, a command for registering and browsing a schedule. The information transmitted from the server 200 to the mobile phone 100 includes information for supporting execution of the registered schedule such as an interface screen for registering and browsing the schedule and a notification signal of the scheduled time.

  The GPS 130 detects the current position of the mobile phone 100 using a global positioning system. The time management unit 160 is a “clock” that outputs the current time. The display control unit 150 controls display on the display of the mobile phone 100. The command input unit 140 inputs details of operations such as keys by the user. With these functional blocks, the mobile phone 100 can provide a user interface required as a terminal device of the schedule management system.

  In the server 200, each functional block operates under the control of the schedule management unit 210. The communication unit 220 controls communication with the mobile phone 100 via the network. The position DB management unit 230 manages the position DB 232, that is, registers new data in the position DB 232 or searches the position DB 232. The position DB 232 is a database that is referred to when a schedule is registered, and the contents thereof will be described later.

  The schedule DB 212 is a database for registering each user's schedule, and the contents are managed by the schedule management unit 210. The contents of the schedule DB 212 will be described later.

  The schedule automatic setting unit 240 provides a function for supporting schedule registration. As such a function, for example, whether or not there is overlap between a newly registered schedule (hereinafter simply referred to as “new schedule”) and another schedule that has already been registered (hereinafter simply referred to as “registered schedule”). A function for setting the time and place of a new schedule based on a registered schedule.

  The route search unit 250 searches for a route from a designated departure point to a destination using a known method such as the Dijkstra method. Further, the travel time to the destination is estimated based on the route search result and the standard travel speed. The estimated travel time is used by the automatic schedule setting unit 240.

  The electronic map DB 252 is a database that provides an electronic map used for the route search described above. The electronic map DB 252 includes road network data representing roads as a set of nodes and links. In order to improve the estimation accuracy of travel time when travel by transportation is included in the route, the electronic map DB 252 may include transportation transportation diagram data. Further, the electronic map DB 252 may include drawing data for displaying a map to the destination.

  FIG. 2 is an explanatory diagram showing the contents of the position DB 232. The position DB 232 is a database that is referred to when a schedule is registered, and stores keywords used for specifying a destination at the time of registration and position information corresponding to the keyword. In this embodiment, schedule items and names are used as keywords. The position information is information for specifying the destination on the electronic map. In the present embodiment, the position information is coordinate values of latitude and longitude. The position DB 232 is provided for each user, and each user can customize the contents.

  For example, for the schedule item “monthly meeting”, the latitude and longitude (Lat1, Lon1) of the “main building meeting room” where the meeting is normally held are registered. The position DB 232 is not necessarily associated with a schedule item, but may be a point group, a section, a region, or the like. For example, the schedule item “bank transfer” is associated with the location information of the head office or each branch of the AA bank used by the user. For the event “## Marathon”, the section corresponding to the route is given as a point sequence. The event “++ fireworks” is associated with an area where fireworks can be appreciated, for example, a circular area with a center position (Lat9, Lon9) and a radius R. The region is not limited to a circle, but may be specified by a polygon point sequence.

  The position DB 232 may allow a user to register position information, or the server 200 may acquire and register position information from a web page on the Internet. As an example of the former, for example, a user searches based on an address, a telephone number, a building name, or the like while referring to the electronic map DB 252, or the destination latitude and longitude designated on the displayed map are newly A method of registering in the position DB 232 as correct position information can be employed. The latter example can be applied to registration of position information regarding various events. The position information can be provided on a Web page, or can be encoded and provided on a barcode or QR code printed on a ticket or an advertisement.

  FIG. 3 is an explanatory diagram showing the contents of the schedule DB 212. It is a database for holding schedule data registered for each user. “No.” is attached to the schedule data, and each item shown in the figure is registered. The schedule data includes a “time designation schedule” in which “start time” and “end time” are designated, and a “time indefinite schedule” in which these are indefinite. There are a “place designation schedule” in which a destination is designated and a “place indefinite schedule” in which the destination is designated in a form that is not limited to a single point such as a point cloud, a section, or an area. The “time indefinite schedule” and “location indefinite” fields are “YES” in the “time indefinite schedule” and “location indefinite schedule”, respectively. No. As in the schedule 3, the server 200 automatically sets the time and the location by the processing described later, although the data of the start time, the end time, and the location are stored even though the time is indefinite and the location is indefinite. Represents that. In “Remarks”, for example, names of other users who should behave together for each schedule, such as participants in a conference, can be registered.

  The location DB 232 and the schedule DB 212 illustrated in FIGS. 2 and 3 are merely examples, and various items other than those illustrated may be registered in these databases. For convenience of illustration, each database has exemplified a table format, but various formats such as a database using XML (eXtensible Markup Language) can be adopted.

B. Schedule registration process:
FIG. 4 is an explanatory diagram showing an example of a schedule registration screen. The screen displayed on the display of the mobile phone 100 based on display data provided from the server 200 in the form of a Web page or the like is illustrated. The user can input items, start date / time, end date / time, location, member, and remarks by operating the keys of the mobile phone 100. The contents entered in “Item” and “Member” are registered in “Schedule Item” and “Remarks” in the schedule DB 212. If the start date and time and the end date and time are blank, the “time indefinite” column of the schedule DB 212 is “YES”. When a point group, section, area, or the like is designated as the place, the “place undefined” column in the schedule DB 212 is “YES”.

  In this embodiment, a function for assisting input is provided for a place and a member. Clicking the triangle on the right side of the location field and member field displays the list shown on the right side of the figure. For the location, the name registered in the location DB 232 is presented, and search menus such as “Search from address”, “Search from phone number”, “Search from nearest station” are presented for registration of a new location Is done. When these search menus are selected, the screen further shifts to a search screen for inputting necessary information such as an address, a telephone number, and a nearest station name. When the input content in the “item” column matches the schedule item in the position DB 232, the name corresponding to the input item may be displayed in the location column by default. The “location” designated by the user is converted into position information of latitude and longitude by the server 200 and registered in the schedule DB 212.

  Similarly, members are presented with user-specific lists such as in-house meetings and private groups, as well as various search menus. Members such as in-house meetings and private groups may be registered in advance using a database having the same format as the position DB 232, or may be searched from past schedule data registered in the schedule DB 212. In the former case, instead of the position information in the position DB 232, a method of enumerating and storing member names corresponding to names such as “in-house meeting” and “private group” can be employed. In the latter case, it is possible to search past schedule data corresponding to “items” such as “in-house conference” and extract member names registered there. Similarly, in the “Remarks” column, data registered in the past schedule data in the schedule DB 212 may be listed.

  As described above, schedule registration may be performed manually by operating a key by a user, or by acquiring information from a QR code or a web page. For example, information such as item name, start time, end time, and location can be encoded and recorded in the QR code. For events such as concerts, if the organizer prints a QR code including this information in a ticket or an advertisement, and the user reads the QR code with a digital camera incorporated in the mobile phone 100, schedule data can be obtained. It becomes possible to register easily.

  FIG. 5 is a flowchart of the schedule registration process. This process is executed by the server 200 in response to access from the mobile phone 100. Here, a description will be given assuming that the method for registering a schedule by the above-described manual operation and the method for registering a new schedule using a QR code can be used. The server 200 provides the mobile phone 100 with an interface screen for specifying whether to input manually or using a QR code, and accepts an input method selection instruction (step S10). When the code input is instructed, the QR code information is input from the mobile phone 100, and the content is analyzed (step S12). The analysis of the QR code may be performed by the server 200 or the mobile phone 100.

  If not code input (step S11), the server 200 provides an interface screen for manual registration and inputs new schedule data (step S13). At this time, as described above with reference to FIG. 4, for the place and member, a default display and a list for input support are performed according to the position DB 232 and the registered schedule data. Further, referring to the position DB 232, the “location” designated by the name is converted into position information of latitude and longitude and registered in the schedule DB 212. When a new location that is not registered in the location DB 232 is designated, the name and location information may be additionally registered in the location DB 232.

  Next, the server 200 determines whether or not the input new schedule data is specified for both time and place (step S14). If at least one of the time and location is indefinite, that is, if it falls under the “time indefinite schedule” or “location indefinite schedule”, the process for automatically setting the time and location and the time / place setting process are executed. (Step S20). Details of this processing will be described later.

  For a new schedule in which both time and place are specified (step S14), whether or not the schedule can be registered is determined by the following procedure. The server 200 refers to the schedule D212, and extracts the registered schedule scheduled immediately before the start time of the new schedule and the registered schedule scheduled immediately after the end time (step S15).

  Next, based on each extracted registered schedule and the position information of the newly registered schedule, a route search between schedules is performed to estimate the travel time (step S16). Then, based on the start time and end time of each schedule, it is determined whether or not the travel time is secured between schedules, and it is determined whether or not a new schedule can be registered (step S40). It may be possible to determine whether or not the schedule can be executed in consideration of a predetermined margin for the travel time. If it is determined that registration is possible, a new schedule is registered in the schedule DB 212 (step S41). If it is determined that registration is impossible, an error message to that effect is output to the mobile phone 100 (step S42).

  FIG. 6 is a flowchart of the time / place setting process. This is a process corresponding to step S20 of the schedule registration process (FIG. 5). The server 200 first reads the schedule data (step S21), and determines whether or not a participant who should act together is specified (step S22). If the participant is specified, the schedule data of the participant is also input from the schedule DB 212 (step S23).

  Next, the server 200 identifies a time zone in which the schedule is not registered, that is, a free time zone (step S24). If the participant is not specified, it is sufficient to specify a time zone in which the user's own schedule is vacant. If the participant is specified, both the user and the participant's schedule are vacant. It will specify the time zone. The free time zone is not limited to one, and a plurality of free time zones may be specified.

  The server 200 selects one of the vacant time zones specified in this way (step S25), and extracts a registered schedule scheduled immediately before and after the vacant time zone (step S26). When a participant is designated, the schedule is extracted for the participants. The idle time zone can be selected in an arbitrary order. For example, the idle time zone may be selected in order from the earliest time, or may be selected in the order from the longest idle time. In the new schedule, when time is specified, a free time zone including the time may be selected.

  Next, the server 200 sets the location of the new schedule (step S27). If a location is specified in the new schedule, that location may be used. When the location is indefinite, the server 200 selects a destination from the designated candidates by the following method. If the location is specified by a point cloud, the one closest to the destination of the immediately preceding / immediate schedule is selected from these point clouds. This selection may be made based only on the distance from the destination in the immediately preceding schedule, may be made based only on the distance from the destination in the immediately following schedule, or based on the sum of the distances between the two. You may go. When the place is designated by a section or a region, a point closest to the destination of the immediately preceding / immediate schedule is selected from various points in the section or region. This selection can also be performed by various methods like the point cloud.

  When the location is set in this way, the server 200 searches for a route from the immediately preceding / immediately scheduled destination to the new scheduled destination, and estimates the travel time (step S28). Then, based on the start time and end time of each schedule, it is determined whether or not the travel time is secured between schedules, and it is determined whether or not a new schedule can be registered (step S29). If registration is possible, the start time and end time of the new schedule are set in the free time zone and registered in the schedule DB 212. For the location, the destination set in step S27 is registered (step S32).

  If registration is impossible (step S29), the same processing is repeatedly executed for all available time zones, and if registration is impossible for all available time zones (step S30), an error message to that effect is output. (Step S31).

  FIG. 7 is an explanatory diagram showing a processing example of time / place setting. Consider a case in which user A and B register new schedules [1] and [2] in a state in which an existing registration schedule exists in the time zone illustrated by hatching. Schedule [1] is a “time / place indefinite schedule” in which the required time is a bank transfer of 15 minutes, the time is not specified, and the destination can be selected from each bank store. Schedule [1] is a schedule that user A performs alone, and there is no participant. The schedule [2] is an in-house planning meeting with a required time of 1.5 hours, and the time is not specified, but the destination is a “time indefinite schedule” specified in the meeting room in the company. In schedule [2], it is assumed that in-house user B is designated as a participant.

  In the registered schedule of the user A, free time zones [1] and [2] are found as time zones in which the schedule [1] can be registered. As described with reference to FIG. 6, the server 200 stores stores close to the destination of the previous registered schedule “Monthly Meeting” and the destination of the registered schedule “Meeting Company B” immediately after the vacant time [1]. Is selected to perform route search and travel time estimation. That is, after the monthly meeting is completed, it is determined whether or not it is possible to make a bank transfer and go to the meeting with Company B in consideration of each travel time. If it is determined that bank transfer is possible, the start time and end time of the schedule [1] are set in the free time zone [1]. If it is determined that bank transfer is not possible, the same applies to the free time zone [2]. Make a decision.

  On the other hand, according to the registered schedules of the users A and B, the free time zone [3] is found as a time zone in which the schedule [2] can be registered. The server 200 determines whether or not the schedule [2] can be set in consideration of the travel time from the previous schedule “Company B meeting” for this vacant time zone [3]. With this process, it is possible to efficiently set a schedule for which a time and a place are not specified in consideration of the registered schedule and taking the travel time into consideration. Regarding the time and place indefinite schedule, resetting of the time and place may be permitted by re-execution of the processing of FIG. 6 even after the time and place are once set. By doing so, every time an attempt is made to register a new schedule with time and place designation, it becomes possible to reset the time and place indefinite schedule while giving priority to the new schedule.

C. Scheduled time notification process:
FIG. 8 is a flowchart of the scheduled time notification process. This is a function for supporting the execution of the schedule by the server 200 notifying the user of the scheduled time based on the schedule data registered in the schedule DB 212. The server 200 periodically monitors the schedule data of each user and executes the process described below.

  First, the current position and time are input from the mobile phone 100 of the server 200 (step S51). As for the current time, the server 200 itself may hold a clock, or obtain an absolute time from an NTP server or the like. The server 200 refers to the schedule DB 212 and inputs the already registered schedule data scheduled immediately after the current time (step S52). Then, a route search from the current position to the destination of the next schedule is performed to estimate the travel time, and based on the result and the start time of the next schedule, the time to depart from the current position (hereinafter, “ (Referred to as “departure time”) (step S53).

  When the margin from the current time to the departure time is less than 30 minutes (step S54), the server 200 outputs an instruction for sounding a departure alarm to the mobile phone 100 in order to prompt the user to leave (step S54). Step S55). When the margin is 30 minutes or more, no departure warning is given. When the current time has passed the departure time, that is, when it is determined that it is not in time for the next schedule (step S54), the server 200 notifies the user of the lateness and displays the expected delay time. Is output to the mobile phone 100 (step S56).

  The expected delay time can be, for example, the difference between the current time and the departure time. As another aspect, a new departure time may be searched and obtained as a difference between the departure time and the current time. In the latter mode, when movement by transportation is included, the expected delay time can be obtained in consideration of the schedule of the transportation. Prior to calculating the expected delay time, the arrival time, i.e., the start time of the next schedule or the time at which the start time is expected to be fixed, is fixed, and the route search is performed. Processing to try to find a short route may be performed.

  After completing the above processing, the server 200 sets a processing time interval (step S57). The processing time interval is the time until the server 200 next executes the scheduled time notification process. In this embodiment, in order to reduce the load on the server 200, the time interval for monitoring the schedule is changed according to the margin from the current time to the departure time. In the figure, an example of setting the time interval is shown. In this example, the processing time interval is set to increase as the margin increases. When the margin is 60 minutes, the processing time interval is set to 30 minutes. The processing time interval may be changed continuously as shown by a solid line in the drawing according to the margin, or may be changed stepwise as shown by a broken line. The correspondence between the margin and the processing time interval is not limited to this example, and various settings are possible.

  According to the schedule management system of the embodiment described above, since the user can easily input the location information of the destination of the schedule, the linkage between the schedule and the electronic map can be realized relatively easily. . As a result, considering the travel time between schedules, it is possible to determine whether or not a new schedule can be registered, and to automatically set the time and place for the new schedule. It can be carried out.

D. Variation:
(1) The server 200 may provide various functions that support execution of the schedule in addition to the above-described processes. For example, based on the schedule data, a map representing the route to the destination of each schedule may be provided to the mobile phone 100 or route guidance may be provided. In addition, as a function of route guidance, for example, when traveling by means of transportation, information such as transportation schedules, time required to get off the station, etc. is presented, Outputs such as prompting display, sound, vibration may be performed. The contents of the schedule DB 212 can be viewed by registered users, and can also be viewed by other users under predetermined conditions. For example, it may be possible to set whether to allow browsing by other users for each schedule data.

(2) Anniversary such as wedding anniversary or family birthday may be included in the schedule to be registered. For example, the dates and contents of the anniversary may be registered in a home server shared by all the family members so that the anniversary is automatically avoided when setting the schedule of each member of the family. In addition, the anniversary may be automatically set for each member with a schedule such as returning home at a predetermined time such as dinner.

(3) Part of schedule registration may be automated. For example, the schedule management system may extract and register necessary information from an e-mail. By doing so, it becomes possible to easily register a schedule by using notification by e-mail such as a meeting or a business trip. The method of extracting the date and contents to be registered in the schedule is a method in which the user designates the corresponding part in the e-mail, and a method in which the schedule management device automatically extracts based on keywords such as “date and time” and “location” Etc. can be taken.

(4) As another aspect, the schedule may be registered by voice. That is, the contents that the user speaks into the microphone may be recognized by the schedule management system and registered as a schedule. The input in this mode is highly useful when a mobile phone is used as a terminal device of the schedule management system. Speech recognition can be performed using various known techniques.

(5) In the case of an indefinite time or indefinite place schedule, when setting the time, various conditions may be considered in addition to the schedule availability. For example, regarding the schedule “shopping”, the time and place may be set in consideration of bargain information, time service information, store congestion, and the like. Such information may be provided from the server, or may be registered in advance by the user as a kind of customization. Regarding the schedule of “meal”, a function may be provided in which a time and a restaurant are determined and the schedule is registered, and a reservation is made to the restaurant by e-mail or the like.

  As mentioned above, although the various Example of this invention was described, it cannot be overemphasized that this invention is not limited to these Examples, and can take a various structure in the range which does not deviate from the meaning. For example, in this embodiment, the terminal device is not limited to a mobile phone, and various devices such as a PDA and an in-vehicle navigation device can be used. Further, the functions of the server 200 and the mobile phone 100 may be integrated to constitute a stand-alone schedule management device.

It is explanatory drawing which shows schematic structure of the schedule management system as an Example. It is explanatory drawing which shows the content of position DB232. It is explanatory drawing which shows the content of schedule DB212. It is explanatory drawing which shows the example of a registration screen of a schedule. It is a flowchart of a schedule registration process. It is a flowchart of a time / place setting process. It is explanatory drawing which shows the process example of a time and a place setting. It is a flowchart of a scheduled time notification process.

Explanation of symbols

100 ... mobile phone 110 ... main control unit 120 ... communication unit 130 ... GPS
140 ... Command input unit 150 ... Display control unit 160 ... Time management unit 200 ... Server 210 ... Schedule management unit 212 ... Schedule DB
220 ... Communication unit 230 ... Location DB management unit 232 ... Location DB
240 ... Automatic schedule setting unit 250 ... Route search unit 252 ... Electronic map DB

Claims (11)

A schedule management device for managing a schedule,
A database reference unit that references a database that associates keywords representing the contents of the schedule with location information that can be used for route search;
An input unit for inputting the keyword according to a user operation for registering schedule data;
A schedule management apparatus comprising: a position information registration unit that associates position information obtained by referring to the database according to the keyword with the schedule data as a place for executing the schedule. A schedule management device for managing a schedule,
A management unit for managing schedule data including position information indicating a place for executing the schedule and time information indicating a time at which the schedule should be executed;
A schedule data input unit for inputting new schedule data in accordance with a user operation;
Based on the new schedule data and other schedule data that has already been registered, a determination unit that estimates the travel time between each schedule and determines whether the new schedule data can be registered;
A schedule management apparatus comprising: a registration unit that registers the new schedule data when it is determined that registration is possible. The schedule management device according to claim 2,
An input unit for inputting the current time and current position;
Based on the managed schedule data, the travel time from the current position to the place for executing the schedule scheduled after the current time is estimated, and the current position should be departed based on the estimation result A schedule management device comprising: a departure time notifying unit for notifying time. The schedule management device according to claim 2,
The schedule data includes a time designation schedule in which the time is specified and a time indefinite schedule in which the time is not specified,
A schedule management apparatus comprising a time setting unit that estimates a travel time from the time designation schedule and sets a time at which the time indefinite schedule is to be executed based on the estimation result for the time indefinite schedule. The schedule management device according to claim 1 or 2,
The position information is a schedule management device that is information for specifying a single point. The schedule management device according to claim 1 or 2,
The schedule data includes a position designation schedule in which a place for executing the schedule is specified as one place, and a position indefinite schedule in which a plurality of places can be selected,
A schedule management apparatus comprising a position setting unit that estimates a travel time from the position designation schedule and sets a place where the position undefined schedule is to be executed based on the estimation result for the position undefined schedule. The schedule management device according to claim 6,
The position management information of the position indefinite schedule is any one of point group information for specifying a plurality of points, section information for specifying a linear or curved area, and area information for specifying a two-dimensional area. . A control method of a schedule management device that manages a schedule,
A step of referring to a database in which keywords representing schedule contents are associated with position information that can be used for route search;
Inputting the keyword in response to a user operation for registering the schedule;
And a step of associating position information obtained by referring to the database according to the keyword with the schedule as a place for executing the schedule. A control method of a schedule management device that manages a schedule,
Managing schedule data including position information indicating a place for executing the schedule and time information indicating a time at which the schedule should be executed;
A step for inputting new schedule data in accordance with the operation of the user;
Based on the new schedule data and other schedule data already registered, estimating the travel time between each schedule, and determining whether or not the new schedule data can be registered;
And a step of registering the new schedule data when it is determined that registration is possible. A computer program for managing a schedule by a schedule management device incorporating a computer,
A function that refers to a database that associates keywords representing schedule contents with location information that can be used for route search;
A function of inputting the keyword in response to a user operation for registering the schedule;
A computer program that causes the computer to realize a function of associating position information obtained by referring to the database according to the keyword with the schedule as a place for executing the schedule. A computer program for managing a schedule by a schedule management device incorporating a computer,
A function for managing schedule data including position information indicating a place for executing the schedule and time information indicating a time at which the schedule should be executed;
A function for inputting new schedule data according to the user's operation;
Based on the new schedule data and other schedule data that has already been registered, a function for estimating the travel time between each schedule and determining whether or not the new schedule data can be registered;
A computer program for causing the computer to realize a function of registering the new schedule data when it is determined that registration is possible.

Images