In this thesis we intend to propose and implement a planning based enhancement of the agent orien... more In this thesis we intend to propose and implement a planning based enhancement of the agent oriented programming language CLAIM, in which an agent is an intelligent and mobile entity. This new language which is called P-CLAIM, should have the following characteristics. Firstly, temporal planning capability for the agents. Secondly, the agents should be able to work in a stable manner in the changing environment. Thirdly, a balance should exist between reactivity and proactivity. Fourthly, the agents' actions should not conflict with the actions of other agents in the same environment and the agents should avail the cooperative oppurtunities offered by other agents and they themselves should be able to help other agents where possible.
In the collaborative multi-agent systems where agents' goals are prioritized, an agent often need... more In the collaborative multi-agent systems where agents' goals are prioritized, an agent often needs to be more flexible in the pursuit of its own goals, for the sake of the higher priority goals of the others. In such situations, finding an optimal plan under the constraints imposed by the other agents' plans, is really an important area which needs more investigation. This work aims to fill this gap by studying two different situations in a similar context. In the first situation, which we call Coordinated Planning, an agent has to compute a temporal plan for the achievement of its own goals, but without violating the constraints of another agent's plan, and utilizing where possible the cooperative opportunities offered by the latter. For this purpose, we propose Coordinated-Sapa an extension to the well known planner Sapa, which aims to deal with negative and positive interactions. In the second situation, which we call Proactive-Reactive Coordination, an agent has to modify its plan in order to remove any conflicts with the plan of another agent, having high priority goals. We propose a plan merging algorithm supported by a sound plan repair technique to solve this problem.
In this paper, we present an approach to coordinate two temporal plans, where one plan is for the... more In this paper, we present an approach to coordinate two temporal plans, where one plan is for the achievement of a reactive goal, and thus has more priority, while the other is for the achievement of a proactive goal. As both plans have been computed independently from each other, conflicts can arise during their execution.
Planning is a fundamental issue in multi-agent systems. In this work we focus on the coordination... more Planning is a fundamental issue in multi-agent systems. In this work we focus on the coordination of multiple agents in two different settings. In the first, agents are able to attain individual goals that are necessary for the achievement of a global common goal. As the agents share the same environment, they need to find a coordinated course of action that avoids harmful (or negative) interactions, and benefit from positive interactions, whenever this is possible. In the second setting some of the agents may need the assistance of other agents to achieve their individual goals. This is the case where some of the actions of the plan of an agent may be executed by another agent who will play the role of the assistant. We formalize these two problems in a more general way than in previous works, and present a coordination algorithm which generates optimal solutions in the case of two agents. In this algorithm, agents use l-SATPLAN as the underlying planner for generating individual and joint consistent plans. This planner is an extension of the classical SATPLAN planner, that tackles negative and positive interactions and, therefore, multi-agent planning. We also present an algorithm that solves the assistance problem. The underlying algorithm is again l-SATPLAN, and is used for the generation of individual (based on assistance) and joint consistent plans. Finally experimental results on multi-agent versions of problems taken from International Planning Competitions demonstrate the effectiveness of l-SATPLAN and the coordination algorithm.
Time and uncertainty of the environment are very important aspects in the development of real wor... more Time and uncertainty of the environment are very important aspects in the development of real world applications. Another important issue for the real world agents is, the balance between deliberation and reactivity. But most of the agent oriented programming languages ignore some or all of these important aspects. In this paper we try to fill this gap by presenting an extension to the architecture of CLAIM agent oriented programming language to endow the agents with the planning capability. We remove the assumption that agents' actions are instantaneous. We are interested in the temporal planning of on the fly goals. A coherrent framework is proposed in which agents are able to generate, monitor and repair their temporal plans. Our proposed framework creates a balance between reactivity and deliberation. This work could be considered as a first step towards a complete temporal planning solution for an AOP language.
In the collaborative multi-agent systems where agents' goals are prioritized, an agent often need... more In the collaborative multi-agent systems where agents' goals are prioritized, an agent often needs to be more flexible in the pursuit of its own goals, for the sake of the higher priority goals of the others. In such situations, finding an optimal plan under the constraints imposed by the other agents' plans, is really an important area which needs more investigation. This work aims to fill this gap by studying two different situations in a similar context. In the first situation, which we call Coordinated Planning, an agent has to compute a temporal plan for the achievement of its own goals, but without violating the constraints of another agent's plan, and utilizing where possible the cooperative opportunities offered by the latter. For this purpose, we propose Coordinated-Sapa an extension to the well known planner Sapa, which aims to deal with negative and positive interactions. In the second situation, which we call Proactive-Reactive Coordination, an agent has to modify its plan in order to remove any conflicts with the plan of another agent, having high priority goals. We propose a plan merging algorithm supported by a sound plan repair technique to solve this problem.
In this thesis we intend to propose and implement a planning based enhancement of the agent orien... more In this thesis we intend to propose and implement a planning based enhancement of the agent oriented programming language CLAIM, in which an agent is an intelligent and mobile entity. This new language which is called P-CLAIM, should have the following characteristics. Firstly, temporal planning capability for the agents. Secondly, the agents should be able to work in a stable manner in the changing environment. Thirdly, a balance should exist between reactivity and proactivity. Fourthly, the agents' actions should not conflict with the actions of other agents in the same environment and the agents should avail the cooperative oppurtunities offered by other agents and they themselves should be able to help other agents where possible.
In the collaborative multi-agent systems where agents' goals are prioritized, an agent often need... more In the collaborative multi-agent systems where agents' goals are prioritized, an agent often needs to be more flexible in the pursuit of its own goals, for the sake of the higher priority goals of the others. In such situations, finding an optimal plan under the constraints imposed by the other agents' plans, is really an important area which needs more investigation. This work aims to fill this gap by studying two different situations in a similar context. In the first situation, which we call Coordinated Planning, an agent has to compute a temporal plan for the achievement of its own goals, but without violating the constraints of another agent's plan, and utilizing where possible the cooperative opportunities offered by the latter. For this purpose, we propose Coordinated-Sapa an extension to the well known planner Sapa, which aims to deal with negative and positive interactions. In the second situation, which we call Proactive-Reactive Coordination, an agent has to modify its plan in order to remove any conflicts with the plan of another agent, having high priority goals. We propose a plan merging algorithm supported by a sound plan repair technique to solve this problem.
In this paper, we present an approach to coordinate two temporal plans, where one plan is for the... more In this paper, we present an approach to coordinate two temporal plans, where one plan is for the achievement of a reactive goal, and thus has more priority, while the other is for the achievement of a proactive goal. As both plans have been computed independently from each other, conflicts can arise during their execution.
Planning is a fundamental issue in multi-agent systems. In this work we focus on the coordination... more Planning is a fundamental issue in multi-agent systems. In this work we focus on the coordination of multiple agents in two different settings. In the first, agents are able to attain individual goals that are necessary for the achievement of a global common goal. As the agents share the same environment, they need to find a coordinated course of action that avoids harmful (or negative) interactions, and benefit from positive interactions, whenever this is possible. In the second setting some of the agents may need the assistance of other agents to achieve their individual goals. This is the case where some of the actions of the plan of an agent may be executed by another agent who will play the role of the assistant. We formalize these two problems in a more general way than in previous works, and present a coordination algorithm which generates optimal solutions in the case of two agents. In this algorithm, agents use l-SATPLAN as the underlying planner for generating individual and joint consistent plans. This planner is an extension of the classical SATPLAN planner, that tackles negative and positive interactions and, therefore, multi-agent planning. We also present an algorithm that solves the assistance problem. The underlying algorithm is again l-SATPLAN, and is used for the generation of individual (based on assistance) and joint consistent plans. Finally experimental results on multi-agent versions of problems taken from International Planning Competitions demonstrate the effectiveness of l-SATPLAN and the coordination algorithm.
Time and uncertainty of the environment are very important aspects in the development of real wor... more Time and uncertainty of the environment are very important aspects in the development of real world applications. Another important issue for the real world agents is, the balance between deliberation and reactivity. But most of the agent oriented programming languages ignore some or all of these important aspects. In this paper we try to fill this gap by presenting an extension to the architecture of CLAIM agent oriented programming language to endow the agents with the planning capability. We remove the assumption that agents' actions are instantaneous. We are interested in the temporal planning of on the fly goals. A coherrent framework is proposed in which agents are able to generate, monitor and repair their temporal plans. Our proposed framework creates a balance between reactivity and deliberation. This work could be considered as a first step towards a complete temporal planning solution for an AOP language.
In the collaborative multi-agent systems where agents' goals are prioritized, an agent often need... more In the collaborative multi-agent systems where agents' goals are prioritized, an agent often needs to be more flexible in the pursuit of its own goals, for the sake of the higher priority goals of the others. In such situations, finding an optimal plan under the constraints imposed by the other agents' plans, is really an important area which needs more investigation. This work aims to fill this gap by studying two different situations in a similar context. In the first situation, which we call Coordinated Planning, an agent has to compute a temporal plan for the achievement of its own goals, but without violating the constraints of another agent's plan, and utilizing where possible the cooperative opportunities offered by the latter. For this purpose, we propose Coordinated-Sapa an extension to the well known planner Sapa, which aims to deal with negative and positive interactions. In the second situation, which we call Proactive-Reactive Coordination, an agent has to modify its plan in order to remove any conflicts with the plan of another agent, having high priority goals. We propose a plan merging algorithm supported by a sound plan repair technique to solve this problem.
Uploads
Papers by Adnan Hashmi