Information processing device, improved trajectory construction method and program

The information processing device constructs improvement trajectories using Dijkstra's method to balance reward and effort, addressing the challenge of rapid goal achievement and user motivation, enhancing goal efficiency and motivation.

JP7586312B2Active Publication Date: 2024-11-19NIPPON TELEGRAPH & TELEPHONE CORP
View PDF 10 Cites 0 Cited by

Patent Information

Application Number
JP2023523839
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Filing Date
2021-05-26
Publication Date
2024-11-19
Estimated Expiration
2041-05-26

AI Technical Summary

Technical Problem

Existing improvement plans often fail to balance the speed of achieving goals with user motivation, leading to excessive burden and decreased motivation when attempting rapid index improvement.

Method used

An information processing device and method that constructs an improvement trajectory using Dijkstra's method, minimizing the weighted sum of negative present value of time-discounted rewards and total distance, considering a reward function, time discount, effort per unit time, and a trade-off parameter.

Benefits of technology

Supports the creation of appropriate improvement plans that balance reward and effort, enhancing user motivation and goal achievement efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007586312000002
    Figure 0007586312000002
  • Figure 0007586312000003
    Figure 0007586312000003
  • Figure 0007586312000004
    Figure 0007586312000004
Patent Text Reader

Abstract

Provided is an information processing device comprising an input unit that acquires input information including a first numerical index serving as an initial index and a second numerical index serving as a target index; and an improved trajectory construction unit that uses the input information to construct an improved trajectory indicating a trajectory from the first numerical index to the second numerical index in time series.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present invention relates to an information processing device, an improved trajectory construction method, and a program. [Background technology]

[0002] There is a known technology that supports the generation of improvement plans for users' numerical indicators. It is also known that for many people, the value of the reward (monetary reward, joy associated with goal achievement, etc.) that is obtained when a goal is achieved decreases the further away from the present the time at which it is obtained, and this phenomenon is called time discounting and has been studied in fields such as behavioral economics (Non-Patent Document 1). [Prior art documents] [Non-patent literature]

[0003] [Non-Patent Document 1] J. Benhabib, B. Alberto, and S. Andrew. Present-bias, Quasi-hyperbolic Discounting, and Fixed Costs, Games and Economic Behavior 69.2 (2010): 205-223. Summary of the Invention [Problem to be solved by the invention]

[0004] Improvement plans that achieve their goals as quickly as possible have a higher present value and are more effective at motivating users. However, if you try to raise the indicators too quickly, the burden on the user becomes too great, which in turn lowers their motivation. Therefore, there is a demand for creating appropriate improvement plans that take these trade-offs into account until the goal is achieved.

[0005] The disclosed technology aims to support the creation of appropriate improvement plans for numerical indicators. [Means for solving the problem]

[0006] The disclosed technology includes an input unit that acquires input information including an initial first numerical index and a target second numerical index, and an improvement trajectory construction unit that constructs an improvement trajectory that indicates a trajectory from the first numerical index to the second numerical index in a time series based on the input information, The input information further includes a reward when the goal is achieved, a time discounting function, a function representing an effort required to change the numerical index per unit time, and a parameter for adjusting the trade-off between the reward and the effort, and the improved trajectory construction unit constructs the improved trajectory that minimizes a weighted sum of a negative present value of the time-discounted reward and a total distance. It is an information processing device. Effect of the Invention

[0007] Assist in creating appropriate improvement plans for quantitative indicators. [Brief description of the drawings]

[0008] [Figure 1] FIG. 2 is a functional configuration diagram of an information processing device. [Diagram 2] FIG. 11 is a diagram illustrating an example of input information. [Diagram 3] 13 is a flowchart showing an example of the flow of an improved trajectory output process. [Figure 4] FIG. 13 is a diagram showing an example of an algorithm for constructing an improved trajectory. [Diagram 5] FIG. 13 is a diagram showing an example of an improved trajectory. [Figure 6] FIG. 2 illustrates an example of a hardware configuration of a computer. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0009] Hereinafter, an embodiment of the present invention (the present embodiment) will be described with reference to the drawings. The embodiment described below is merely an example, and the embodiment to which the present invention is applied is not limited to the following embodiment.

