Outputs (226)

Synthesising Diverse and Discriminatory Sets of Instances using Novelty Search in Combinatorial Domains (2024)
Journal Article
Marrero, A., Segredo, E., Leon, C., & Hart, E. (online). Synthesising Diverse and Discriminatory Sets of Instances using Novelty Search in Combinatorial Domains. Evolutionary Computation, https://doi.org/10.1162/evco_a_00350

Gathering sufficient instance data to either train algorithm-selection models or understand algorithm footprints within an instance space can be challenging. We propose an approach to generating synthetic instances that are tailored to perform well w... Read More about Synthesising Diverse and Discriminatory Sets of Instances using Novelty Search in Combinatorial Domains.

How Much do Robots Understand Rudeness? Challenges in Human-Robot Interaction (2024)
Presentation / Conference Contribution
Orme, M., Yu, Y., & Tan, Z. (2024, May). How Much do Robots Understand Rudeness? Challenges in Human-Robot Interaction. Presented at The 2024 Joint International Conference on Computational Linguistics, Language Resources and Evaluation (LREC-COLING 2024), Torino, Italy

This paper concerns the pressing need to understand and manage inappropriate language within the evolving human-robot interaction (HRI) landscape. As intelligent systems and robots transition from controlled laboratory settings to everyday households... Read More about How Much do Robots Understand Rudeness? Challenges in Human-Robot Interaction.

Can Federated Models Be Rectified Through Learning Negative Gradients? (2024)
Presentation / Conference Contribution
Tahir, A., Tan, Z., & Babaagba, K. O. Can Federated Models Be Rectified Through Learning Negative Gradients?. Presented at 13th EAI International Conference, BDTA 2023, Edinburgh

Federated Learning (FL) is a method to train machine learning (ML) models in a decentralised manner, while preserving the privacy of data from multiple clients. However, FL is vulnerable to malicious attacks, such as poisoning attacks, and is challen... Read More about Can Federated Models Be Rectified Through Learning Negative Gradients?.

Evolving Behavior Allocations in Robot Swarms (2024)
Presentation / Conference Contribution
Hallauer, S., Nitschke, G., & Hart, E. (2023, December). Evolving Behavior Allocations in Robot Swarms. Presented at IEEE Symposium Series on Computational Intelligence (SSCI 2023), Mexico City, Mexico

Behavioral diversity is known to benefit problem-solving in biological social systems such as insect colonies and human societies, as well as in artificial distributed systems including large-scale software and swarm-robotics systems. We investigate... Read More about Evolving Behavior Allocations in Robot Swarms.

Evaluation of Frameworks That Combine Evolution and Learning to Design Robots in Complex Morphological Spaces (2023)
Journal Article
Li, W., Buchanan, E., Goff, L. K. L., Hart, E., Hale, M. F., Wei, B., Carlo, M. D., Angus, M., Woolley, R., Gan, Z., Winfield, A. F., Timmis, J., Eiben, A. E., & Tyrrell, A. M. (online). Evaluation of Frameworks That Combine Evolution and Learning to Design Robots in Complex Morphological Spaces. IEEE Transactions on Evolutionary Computation, https://doi.org/10.1109/tevc.2023.3316363

Jointly optimising both the body and brain of a robot is known to be a challenging task, especially when attempting to evolve designs in simulation that will subsequently be built in the real world. To address this, it is increasingly common to combi... Read More about Evaluation of Frameworks That Combine Evolution and Learning to Design Robots in Complex Morphological Spaces.

A Cross-Domain Method for Generation of Constructive and Perturbative Heuristics (2021)
Book Chapter
Stone, C., Hart, E., & Paechter, B. (2021). A Cross-Domain Method for Generation of Constructive and Perturbative Heuristics. In N. Pillay, & R. Qu (Eds.), Automated Design of Machine Learning and Search Algorithms (91-107). Springer. https://doi.org/10.1007/978-3-030-72069-8_6

Hyper-heuristic frameworks, although intended to be cross-domain at the highest level, usually rely on a set of domain-specific low-level heuristics which exist below the domain-barrier and are manipulated by the hyper-heuristic itself. However, for... Read More about A Cross-Domain Method for Generation of Constructive and Perturbative Heuristics.

Machine learning-enabled quantitative ultrasound techniques for tissue differentiation (2022)
Journal Article
Thomson, H., Yang, S., & Cochran, S. (2022). Machine learning-enabled quantitative ultrasound techniques for tissue differentiation. Journal of Medical Ultrasonics, 49, 517-528. https://doi.org/10.1007/s10396-022-01230-6

