Patent US5504837A successfully refreshed from Google Patents.
US5504837A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for resolving conflicts among distributed entities through the generation of counter proposals by transversing a goal hierarchy with acceptable, unacceptable, and indeterminate nodes
Assignee: PTT Research
•
Filing: 1993-05-10
•
Granted: 1996-04-02
•
Expires: 2013-05-10
Abstract
Abstract Communication among entities such as customer premises equipment (20, 22, 28) in a telecommunications network (10) is set up through the use of agents representing each entity (20, 22, 28). Agents representing corresponding entities in the telecommunications network (10) negotiate over the type of communication sessions in which the corresponding entities want to be involved. The negotiation process involves the exchange of proposals by agents. A proposal comprises one or more planned actions which can be taken in the network (10). One agent generates a proposal acceptable to it and transmits the proposal to another agent. The receiving agent determines if the received proposal is acceptable to it and if not generates a counterproposal. The process continues until a proposal acceptable to both agents is found or it is determined that there is no proposal for realizing the particular type of communication session which is acceptable to both agents. An agent determines whether a proposal is acceptable to it through use of a goal hierarchy. The goal hierarchy indicates whether or not specific actions for accomplishing a goal are acceptable. The use of the goal hierarchy permits an agent to infer another agent's goals, and to find alternate actions that achieve this goal. The negotiation process enables agents to reach agreement without modification of their goals and without requiring the disclosure of restricted information to other agents. The inventive negotiation method is also applicable to other distributed systems.
Inventors
- 👤 Nancy D. Griffeth
- 👤 Hugo Velthuijsen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 19:45
CPC Classifications
H; H04; H04Q; H04Q3/00; H04Q3/0016; H04Q3/0029; H04Q3/0041; G; G06; G06N; G06N5/00; G06N5/04; G06N5/043; H04M; H04M3/00; H04M3/42; H04M3/42136; H04M3/4217; H04L; H04L69/00; H04L69/24; H04Q2213/00; H04Q2213/13501; H04Q2213/13516; H04Q2213/13535; H04Q2213/13567
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
193 words
A method for establishing an activity among two or three entities in a distributed system with each entity represented by an agent comprising the steps of: each agent generating proposals comprising operations that can be taken in said distibuted system acceptable to said each agent for transmission to other agents and determining if proposals received from said other agents are acceptable or unacceptable to said each agent by searching a goal hierarchy comprising nodes made up of operations which are acceptable or unacceptable or are indeterminate. exchanging proposals among agents representing said entities until all of said agents determine that a proposal is acceptable or it is determined that no agreement can be reached, each of said agents after receiving a proposal which is determined to be unacceptable searching said goal hierarchy for a counterproposal by moving up the goal hierarchy to find an indeterminate node and then moving down the goal hierarchy to find a specification which is acceptable and transmitting said specification to said counterproposall to another agent, and when said agents all determine that a particular proposal is acceptable, executing in said distributed system the operations in said particular proposal.
Claim 2
Independent Claim
193 words
A method for establishing an activity among two or three entities in a distributed system with each entity represented by an agent comprising the steps of: each agent generating proposals comprising operations that can be taken in said distibuted system acceptable to said each agent for transmission to other agents and determining if proposals received from said other agents are acceptable or unacceptable to said each agent by searching a goal hierarchy comprising nodes made up of operations which are acceptable or unacceptable or are indeterminate. exchanging proposals among agents representing said entities until all of said agents determine that a proposal is acceptable or it is determined that no agreement can be reached, each of said agents after receiving a proposal which is determined to be unacceptable searching said goal hierarchy for a counterproposal by moving up the goal hierarchy to find an indeterminate node and then moving down the goal hierarchy to find a specification which is acceptable and transmitting said specification to said counterproposall to another agent, and when said agents all determine that a particular proposal is acceptable, executing in said distributed system the operations in said particular proposal.
Claim 3
Dependent Claim
18 words
The method of claim 1 wherein said proposals are exchanged among said agents through use of a negotiator.
Claim 4
Dependent Claim
13 words
The method of claim 1 wherein proposals are exchanged among said agents directly.
Claim 5
Dependent Claim
15 words
The method of claim 1 where all of said agents utilize the same goal hierarchy.
Claim 6
Dependent Claim
12 words
The method of claim 1 wherein said agents utilize different goal hierarchies.
Claim 7
Dependent Claim
21 words
The method of claim 1 wherein said distributed system is a communications network and said activity is a communication among entities.
Claim 8
Independent Claim
204 words
A method for setting up a communication among two or more entities in a communications network comprising the steps of: representing each of said entities by an agent, each agent generating proposals for transmission to other agents and for determining whether or not proposals received from other agents are acceptable, said proposals comprising operations which can be executed in said communications network, generating said proposals for transmission to other agents and determining the acceptability of said proposals received from other agents by accessing stored information indicating the acceptability or unacceptability of particular operations, said stored information being in the form of a goal hierarchy, each of whose nodes comprise operations and wherein for each agent each node is acceptable, unacceptable or indeterminate, and wherein when an agent receives a proposal from another agent corresponding to a node marked unacceptable in the goal hierarchy the agent searches the goal hierarchy for a counterproposal by moving up the goal hierarchy until an indeterminate node is reached and then moving down the goal hierarchy to find an acceptable specification of the indeterminate node, and executing the operations of a particular proposal in said network when said agents of said entities agree that said particular proposal is acceptable.
Claim 9
Independent Claim
204 words
A method for setting up a communication among two or more entities in a communications network comprising the steps of: representing each of said entities by an agent, each agent generating proposals for transmission to other agents and for determining whether or not proposals received from other agents are acceptable, said proposals comprising operations which can be executed in said communications network, generating said proposals for transmission to other agents and determining the acceptability of said proposals received from other agents by accessing stored information indicating the acceptability or unacceptability of particular operations, said stored information being in the form of a goal hierarchy, each of whose nodes comprise operations and wherein for each agent each node is acceptable, unacceptable or indeterminate, and wherein when an agent receives a proposal from another agent corresponding to a node marked unacceptable in the goal hierarchy the agent searches the goal hierarchy for a counterproposal by moving up the goal hierarchy until an indeterminate node is reached and then moving down the goal hierarchy to find an acceptable specification of the indeterminate node, and executing the operations of a particular proposal in said network when said agents of said entities agree that said particular proposal is acceptable.
Claim 10
Dependent Claim
38 words
The method of claim 7 wherein said information permits an agent receiving a proposal from another agent to infer a goal of said other agent and to generate a counterproposal which implements said goal of said other agent.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-04-02 | 1999-10-02 | 2000-04-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-04-02 | 2003-10-02 | 2004-04-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-04-02 | 2007-10-02 | 2008-04-02 | $7700.00 | Window Closed / Lapsed |