Nicholas M. Stiffler

Nicholas M. Stiffler

Auto-generated profile, based on publicly available information

Nicholas M. Stiffler

Computer Science Department, Rutgers, the State University of New Jersey, Piscataway, NJ, USA

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 July 2018 in The International Journal of Robotics Research
Verified
Journal Article
Closed access
SHShuai D Han
Shuai D Han
NSNicholas M Stiffler
Nicholas M Stiffler
AKAthanasios Krontiris
Athanasios Krontiris
KBKostas E Bekris
Kostas E Bekris
Jingjin YuJingjin Yu
Jingjin Yu
This paper studies the underlying combinatorial structure of a class of object rearrangement problems, which appear frequently in applications. The problems involve multiple, similar-geometry objects placed on a flat, horizontal surface, where a robot can approach them from above and perform pick-and-place operations to rearrange them. The paper considers both the case where the start and goal object poses overlap, and where they do not. For overlapping poses, the primary objective is to minimize the number of pick-and-place actions and then to minimize the distance traveled by the end-effector. For the non-overlapping case, the objective is solely to minimize the travel distance of the end-effector. Although such problems do not involve all the complexities of general rearrangement, they remain computationally hard in both cases. This is shown through reductions from well-understood, hard combinatorial challenges to these rearrangement problems. The reductions are also shown to hold in the reverse direction, which enables the convenient application on rearrangement of well-studied algorithms. These algorithms can be very efficient in practice despite the hardness results. The paper builds on these reduction results to propose an algorithmic pipeline for dealing with the rearrangement problems. Experimental evaluation, including hardware-based trials, shows that the proposed pipeline computes high-quality paths with regards to the optimization objectives. Furthermore, it exhibits highly desirable scalability as the number of objects increases in both the overlapping and non-overlapping setup.

31 January 2018 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
SHShuai D. Han
Shuai D. Han
NSNicholas M. Stiffler
Nicholas M. Stiffler
KBKostas E. Bekris
Kostas E. Bekris
Jingjin YuJingjin Yu
Jingjin Yu
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: one where every robot or object needs to reach a particular stack, and a setting in which each robot has a distinct position within a stack. In both cases, the goal is to minimize the number of stack removals that need to be performed. Stack rearrangement is shown to be intimately connected to pebble motion problems, a useful abstraction in multi-robot path planning. Through this connection, feasibility of stack rearrangement can be readily addressed. Lower and upper bounds on optimality are established, which differ only by a logarithmic factor, in terms of stack removals. An algorithmic solution is then developed that produces suboptimal paths much quicker than a pebble motion solver. Furthermore, informed search-based methods are proposed for finding high-quality solutions. The efficiency and desirable scalability of the methods are demonstrated in simulation.

1 May 2012
Verified
Conference Paper
Closed access
NSNicholas M. Stiffler
Nicholas M. Stiffler
JOJason O'Kane
Jason O'Kane
We present an algorithm that computes a minimal-cost pursuer trajectory for a single pursuer to solve the visibility-based pursuit-evasion problem in a simply-connected two-dimensional environment. This algorithm improves upon the known algorithm of Guibas, Latombe, LaValle, Lin, and Motwani, which is complete but not optimal. Our algorithm uses a Tour of Segments (ToS) subroutine to construct a pursuer path that minimizes the distance traveled by the pursuer while guaranteeing that all evaders in the environment will be captured. We have implemented our algorithm in simulation and provide results.