Multi-Objective Constraint Satisfaction for Mobile Robot Area Defense - Brossura

Mayo, Kenneth W.

Brossura

ISBN 10: 1288397690 ISBN 13: 9781288397693

Casa editrice: British Library, Historical Print Editions, 2012

Riassunto

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.

Dettagli dell'edizione

• Editore: British Library, Historical Print Editions
• Data di pubblicazione: 2012
• Lingua: Inglese
• ISBN 10: 1288397690
• ISBN 13: 9781288397693
• Rilegatura: Copertina flessibile
• Numero di pagine: 84
• Contatto del produttore: non disponibile
• Persona responsabile: gpsr@libri.de; gpsr@libri.de; ; Friedensallee 273; Hamburg; 22763; Germania