×

Computer story generation system and method using network of re-usable substories

  • US 5,805,784 A
  • Filed: 12/30/1996
  • Issued: 09/08/1998
  • Est. Priority Date: 09/28/1994
  • Status: Expired due to Term
First Claim
Patent Images

1. A method of generating a sequence of images representing a dynamically generated story line, comprising:

  • establishing a set of characters;

    defining a set of re-usable substories, a multiplicity of the substories representing an action by a subject comprising a selectable one of the characters where the action is performed with respect to at least one object comprising at least a selectable one of the characters;

    for each substory, establishing a set of possible reaction substories comprising a subset of the set of re-usable substories;

    establishing a plan list for storing plans indicating ones of the substories to be performed;

    storing in the plan list an initial set of plans, each of the stored plans representing a substory to be performed;

    executing ones of the substories represented by the plans stored in the plan list;

    establishing a physical position for each of the characters and updating the characters'"'"' physical positions during the executing step;

    establishing a current time and advancing the current time during the executing step;

    generating, in reaction to each executed substory, additional plans to perform additional ones of the substories wherein the additional substories comprise selected ones of the set of possible reaction substories for the executed substory; and

    storing the generated plans in the plan list;

    the plan list at times storing a multiplicity of the generated plans;

    the generating plans step including receiving, in reaction to at least a subset of the executed substories, input from an end user and selecting at least a subset of the additional substories in accordance with the end user input;

    the plan generating step including assigning each generated plan an earliest execution time and a set of associated characters including a subject and an object, wherein the subject and object are each a specified one of the characters;

    each stored plan in the plan list including the assigned earliest execution time, subject and object, such that at various times at least a subset of the plans in the plan list have respective earliest execution times that are later than the current time;

    at least a subset of the generated plans comprising deferred plans, where each deferred plan'"'"'s execution is deferred because its earliest execution time is later than the current time and/or its associated characters are not physically proximate each other;

    the executing step including selecting for execution one plan from those of the stored plans in the plan list whose associated earliest execution time is at least as early as the current time and that meet opportunity availability criteria, the opportunity availability criteria including a requirement that the characters associated with the one plan have physical positions that are proximate to one another;

    wherein the generated plans are executed in a different order than those generated plans are added to the plan list by the generated plans storing step.

View all claims
  • 0 Assignments
Timeline View
Assignment View
    ×
    ×