most citedHigh-Quality Tabletop Rearrangement with Overhand Grasps: Hardness Results and Fast Methods

6 citations · 10 across the 6 of their papers we have counts for

collaborators

6 papers

cs.RO2021

Robust-by-Design Plans for Multi-Robot Pursuit-Evasion

Trevor Olsen, Nicholas M. Stiffler, Jason M. O'Kane

This paper studies a multi-robot visibility-based pursuit-evasion problem in which a group of pursuer robots are tasked with detecting an evader within a two dimensional polygonal…

cs.RO2021

Rapid Recovery from Robot Failures in Multi-Robot Visibility-Based Pursuit-Evasion

Trevor Olsen, Nicholas M. Stiffler, Jason M. O'Kane

This paper addresses the visibility-based pursuit-evasion problem where a team of pursuer robots operating in a two-dimensional polygonal space seek to establish visibility of an a…

cs.RO2021

A Visibility Roadmap Sampling Approach for a Multi-Robot Visibility-Based Pursuit-Evasion Problem

Trevor Olsen, Anne M. Tumlin, Nicholas M. Stiffler +1

Given a two-dimensional polygonal space, the multi-robot visibility-based pursuit-evasion problem tasks several pursuer robots with the goal of establishing visibility with an arbi…

cs.RO20174 cited

Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Grasps

Shuai D Han, Nicholas M Stiffler, Athanasios Krontiris +2

This paper studies the underlying combinatorial structure of a class of object rearrangement problems, which appear frequently in applications. The problems involve multiple, simil…

cs.RO2017

Efficient, High-Quality Stack Rearrangement

Shuai D. Han, Nicholas M. Stiffler, Kostas E. Bekris +1

This work studies rearrangement problems involving the sorting of robots or objects in stack-like containers, which can be accessed only from one side. Two scenarios are considered…

cs.RO20176 cited

High-Quality Tabletop Rearrangement with Overhand Grasps: Hardness Results and Fast Methods

Shuai D. Han, Nicholas M. Stiffler, Athansios Krontiris +2

This paper studies the underlying combinatorial structure of a class of object rearrangement problems, which appear frequently in applications. The problems involve multiple, simil…