oru.sePublikationer
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Combining Task and Motion Planning
Örebro University, School of Science and Technology.ORCID iD: 0000-0002-8631-7863
2016 (English)Doctoral thesis, monograph (Other academic)
Abstract [en]

This thesis addresses the problem of automatically computing, given a high-level goal description, a sequence of actions and motion paths for one or several robots to achieve that goal. Also referred to as CTAMP (Combining Task And Motion Planning), this problem may seem trivial at first glance, since efficient solutions have been found for its two underlying problems, namely task planning and motion planning. However, further consideration reveals that combining task and motion planning, in many cases, is not straightforward. We have identified two important issues which are addressed in this thesis.

The first issue originates in the fact that symbolic actions can be geometrically instantiated in multiple ways. Choosing a geometric instance for each action is not trivial, because a “wrong” choice may compromise the feasibility of subsequent actions. To address this issue, in the first part of the thesis we propose a mechanism for backtracking over geometric choices in the context of a partial symbolic plan. This process may greatly increase the complexity of CTAMP. Therefore, we also present a constraint-based approach for pruning out geometric configurations which violate a number of geometric constraints imposed by the action sequence, and by the kinematic models of robots. This approach has been tested with success on the real humanoid robotic platform Justin in the context of the GeRT1 project.

The second issue results from the necessity to interleave symbolic and geometric computations for taking geometric constraints into account at the symbolic level. Indeed, the symbolic search space forms an abstraction of the physical world, hence geometric constraints such as objects occlusions or kinematic constraints are not represented. However, interleaving both search processes is not a workable approach for large problem instances, because the resulting search space is too large. In the second part of the thesis, we propose a novel approach for decoupling symbolic and geometric search spaces, while keeping the symbolic level aware of geometric constraints. Culprit detection mechanisms are used for computing explanations for geometric failures, and these explanations are leveraged at the symbolic level for pruning the search space through inference mechanisms. This approach has been extensively tested in simulation, on different types of single and multiple robot systems.

Place, publisher, year, edition, pages
Örebro: Örebro university , 2016. , 194 p.
Series
Örebro Studies in Technology, ISSN 1650-8580 ; 67
National Category
Computer Science
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:oru:diva-46994ISBN: 978-91-7529-113-0 (print)OAI: oai:DiVA.org:oru-46994DiVA: diva2:877814
Public defence
2016-01-29, Teknikhuset, Hörsal T, Örebro universitet, Fakultetsgatan 1, Örebro, 13:15 (English)
Opponent
Supervisors
Available from: 2015-12-08 Created: 2015-12-08 Last updated: 2017-10-17Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Lagriffoul, Fabien
By organisation
School of Science and Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Total: 625 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf