Fast planning through planning graph analysis
Artificial Intelligence
Distributed problem solving and planning
Multiagent systems
Introduction: Service-oriented computing
Communications of the ACM - Service-oriented computing
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
Agent-based Dis-graph Planning Algorithm for Web Service Composition
CIMCA '06 Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce
Graph-based multiagent replanning algorithm
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
| Hi-index | 0.00 |
In situations where it needs the actions of different agents to accomplish a task, the planning for the task involves selecting and organizing the actions belonging to multiple agents. Most existing multi-agent planning approaches to solving such a planning problem rely on the global knowledge of the capabilities of the agents, and are confronted with difficulties when the availability of the global knowledge is impossible or undesirable. Previously, we have proposed a distributed multi-agent planning algorithm Dis-graph planning to address the difficulties, which enables multiple agents to cooperate in generating a plan without relying on the global knowledge. In the work of this paper, we performed a theoretical study of Dis-graph planning approach, discussing its critical features such as completeness, soundness and terminability.