Purpose: Quantitative ultrasound (QUS) infers properties about tissue microstructure from backscattered radio-frequency ultrasound data. This paper describes how to implement the most practical QUS parameters using an ultrasound research system for t... Read More about Machine learning-enabled quantitative ultrasound techniques for tissue differentiation.

Single-Element and MIMO Circularly Polarized Microstrip Antennas with Negligible Back Radiation for 5G Mid-Band Handsets (2022)
Journal Article
Alnahwi, F. M., Al-Yasir, Y. I. A., See, C. H., & Abd-Alhameed, R. A. (2022). Single-Element and MIMO Circularly Polarized Microstrip Antennas with Negligible Back Radiation for 5G Mid-Band Handsets. Sensors, 22(8), Article 3067. https://doi.org/10.3390/s22083067

In this paper, single-element and MIMO microstrip antenna with two pairs of unequal slits is proposed as a circularly polarized antenna with negligible back radiation for 5G mid-band handsets. The unequal pairs of slits are engraved on the antenna pa... Read More about Single-Element and MIMO Circularly Polarized Microstrip Antennas with Negligible Back Radiation for 5G Mid-Band Handsets.

A Compact Wideband Circularly Polarized Planar Monopole Antenna with Axial Ratio Bandwidth Entirely Encompassing the Antenna Bandwidth (2022)
Journal Article
Mousa, F. M., Al-Yasir, Y. I. A., Ali, N. T., Gharbia, I., See, C. H., & Abd-Alhameed, R. (2022). A Compact Wideband Circularly Polarized Planar Monopole Antenna with Axial Ratio Bandwidth Entirely Encompassing the Antenna Bandwidth. IEEE Access, 10, 81828-81835. https://doi.org/10.1109/ACCESS.2022.3196610

The antenna presented in this study is a compact wideband monopole with wideband circular polarization that can be used across the whole antenna bandwidth. A rectangular C-shaped patch is partially covered by a ground plane in the proposed planar mon... Read More about A Compact Wideband Circularly Polarized Planar Monopole Antenna with Axial Ratio Bandwidth Entirely Encompassing the Antenna Bandwidth.

Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches (2023)
Journal Article
Alissa, M., Sim, K., & Hart, E. (2023). Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches. Journal of Heuristics, 29(1), 1-38. https://doi.org/10.1007/s10732-022-09505-4

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 netw... Read More about Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches.

A Quality-Diversity Approach to Evolving a Repertoire of Diverse Behaviour-Trees in Robot Swarms (2023)
Presentation / Conference Contribution
Montague, K., Hart, E., Paechter, B., & Nitschke, G. (2023, April). A Quality-Diversity Approach to Evolving a Repertoire of Diverse Behaviour-Trees in Robot Swarms. Presented at EVOStar 2023, Brno, Czechia

Designing controllers for a swarm of robots such that collabo-rative behaviour emerges at the swarm level is known to be challenging. Evolutionary approaches have proved promising, with attention turning more recently to evolving repertoires of dive... Read More about A Quality-Diversity Approach to Evolving a Repertoire of Diverse Behaviour-Trees in Robot Swarms.

DIGNEA: A tool to generate diverse and discriminatory instance suites for optimisation domains (2023)
Journal Article
Marrero, A., Segredo, E., León, C., & Hart, E. (2023). DIGNEA: A tool to generate diverse and discriminatory instance suites for optimisation domains. SoftwareX, 22, Article 101355. https://doi.org/10.1016/j.softx.2023.101355

To advance research in the development of optimisation algorithms, it is crucial to have access to large test-beds of diverse and discriminatory instances from a domain that can highlight strengths and weaknesses of different algorithms. The DIGNEA t... Read More about DIGNEA: A tool to generate diverse and discriminatory instance suites for optimisation domains.

DanceGraph: A Complementary Architecture for Synchronous Dancing Online (2023)
Presentation / Conference Contribution
Sinclair, D., Ademola, A. V., Koniaris, B., & Mitchell, K. (2023, May). DanceGraph: A Complementary Architecture for Synchronous Dancing Online. Paper presented at 36th International Computer Animation & Social Agents (CASA) 2023, Limassol, Cyprus

DanceGraph is an architecture for synchronized online dancing overcoming the latency of net-worked body pose sharing. We break down this challenge by developing a real-time bandwidth-efficient architecture to minimize lag and reduce the timeframe of... Read More about DanceGraph: A Complementary Architecture for Synchronous Dancing Online.

Generating diverse and discriminatory knapsack instances by searching for novelty in variable dimensions of feature-space (2023)
Presentation / Conference Contribution
Marrero, A., Segredo, E., Hart, E., Bossek, J., & Neumann, A. (2023, July). Generating diverse and discriminatory knapsack instances by searching for novelty in variable dimensions of feature-space. Presented at GECCO 2023, Lisbon, Portugal

