We describe a new hyper-heuristic method NELLI-GP for solving job-shop scheduling problems (JSSP) that evolves an ensemble of heuristics. The ensemble adopts a divide-and-conquer approach in which each heuristic solves a unique subset of the instance set considered. NELLI-GP extends an existing ensemble method called NELLI by introducing a novel heuristic generator that evolves heuristics composed of linear sequences of dispatching rules: each rule is represented using a tree structure and is itself evolved. Following a training period, the ensemble is shown to outperform both existing dispatching rules and a standard genetic programming algorithm on a large set of new test instances. In addition, it obtains superior results on a set of 210 benchmark problems from the literature when compared to two state-of-the-art hyper-heuristic approaches. Further analysis of the relationship between heuristics in the evolved ensemble and the instances each solves provides new insights into features that might describe similar instances.

We propose a novel technique for algorithm-selection, applicable to optimisation domains in which there is implicit sequential information encapsulated in the data, e.g., in online bin-packing. Specifically we train two types of recurrent neural networks to predict a packing heuristic in online bin-packing, selecting from four well-known heuristics. As input, the RNN methods only use the sequence of item-sizes. This contrasts to typical approaches to algorithm-selection which require a model to be trained using domain-specific instance features that need to be first derived from the input data. The RNN approaches are shown to be capable of achieving within 5% of the oracle performance on between 80.88 and 97.63% of the instances, depending on the dataset. They are also shown to outperform classical machine learning models trained using derived features. Finally, we hypothesise that the proposed methods perform well when the instances exhibit some implicit structure that results in discriminatory performance with respect to a set of heuristics. We test this hypothesis by generating fourteen new datasets with increasing levels of structure, and show that there is a critical threshold of structure required before algorithm-selection delivers benefit.

With biodiversity loss escalating globally, a step change is needed in our capacity to accurately monitor species populations across ecosystems. Robotic and autonomous systems (RAS) offer technological solutions that may substantially advance terrestrial biodiversity monitoring, but this potential is yet to be considered systematically. We used a modified Delphi technique to synthesize knowledge from 98 biodiversity experts and 31 RAS experts, who identified the major methodological barriers that currently hinder monitoring, and explored the opportunities and challenges that RAS offer in overcoming these barriers. Biodiversity experts identified four barrier categories: site access, species and individual identification, data handling and storage, and power and network availability. Robotics experts highlighted technologies that could overcome these barriers and identified the developments needed to facilitate RAS-based autonomous biodiversity monitoring. Some existing RAS could be optimized relatively easily to survey species but would require development to be suitable for monitoring of more ‘difficult’ taxa and robust enough to work under uncontrolled conditions within ecosystems. Other nascent technologies (for instance, new sensors and biodegradable robots) need accelerated research. Overall, it was felt that RAS could lead to major progress in monitoring of terrestrial biodiversity by supplementing rather than supplanting existing methods. Transdisciplinarity needs to be fostered between biodiversity and RAS experts so that future ideas and technologies can be codeveloped effectively.

A long-term vision of evolutionary robotics is a technology enabling the evolution of entire autonomous robotic ecosystems that live and work for long periods in challenging and dynamic environments without the need for direct human oversight. Evolutionary robotics has been widely used due to its capability of creating unique robot designs in simulation. Recent work has shown that it is possible to autonomously construct evolved designs in the physical domain; however, this brings new challenges: the autonomous manufacture and assembly process introduces new constraints that are not apparent in simulation. To tackle this, we introduce a new method for producing a repertoire of diverse but manufacturable robots. This repertoire is used to seed an evolutionary loop that subsequently evolves robot designs and controllers capable of solving a maze-navigation task. We show that compared to random initialisation, seeding with a diverse and manufacturable population speeds up convergence and on some tasks, increases performance, while maintaining manufacturability.