Skip to main content

Research Repository

Advanced Search

Outputs (10)

Requirements for getting a robot to grow-up (2003)
Presentation / Conference Contribution
Ross, P., Hart, E., Lawson, A., Webb, A., Prem, E., Poelz, P., & Morgavi, G. (2003). Requirements for getting a robot to grow-up. In W. Banzhaf, T. Christaller, P. Dittrich, J. T. Kim, & J. Ziegler (Eds.), Advances in Artificial Life 7th European Conferen

Much of current robot research is about learning tasks in which the task to be achieved is pre-specified, a suitable technology for the task is chosen and the learning process is then experimentally investigated. In this paper we discuss a different... Read More about Requirements for getting a robot to grow-up.

Exploiting the analogy between the immune system and sparse distributed memory. (2003)
Journal Article
Hart, E., & Ross, P. (2003). Exploiting the analogy between the immune system and sparse distributed memory. Genetic Programming and Evolvable Machines, 4(4), 333-358. https://doi.org/10.1023/a%3A1026191011609

The relationship between immunological memory and a class of associative memories known as sparse distributed memories (SDM) is well known. This paper proposes a new model for clustering non-stationary data based on a combination of salient features... Read More about Exploiting the analogy between the immune system and sparse distributed memory..

Genetic algorithms and timetabling (2003)
Book Chapter
Ross, P., Hart, E., & Corne, D. (2003). Genetic algorithms and timetabling. In A. Ghosh, & K. Tsutsui (Eds.), Advances in Evolutionary Optimisation. Springer. https://doi.org/10.1007/978-3-642-18965-4_30

Genetic algorithms can be used to search very large spaces, and it would seem natural to use them for tackling the nastier kinds of timetabling problem. We completed an EPSRC-funded project on this last year, and distribute a free package that handle... Read More about Genetic algorithms and timetabling.

Routing using evolutionary agents and proactive transitions. (2003)
Book Chapter
Urquhart, N. B., Ross, P., Paechter, B., & Chisholm, K. (2003). Routing using evolutionary agents and proactive transitions. In Applications of Evolutionary Computing (696-705). Springer-Verlag

The authors have previously introduced the concept of building a delivery network using an agent-based system. The delivery networks are built in response to a real-world problem that involves delivering post to a large number of households within an... Read More about Routing using evolutionary agents and proactive transitions..

A role for immunology in 'next generation' robots. (2003)
Presentation / Conference Contribution
Hart, E., Ross, P., Webb, A., & Lawson, A. (2003). A role for immunology in 'next generation' robots. In J. Timmis, P. Bentley, & E. Hart (Eds.), Artificial Immune Systems. ICARIS 2003 (46-56). https://doi.org/10.1007/978-3-540-45192-1_5

Much of current robot research is about learning tasks in which the task to be achieved is pre-specified, a suitable technology for the task is chosen and the learning process is experimentally investigated. A more interesting research question is ho... Read More about A role for immunology in 'next generation' robots..

Controlling a simulated Khepera with an XCS classifier system with memory. (2003)
Presentation / Conference Contribution
Webb, A., Hart, E., Ross, P., & Lawson, A. (2003). Controlling a simulated Khepera with an XCS classifier system with memory.

Autonomous agents commonly suffer from perceptual aliasing in which differing situations are perceived as identical by the robots sensors, yet require different courses of action. One technique for addressing this problem is to use additional interna... Read More about Controlling a simulated Khepera with an XCS classifier system with memory..

Requirements for getting a robot to grow up. (2003)
Presentation / Conference Contribution
Ross, P., Hart, E., Lawson, A., Webb, A., Prem, E., Poelz, P., & Morgavi, G. (2003). Requirements for getting a robot to grow up.

Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyperheuristics. (2003)
Presentation / Conference Contribution
Ross, P., Marin-Blazquez, J. G., Schulenburg, S., & Hart, E. (2003). Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyperheuristics.

The idea underlying hyper-heuristics is to discover some combination of familiar, straightforward heuristics that performs very well across a whole range of problems. To be worthwhile, such a combination should outperform all of the constituent heur... Read More about Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyperheuristics..

A systematic investigation of GA performance on jobshop scheduling problems. (2003)
Presentation / Conference Contribution
Hart, E., & Ross, P. (2003). A systematic investigation of GA performance on jobshop scheduling problems. In Real-World Applications of Evolutionary Computing (280-289). https://doi.org/10.1007/3-540-45561-2_27

Although there has been a wealth of work reported in the literature on the application of genetic algorithms (GAs) to jobshop scheduling problems, much of it contains some gross over-generalisations, i.e that the observed performance of a GA on a sma... Read More about A systematic investigation of GA performance on jobshop scheduling problems..