Generating new instances via evolutionary methods is commonly used to create new benchmarking data-sets, with a focus on attempting to cover an instance-space as completely as possible. Recent approaches have exploited Quality-Diversity methods to ev... Read More about Generating diverse and discriminatory knapsack instances by searching for novelty in variable dimensions of feature-space.

Learning-Based Neural Ant Colony Optimization (2023)
Presentation / Conference Contribution
Liu, Y., Qiu, J., Hart, E., Yu, Y., Gan, Z., & Li, W. (2023). Learning-Based Neural Ant Colony Optimization. In GECCO 2023: Proceedings of the Genetic and Evolutionary Computation Conference (47-55). https://doi.org/10.1145/3583131.3590483

In this paper, we propose a new ant colony optimization algorithm , called learning-based neural ant colony optimization (LN-ACO), which incorporates an "intelligent ant". This intelligent ant contains a convolutional neural network pre-trained on a... Read More about Learning-Based Neural Ant Colony Optimization.

The Opaque Nature of Intelligence and the Pursuit of Explainable AI (2023)
Presentation / Conference Contribution
Thomson, S. L., van Stein, N., van den Berg, D., & van Leeuwen, C. (2023, November). The Opaque Nature of Intelligence and the Pursuit of Explainable AI. Presented at NCTA 2023: 15th International Conference on Neural Computation Theory and Applications, Rome, Italy

When artificial intelligence is used for making decisions, people are more likely to accept those decisions if they can be made intelligible to the public. This understanding has led to the emerging field of explainable artificial intelligence. We re... Read More about The Opaque Nature of Intelligence and the Pursuit of Explainable AI.

Too Constrained for Genetic Algorithms. Too Hard for Evolutionary Computing. The Traveling Tournament Problem. (2023)
Presentation / Conference Contribution
Verduin, K., Thomson, S. L., & van den Berg, D. (2023, November). Too Constrained for Genetic Algorithms. Too Hard for Evolutionary Computing. The Traveling Tournament Problem. Presented at ECTA 2023 15th International Conference on Evolutionary Computation Theory and Applications, Rome, Italy

Unlike other NP-hard problems, the constraints on the traveling tournament problem are so pressing that it’s hardly possible to randomly generate a valid solution, for example, to use in a genetic algorithm’s initial population. In this study, we ran... Read More about Too Constrained for Genetic Algorithms. Too Hard for Evolutionary Computing. The Traveling Tournament Problem..

Can HP-protein folding be solved with genetic algorithms? Maybe not (2023)
Presentation / Conference Contribution
Jansen, R., Horn, R., van Eck, O., Version, K., Thomson, S. L., & van den Berg, D. (2023, November). Can HP-protein folding be solved with genetic algorithms? Maybe not. Presented at ECTA 2023 15th International Conference on Evolutionary Computation Theory and Applications, Rome, Italy

Genetic algorithms might not be able to solve the HP-protein folding problem because creating random individuals for an initial population is very hard, if not impossible. The reason for this, is that the expected number of constraint violations incr... Read More about Can HP-protein folding be solved with genetic algorithms? Maybe not.

Robotics and Autonomous Systems for Environmental Sustainability: Monitoring Terrestrial Biodiversity (2023)
Preprint / Working Paper
Pringle, S., Davies, Z. G., Goddard, M. A., Dallimer, M., Hart, E., Le Goff, L., & Langdale, S. J. (2023). Robotics and Autonomous Systems for Environmental Sustainability: Monitoring Terrestrial Biodiversity

Welcome to the UK-RAS White paper Series on Robotics and Autonomous Systems (RAS). This is one of the core activities of UK-RAS Network, funded by the Engineering and Physical Sciences Research Council (EPSRC). By Bringing together academic centres o... Read More about Robotics and Autonomous Systems for Environmental Sustainability: Monitoring Terrestrial Biodiversity.

Improving Algorithm-Selection and Performance-Prediction via Learning Discriminating Training Samples (2024)
Presentation / Conference Contribution
Renau, Q., & Hart, E. (2024, July). Improving Algorithm-Selection and Performance-Prediction via Learning Discriminating Training Samples. Presented at GECCO 2024, Melbourne, Australia

The choice of input-data used to train algorithm-selection models is recognised as being a critical part of the model success. Recently, feature-free methods for algorithm-selection that use short trajec-tories obtained from running a solver as input... Read More about Improving Algorithm-Selection and Performance-Prediction via Learning Discriminating Training Samples.