Outputs (228)

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.

Evaluating the Robustness of Deep-Learning Algorithm-Selection Models by Evolving Adversarial Instances (2024)
Presentation / Conference Contribution
Hart, E., Renau, Q., Sim, K., & Alissa, M. (2024, September). Evaluating the Robustness of Deep-Learning Algorithm-Selection Models by Evolving Adversarial Instances. Presented at 18th International Conference on Parallel Problem Solving From Nature PPSN 2024, Hagenburg, Austria

Deep neural networks (DNN) are increasingly being used to perform algorithm-selection in combinatorial optimisation domains, particularly as they accommodate input representations which avoid designing and calculating features. Mounting evidence fro... Read More about Evaluating the Robustness of Deep-Learning Algorithm-Selection Models by Evolving Adversarial Instances.

Improving Efficiency of Evolving Robot Designs via Self-Adaptive Learning Cycles and an Asynchronous Architecture (2024)
Presentation / Conference Contribution
Le Goff, L., & Hart, E. (2024, July). Improving Efficiency of Evolving Robot Designs via Self-Adaptive Learning Cycles and an Asynchronous Architecture. Presented at GECCO 2024 Embodied and Evolved Artificial Intelligence Workshop, Melbourne, Australia

Algorithmic frameworks for the joint optimisation of a robot's design and controller often utilise a learning loop nested within an evolutionary algorithm to refine the controller associated with a newly generated robot design. Intuitively, it is rea... Read More about Improving Efficiency of Evolving Robot Designs via Self-Adaptive Learning Cycles and an Asynchronous Architecture.

Learning Descriptors for Novelty-Search Based Instance Generation via Meta-evolution (2024)
Presentation / Conference Contribution
Marrero, A., Segredo, E., León, C., & Hart, E. (2024, July). Learning Descriptors for Novelty-Search Based Instance Generation via Meta-evolution. Presented at GECCO '24: Genetic and Evolutionary Computation Conference, Melbourne, Australia

The ability to generate example instances from a domain is important in order to benchmark algorithms and to generate data that covers an instance-space in order to train machine-learning models for algorithm selection. Quality-Diversity (QD) algorit... Read More about Learning Descriptors for Novelty-Search Based Instance Generation via Meta-evolution.

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.

Automated Human-Readable Label Generation in Open Intent Discovery (2024)
Presentation / Conference Contribution
Anderson, G., Hart, E., Gkatzia, D., & Beaver, I. (2024, September). Automated Human-Readable Label Generation in Open Intent Discovery. Presented at Interspeech 2024, Kos, Greece

The correct determination of user intent is key in dialog systems. However, an intent classifier often requires a large, labelled training dataset to identify a set of known intents. The creation of such a dataset is a complex and time-consuming task... Read More about Automated Human-Readable Label Generation in Open Intent Discovery.

Overtaking Feasibility Prediction for Mixed Connected and Connectionless Vehicles (2024)
Journal Article
Zhao, L., Qian, H., Hawbani, A., Al-Dubai, A. Y., Tan, Z., Yu, K., & Zomaya, A. Y. (online). Overtaking Feasibility Prediction for Mixed Connected and Connectionless Vehicles. IEEE Transactions on Intelligent Transportation Systems, https://doi.org/10.1109/TITS.2024.3398602

Intelligent transportation systems (ITS) utilize advanced technologies to enhance traffic safety and efficiency, contributing significantly to modern transportation. The integration of Vehicle-to-Everything (V2X) further elevates road safety and fost... Read More about Overtaking Feasibility Prediction for Mixed Connected and Connectionless Vehicles.

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.

An Evaluation of Domain-agnostic Representations to Enable Multi-task Learning in Combinatorial Optimisation (2024)
Presentation / Conference Contribution
Stone, C., Renau, Q., Miguel, I., & Hart, E. (2024, June). An Evaluation of Domain-agnostic Representations to Enable Multi-task Learning in Combinatorial Optimisation. Presented at 18TH LEARNING AND INTELLIGENT OPTIMIZATION CONFERENCE, Ischia, Italy

We address the question of multi-task algorithm selection in combinatorial optimisation domains. This is motivated by a desire to simplify the algorithm-selection pipeline by developing a more general classifier that does not require specialised info... Read More about An Evaluation of Domain-agnostic Representations to Enable Multi-task Learning in Combinatorial Optimisation.

On the Utility of Probing Trajectories for Algorithm-Selection (2024)
Presentation / Conference Contribution
Renau, Q., & Hart, E. (2024, April). On the Utility of Probing Trajectories for Algorithm-Selection. Presented at EvoStar 2024, Aberystwyth, UK

Machine-learning approaches to algorithm-selection typically take data describing an instance as input. Input data can take the form of features derived from the instance description or fitness landscape , or can be a direct representation of the ins... Read More about On the Utility of Probing Trajectories for Algorithm-Selection.

A Hierarchical Approach to Evolving Behaviour-Trees for Swarm Control (2024)
Presentation / Conference Contribution
Montague, K., Hart, E., & Paechter, B. (2024, April). A Hierarchical Approach to Evolving Behaviour-Trees for Swarm Control. Presented at EvoStar 2024, Aberystwyth

Behaviour trees (BTs) are commonly used as controllers in robotic swarms due their modular composition and to the fact that they can be easily interpreted by humans. From an algorithmic perspective, an additional advantage is that extra modules can e... Read More about A Hierarchical Approach to Evolving Behaviour-Trees for Swarm Control.

Generalized Early Stopping in Evolutionary Direct Policy Search (2024)
Journal Article
Arza, E., Le Goff, L. K., & Hart, E. (2024). Generalized Early Stopping in Evolutionary Direct Policy Search. ACM Transactions on Evolutionary Learning and Optimization, 4(3), Article 14. https://doi.org/10.1145/3653024

Lengthy evaluation times are common in many optimization problems such as direct policy search tasks, especially when they involve conducting evaluations in the physical world, e.g. in robotics applications. Often when evaluating solution over a fixe... Read More about Generalized Early Stopping in Evolutionary Direct Policy Search.

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.

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.

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.