Path planning under interface-based constraints for assistive robotics

Alexander Broad, Brenna Dee Argall

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

We present a heuristic-based search method for path planning in shared human-robot control scenarios in which the robot should adhere to specific motion constraints imposed by the human's control interface. This approach to path planning gives special consideration to kinematic and dynamic constraints introduced to reconcile discrepancies between the control space of the user and the control space of the robot. The resulting paths more closely mirror paths produced by users of the same interface; which is helpful, for example, when inferring human intent or for control sharing. Our first insight is to develop a hierarchical finite state machine describing the constrained state space, state transitions and associated costs. We then use this definition to embed the constraints of the interface into our heuristic planning algorithm, named C, with simple modifications to the A/D family of graph search algorithms. This approach allows us to maintain powerful theoretical guarantees such as complexity and completeness. In this paper, we ground our augmented path planning algorithm with an implementation on a robotic wheelchair system and a Sip-and-Puff interface. We demonstrate that the new approach produces paths and control signals that more closely resemble user-generated data and can easily be incorporated into real hardware systems.

Original languageEnglish (US)
Pages (from-to)450-458
Number of pages9
JournalProceedings International Conference on Automated Planning and Scheduling, ICAPS
Volume2016-January
StatePublished - Jan 1 2016

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Science Applications
  • Information Systems and Management

Fingerprint

Dive into the research topics of 'Path planning under interface-based constraints for assistive robotics'. Together they form a unique fingerprint.

Cite this