Abstract: A method for automatically planning is provided, comprising the steps of receiving a plurality of tasks that a user needs to perform, each task having an earliest start time, a latest stop time, a duration for completing the event and a reward value for completing the event, the tasks including a fixed task having the duration being equal to the time period between the earliest start time and the latest stop time and a floating task having a duration that is less than the time period between the earliest start time and the latest stop time, arranging said fixed task into a plan for the user based on the earliest start time, duration and reward of the fixed task, determining an actual start time for the floating task within the time period between the earliest start time and the latest stop time based on the earliest start time and duration of the fixed task, and arranging said floating task into the plan for the user based on the selected actual start time and the reward of the floating task.

Abstract: A system and method for automatic planning and cueing includes a computer system having an input module, a storage module, a planning module and an output module. The planning module automatically detects and corrects scheduling or planning errors that may occur whenever the calendar data is modified. The system may implement a script which is a sequence of tasks that may include conditional and iterative task sequences. A script may also include choice statements that permit different resources or tasks to be automatically selected. The planning module uses the choices to generate plan variations in order to correct planning errors. Tasks may also include precondition and prerequisite task constraints that must be achieved before during or after the task is executed. The planning system automatically checks that all precondition and prerequisite task constraints are satisfied, and if they are not, then the system may correct the problem by adding, removing, replacing, or reordering the tasks in the calendar.

Abstract: A method for intelligently planning is provided, comprising the steps of receiving a plurality of tasks that a user needs to perform, each task having an earliest start time, a latest stop time, a duration for completing the event and a reward value for completing the event, the tasks including a fixed task having the duration being equal to the time period between the earliest start time and the latest stop time and a floating task having a duration that is less than the time period between the earliest start time and the latest stop time, arranging said fixed task into a plan for the user based on the earliest start time, duration and reward of the fixed task, determining an actual start time for the floating task within the time period between the earliest start time and the latest stop time based on the earliest start time and duration of the fixed task, and arranging said floating task into the plan for the user based on the selected actual start time and the reward of the floating task.