By Topic

Merging of Temporal Plans Supported by Plan Repairing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Muhammad Adnan Hashmi ; Lab. d'Inf. de Paris 6, Paris, France ; Amal El Fallah Seghrouchni

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. We present a plan merging algorithm to coordinate the actions of both plans. Unlike many other plan merging approaches, which use only the actions present in both plans to coordinate them, our approach is supported by a sound plan repairing approach, to deal with the situations where both plans can not be merged as they are i.e. when one plan uses the same resource needed by the other plan and then does not release the resource. The plan repairing algorithm uses an extension of the well known planner Sapa, to repair a plan in the presence of another plan, and thus taking into account the constraints imposed by the latter. Our approach is generic and can be used in different situations of coordination between multiple agents and within a single agent.

Published in:

2010 22nd IEEE International Conference on Tools with Artificial Intelligence  (Volume:2 )

Date of Conference:

27-29 Oct. 2010