Multi-Objective Constraint Satisfaction for Mobile Robot Area Defense

<p>In developing multi-robot cooperative systems there are often competing objectives that need to be met. For example in automating area defense systems multiple robots must work together to explore the entire area and maintain consistent communications to alert the other agents and ensure trust in the system. This research presents an algorithm that tasks robots to meet the two specific goals of exploration and communication maintenance in an uncoordinated environment reducing the need for a user to pre-balance the objectives. This multi-objective problem is defined as a constraint satisfaction problem solved using the Non-dominated Sorting Genetic Algorithm II (NSGA-II). Applying the algorithm to the area defense problem results show exploration and communication without coordination are two diametrically opposed goals in which one may be favored but only at the expense of the other. This work also presents suggestions for anyone looking to take further steps in developing a physically grounded solution to this area defense problem.</p><p>This work has been selected by scholars as being culturally important and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact and remains as true to the original work as possible. Therefore you will see the original copyright references library stamps (as most of these works have been housed in our most important libraries around the world) and other notations in the work.</p><p>This work is in the public domain in the United States of America and possibly other nations. Within the United States you may freely copy and distribute this work as no entity (individual or corporate) has a copyright on the body of the work.</p><p>As a reproduction of a historical artifact this work may contain missing or blurred pages poor pictures errant marks etc. Scholars believe and we concur that this work is important enough to be preserved reproduced and made generally available to the public. We appreciate your support of the preservation process and thank you for being an important part of keeping this knowledge alive and relevant.</p>