[0010] (Outline of this embodiment) The information processing device of this embodiment is a device that outputs an improvement trajectory of a numerical index based on input information including an initial numerical index (first numerical target) and a target numerical index (second numerical target) in a situation where the goal is to improve a numerical index, such as weight loss through dieting or a rating system in a chess or programming contest.

[0011] The improvement trajectory is information that indicates a chronological path from an initial numerical indicator to a target numerical indicator.

[0012] Next, the formulation of the problem to be dealt with in this embodiment will be described. The input to the information processing device 10 is as follows. Note that it is assumed that the numerical index and time have been appropriately discretized.

[0013] (1) Initial numerical index y c .

[0014] (2) Target numerical indicator y g For example, dieting is g <y c , for example, y g >y c It is assumed that y g >y c The explanation will be given under g <y c The same processing is possible even in this case.

[0015] (3) Reward R upon achievement of the goal.

[0016] (4) Time discount function f(t) expresses the discount rate of the reward t unit time ahead. The reward R t time ahead makes the user feel the value of R·f(t). Usually, f(t) is assumed to be a monotonically decreasing function, and the same assumption is made in this embodiment.

[0017] (5) Function g(y1,y2) represents the effort (distance) required to change an index from y1 to y2 per unit time. Assume that g(y1,y2)>0 for any y1,y2.

[0018] (6) Parameter λ, which adjusts the trade-off between reward and effort. When λ is large, the emphasis is on increasing reward, and when λ is small, the emphasis is on reducing effort.

[0019] These values ​​are to be determined in advance by the user.

[0020] The output of the information processing device 10 is an improved trajectory that minimizes the weighted sum of the negative present value of the time-discounted reward and the total distance. c ),y1,···,y T (=y g ) which minimizes the following equation (1):

[0021]

number

[0022] (Functional configuration of information processing device) 1 is a functional block diagram of an information processing device 10. The information processing device 10 includes an operation unit 11, an input unit 12, an input information storage unit 13, a shortest path calculation unit 14, an improved trajectory construction unit 15, an improved trajectory storage unit 16, and an output unit 17.

[0023] The operation unit 11 provides an interface for performing operations from the outside. The operation unit 11 enables operations such as storing and modifying input data by operating the input unit 12, starting calculations by issuing a command to the shortest path calculation unit 14, and outputting estimation results by issuing a command to the output unit 17.

[0024] The input unit 12 stores and modifies data in the input information storage unit 13. Specific inputs include an initial numerical index, a target numerical index, a reward when the goal is achieved, a time discounting function, a function expressing the distance between the numerical indexes, and a parameter for adjusting the trade-off between the reward and the distance.

[0025] The shortest path calculation unit 14 performs shortest path calculation using the Dijkstra algorithm (reference document [1]) to construct an improved trajectory. The details of the calculation will be described later.

[0026] The improved trajectory construction unit 15 constructs an improved trajectory based on the calculated shortest path. g ,0),(y1,1),···,(y T =y c ,T) to ,y T ,y T-1 , y0. The improved trajectory constructed is the one that minimizes equation (1).

[0027] The improved trajectory storage unit 16 stores the constructed improved trajectories.

[0028] The output unit 17 reads and outputs the improved trajectory stored in the improved trajectory storage unit 16. The output unit 17 may display a screen showing the improved trajectory on a display or the like, or may transmit information showing the improved trajectory to another device.

[0029] (Information handled by information processing device) 2 is a diagram showing an example of input information. The input information 901 includes, as items, an initial numerical index y c and the target numerical indicator y g It includes a reward R when the goal is achieved, a time discount function f(t) that represents the discount rate of the reward t unit times ahead, a function g(y1, y2) that represents the effort (distance) required to change the index from y1 to y2 in unit time, and a parameter λ that adjusts the trade-off between reward and effort.

[0030] (Operation of information processing device) Next, the operation of the information processing device 10 will be described with reference to the drawings. In the information processing device 10, the operation unit 11 receives an operation from a user, and starts an improved trajectory output process.

[0031] 3 is a flowchart showing an example of the flow of the improved trajectory output process. The input unit 12 acquires input information 901 (step S11). The acquired input information 901 is stored in the input information storage unit 13.

[0032] Next, the shortest path calculation unit 14 applies the Dijkstra algorithm to the input information to calculate the shortest path (step S12).

