JP2007058259A - Schedule-registering device and schedule-registering method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To enable a user to easily register a schedule which does not specify time and places. <P>SOLUTION: When schedule data inputted from an inputting means 5 are a schedule which does not specify time and places, a candidate route extracting means 2 extracts, from a map DB 7, candidate routes, which move between execution places of respective schedule data to conform to their execution time, based on the map DB 7 and a time-table DB 8, when the schedule which does not specify time and places is incorporated into an unregistered time zone. A candidate route-selecting means 3 selects a movement route from among the candidates routes. An additional registering means 4 specifies the execution time and execution place of a schedule which does not specify time and places, and registers them with a schedule database 6. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a schedule registration apparatus for adding a schedule to a schedule database in a schedule management system for automatically managing a schedule using an electronic map.

  Some portable terminals such as PDAs and mobile phones have a function of managing a user's schedule. In such a schedule management 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, cooperation between a schedule management function and an electronic map has been attempted.

  As a schedule management device that cooperates with an electronic map, those described in Patent Documents 1 and 2 are known.

  The schedule management device described in Patent Document 1 determines whether or not the current position of a user is within a range that can reach a scheduled destination at a specified time, and notifies the result. Patent Document 2 describes a navigation device that can display a route from a current position to a destination specified by an input schedule and a time margin.

  On the other hand, in actual transportation, some trains, buses, ferries, etc. operate according to a predetermined schedule. When it is necessary to use such a transportation facility, it is necessary to determine the time taken from the starting point to the destination in consideration of the transportation schedule when estimating the schedule.

Patent Document 3 describes a navigation device that performs optimal route calculation in consideration of the ferry departure waiting time. Patent Document 4 describes a route guidance device that calculates a time cost of a route in consideration of a waiting time between stations.
JP 2000-283786 A JP 2000-258173 A JP-A-8-166248 JP 2001-165683 A

  In the above conventional technique, the time cost to the destination can be automatically calculated based on the schedule input by the user. However, when the user sets a schedule in the pedestrian navigation apparatus, the user needs to set the schedule while considering the travel time between the schedules. In this case, if an optimal schedule is to be set, the user needs to estimate the travel time and to set the schedule by examining the timetable of various transportation facilities. In particular, if you want to incorporate a schedule that does not specify time or place between the set schedules (hereinafter referred to as “time / place indefinite schedule”), you must estimate the travel time or check the timetable one by one. Is cumbersome and lacks convenience.

  For example, you may want to drop in at a post office for about 5 minutes at a time of day schedule. In such a case, it is time consuming and wasteful to check the timetable by checking the location of the travel time between the set schedules while checking against the post office.

  Therefore, an object of the present invention is to provide a schedule registration apparatus and a schedule registration method that can easily create a schedule even when a user registers a time / place indefinite schedule in a schedule management system. .

  The first configuration of the schedule registration apparatus according to the present invention is a schedule database in which schedule execution time zones and execution locations are stored in association with schedule items representing the contents of schedule data; A map database storing nodes, links representing paths connecting the nodes, and the time typically required to pass through the links given as the cost of each link; A timetable database for storing the timetable of the transportation facility; and input means for inputting a schedule item, an execution time zone, and an execution place in accordance with a user operation for registering schedule data. In the schedule management system, schedule data input from the input means A schedule registration apparatus for registering in a schedule database, where the schedule data input from the input means is a time / place indefinite schedule that does not specify an execution time zone on time and does not specify an execution place in one place When an undefined time / location schedule is incorporated in an unregistered time zone other than the time zone in which schedule data has already been registered, the schedule data is executed between the execution locations based on the map database and timetable database. Candidate route extracting means for extracting from the map database a combination of a passing link, a passing node, and a waiting time that move so as to be consistent with the time zone (hereinafter referred to as “candidate route”); Candidate route selection means for selecting a travel route; and the above-mentioned based on the travel route Characterized in that it comprises a; identifies the execution time period and execution place between and place indefinite schedule, additional registration means for registering the schedule database.

