SE-701 82 Írebro, Sweden
Phone: +46 (19) 30 14 38
Fax: +46 (19) 30 34 63
Welcome to my academic homepage. Here you will find all information related to my current research at
AASS,Örebro university as well as
articles published during my time as a PhD student at
IDA, Linköping university. If you are
interested in other aspects of me you can take a look at some of my
hobby software projects hosted at lysator or at sourceforge.
I am currently employed as an associate professor at Örebro University. After taking a PhD in computer science I have worked mainly within robotics and artificial intelligence. Currently my main interest is the technical managements of the Ecologies of Physically Embedded Intelligent Systems project within which one of my three PhD students are doing his thesis work. The remaining two students are industrial PhD students working on automation of underground mining vehicles and on teleoperated robotics and surveillance, respectively.
I have also been involved in several successful grant applications including two grants from the Swedish research counsil (Vetenskapsrådet) and in receiving funding from Electronic and Telecommunications Research Institute (ETRI), Deajon, Korea. This funding is for the above mentioned collaborative project, Ecologies of Physically Embedded Intelligent Systems, beeing performed with ETRI. As such I have given numerous presentations of the technical results from this project in South Korean as well as in international conferences and with a tutorial at the ACSE 2006 planned for november 2006.
Apart from research within ubiquitous robotics I have also published within anchoring, field robotics and recovery planning as well as in more theoretical artificiall intelligence. In my work within anchoring and recovery planning we have mainly dealt with ambiguities in perceptual situations and related problems and uses plan-based approaches for automatic recovery.
In my thesis work the main focus where on more theoretical computer science and artificiall intelligence. The main area of this work was temporal and to some degree spatial reasoning and the delineation of what reasoning problems can and cannot be solved by any algorithm within a reasonable timeframe. That is, a computational perspective was choosen here with a classification of NP-completeness (or harder) as well as general methods for investigating and creating algorithms for relational algebra based problems.
For further information about my results within these different research topics please see the navigation area to the top right.
Last modified 03/13/12