[0033] Next, the improved trajectory constructing unit 15 constructs an improved trajectory based on the calculated shortest path (step S13). The constructed improved trajectory is stored in the improved trajectory storage unit 16.

[0034] The output unit 17 outputs the constructed improved trajectory (step S14).

[0035] (Details of the shortest route calculation) Next, the process of the shortest path calculation unit 14 in step S12 of the improved trajectory output process will be described in detail.

[0036] Figure 4 shows an example of an algorithm for constructing an improved trajectory. Consider a graph in which each vertex is represented in the form of (index value, time). From point (y, t), each y′∈{y c ,y c +1,...,y g}, an edge with cost g(y,y')+λ·R·(f(t)-f(t-1)) is drawn toward point (y',t+1). On this graph, the shortest path calculation unit 14 calculates the starting point from (y g ,0), and the search is completed for the first time (y gThe search ends when a vertex of the form (y , T) (T is any non-negative integer) is reached. The shortest path calculation unit 14 uses the information prev returned by this algorithm to find g ,T) to calculate the shortest path.

[0037] Because f is monotonically decreasing and g can only take positive values, the cost of each edge is always positive. This means that the above algorithm can be applied to g ,0) to (y g ,T), and that the above algorithm always terminates.

[0038] (Example of constructed improvement trajectory) 5 is a diagram showing an example of an improved trajectory. A screen 902 is an example of a screen displayed on the display by the output unit 17. One improved trajectory is constructed for one piece of input information. The screen 902 includes a first improved trajectory 903 and a second improved trajectory 904, and thus displays two improved trajectories constructed respectively for two pieces of input information.

[0039] For example, the first improved trajectory 903 and the second improved trajectory 904 are each a first index y c and the second index y g These are constructed using the target index as input. Since the reward R, time discount function f(t), function g(y1, y2), and parameter λ are different, different improvement trajectories are constructed.

[0040] (Example of computer hardware configuration) Each of the functional units of the information processing device 10 described above can be realized by causing a computer to execute a program describing the processing contents described in this embodiment. Note that this "computer" may be a physical machine or a virtual machine on the cloud. When a virtual machine is used, the "hardware" described here is virtual hardware.

[0041] The above program can be recorded on a computer-readable recording medium (such as a portable memory) and can be stored or distributed. The above program can also be provided via a network such as the Internet or e-mail.

[0042] Fig. 6 is a diagram showing an example of the hardware configuration of the computer. The computer in Fig. 6 has a drive device 1000, an auxiliary storage device 1002, a memory device 1003, a CPU 1004, an interface device 1005, a display device 1006, an input device 1007, an output device 1008, etc., which are all connected to each other via a bus B.

[0043] The program for realizing the processing on the computer is provided by a recording medium 1001 such as a CD-ROM or a memory card. When the recording medium 1001 storing the program is set in the drive device 1000, the program is installed from the recording medium 1001 to the auxiliary storage device 1002 via the drive device 1000. However, the program does not necessarily have to be installed from the recording medium 1001, but may be downloaded from another computer via a network. The auxiliary storage device 1002 stores the installed program as well as necessary files, data, etc.

[0044] When a program start instruction is received, the memory device 1003 reads out and stores the program from the auxiliary storage device 1002. The CPU 1004 realizes the functions related to the device according to the program stored in the memory device 1003. The interface device 1005 is used as an interface for connecting to a network. The display device 1006 displays a GUI (Graphical User Interface) or the like according to a program. The input device 1007 is composed of a keyboard, a mouse, a button, a touch panel, or the like, and is used to input various operation instructions. The output device 1008 outputs the calculation result. Note that the above computer may be equipped with a GPU (Graphics Processing Unit) or a TPU (Tensor processing unit) instead of the CPU 1004, or may be equipped with a GPU or a TPU in addition to the CPU 1004. In that case, the processes may be shared and executed, for example, the GPU or the TPU executes processes that require special calculations, and the CPU 1004 executes other processes.

[0045] (Effects of this embodiment) According to the information processing device 10 of the present embodiment, the shortest path is calculated by Dijkstra's algorithm based on the input information, and an improved trajectory that minimizes the weighted sum of the time-discounted initial value of the negative reward and the total distance is constructed based on the calculated shortest path. This makes it possible to support the creation of an appropriate improvement plan for the numerical index with the trade-off between the reward and the distance adjusted.