According to this configuration, when the user wants to newly incorporate a time / place indefinite schedule into the schedule data, the time / place indefinite schedule is input from the input means. The candidate route extracting means refers to the map database and the timetable database, and sets the combination of the passing link, the passing node, and the waiting time of the moving route between the schedule data, and between the execution locations of the schedule data. Several candidates are extracted so as to be consistent with the execution time zone. The candidate route selection means selects one movement route from among these candidates. The additional registration means registers the selected movement route in the schedule database.
As a result, the user is not bothered with where the time / place indefinite schedule is incorporated into the daily schedule, and the convenience of the schedule management system is improved.

  Here, the “time / place indefinite schedule” refers to a schedule that does not specify an execution time zone on time and does not specify an execution place in one place. The “time / location indeterminate schedule” is not required if the execution time zone and execution location are not specified as one. In addition to the case where the execution time zone and execution location are not specified at all, the execution time zone and execution location are not specified. The case where it is restricted to a plurality of places or a certain time zone is also included. In the following, a schedule that does not specify an execution location in one place is referred to as a “location indefinite schedule”, and a schedule that does not specify an execution time on time is called a “time indefinite schedule”.

  For example, the place indefinite schedule where the execution place is restricted to a plurality of places is restricted as a point cloud of a plurality of points, restricted as a linear or curved area, or restricted as a two-dimensional area Is raised. Specifically, examples of the place undefined schedule in which the execution place is restricted as a point cloud of a plurality of points include a post office, a bank, a gas station, and the like. Examples of the place-indefinite schedule in which the execution place is limited as a straight or curved area include OO street, XX river, and a street where a marathon can be watched. Examples of the place-indefinite schedule in which the execution place is limited as a straight line or a two-dimensional area include OO park and an area where fireworks can be viewed.

  In addition, examples of the place-indefinite schedule in which the execution time is limited to a plurality of times include those in which the execution time zone is limited. Specifically, for example, a time zone where a post office is open, a time zone where a bank is open, and the like can be mentioned.

  “Candidate route that moves between execution locations of each schedule data so as to be consistent with their execution time zone” means moving between the execution location of one schedule data and the execution location of the next schedule data This means that the user can move between the execution end time of the previous schedule data and the execution start time of the subsequent schedule data.

  Further, here, the selection method of the moving route by the candidate route selecting means is not specified. For example, a method of displaying a list of candidate routes to prompt the user to select and select by user selection input, a method of selecting a travel route with the shortest waiting time in the candidate route, and a travel distance in the candidate route For example, a method of selecting the shortest travel route can be used.

  According to a second configuration of the schedule registration apparatus of the present invention, in the first configuration, the candidate route extraction unit extracts the unregistered time zone that is longer than the time required for the time / location indefinite schedule. Time zone extracting means; referring to the map database and the timetable database, both schedule data in the unregistered time zone between the end time of the immediately preceding schedule data and the start time of the immediately following schedule data Moving path extracting means for extracting a combination of a passing link, a passing node, and a waiting time (hereinafter referred to as a “moving path”) that moves between the execution locations of each of the passing positions; and, for each passing node of the moving path, the passing node Immediately after, the node of the execution place of the time / location indefinite schedule is added, and the travel route of the shortest time is re-started If the travel route can be set between the end time and the start time of the previous and subsequent registered schedules (hereinafter referred to as “registered schedule”), candidate route calculation using the travel route as the candidate route Means.

  According to this configuration, when a time / place indefinite schedule is input from the input unit, the unregistered time zone extracting unit extracts an unregistered time zone longer than the required time. Next, for each extracted unregistered time zone, the movement route extraction means executes both schedule data between the end time of the previous schedule data and the start time of the later schedule data. Extract travel routes that move between them. Next, the candidate route calculation means adds a node at the execution place of the time / location indefinite schedule immediately after the passing node to each passing node of the moving route, and reconstructs the moving route with the shortest time. Then, it is checked whether or not the reconstructed travel route is within the unregistered time zone, and if it is within, the travel route is set as a candidate route. Thereby, a candidate route can be generated.

  According to a third configuration of the schedule registration apparatus of the present invention, in the first or second configuration, the candidate route selection means displays a list of insertion time candidates of a time / location indefinite schedule according to each candidate route. Candidate display means for displaying above; and user selection means for selecting insertion time candidates from the list in accordance with a user input operation.

  According to this configuration, when the user inputs a time / place indefinite schedule using the input means, the candidate time zones are displayed as a list on the display. The user can select a desired candidate time zone from the displayed candidate time zones, and register the time / location indefinite schedule in the desired time zone. If the execution time zone is determined, the execution location is automatically determined. This enhances the convenience of user schedule registration.

  According to a fourth configuration of the schedule registration apparatus of the present invention, in the third configuration, the candidate display unit rearranges each candidate route in ascending order of waiting time, and sets a time / Candidates for the insertion time of the place-indeterminate schedule are displayed on the display as a list.

  Time / place indefinite schedule insertion time candidates for candidate routes are displayed sorted in ascending order of total waiting time, so users can easily insert time / place indefinite schedules in the time zone with the least waiting time. can do.

  According to a fifth configuration of the schedule registration apparatus of the present invention, in the third configuration, the candidate display unit rearranges each candidate route in ascending order of total travel distance, and sets a time / Candidates for the insertion time of the place-indeterminate schedule are displayed on the display as a list.

  Time / place indefinite schedule for candidate routes Inserted time candidates are sorted and displayed in ascending order of total travel distance, so users can easily insert time / place indefinite schedules at times when travel distance is the least. can do.

  According to a sixth configuration of the schedule registration apparatus of the present invention, in the third configuration, the candidate display unit rearranges each candidate route in ascending order of total travel time, Candidates for the insertion time of the place-indeterminate schedule are displayed on the display as a list.

  Candidates for time / location schedules for candidate routes are inserted and displayed in order of increasing total travel time, so users can easily insert time / location time schedules at times when travel time is the shortest. can do.

  A first configuration of the schedule registration method according to the present invention is a schedule database in which schedule execution time zones and execution locations are stored in association with schedule items representing the contents of schedule data; A map database storing nodes, links representing paths connecting the nodes, and the time typically required to pass through the links given as the cost of each link; A timetable database for storing the timetable of the transportation facility; and input means for inputting a schedule item, an execution time zone, and an execution place in accordance with a user operation for registering schedule data. In the schedule management system, schedule data input from the input means A schedule registration method for registering in a schedule database, wherein the schedule data input from the input means is a time / place indefinite schedule that does not specify an execution time zone on time and does not specify an execution place in one place When an undefined time / location schedule is incorporated in an unregistered time zone other than the time zone in which schedule data has already been registered, the schedule data is executed between the execution locations based on the map database and timetable database. A candidate route extracting step of extracting from the map database a combination of a passing link, a passing node, and a waiting time that move so as to be consistent with a time zone (hereinafter referred to as “candidate route”); A candidate route selection step for selecting a travel route; and based on the travel route Characterized in that it comprises a; identify can perform time zone and execution location of the time and place indefinite schedule, additional registration step of registering the schedule database.

  According to a second configuration of the schedule registration method of the present invention, in the first configuration, in the candidate route extraction step, the unregistered time zone that is longer than the time required for the time / location indefinite schedule is extracted. Registration time zone extraction step; with reference to the map database and the timetable database, in the unregistered time zone, between the end time of the immediately preceding schedule data and the start time of the immediately following schedule data, A moving path extraction step of extracting a combination of a passing link, a passing node, and a waiting time (hereinafter referred to as a “moving path”) that moves between data execution locations; and, for each passing node of the moving path, the passing Add the execution location node of the time / location indefinite schedule immediately after the node. If the travel route can be set between the end time and start time of the previous and subsequent registered schedules (hereinafter referred to as “registered schedule”), the travel route is selected as the candidate. A candidate route calculation step as a route.

  According to a third configuration of the schedule registration method of the present invention, in the first or second configuration, in the candidate route selection step, insertion time candidates of a time / location indefinite schedule are listed according to the candidate routes. A candidate display step for displaying on the display; and a user selection step for selecting a candidate for an insertion time from the list according to an input operation by the user.

  According to a fourth configuration of the schedule registration method of the present invention, in the third configuration, in the candidate display step, the candidate routes are rearranged in the order of decreasing total waiting time, and time for the candidate routes is set. -It is characterized by displaying on the display the candidates for the insertion time of the undefined place schedule as a list.

  According to a fifth configuration of the schedule registration method of the present invention, in the third configuration, in the candidate display step, the candidate routes are rearranged in order from the smallest total travel distance, and the time for the candidate routes is arranged. -It is characterized by displaying on the display the candidates for the insertion time of the undefined place schedule as a list.

  According to a sixth configuration of the schedule registration method of the present invention, in the third configuration, in the candidate display step, the candidate routes are rearranged in the order from the smallest total travel time to the time for the candidate route. -It is characterized by displaying on the display the candidates for the insertion time of the undefined place schedule as a list.

  The program according to the present invention is read and executed by a computer, thereby causing the computer to function as the schedule registration device having any one of the first to sixth configurations.

  As described above, according to the present invention, when the user incorporates the time / place indefinite schedule into the daily schedule, the user is not bothered by where the schedule is incorporated, and the convenience of the schedule management system is improved.

  The best mode for carrying out the present invention will be described below with reference to the drawings.

  FIG. 1 is a block diagram illustrating a functional configuration of a schedule registration device 1 according to the first embodiment of the present invention. FIG. 1 illustrates a state in which the schedule registration device 1 according to the first embodiment is incorporated in a schedule management system.

  The schedule registration device 1 includes a candidate route extraction unit 2, a candidate route selection unit 3, and an additional registration unit 4. Further, as a peripheral configuration of the system, an input means 5, a schedule database 6, a map database 7, a timetable database 8, and a display 9 are provided.

  The schedule database 6 is a database for holding a schedule registered for each user. The map database 7 stores map information. In this case, the map information is data having a graph structure composed of links representing sections of passages such as sidewalks, roads, railways, and bus routes, and nodes representing points corresponding to end points of the links. The timetable database 8 stores operation schedules related to public transportation such as railways and buses.

  When the schedule data is input from the input unit 5, the candidate route extraction unit 2 extracts a time zone in which the schedule data is registered and a moving route candidate associated therewith. The candidate route selection unit 3 performs control for selecting one movement route from the candidate routes extracted by the candidate route extraction unit 2. The additional registration means 4 registers schedule data in the schedule database 6 according to the selected movement route.

  The candidate route extraction unit 2 includes an unregistered time zone extraction unit 11, an unregistered time zone table 12, a movement route extraction unit 13, a route search unit 14, a movement route table 15, a candidate route calculation unit 16, and a candidate route table 17. I have.

  The unregistered time zone extracting means 11 refers to the user's schedule database 6 and extracts a time zone (unregistered time zone) in which the user's schedule data is not yet registered, and the unregistered time zone table 12 Create

  The movement route extraction means 13 extracts the execution location, end time, and start time of the previous schedule and the subsequent schedule for each unregistered time zone in the unregistered time zone table 12. Then, the route searching means 14 searches and extracts the route moving from the execution location of the previous schedule to the execution location of the subsequent schedule and the waiting time at each node in the route. When the departure point, departure time, and destination point are given, the route search means 14 searches the route from the departure point to the destination point in the shortest time with reference to the map database 7 and the timetable database 8. Here, the route search can be performed using a known Dijkstra method or the like. The movement route extraction means 13 registers the movement route extracted for each unregistered time zone in the movement route table 15.

  The candidate route calculation means 16 tries to add a node of the execution place of the time / location indefinite schedule for each of the movement routes registered in the movement route table 15. That is, one node (hereinafter referred to as “passing node”) in the movement route is selected, and immediately after the passing node, a node (hereinafter referred to as “candidate node”) where the time / location indefinite schedule is executed is hypothesized. Add to Then, with the candidate node added, the route search means 14 resets the shortest travel route. If a travel route can be set between the end time and start time of the previous and subsequent registered schedules (hereinafter referred to as “registered schedule”), the travel route is set as a candidate route and registered in the candidate route table 17. To do.

