By Topic

A constraint satisfaction algorithm for fleet weapon compatibility

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

3 Author(s)
Jiangbo Sui ; Academy of Electronic Engineering, Naval University of Engineering, Wuhan 430033, China ; Changfeng Xing ; Ling Wu

The coordination of fleet weapon compatibility is a typical constraint satisfaction problem based on multi-agent system. The conception of the most non-cooperation plan in fleet weapon resources allocation is given. A search algorithm for fleet weapon compatibility constraint satisfaction problem is proposed. By using back tracking and consistency examination in the operation scheme, the most non-cooperation plan is found and eliminated gradually, and the number of conflict plans in fleet weapon resource allocation decreases. Finally, the fleet operation scheme which has no conflicts is obtained. A practical example is provided to show the effectiveness of this algorithm.

Published in:

Proceedings of the 29th Chinese Control Conference

Date of Conference:

29-31 July 2010