oru.sePublikationer
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Efficiently combining task and motion planning using geometric constraints
Örebro University, School of Science and Technology, Örebro University, Sweden. (AASS)
Örebro University, School of Science and Technology, Örebro University, Sweden. (AASS)
Örebro University, School of Science and Technology, Örebro University, Sweden. (AASS)
Örebro University, School of Science and Technology, Örebro University, Sweden. (AASS)ORCID iD: 0000-0001-8229-1363
Show others and affiliations
2014 (English)In: The international journal of robotics research, ISSN 0278-3649, E-ISSN 1741-3176, Vol. 33, no 14, 1726-1747 p.Article in journal (Refereed) Published
Abstract [en]

We propose a constraint-based approach to address a class of problems encountered in combined task and motion planning (CTAMP), which we call kinematically constrained problems. CTAMP is a hybrid planning process in which task planning and geometric reasoning are interleaved. During this process, symbolic action sequences generated by a task planner are geometrically evaluated. This geometric evaluation is a search problem per se, which we refer to as geometric backtrack search. In kinematically constrained problems, a significant computational effort is spent on geometric backtrack search, which impairs search at the task level. At the basis of our approach to address this problem, is the introduction of an intermediate layer between task planning and geometric reasoning. A set of constraints is automatically generated from the symbolic action sequences to evaluate, and combined with a set of constraints derived from the kinematic model of the robot. The resulting constraint network is then used to prune the search space during geometric backtrack search. We present experimental evidence that our approach significantly reduces the complexity of geometric backtrack search on various types of problem.

Place, publisher, year, edition, pages
2014. Vol. 33, no 14, 1726-1747 p.
Keyword [en]
Manipulation planning, combining task and motion planning, geometric reasoning
National Category
Computer Science
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:oru:diva-40158DOI: 10.1177/0278364914545811ISI: 000345707000002Scopus ID: 2-s2.0-84914173646OAI: oai:DiVA.org:oru-40158DiVA: diva2:776857
Note

Funding Agency:

EU FP7 project "Generalizing Robot Manipulation Tasks" (GeRT) 248273

Available from: 2015-01-08 Created: 2015-01-07 Last updated: 2016-08-10Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Lagriffoul, FabienDimitrov, DimitarBidot, JulienSaffiotti, AlessandroKarlsson, Lars
By organisation
School of Science and Technology, Örebro University, Sweden
In the same journal
The international journal of robotics research
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 246 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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