Exploiting Opportunities Using Planning Graphs

Opportunities arise in planning when changes in the environment make new propositions available to the planner. Replanning methods often focus only on the negative effects that changes in the environment have and therefore do not apply well. This paper introduces a method that is specifically focused on the opportunity problem. This method is...

Plan Merging: Experimental results

In this paper we discuss the results of a plan merging algorithm. This algorithm coordinates the plans of multiple, autonomous agents, each able to independently find a plan. This algorithm is evaluated using realistic data from a taxi company. We show that when we allow passengers to be a few minutes later at their destination and share rides,...

A Resource Based Framework for Planning and Replanning

We discuss a rigorous unifying framework for both planning and replanning, extending an existing logic-based approach to resource-based planning. The primitive concepts in this Action Resource Framework (ARF) are actions and resources. Actions consume and produce resources. Plans are structures composed of actions, resource facts and an explicit...

Plan coordination (extended abstract)

Autonomous agents usually plan their actions. Sometimes agents can benefit from cooperation, and sometimes they cannot even do without resources from another. We can either coordinate the plans of agents after they have constructed their plans (plan merging), or we can plan the coordination of agents. Plan merging can only be used for agents...

Combining Planning and Coordination to Improve Efficiency in Transport

A Method to Integrate Planning and Coordination

A Resource Logic for Multi-Agent Plan Merging

Cooperative heuristic multi-agent planning

In this paper we will use the framework to study cooperative heuristic multi-agent planning. During the construction of their plans, the agents use a heuristic function inspired by the FF planner (l3l). At any time in the process of planning the agents may exchange available resources, or they may request an agent to produce a missing resource....

Improving efficiency by plan fusion in a personal transport domain

ƒ†Œˆœ

Fusion of Plans in a Framework with Constraints

The promise of multi-agent systems is that multiple agents can solve problems more efficiently than single agents can. In this paper we propose a method to implement cooperation between agents in the planning phase, in order to achieve more cost-effective solutions than without cooperation. Two results are presented: First of all, we introduce a...

An algorithm for replanning

Multi-agent Cooperation in a Planning Framework

The promise of multi-agent systems is that multiple agents can solve problems more efficiently than single agents can. In this paper we propose a method to implement cooperation between agents in the planning phase, in order to achive more cost-effective solutions than without cooperation. Two results are presented: First of all, we introduce a...

Cooperative Transport Planning

To test and compare different forms of cooperative planning algorithms developed in the CABS project we use a generic simulator called MARS. Examples in the transportation sector are implemented in this simulator.

A Framework for Multi-Agent Planning

We introduce a computational framework, consisting of resources, skills, goals and services to represent the plans of individual agents and to develop models and algorithms for cooperation processes between a collection of agents.

A Plan Fusion Algorithm for Multi-Agent Systems

We introduce an algorithm for cooperative planning in multi-agent systems. The algorithm enables the agents to combine (fuse) their plans in order to increase their joint profits. A computational resources and skills framework is developed for representing the planned activities of an agent under time constraints. Using this resource-skill...

A Dynamic Systems Framework for Multi-Agent Experiments