Moving a Chair through a Door: A Tutorial on Local Spatial Reasoning in Algorithmic Robotics

Research output: Contribution to journalConference article

Abstract

Spatial reasoning problems in robotics may be categorised into two types: global and local. A typical problem of the global kind involves determining if a robot can navigate along a specified terrain from one specified (starting) point to another (target) point by means of a suitable path, subject to a variety of constraints. A quintessential example of local spatial reasoning is the determination of whether an object can pass through a specified opening. This paper presents a tutorial on the local spatial reasoning problem of deciding whether a given rigid convex object can pass through a specified convex aperture, and if possible, planning a sequence of motions to accomplish the task, in a computationally efficient manner. The exposition of this material is at the freshman and sophomore undergraduate levels, and is well suited to motivate computer science students in discrete mathematics courses.

Original languageEnglish (US)
Article number012043
JournalIOP Conference Series: Materials Science and Engineering
Volume435
Issue number1
DOIs
StatePublished - Nov 5 2018
Event2018 2nd International Conference on Artificial Intelligence Applications and Technologies, AIAAT 2018 - Shanghai, China
Duration: Aug 8 2018Aug 10 2018

Fingerprint

Computer science
Robotics
Robots
Students
Planning

ASJC Scopus subject areas

  • Materials Science(all)
  • Engineering(all)

Cite this

@article{61a0899a21704754a4ba10358bfd6ba5,
title = "Moving a Chair through a Door: A Tutorial on Local Spatial Reasoning in Algorithmic Robotics",
abstract = "Spatial reasoning problems in robotics may be categorised into two types: global and local. A typical problem of the global kind involves determining if a robot can navigate along a specified terrain from one specified (starting) point to another (target) point by means of a suitable path, subject to a variety of constraints. A quintessential example of local spatial reasoning is the determination of whether an object can pass through a specified opening. This paper presents a tutorial on the local spatial reasoning problem of deciding whether a given rigid convex object can pass through a specified convex aperture, and if possible, planning a sequence of motions to accomplish the task, in a computationally efficient manner. The exposition of this material is at the freshman and sophomore undergraduate levels, and is well suited to motivate computer science students in discrete mathematics courses.",
author = "Godfried Toussaint",
year = "2018",
month = "11",
day = "5",
doi = "10.1088/1757-899X/435/1/012043",
language = "English (US)",
volume = "435",
journal = "IOP Conference Series: Materials Science and Engineering",
issn = "1757-8981",
publisher = "IOP Publishing Ltd.",
number = "1",

}

TY - JOUR

T1 - Moving a Chair through a Door

T2 - A Tutorial on Local Spatial Reasoning in Algorithmic Robotics

AU - Toussaint, Godfried

PY - 2018/11/5

Y1 - 2018/11/5

N2 - Spatial reasoning problems in robotics may be categorised into two types: global and local. A typical problem of the global kind involves determining if a robot can navigate along a specified terrain from one specified (starting) point to another (target) point by means of a suitable path, subject to a variety of constraints. A quintessential example of local spatial reasoning is the determination of whether an object can pass through a specified opening. This paper presents a tutorial on the local spatial reasoning problem of deciding whether a given rigid convex object can pass through a specified convex aperture, and if possible, planning a sequence of motions to accomplish the task, in a computationally efficient manner. The exposition of this material is at the freshman and sophomore undergraduate levels, and is well suited to motivate computer science students in discrete mathematics courses.

AB - Spatial reasoning problems in robotics may be categorised into two types: global and local. A typical problem of the global kind involves determining if a robot can navigate along a specified terrain from one specified (starting) point to another (target) point by means of a suitable path, subject to a variety of constraints. A quintessential example of local spatial reasoning is the determination of whether an object can pass through a specified opening. This paper presents a tutorial on the local spatial reasoning problem of deciding whether a given rigid convex object can pass through a specified convex aperture, and if possible, planning a sequence of motions to accomplish the task, in a computationally efficient manner. The exposition of this material is at the freshman and sophomore undergraduate levels, and is well suited to motivate computer science students in discrete mathematics courses.

UR - http://www.scopus.com/inward/record.url?scp=85057474911&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85057474911&partnerID=8YFLogxK

U2 - 10.1088/1757-899X/435/1/012043

DO - 10.1088/1757-899X/435/1/012043

M3 - Conference article

AN - SCOPUS:85057474911

VL - 435

JO - IOP Conference Series: Materials Science and Engineering

JF - IOP Conference Series: Materials Science and Engineering

SN - 1757-8981

IS - 1

M1 - 012043

ER -