Individual autonomous computational processes (“agents”) representing application-specific data items (e.g., representations of real-world entities or events, any-media documents, models, etc.) are provided with an application-independent method and data structures to combine arbitrary objectives and constraints into a goal-oriented sequence of movement steps in a global topology based on virtual or physical sensor information. The invention specifies a cyclical two-step agent movement process where the first step determines the proposed movement step relative to the agent's current position and the second step attempts to attain the new position implied by the movement step. The first step in the process first combines movement proposals from each of the objectives defined by the application and then enforces any of the application-defined constraints. The invention includes a number of prescriptions on how standard agent movement objectives are to be realized in this agent process.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A method of combining objectives and constraints specific to a particular application into a sequence of location changes of autonomous software agents in a distributed and decentralized computational or physical environment, the agents being operative to perform independent processes including a Movement process, the method comprising the steps of: receiving available situational data associated with the application; proposing an agent location change derived from an arbitrary number of objectives and constraints based on the available situational data; attempting, for a limited time defined by the application, to attain a new location implied by the proposed location change; and continuously and repeatedly executing the processes by the agents to create agent movement trajectories to meet the objectives of the application. 2. The method of claim 1, wherein the available situational data includes one or more of the following: sensor information, the presence or absence of object representations of certain characteristics in the agent's environment, and knowledge of the movement capabilities of a real-world entity controlled by the agent. 3. The method of claim 1, wherein the proposed location change is computed in a decision process, comprising the steps of: producing, independently for each application-specific objective, a movement objective step contribution that implies where the given objective would move the agent; combining all movement objective step contributions into a preliminary movement step proposal; and applying all application-specific constraints in an application-defined sequence to the preliminary movement step, thereby arriving at a final movement step proposal for attainment by the agent. 4. The method of claim 1, wherein the distributed and decentralized computational or physical environment includes a metric space. 5. The method of claim 3, wherein the movement objective step contributions, preliminary, and final movement step proposals are vectors with a heading and magnitude in an embedding metric space. 6. The method of claim 5, where the combination of movement objective step contributions is a vector addition operation, and where the application-specific constraints change the magnitude but not the heading of the proposed movement step. 7. The method of claim 5, including an objective to include random noise in the movement decision process by producing a new vector of unit length and uniformly random direction in each movement step. 8. The method of claim 5, including an objective to include Levy Dispersion in the movement decision process by producing a new vector of unit length and uniformly random direction in each Levi walk phase that spans T/r movement steps, where T is a non-zero parameter of the Levy Walk model, and r is a randomly generated number in the (0,1] interval. 9. The method of claim 5, including an objective to include responses to a given set of arbitrary objects and their locations in the metric space in the movement decision process by combining individual response vectors from the agent to each object location modulated by the agent's relation to the object, where the combination function is the sum of all response vectors divided by the number of the response vectors. 10. The method of claim 9, wherein the objects are scalar field-strength values associated with specific locations in the agents' vicinity and the combination of response vectors to these field values results in a ascent or descent of the agent on the gradient of that field. 11. The method of claim 3, wherein a constraint on the movement of the agent is an application-specific minimum or maximum speed that is enforced on the length of the preliminary movement step proposal vector. 12. The method of claim 3, wherein a constraint on the movement of the agent is the avoidance of application-specific exclusion zones that is enforced by reducing the length of the preliminary movement step proposal vector such that the proposed step does not take the agent into or over an exclusion zone. 13. The method of claim 1, wherein the distributed and decentralized computational or physical environment includes a graph with its nodes being available agent locations and its edges enumerate the available movement choices of each agent. 14. The method of claim 13, wherein the movement objective step contributions, preliminary, and final movement step proposals are probability distributions over the set of outgoing edges from the node of the current agent location in the graph topology, and wherein the probability associated with a single such edge corresponds to the likelihood that the agent will choose to traverse that edge to the node on its opposite end. 15. The method of claim 13, wherein the combination of movement objective step contributions is an operation combining multiple probability distributions into one, and wherein the application-specific constraints change individual probabilities in the proposed movement step. 16. The method of claim 13, wherein an objective to include random noise in the movement decision process is realized by producing a uniform probability distribution over the outgoing edges in each movement step. 17. The method of claim 13, including an objective to include responses to a given set of arbitrary objects located at the nodes opposite of the outgoing edges of the agent's current node in the movement decision process by combining individual response values derived from the agent's relation to each object, and wherein the combination function is the sum of all response values for each unique outgoing edge divided by the total sum of response values to form a probability distribution over outgoing edges. 18. The method of claim 17, wherein the objects are scalar field-strength values associated with nodes opposite of the outgoing edges of the agent's current node and the combination of agent response values to these field values results in a ascent or descent of the agent on the gradient of that field across the graph topology. 19. The method of claim 13, wherein a constraint on the movement of the agent is the avoidance of application-specific exclusion zones that is enforced by setting to zero the probability associated with any outgoing edge from the agent's current node to an excluded node, thereby preventing the agent from stepping onto an excluded node.