The candidate route selection unit 3 includes a candidate display unit 21 and a user selection unit 22.
The candidate display means 21 displays the candidate route registered in the candidate route table 17 on the display 9 and prompts the user to select. When a candidate route is selected by the user using the input unit 5, the user selection unit 22 determines the execution time zone / execution location of the time / location indefinite schedule corresponding to the candidate route, and the schedule database 6 Register with.

  FIG. 2 shows the data structure of the schedule database 6. “No.” is attached to the schedule data, and the illustrated items are registered. The schedule data includes a “time designation schedule” and a “time indefinite schedule”. In the “time designation schedule”, “start time” and “end time” are designated. On the other hand, these are undefined in the “time indefinite schedule”. There are also a “location designation schedule” and a “location indefinite schedule”. The “location specification schedule” specifies an execution location. On the other hand, the “location indefinite schedule” is designated in such a way that the execution location is not limited to a single point such as a point cloud, a section, or an area. A schedule that is a “time indefinite schedule” and also a “place indefinite schedule” is referred to as a “time / place indefinite schedule”. In FIG. 2, “Time Undefined Schedule” and “Location Undefined” fields are “Yes” in “Time Undefined Schedule” and “Location Undefined Schedule”, respectively.

  In FIG. As shown in the schedule of FIG. 3, the schedule registration device 1 stores the start time, end time, and execution location data while the time is indefinite and the location is indefinite. Indicates that is set. In the “remarks” column, for example, names of other users who should behave together for each schedule, such as participants in a conference, can be registered.

  FIG. 3 shows an example of the structure of map data. The map data stored in the map database 7 has a hierarchical structure as shown in FIG. In this hierarchical structure, a graph of a traffic network in which an upper layer connects long distances is stored, and a graph of a traffic network in a short distance is stored in the lower layer. In the example of FIG. 3, the uppermost layer (first layer) is a railway network graph, the middle layer (second layer) is a bus traffic network graph, and the lowermost layer (third layer) is a pedestrian road network graph. Is stored.

