Mohlo by se vám také líbit

Více informací o knize Multi-Objective Constraint Satisfaction for Mobile Robot Area Defense

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 38 bodů

Anotace knihy

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.

Parametry knihy

Zařazení knihy Knihy v angličtině Society & social sciences Education

• Plný název: Multi-Objective Constraint Satisfaction for Mobile Robot Area Defense
• Autor: Kenneth W Mayo
• Jazyk: Angličtina
• Vazba: Brožovaná
• Počet stran: 86
• EAN: 9781288397693
• ISBN: 9781288397693
• ID: 08249442
• Nakladatelství: Biblioscholar
• Hmotnost: 168 g
• Rozměry: 246 × 189 × 5 mm
• Datum vydání: 01. December 2012

Oblíbené z jiného soudku

---

---

---