A dynamic search space approach to improving learning on a simulated Flapping Wing Micro Air Vehicle

2017 
Those employing Evolutionary Algorithms (EA) are constantly challenged to engineer candidate solution representations that balance expressive power (I.E. can a wide variety of potentially useful solutions be represented?) and meta-heuristic search support (I.E. does the representation support fast acquisition and subsequent fine-tuning of adequate solution candidates). In previous work with a simulated insect-like Flapping-Wing Micro Air Vehicle (FW-MAV), an evolutionary algorithm was employed to blend descriptions of wing flapping patterns to restore correct flight behavior after physical damage to one or both of the wings. Some preliminary work had been done to reduce the overall size of the search space as a means of improving time required to acquire a solution. This of course would likely sacrifice breadth of solutions types and potential expressive power of the representation. In this work, we focus on methods to improve performance by augmenting EA search to dynamically restrict and open access to the whole space to improve solution acquisition time without sacrificing expressive power of the representation. This paper will describe some potential restriction/access control methods and provide preliminary experimental results on the efficacy of these methods in the context of adapting FW-MAV wing gaits.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    7
    References
    0
    Citations
    NaN
    KQI
    []