The graph of each layer (layer) is composed of a set of a node set {N _i } and a link set {L _k }. Each node in the node set represents a point on the map. For example, in the example of FIG. 3, the first layer nodes N _i and N _j represent stations, and the second layer nodes N _p and N _q represent bus stops. Each link in the link set represents a passage on the map. For example, in the example of FIG. 3, the link L _k of the first layer represents the railway, the node L _r of the second layer represents the bus lines. Each link is weighted by the time t (L) typically required to pass through that link.

  FIG. 4 shows a configuration example when the schedule registration device 1 of FIG. 1 is incorporated in a specific schedule management system. The schedule management system in FIG. 4 includes a server 31 and a plurality of portable terminals 32 connected to the server 31 via wireless communication lines. As the mobile terminal 32, a mobile phone, a PDA, or the like can be used.

  The server 31 incorporates the schedule registration apparatus 1 according to the present embodiment as a program module. Further, the location database 43 and the schedule database 6, the map database 7, and the timetable database 8 shown in FIG. 1 are stored in a large-capacity auxiliary storage device (HDD, DVD-ROM, etc.) provided in the server 31. Stored.

  In FIG. 4, the schedule management means 41 in the server 31 has various functions related to schedule call and other schedule management in addition to the functions of the schedule registration device 1. The communication unit communicates with the mobile terminal 32 through a communication line.

  The position database 43 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. FIG. 5 is an explanatory diagram showing the contents of the position database 43. In this embodiment, “schedule item” and “name” are used as keywords. “Position information” is information for specifying a destination on a map, and in the present embodiment, it is a coordinate value of longitude and latitude. The position database 43 is provided for each user, and each user can customize the contents.

  For example, for the schedule item “monthly meeting”, the background coordinates (Lat1, Lon1) of the “main building meeting room” where the meeting is normally held are registered. The position database 43 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 location information of the head office or each branch of the AA bank used by the user. In addition, the section corresponding to the route is associated with the event “## marathon” as a point sequence. The event “XX fireworks” is associated with an area where fireworks can be appreciated, for example, a circular area with a center position (Lat9, Lot9) and a radius R. The region is not limited to a circle, and may be specified by a polygon dot sequence.

  The position database 43 may allow a user to register position information, or the server 31 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, and a building name while referring to the position database 43, or the latitude and longitude of a destination specified on the displayed map are newly located. A method of registering in the position database 43 as information can be taken. 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.

  On the other hand, each portable terminal 32 in FIG. 4 includes the input means 5 and the display 9 in FIG. In addition, display control means 51, time management means 52, GPS 53, communication means 54, and main control means 55 are provided.

  In this case, the input means 5 is a key switch provided in the portable terminal 32. The display 9 is a display screen provided in the mobile terminal 32.

  The display control means 51 performs display control on the display 9. The time management means 52 is a “clock” that outputs the current time. The GPS 53 detects the current position of the mobile terminal 32 using a global positioning system.

  The communication unit 54 controls communication with the server 31 via a communication line. The information transmitted from the portable terminal 32 to the server 31 includes, for example, commands and data for registering and browsing the schedule. Information transmitted from the server 31 to the portable terminal 32 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 main control means 55 controls the entire operation of the mobile terminal 32.

  The operation of the schedule registration device 1 according to this embodiment configured as described above will be described below.

  FIG. 6 is a flowchart of the schedule registration process.

  First, when the schedule registration process is started in step S1, a schedule / data input screen as shown in FIG. The user can input items, start date and time, end date and time, required time, place, member, and remarks as schedule data by the input means 5, respectively. The content to be entered in “Item” is the content to be registered in “Schedule Item” in the schedule database 6. The contents registered in “Members” and “Remarks” are the contents registered in “Remarks” of the schedule database 6. If the start date and time and the end date and time are blank, they are recognized as “time indefinite schedule” and “location indefinite schedule”. In the case of a “time indefinite schedule”, an execution time required to execute the schedule is designated as “required time”.

  In the example of FIG. 6, a function for supporting input for a place and a member is provided. The “Location” field and the “Member” field are combo boxes, and clicking the inverted triangle on the right side displays the list shown on the right side of the figure. For the location, the name registered in the location database 43 is displayed, and a search menu such as “Search by address”, “Search by phone number”, “Search by nearest station”, etc. is 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 the nearest station name. When the input content in the “item” column matches the schedule item in the position database 43, the corresponding name may be displayed in the “location” column by default. After setting the schedule data, click the “Register” button at the bottom right. As a result, the “location” designated by the user is converted into background coordinates by the schedule registration device 1.

  Next, in step S2, the schedule registration device 1 refers to the information related to the start / end date and time of the schedule data and the information related to the location, and determines whether or not the input schedule data is a time / location designation schedule. inspect. In the case of a time / place designation schedule, the process proceeds to step S3, and in the case of a time undefined schedule or a place undefined schedule, the process proceeds to step S8.

  In step S3, the movement route extraction means 13 refers to the start time and end time of the input schedule data γ and refers to the schedule database 6 to immediately before and immediately after the input schedule data γ. The schedule data α and β are extracted.

  In step S4, the movement route extraction means 13 causes the route search means 14 to move from the execution location of the schedule data α to the execution location of the schedule data γ, the movement time, and each passage in the route. Estimate the waiting time at the node. Similarly, the movement route for moving from the execution location of the schedule data γ to the execution location of the schedule data β, the movement time, and the waiting time at each passing node in the route are estimated.

  Here, when the departure point, departure time, and destination point are given, the route search means 14 searches the map database 7 for a route that reaches the destination point from the departure point in the shortest time using the Dijkstra method or the like. Here, when passing a public transportation link such as a railroad or bus, a waiting time is actually generated at a station or a bus stop. Therefore, first, a plurality of travel routes having a short required time are selected from the routes from the departure point to the destination point. Then, the waiting time in each node is determined by referring to the timetable database 8, and the time actually required to pass through each selected movement route is calculated. Of these, the shortest travel time in consideration of the waiting time is output as the shortest travel route.

