| M. desJardins, E. Durfee, C. Ortiz, and M. Wolverton. A survey of research in distributed, continual planning. AI Magazine, 1(4):13 -- 22, 1999. |
....that have no interdependencies with the failed subgraph. There is no explicit bound on the time needed to do the replacement. In contrast, local subplan replacement can implement anytime planning. The CASPER system [20] uses a continual planning approach to plan repair. In continual planning (see [25] for a survey) planning and plan repair are not distinct from each other. The planner continually updates its plan to reflect changes in the environment that are detected. CASPER is thus an example of an anytime replanning system, as a plan is always available and constantly being repaired ....
....plans for different sorts of goals, and for resolving conflicts between them. Local subplan replacement could, in theory, be one of the algorithms utilized by CASPER for plan updating. Local subplan replacement could similarly be utilized by other continual planning approaches in the literature [25]. Soar (see [53] for an overview) is an architectural framework and programming language for implementing intelligent systems. Action selection in Soar operates as follows ( 45] also found in [53] Soar uses a production system to select actions. Each time an action is to be selected, every ....
Marie E. desJardins, Edmund H. Durfee, Jr. Charles L. Ortiz, and Michael J. Wolverton. A survey of research in distributed, continual planning. AI Magazine, 21(4), Winter 2000.
....the STRIPS formalism, aiming to build centralized decentralized conflict free plans. Clement [7] develops specialized agents which are responsible for HTN individual plans coordination. Several generic approaches have been proposed concerning goal decomposition, task allocation and negotiation [9]. PGP [11] and later GPGP [8] is a specialized mission representation that allows exchanges of plans among the agents. DIPART [19] is a scheme for task (re)allocation based on load balancing. Cooperation has also been treated through negotiation strategies [21] like CNP based protocols[23] or ....
M. DesJardins, E. Durfee, Ortiz C., and M. Wolverton. A survey of research in distributed, continual planning. AI Magazine, pages 13--22, 1999.
....has been driven towards the coordination of the decision making process between multiple agents. However, much work is still needed in developing well founded reasoning and negotiating techniques, in particular in environments in which the agent must constantly be on the lookout for changes (see [dDJW99] for a recent survey) An interesting approach is the RETSINA project [PKP ng,PSS00] In RETSINA each agent can do its own planning, as each agent is equipped with a special planning component in its internal architecture. In contrast to this, we have chosen that one special planning agent, ....
M. E. desJardins, E. H. Durfee, C. L. Ortiz Jr., and M. J. Wolverton. A survey of research in distributed, continual planning. AI Magazine, 20(4), 1999.
....has been driven towards the coordination of the decision making process between multiple agents. However, much work is still needed in developing well founded reasoning and negotiating techniques, in particular in environments in which the agent must constantly be on the lookout for changes (see [desJardins et al. 1999] for a recent survey) 3 HTN Planning with Ordered Task Decompositions: SHOP Below we formalize the idea of ordered task decomposition that forms the basis of SHOP s planning Hierarchical Task Network (HTN) algorithm. HTN planning is a planning paradigm frequently used in applied research ....
desJardins, M. E., Durfee, E. H., Jr., C. L. O., and Wolverton, M. J. (1999). A survey of research in distributed, continual planning. AI Magazine, 20(4).
No context found.
M. desJardins, E. Durfee, C. Ortiz, and M. Wolverton. A survey of research in distributed, continual planning. AI Magazine, 1(4):13 -- 22, 1999.
No context found.
desJardins, M. E., Durfee, E. H., Ortiz, C. L., and Wolverton, M. J. (1999). A survey of research in distributed, continual planning. AI Magazine, 20(4):13-22.
No context found.
M. desJardins, E. Durfee, C. Ortiz, and M. Wolverton. A survey of research in distributed, continual planning. AI Magazine, 1(4):13 -- 22, 1999.
No context found.
M. E. desJardins, E. H. Durfee, C. L. Ortiz, Jr., and M. J. Wolverton. A Survey of Research in Distributed, Continual Planning. AI Magazine, pp. 12-22, Winter 1999.
No context found.
Marie E. desJardins, Edmund H. Durfee, Charles L. Ortiz Jr., and Michael J. Wolverton. A survey of research in distributed, continual planning. AI Magazine, 20(4):13--22, 1999.
No context found.
M. E. DesJardins, E. H. Durfee, C. L. Ortiz, and M. J. Wolverton. A survey of research in distributed, continual planning. AI Magazine, 4:13--22, 2000.
No context found.
M. E. DesJardins, E. H. Durfee, C. L. Ortiz, and M. J. Wolverton. A survey of research in distributed, continual planning. AI Magazine, 4:13--22, 2000.
No context found.
DesJardins, M.; Durfee, E.; Ortiz, C.; and Wolverton, M. 1999. A survey of research in distributed, continual planning. AI Magazine 20(4):13--22.
No context found.
M. E. DesJardins, E. H. Durfee, C. L. Ortiz, and M. J. Wolverton. A survey of research in distributed, continual planning. AI Magazine, 4:1322, 2000.
No context found.
Marie E. desJardins, Edmund H. Durfee, Charles L. Ortiz, and Michael J. Wolverton. A survey of research in distributed, continual planning. AI Magazine, 20(4):13--22, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC