4 papers
Algebraic Characterizations for Minors of Finite Graphs via Flow Transformation Monoid Division and Embedding
Amena Assem, Hanna Derets, Chrystopher L. Nehaniv
We prove three theorems on the flow monoids of finite graphs. First, we show that a non-empty finite graph G = (V, E) is connected if and only if its flow monoid contains a constan…
Using Dynamical Systems Theory to Quantify Complexity in Asymptotic Lenia
Ivan Yevenko, Hiroki Kojima, Chrystopher L. Nehaniv
Continuous cellular automata (CCAs) have evolved from discrete lookup tables to continuous partial differential equation (PDE) formulations in the search for novel forms of complex…
Interactive Continual Learning Architecture for Long-Term Personalization of Home Service Robots
Ali Ayub, Chrystopher Nehaniv, Kerstin Dautenhahn
For robots to perform assistive tasks in unstructured home environments, they must learn and reason on the semantic knowledge of the environments. Despite a resurgence in the devel…
Utilization of Non-verbal Behaviour and Social Gaze in Classroom Human-Robot Interaction Communications
Sahand Shaghaghi, Pourya Aliasghari, Bryan Tripp +2
This abstract explores classroom Human-Robot Interaction (HRI) scenarios with an emphasis on the adaptation of human-inspired social gaze models in robot cognitive architecture to…