Change search
ReferencesLink to record
Permanent link

Direct link
A Constraint-Based Approach for Hybrid Reasoning in Robotics
Örebro University, School of Science and Technology, Örebro University, Sweden.
2016 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

The quest of AI and Robotics researchers to realize fully AI-driven integrated robotic systems has not yet led to such realizations, in spite of great attainments in both research areas. This thesis claims that one of the major hindrances to these realizations is the lack of attention to what we call “the hybrid reasoning problem”. This is the problem of jointly reasoning about heterogeneous and inter-dependent aspects of the world, expressed in different forms and at different levels of abstraction.

In this thesis, we propose an approach to hybrid reasoning (or integrated reasoning) for robot applications. Our approach constitutes a systematic way of achieving a domain-specific integration of reasoning capabilities. Its underpinning is to jointly reason about the sub-problems of an overall hybrid problem in the combined search space of mutual decisions. Each sub-problem represents one viewpoint, or type of requirement, that is meaningful in the particular application. We propose a Constraint Satisfaction Problem (CSP) formulation of the hybrid reasoning problem. This CSP, called meta-CSP, captures the dependencies between sub-problems. It constitutes a high-level representation of the (hybrid) requirements that define a particular application. We formalize the meta-CSP in a way that is independent of the viewpoints that are relevant in the application, as is the algorithm used for solving the meta-CSP.

In order to verify the applicability of the meta-CSP approach in real-world robot applications, we instantiate it in several different domains, namely, a waiter robot, an automated industrial fleet management application, and a drill pattern planning problem in open-pit mining. These realizations highlight the important features of the approach, namely, modularity, generality, online reasoning and solution adjustment, and the ability to account for domain-specific metric and symbolic knowledge.

Place, publisher, year, edition, pages
Örebro: Örebro university , 2016. , 156 p.
Örebro Studies in Technology, ISSN 1650-8580 ; 69
National Category
Computer Science
Research subject
Computer Science
URN: urn:nbn:se:oru:diva-50586ISBN: 978-91-7529-145-1OAI: diva2:934046
Public defence
2016-09-30, Örebro universitet, Teknikhuset, Hörsal T, Fakultetsgatan 1, Örebro, 13:15 (English)
Available from: 2016-06-08 Created: 2016-06-08 Last updated: 2016-09-06Bibliographically approved

Open Access in DiVA

Cover(742 kB)8 downloads
File information
File name COVER01.pdfFile size 742 kBChecksum SHA-512
Type coverMimetype application/pdf
Spikblad(52 kB)5 downloads
File information
File name SPIKBLAD01.pdfFile size 52 kBChecksum SHA-512
Type spikbladMimetype application/pdf
A Constraint-Based Approach for Hybrid Reasoning in Robotics(6895 kB)24 downloads
File information
File name FULLTEXT01.pdfFile size 6895 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Mansouri, Masoumeh
By organisation
School of Science and Technology, Örebro University, Sweden
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 24 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 519 hits
ReferencesLink to record
Permanent link

Direct link