For example, as shown in FIG. 8, a case is considered where a movement route from the execution location of the schedule data α to the execution location of the schedule data γ is searched. The execution place (departure place) of the schedule data α is set as a node N ₁ , and the execution place (destination) of the schedule data γ is set as a node N ₆ . The end time of the schedule data α is T ₁ and the start time of the schedule data γ is T ₂ . First, the route search means 14 searches for a route from the departure point to the destination point in the shortest time using the Dijkstra method or the like. As a result, it is assumed that route P ₁ (departure point → A station → B station → bus stop C → bus stop D → destination point) and route P ₂ (departure point → bus stop E → bus stop D → destination point) are extracted. The passing nodes of the route P ₁ are N ₁ , N ₂ , N ₃ , N ₄ , N ₅ , N ₆ , and the passing links are L ₁ , L ₂ , L ₃ , L ₄ , L ₅ . Further, let the passing nodes of the route P _{2 be} N ₁ , N ₇ , N ₅ , N _6, and let the passing links be L ₆ , L ₅ . The departure point and the destination point are also included in the passing node. The time required to pass through each passing link is estimated from the time t (L _i ) (i = 1, 2,..., 7) normally required for each link in the map database 7.

The route search means 14 determines the waiting time at each passing node of each route with reference to the timetable database 8. For example, in the case of the route P ₁ , the time of arrival at the passing node N ₂ (A station) is T ₁ + t (L ₁ ). Thus, out of the whole train stop at station A at time T _{1 +} t (L ₁₎ and later, to search the vehicle stop time T ₃ of the train station A to arrive at the earliest B station from the timetable database 8. Accordingly, the waiting time at the transit node N ₂ (A station) can be estimated as T ₃ − [T ₁ + t (L ₁ )]. Similarly, the waiting time is estimated for other transit nodes.

Finally, the route search means 14 obtains the sum of the time required for moving the route including the waiting time for the routes P ₁ and P ₂ . Then, the route with the shortest travel time is output as the travel route with the shortest time. For example, in the example of FIG. 8, the movement time of the path _{P 1} is 125 minutes, travel time path _{P 2} is 135 minutes. Therefore, in this case, the path P ₁ is outputted as a moving path of the shortest time.

  Next, in step S5, the additional registration means 4 determines whether registration is possible. That is, the movement time for moving from the execution location of the schedule data α to the execution location of the schedule data γ falls within the unregistered time zone between the schedule data α and the schedule data β, and the schedule data γ If the movement time for moving from the execution location to the execution location of the schedule data β falls within the unregistered time zone between the schedule data α and the schedule data β, it is determined that registration is possible.

  If it is determined that registration is possible, in step S6, the additional registration means 4 registers the schedule data γ in the schedule database 6 and ends the schedule registration process. On the other hand, if it is determined that registration is impossible, in step S7, the additional registration means 4 displays an error message on the display 9 and ends the schedule registration process.

  On the other hand, in step S8, after the time / place setting process described below is performed, the schedule registration process ends.

  FIG. 9 is a flowchart of the time / place setting process.

  In step S <b> 11, the unregistered time zone extracting unit 11 refers to the schedule database 6, extracts a time zone where the schedule is not yet registered (unregistered time zone), and registers it in the unregistered time zone table 12. Here, when the time zone is conditioned in the time indefinite schedule (for example, “opening time of post office”), the unregistered time zone extracting means 11 extracts only the unregistered time zone that satisfies the condition. .

  When the input schedule data is a place-indefinite schedule with a specified time, the unregistered time zone extracting means 11 extracts only the unregistered time zone including the specified time zone and is not registered. Register in the time zone table 12. If no unregistered time zone is extracted (S12), an error message is displayed on the display 9 (S26), and the process is terminated.

  Next, in step S <b> 13, the movement route extraction unit 13 selects one unregistered time zone registered in the unregistered time zone table 12. In step S14, it is determined whether or not the length of the selected unregistered time zone is equal to or shorter than the execution time of the input schedule data. If it is less than the execution time of the schedule data, the process proceeds to step S21.

Next, in step S <b> 15, the movement route extraction unit 13 extracts schedule data α and β before and after the selected unregistered time zone from the schedule database 6. Then, the route from the execution location of the schedule data α to the execution location of the schedule data β is determined by searching by the route search means 14 and registered in the movement route table 15. As a result, passing nodes N ₁ , N ₂ ,..., N _ξ and passing links L ₁ , L _{2 ,.} Note that the movement path P may pass through the same node or the same link a plurality of times. For example, the movement path P is set in the order of N ₁ → L ₁ → N ₂ → L ₂ → N ₃ → L ₂ → N ₂ → L ₃ → N ₄ . In this case, the same node and the same link are regarded as different nodes and different links in each passing order, and it is assumed that there is one node and one link for each passing order. In the above example, it is assumed that the moving path P includes five nodes {N ₁ , N ₂ , N ₃ , N ₂ , N ₄ } and 4 links {L ₁ , L ₂ , L ₂ , L ₃ }.

A set of nodes on the moving path P is denoted as S _N , and a set of links as S _L. S _N = {N ₁ , N ₂ ,..., N _ξ }, S _L = {L ₁ , L ₂ ,..., L _ξ−1 }. The movement path P is expressed as a permutation of the passing node and the passing link, and is written as P = (N ₁ , L ₁ , N ₂ , L ₂ ,..., L _ξ−1 , N _ξ ). The time required for each transit node and transit link is denoted as t (N _i ), t (L _i ) (N _i εS _N , L _i εS _L ). Here, the required time at the transit node is “waiting time”. Further, the required time of the travel route P excluding the waiting time at the destination point (the last node of the travel route P) is referred to as “travel required time” and is denoted as t (P). The stroke required time t (P) is defined by the equation (1).

(Example 1)
For example, the execution location of the schedule data α before the unregistered time zone is the node N ₁ , the end time is T ₁ = 10: 00, and the execution location of the schedule data β after the unregistered time zone is the node Assume that N ₆ and the end time is T ₂ = 12: 10. Under this condition, the movement route extraction means 13 obtains a movement route. For example, assume that a movement route P as shown in FIG. A diagram showing the relationship between the time of the route and the movement distance is as shown in FIG. The movement path P is written as P = (N ₁ , L ₁ , N ₂ , L ₂ , N ₃ , L ₃ , N ₄ , L ₄ , N ₅ , L ₅ , N ₆ ). The required time t (N _i ), t (L _i ) (N _i εS _N , L _i εS _L ) and the travel time t (P) in each passing node and passing link are as shown in Table 1. is there.

（例終わり）

(End of example)

Next, in step S <b> 16, the candidate route calculation means 16 selects a passing node N _i (εS _N ) in order from the head of the moving route P registered in the moving route table 15. Then moving, in step S17, the candidate route calculating means 16, in the vicinity of the transit node N _i selected, temporarily add a point corresponding to the condition of the schedule data γ entered as a node, the route searching means 14 Reconfigure the route. Next, in step S18, the candidate route calculation means 16 obtains the travel time t (P _i ) of the reconstructed travel route P _i , and is this less than the time interval T ₂ -T _{1 of the} unregistered time zone? Determine whether or not. When the _{t (P i) ≦ T 2} -T 1 , in step S19, and registers the movement path _{P i} in the candidate path table 17. On the other hand, if t (P _i )> T ₂ −T ₁ , no registration is performed.

Next, in step S20, it is determined whether or not the processing from steps S16 to S19 has been performed on all the passing nodes N _i (εS _N ). If there is an unprocessed transit node, the process returns to step S16, the next transit node is selected, and the processing from steps S16 to S19 is performed. When the process is completed for all passing nodes, the process proceeds to step S21.

(Example 2)
Consider a case where schedule data γ of a time / place schedule is added to the travel route P (see FIG. 10) in the above (Example 1). The time interval T ₂ -T ₁ in the unregistered time zone is 130 minutes. For example, a schedule item “post office” is added as schedule data γ. This schedule item “post office” is assumed to be given as a point cloud of all post offices whose execution locations are scattered on the map. The execution time is 5 minutes.

First, a node corresponding to the schedule data γ is added in the vicinity of the transit node N ₁ . In this case, among the point cloud of the execution location of the schedule data gamma, selects those time distance to transit node N ₁ is the shortest. For example, as shown in FIG. 11A, it is assumed that “P post office” is extracted as the execution place. This "P post office" is referred to as a node N _p. The required time t (N _p ) of the node N _p is 5 minutes. Candidate route calculating unit 16, assuming that the absolute transit node _{N p} required time t _{(N p)} is inserted into the movement path, the shortest time through the node _{N 1,} N p, _{N 6} by the route searching means 14 Search for the travel route. As a result, the movement route P ₁ = (N ₁ , L _a , N _p , L _b , N ₂ , L ₂ , N ₃ , L ₃ , N ₄ , L ₄ , N ₅ , shown in FIG. L ₅ , N ₆ ) are extracted. FIG. 11 (b) is a diagram of the movement path _{P 1.} The travel time t (P ₁ ) of this travel route is 125 minutes. Since t (P ₁ ) ≦ T ₂ −T ₁ , the movement route P ₁ is registered in the candidate route table 17.

Next, add a node corresponding to the vicinity of the pass node N ₂ to the schedule data gamma. In this case, as shown in FIG. 12, it is assumed that “U post office” is extracted as the execution place. As before, the “U Post Office” is the node N _u and t (N _u ) = 5 minutes. The candidate route calculation means 16 _{assumes that} the absolute passing node N _u of the required time t (N _u ) is inserted in the moving route, and the shortest time that the route search means 14 passes through the nodes N ₁ , N _u , N _6. Search for the travel route. As a result, the movement route P ₂ = (N ₁ , L ₁ , N ₂ , L _u , N _u , L _u , N ₂ , L ₂ , N ₃ , L ₃ , N ₄ , L ₄ , _{N 5, L 5, N 6} ) is extracted. The travel time t (P ₂ ) of this travel route is 155 minutes. Since t (P ₂ )> T ₂ −T ₁ , the movement route P ₂ is not registered in the candidate route table 17.

Next, a node corresponding to the schedule data γ is added in the vicinity of the transit node N ₃ . In this case, as shown in FIG. 13A, it is assumed that “Q post office” is extracted as the execution place. This “Q post office” is assumed to be a node N _q . t (N _q ) = 5 minutes. The candidate route calculation means 16 _{assumes that} the absolute passing node N _q of the required time t (N _q ) is inserted in the movement route, and the shortest time that the route search means 14 passes through the nodes N ₁ , N _q , N _6. Search for the travel route. As a result, the movement route P ₃ = (N ₁ , L ₁ , N ₂ , L ₂ , N ₃ , L _c , N _q , L _d , N ₄ ′, L ₄ ′, N shown in FIG. ₅ , L ₅ , N ₆ ) are extracted. Figure 13 (b) is a diagram of the movement path _{P 3.} The travel time t (P ₃ ) of this movement route is 125 minutes. Since t (P ₃ ) ≦ T ₂ −T ₁ , the movement route P ₃ is registered in the candidate route table 17.

Next, a node corresponding to the schedule data γ is added in the vicinity of the transit node N ₄ . In this case, as shown in FIG. 14A, it is assumed that “R post office” is extracted as the execution place. This “R post office” is assumed to be a node N _r . t (N _r ) = 5 minutes. Candidate route calculating unit 16, assuming that the absolute transit node _{N r} required time t _{(N r)} is inserted into the movement path, the shortest time through the node _{N 1, N r, N 6} by the route searching means 14 Search for the travel route. As a result, the movement route P ₄ = (N ₁ , L ₁ , N ₂ , L ₂ , N ₃ , L _e , N _r , L _f , N ₄ , L ₄ , N ₅ , shown in FIG. L ₅ , N ₆ ) are extracted. Figure 14 (b) is a diagram of the movement path _{P 4.} The travel time t (P ₄ ) of this movement route is 125 minutes. Since t (P ₄ ) ≦ T ₂ −T ₁ , the movement route P ₄ is registered in the candidate route table 17.

Next, a node corresponding to the schedule data γ is added in the vicinity of the transit node N ₅ . In this case, as shown in FIG. 15A, it is assumed that “S Post Office” is extracted as the execution place. This "S post office" is referred to as a node N _s. t (N _s ) = 5 minutes. The candidate route calculation means 16 assumes that the absolute passing node N _s of the required time t (N _s ) is inserted in the travel route, and the shortest time for passing the nodes N ₁ , N _s , N ₆ by the route search means 14. Search for the travel route. As a result, the movement route P ₅ = (N ₁ , L ₁ , N ₂ , L ₂ , N ₃ , L ₃ , N ₄ , L ₄ ″, N ₅ ′, L _g , N shown in FIG. _{s, L} h, _{N 6)} is extracted. FIG. 15 (b) is a diagram of the movement path _{P 5.} the moving path travel time required t _{(P 5)} is 129 minutes .t _{(P 5} ) ≦ T ₂ −T ₁ , the travel route P ₅ is registered in the candidate route table 17.

Finally, a node corresponding to the schedule data γ is added in the vicinity of the transit node N ₆ . In this case, as shown in FIG. 16, it is assumed that “V post office” is extracted as the execution place. As before, “V Post Office” is node N _v and t (N _v ) = 5 minutes. Candidate route calculating unit 16, assuming that the absolute transit node _{N v} required time t _{(N v)} in the movement path is inserted, the node _N 1 by the route searching means _14, N v, the shortest time through the _{N 6} Search for the travel route. As a result, the movement route P ₆ = (N ₁ , L ₁ , N ₂ , L ₂ , N ₃ , L ₃ , N ₄ , L ₄ , N ₅ , L ₅ , N ₆ , L _m , _{N v, L m, N 6} ) is extracted. The travel time t (P ₆ ) of this travel route is 145 minutes. Since t (P ₆ )> T ₂ −T ₁ , the movement route P ₆ is not registered in the candidate route table 17.
(End of example)

  Next, in step S21, it is determined whether or not the processing from steps S13 to S20 has been performed in all unregistered time zones registered in the unregistered time zone table 12. If there is an unprocessed unregistered time zone, the process returns to step S13, and the processes from step S13 to S20 are performed for the unregistered time zone. When the processing is completed for all unregistered time zones, the process proceeds to the next step S22.

  Next, in step S <b> 22, the candidate route selection unit 3 determines whether one or more candidate routes are registered in the candidate route table 17. If none has been registered, the candidate route selection means 3 displays an error message on the display 9 and ends the time / place setting process. On the other hand, if even one is registered, the candidate display means 21 lists the location and time zone of the added schedule data γ set for the candidate route registered in the candidate route table 17. Display as.

  FIG. 17 shows an example of a list of execution locations and execution time zones of schedule data γ displayed on the display 9. The list may be displayed in ascending order of execution time period (start time), but may be displayed in order of increasing waiting time on the movement route. Moreover, you may arrange and display in order with a short moving distance or a short moving time. This is because it is easy to set an efficient schedule.

  The user selection means 22 displays a cursor indicating the selection item on this list. From this list, the user moves the cursor to the column of the execution location and execution time zone where the schedule data γ is to be inserted, and clicks the “select” button. Thereby, the execution place and execution time zone of the schedule data γ are selected.

  In step S13, the additional registration unit 4 registers the execution time zone and execution location of the selected schedule data γ in the schedule database 6 and ends the time / location setting process.

  Through the above processing, even when a time / place indefinite schedule is input, the execution time zone and execution place where the schedule can be added are automatically searched and displayed as a list as candidates. If the user selects a candidate from the displayed list, the time / place indefinite schedule can be added to a desired time zone while maintaining consistency with other schedules. Thereby, the convenience of the schedule registration operation in the schedule management system is improved, and the schedule management is also made efficient.

It is a block diagram showing the function structure of the schedule registration apparatus which concerns on Example 1 of this invention. The data structure of the schedule database 6 is shown. It is an example of the structure of map data. It is an example of a structure in the case of incorporating the schedule registration apparatus 1 of FIG. 1 in a concrete schedule management system. It is explanatory drawing which shows the content of the position database 43. FIG. It is a flowchart of a schedule registration process. It is a figure showing the example of a schedule data input screen. It is a figure explaining the route estimation method by the route search means. It is a flowchart of a time / place setting process. It is a figure which shows the example of the movement path | route P registered into the movement path | route table. It is a diagram showing a movement path P ₁ in the case where the node N _p of schedule data γ in the vicinity of the transit node N ₁ is added. It is a diagram showing a movement path P ₂ in the case where the node N _u of the schedule data γ in the vicinity of transit node N ₂ is added. It is a diagram showing a movement path P ₃ when the node N _q of schedule data γ in the vicinity of the transit node N ₃ is added. It is a diagram showing a movement path P ₄ when the node N _r of schedule data γ in the vicinity of the transit node N ₄ is added. It is a diagram showing a movement path P ₅ when the node N _s scheduled data γ in the vicinity of the transit node N ₅ is added. It is a diagram showing a movement path P ₆ when the node N _v of schedule data γ in the vicinity of the transit node N ₆ has been added. It is an example of a list of locations and time zones of schedule data γ displayed on the display 9.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Schedule registration apparatus 2 Candidate route extraction means 3 Candidate route selection means 4 Additional registration means 5 Input means 6 Schedule database 7 Map database 8 Timetable database 9 Display 11 Unregistered time zone extraction means 12 Unregistered time zone table 13 Travel route Extraction unit 14 Route search unit 15 Travel route table 16 Candidate route calculation unit 17 Candidate route table 21 Candidate display unit 22 User selection unit 31 Server 32 Portable terminal 41 Schedule management unit 42 Communication unit 43 Position database 51 Display control unit 52 Time management unit 53 GPS
54 Communication means 55 Main control means

Claims (13)

A schedule database in which schedule execution time zones and execution locations are stored in association with schedule items representing the contents of schedule data;
A map database storing nodes representing points on the map, links representing paths connecting the nodes, and the standard time required to pass through the links given as the cost of each link;
A timetable database storing a timetable of the transportation for each link representing the transportation;
And an input means for inputting a schedule item, an execution time zone, and an execution location in accordance with a user operation for registering schedule data;
A schedule registration device for registering schedule data input from the input means in the schedule database,
If the schedule data input from the input means is a time / location indefinite schedule that does not specify the execution time zone on time and does not specify the execution location in one place, the schedule data other than the time zone in which the schedule data has already been registered When the time / location indefinite schedule is incorporated in the unregistered time zone, transit links and passages that move between the execution locations of each schedule and data based on the map database and the timetable database so as to be consistent with those execution time zones Candidate route extraction means for extracting a combination of nodes and waiting time (hereinafter referred to as “candidate route”) from the map database;
Candidate route selection means for selecting one moving route from among the candidate routes;
And additional registration means for specifying the execution time zone and execution location of the time / location indefinite schedule based on the movement route and registering the schedule in the schedule database;
A schedule registration device comprising: The candidate route extraction means includes:
Unregistered time zone extracting means for extracting the unregistered time zone longer than the time required for the time / location indefinite schedule;
Referring to the map database and the timetable database, in the unregistered time zone, between the execution time of both schedule data between the end time of the immediately preceding schedule data and the start time of the immediately following schedule data A route extracting unit that extracts a combination of a passing link, a passing node, and a waiting time (hereinafter referred to as “moving route”);
In addition, for each passing node of the moving route, a node of the execution place of the time / location indefinite schedule is added immediately after the passing node to reset the moving route of the shortest time, and the registered schedules before and after If the travel route can be set between the end time and the start time (hereinafter referred to as “already registered schedule”), candidate route calculation means using the travel route as the candidate route;
The schedule registration device according to claim 1, further comprising: The candidate route selection means includes:
Candidate display means for displaying on the display a list of insertion time candidates of the time / place indefinite schedule according to each candidate route;
And user selection means for selecting insertion time candidates from the list according to the user's input operation;
The schedule registration apparatus according to claim 1, further comprising: The candidate display means rearranges each candidate route in ascending order of the total waiting time, and displays the insertion time candidates of the time / location indefinite schedule for the candidate route on the display as a list. The schedule registration device according to claim 3. The candidate display means rearranges each candidate route in ascending order of the total travel distance, and displays on the display a list of insertion time candidates of the time / location indefinite schedule for the candidate route as a list. The schedule registration device according to claim 3. The candidate display means rearranges each candidate route in ascending order of total travel time, and displays on the display a list of insertion time candidates of the time / location indefinite schedule for the candidate route as a list. The schedule registration device according to claim 3. A schedule database in which schedule execution time zones and execution locations are stored in association with schedule items representing the contents of schedule data;
A map database storing nodes representing points on the map, links representing paths connecting the nodes, and the standard time required to pass through the links given as the cost of each link;
A timetable database storing a timetable of the transportation for each link representing the transportation;
And an input means for inputting a schedule item, an execution time zone, and an execution location in accordance with a user operation for registering schedule data;
A schedule registration method for registering schedule data input from the input means in the schedule database,
If the schedule data input from the input means is a time / location indefinite schedule that does not specify the execution time zone on time and does not specify the execution location in one place, the schedule data other than the time zone in which the schedule data has already been registered When the time / location indefinite schedule is incorporated in the unregistered time zone, transit links and passages that move between the execution locations of each schedule and data based on the map database and the timetable database so as to be consistent with those execution time zones A candidate route extraction step of extracting a combination of a node and a waiting time (hereinafter referred to as “candidate route”) from the map database;
A candidate route selection step of selecting one travel route from the candidate routes;
And an additional registration step of specifying an execution time zone and execution location of the time / location indefinite schedule based on the movement route and registering the schedule in the schedule database;
A schedule registration method comprising: In the candidate route extraction step,
An unregistered time zone extracting step for extracting the unregistered time zone that is longer than the time required for the time / location indefinite schedule;
Referring to the map database and the timetable database, in the unregistered time zone, between the execution time of both schedule data between the end time of the immediately preceding schedule data and the start time of the immediately following schedule data A path extraction step for extracting a combination of a passing link, a passing node, and a waiting time (hereinafter referred to as “movement path”);
In addition, for each passing node of the moving route, a node of the execution place of the time / location indefinite schedule is added immediately after the passing node to reset the moving route of the shortest time, and the registered schedules before and after If the travel route can be set between an end time and a start time (hereinafter referred to as “registered schedule”), a candidate route calculation step using the travel route as the candidate route;
The schedule registration method according to claim 7, further comprising: In the candidate route selection step,
A candidate display step of displaying on the display a list of insertion time candidates of the time / place indefinite schedule according to each candidate route;
And a user selection step of selecting insertion time candidates from the list according to a user input operation;
The schedule registration method according to claim 7 or 8, further comprising: In the candidate display step, the candidate routes are rearranged in ascending order of the total waiting time, and the insertion time candidates of the time / location indefinite schedule for the candidate routes are displayed as a list on the display. The schedule registration method according to claim 9. In the candidate display step, the candidate routes are rearranged in ascending order of total travel distance, and candidates for insertion times of time / place indefinite schedules for the candidate routes are displayed on a display as a list. The schedule registration method according to claim 9. In the candidate display step, the candidate routes are rearranged in ascending order of total travel time, and the insertion time candidates of the time / location indefinite schedule for the candidate routes are displayed as a list on the display. The schedule registration method according to claim 9. A program that causes a computer to function as the schedule registration device according to any one of claims 1 to 6 by being read and executed by a computer.

Images