Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/impacting-shop-putting-an-ai-planner-into-a-multi-agent-environment-c8Ui2Jq04d
References (53)
-
(1998)
Networked Visualization of Heterogeneous US Army War Reserves Readiness Data -
t k ) for some k, and t 1 is non-primitive. Then there must be at least one simple reduction R = (r 1 r 2 . . . r j ) for t 1 such that the minimum solution depth of (O, (r 1 r 2 . . . r j t 2 -
Sibel Adali, K. Candan, Su-shing Chen, K. Erol, V. Subrahmanian (1996)
The Advanced Video Information System: data structures and query processingMultimedia Systems, 4
-
S. Wolfman, Daniel Weld (1999)
The LPSAT System and its Application to Resource Planning -
Theorem 3 (Completeness of A-SHOP -
(1997)
Web hermes user manual -
A. Rao (1996)
Agents Breaking Away: Proceedings of the Seventh European Workshop on Modelling Autonomous Agents in a Multi-Agent World -
V. Subrahmanian, P. Bonatti, J. Dix, Thomas Eiter, Sarit Kraus, Fatma Özcan, Robert Ross (2000)
Heterogenous Active Agents -
Marie desJardins, E. Durfee, C. Ortiz, M. Wolverton (1999)
A Survey of Research in Distributed, Continual PlanningAI Mag., 20
-
Thomas Eiter, V. Subrahmanian, T. Rogers (2000)
Heterogeneous active agents, III: Polynomially implementable agentsArtif. Intell., 117
-
M. Wooldridge, N. Jennings (1995)
Intelligent agents: theory and practiceThe Knowledge Engineering Review, 10
-
F. Bacchus, F. Kabanza (2000)
Using temporal logics to express search control knowledge for planningArtif. Intell., 116
-
B. Srivastava, S. Kambhampati (1999)
Scaling up Planning by Teasing out Resource Scheduling -
K. Currie, A. Tate (1991)
O-Plan: The open Planning ArchitectureArtif. Intell., 52
-
Kirk Lambert (1992)
Noncombatant Evacuation Operations -- Plan Now or Pay Later -
Henry Kautz, J. Walser (1999)
State-space Planning by Integer Optimization -
S. Thomas (1993)
PLACA, an agent oriented programming language -
E. Sacerdoti (1977)
A Structure for Plans and Behavior -
Dana Nau, Hector Muñoz-Avila, Yue Cao, A. Lotem, Steven Mitchell (2001)
Total-Order Planning with Partially Ordered Subtasks -
Dana Nau, Stephen Smith, K. Erol (1998)
Control Strategies in HTN Planning: Theory Versus Practice -
V. Subrahmanian, Thomas Eiter, G. Pick (1998)
Heterogeneous Active Agents -
Fatma Özcan, V. Subrahmanian, J. Dix (2000)
Improving Performance of heavily loaded agentsArXiv, cs.MA/0012004
-
A. Tate (1977)
Generating Project Networks -
J. Dix, V. Subrahmanian, G. Pick (2000)
Meta-agent programsJ. Log. Program., 46
-
Thomas Eiter, V. Subrahmanian, G. Pick (1999)
Heterogeneous Active Agents, I: SemanticsArtif. Intell., 108
-
K. Hindriks, F. Boer, W. Hoek, J. Meyer (1999)
Agent Programming in 3APLAutonomous Agents and Multi-Agent Systems, 2
-
A. Roa (1996)
AgentSpeak(L): BDI agents speak out in a logical computable language -
Randall Davis, Reid Smith (1988)
Negotiation as a Metaphor for Distributed Problem SolvingArtif. Intell., 20
-
Jana Koehler (1998)
Planning under Resource Constraints -
D. Wilkins (1989)
Practical planning - extending the classical AI planning paradigm -
K. Golden, Oren Etzioni, Daniel Weld (1994)
Omnipotence Without Omniscience: Efficient Sensor Management for Planning -
M. Paolucci, O. Shehory, K. Sycara (2000)
Interleaving Planning and Execution in a Multiagent Team Planning EnvironmentElectron. Trans. Artif. Intell., 4
-
Base case (n = 0): In this case, t = nil and P = nil , so A-SHOP returns P at step 1. Induction step: Let n > 1, and suppose that the theorem is true for every m < n -
J. Benton, V. Subrahmanian (1994)
Using hybrid knowledge bases for missile siting problemsProceedings of the Tenth Conference on Artificial Intelligence for Applications
-
Craig Knoblock (1996)
Building a Planner for Information Gathering: A Report from the Trenches -
A. Siegel (1991)
Eastern Exit: The Noncombatant Evacuation Operation (NEO) From Mogadishu, Somalia, in January 1991 -
S. Wolfman, Daniel Weld (1999)
The LPSAT Engine & Its Application to Resource Planning -
(1997)
http://www.cs.umd.edu/ projects/hermes/UserManual/index.html -
J. Dix, Sarit Kraus, V. Subrahmanian (2001)
Temporal agent programsArtif. Intell., 127
-
M. Paolucci, O. Shehory, K. Sycara, D. Kalp, A. Pannu (1999)
A Planning Component for RETSINA Agents -
A. Brink, Sherry Marcus, V. Subrahmanian (1995)
Heterogeneous Multimedia ReasoningComputer, 28
-
J. Dix, M. Nanni, V. Subrahmanian (1999)
Probabilistic agent programsArXiv, cs.AI/9910016
-
J. Dix, Hector Muñoz-Avila, Dana Nau, Lingling Zhang (2002)
Planning in a multi-agent environment: theory and practice -
D) is n−1, for otherwise the minimum solution depth of (O, t, D) could not be n. At step 6, one of the nondeterministic traces of A-SHOP recursively invokes A-SHOP(result(O, p), (t 2 . . . t k ), D) -
Eric Lambrecht, S. Kambhampati (1998)
Efficiently Executing Information Gathering Plans -
S. Thomas (1995)
The PLACA Agent Programming Language -
Dana Nau, Yue Cao, A. Lotem, Hector Muñoz-Avila (1999)
SHOP: Simple Hierarchical Ordered Planner -
Steve Chien, R. Hill, Xuemei Wang, T. Estlin, K. Fayyad, Helen Mortenson (1996)
Why real-world planning is difficult: a tale of two applications -
J. Schafer, T.J. Rogers, J.A. Marin (1998)
Advances in Multimedia Information Systems, 4th International Workshop, MIS'98 -
t i ) for some i. Let (p 1 p 2 . . . p j ) be the plan returned by the recursive call to A-SHOP (R, D) in step 5. From the induction assumption it follows that -
Thomas Eiter, V. Subrahmanian (1999)
Heterogeneous Active Agents, II: Algorithms and ComplexityArtif. Intell., 108
-
Oren Etzioni, S. Hanks, Daniel Weld, Denise Draper, N. Lesh, Mike Williamson (1992)
An Approach to Planning with Incomplete Information -
D) returns a plan P . Then P solves the planning problem
- Publisher
- Springer Journals
- Copyright
- Copyright © 2003 by Kluwer Academic Publishers
- Subject
- Computer Science; Artificial Intelligence (incl. Robotics); Mathematics, general; Computer Science, general; Complex Systems
- ISSN
- 1012-2443
- eISSN
- 1573-7470
- DOI
- 10.1023/A:1021560510377
- Publisher site
- See Article on Publisher Site
Abstract
In this paper we describe a formalism for integrating the SHOP HTN planning system with the IMPACT multi-agent environment. We define the A-SHOP algorithm, an agentized adaptation of the SHOP planning algorithm that takes advantage of IMPACT's capabilities for interacting with external agents, performing mixed symbolic/numeric computations, and making queries to distributed, heterogeneous information sources (such as arbitrary legacy and/or specialized data structures or external databases). We show that A-SHOP is both sound and complete if certain conditions are met.
Journal
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 10, 2004