[0046] For example, the improvement plan by the user can be supported by the user by recognizing the improvement trajectory output by the output unit 17. In addition, by outputting the improvement trajectory to a goal management system or the like, the goal managed by the goal management system or the like can be detailed, and the goal including the progress can be managed.

[0047] (References) [1]RK Ahuja, TL Magnanti, JB Orlin, Network Flows: Theory, Algorithms, Applications, Prentice Hall, 1993.

[0048] (Summary of the embodiment) This specification describes at least the information processing device, improved trajectory construction method, and program described in the following sections. (Section 1) an input unit that acquires input information including an initial first numerical indicator and a target second numerical indicator; and an improved trajectory constructing unit that constructs an improved trajectory that indicates a trajectory from the first numerical index to the second numerical index in a time series based on the input information. Information processing device. (Section 2) The input information further includes a reward when the goal is achieved, a time discounting function, a function representing the effort required to change the numerical index per unit time, and a parameter for adjusting the trade-off between the reward and the effort; The improved trajectory construction unit constructs the improved trajectory that minimizes a weighted sum of a negative present value of a time-discounted reward and a total distance. 2. The information processing device according to claim 1. (Section 3) A shortest path calculation unit that calculates a shortest path by a Dijkstra algorithm based on the input information, The improved trajectory construction unit constructs the improved trajectory based on the calculated shortest path. 3. The information processing device according to claim 1 or 2. (Section 4) 1. A computer implemented method for constructing an improved trajectory, comprising: obtaining input information including an initial first numerical indicator and a target second numerical indicator; and constructing an improvement trajectory that indicates a chronological path from the first numerical index to the second numerical index based on the input information. Improved trajectory construction method. (Section 5) A program for causing a computer to function as each unit in the information processing device according to any one of claims 1 to 3.

[0049] Although the present embodiment has been described above, the present invention is not limited to such a specific embodiment, and various modifications and variations are possible within the scope of the gist of the present invention described in the claims. [Explanation of symbols]

[0050] 10. Information processing device 11 Control section 12 Input section 13 Input information storage unit 14 Shortest path calculation part 15 Improved Trajectory Construction Department 16 Improved trajectory storage section 17 Output section 1000 Drive Device 1001 Recording media 1002 Auxiliary storage 1003 Memory device 1004 CPU 1005 Interface device 1006 Display device 1007 Input Device 1008 Output device

Claims

1. an input unit that acquires input information including an initial first numerical indicator and a target second numerical indicator; an improved trajectory constructing unit that constructs an improved trajectory that indicates a trajectory from the first numerical index to the second numerical index in a time series based on the input information, The input information further includes a reward when the goal is achieved, a time discounting function, a function representing the effort required to change the numerical index per unit time, and a parameter for adjusting the trade-off between the reward and the effort; The improved trajectory construction unit constructs the improved trajectory that minimizes a weighted sum of a negative present value of a time-discounted reward and a total distance. Information processing device.

2. A shortest path calculation unit that calculates a shortest path by a Dijkstra algorithm based on the input information, The improved trajectory construction unit constructs the improved trajectory based on the calculated shortest path. The information processing device according to claim 1 .

3. 1. A computer implemented method for constructing an improved trajectory, comprising: obtaining input information including an initial first numerical indicator and a target second numerical indicator; and an improved trajectory construction step of constructing an improved trajectory that indicates a trajectory from the first numerical index to the second numerical index in a time series based on the input information, The input information further includes a reward when the goal is achieved, a time discounting function, a function representing the effort required to change the numerical index per unit time, and a parameter for adjusting the trade-off between the reward and the effort; In the step of constructing the improved trajectory, the improved trajectory is constructed to minimize a weighted sum of a negative present value of a time-discounted reward and a total distance. Improved trajectory construction method.

4. A program for causing a computer to function as each unit in the information processing device according to claim 1 or 2.

Citation Information

Patent Citations

  • Apparatus and method for evaluation of achievement of target

    JP2001000420A

  • Information processing method and information processing device

    JP2006172318A

  • Building energy management apparatus

    JP2008236904A

  • Side-trip search device, method and program

    JP2012242183A

  • Transit route determination system for public transport trip planning

    JP2013511095A