.png){kind=icon}
.png){kind=icon}
Return
Decidability in robot manipulation planning
.png){kind=icon}
OA
AI
DOI：10.1007/s10514-020-09957-2.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Consider the problem of planning collision-free motion of n objects movable through contact with a robot that can autonomously translate in the plane and that can move a maximum of m <= n objects simultaneously. This represents the abstract formulation of a general class of manipulation planning problems that are proven to be decidable in this paper. The tools used for proving decidability of this simplified manipulation planning problem are, in fact, general enough to handle the decidability problem for the wider class of systems characterized by a stratified configuration space. These include, e.g., problems of legged and multi-contact locomotion, bi-manual manipulation. In addition, the approach described does not restrict the dynamics of the manipulation system modeled.
Keywords:
Manipulation systems
Decidability
Stratified controllability
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.3
Papers:
1.7K
Citations:
5.0K