By Topic

A New Planning Algorithm Based on Constraints Propagating

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
$31 $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

1 Author(s)
Weijin Jiang ; Sch. of Comput. & Electron. Eng., Hunan Univ. of Commerce, Changsha

This paper presents a distrusted multi-agent planning algorithm based on constraints propagating. In our algorithm, conflicts are detected and resolved through a special type of negotiation among agents, i.e. consistency checking for constraints. The algorithm is sound under deterministic circumstance. In our algorithm, agents only exchange information about actions, casual links and constraints related to conflicts. It is of less communication, higher security than that exchanging the whole plan.

Published in:

Pervasive Computing and Applications, 2008. ICPCA 2008. Third International Conference on  (Volume:2 )

Date of Conference:

6-8 Oct. 2008