Abstraction and Multiple Abstraction
We are working since 1997 on implementing abstraction into a number of diverse robotics tasks, such as world modelling, task planning, SLAM or sensor inference. We have proven in all these contexts how this cognitive process turns exponential complexity into polinomial one in suitable situations. We have also developed the first theoretical model of multiple abstraction of detail that have been employed in real mobile robots.
We have published a number of journal and conference papers on this matter, two books, and have developed a few doctoral theses as well.
Journals (9)
2023
2021
2010
2008
2007
2005
2004
2002
1999
Books (2)
Conferences (7)
2007
2005
2004
2002
Task-Driven, Multiple Abstraction for Modeling Mobile Robot Large-Scale Space
1998
Mobile Robot Path Planning and Navigation Using Hierarchical Graphs
1997
PhD Theses (2)
2006
2000
Modelado y Generación de Abstracciones Múltiples para Representación de Grandes Espacios
Technical Reports (9)
2005
Computational Cost of Hierarchical Graph Matching
The Categories of Graphs with Abstractions and Graphs with Refinements
2004
A Mathematical Formulation of Not-Restricted, Multiple Abstraction Based on Graphs. Application to Graph Isomorphism
2002
2001
La Abstracción en el Modelado del Entorno para Robots Móviles
1998
A Brief Introduction to Multi-Hierarchical Representations of Large-Scale Space
An Algorithm which Approaches the Exact Solution for the Problem of Constructing a Hierarchical Graph that Satisfies the Sufficient Condition for Optimality
An Expression for the Average Computational Cost of Path Searching in Hierarchical Graphs
Constructing a Hierarchical Graph Incrementally from a Flat Graph in Order to Perform Optimal, Efficient Path Searching
