Sipu Ruan

Sipu Ruan

Auto-generated profile, based on publicly available information

Sipu Ruan

Department of Mechanical Engineering, National University of Singapore, Singapore

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
27 July 2022 in IEEE Transactions on Robotics
Verified
Journal Article
Open access
SRSipu Ruan
Sipu Ruan
KPKaren L. Poblete
Karen L. Poblete
HWHongtao Wu
Hongtao Wu
QMQianli Ma
Qianli Ma
GCGregory S. Chirikjian
Gregory S. Chirikjian
Path planning has long been one of the major research areas in robotics, with probabilistic roadmap (PRM) and rapidly-exploring random trees (RRT) being two of the most effective classes of planners. Though generally very efficient, these sampling-based planners can become computationally expensive in the important case of “narrow passages.” This article develops a path planning paradigm specifically formulated for narrow passage problems. The core is based on planning for rigid-body robots encapsulated by unions of ellipsoids. Each environmental feature is represented geometrically using a strictly convex body with a $\mathcal {C}^{1}$ boundary (e.g., superquadric). The main benefit of doing this is that configuration-space obstacles can be parameterized explicitly in closed form, thereby allowing prior knowledge to be used to avoid sampling infeasible configurations. Then, by characterizing a tight volume bound for multiple ellipsoids, robot transitions involving rotations are guaranteed to be collision free without needing to perform traditional collision detection. Furthermore, by combining with a stochastic sampling strategy, the proposed planning framework can be extended to solving higher dimensional problems, in which the robot has a moving base and articulated appendages. Benchmark results show that the proposed framework often outperforms the sampling-based planners in terms of computational time and success rate in finding a path through narrow corridors for both single-body robots and those with higher dimensional configuration spaces. Physical experiments using the proposed framework are further demonstrated on a humanoid robot that walks in several cluttered environments with narrow passages.

27 April 2018 in Autonomous Robots
Verified
Journal Article
Closed access
PDF file
QMQianli Ma
Qianli Ma
ZGZachariah Goh
Zachariah Goh
SRSipu Ruan
Sipu Ruan
GCGregory S. Chirikjian
Gregory S. Chirikjian

1 February 2022 in Computer-Aided Design
Verified
Journal Article
Closed access
SRSipu Ruan
Sipu Ruan
GCGregory S. Chirikjian
Gregory S. Chirikjian

27 February 2018 in Journal of Mechanisms and Robotics
Verified
Journal Article
Open access
PDF file
GCGregory S. Chirikjian
Gregory S. Chirikjian
RMRobert Mahony
Robert Mahony
SRSipu Ruan
Sipu Ruan
JTJochen Trumpf
Jochen Trumpf
For more than a century, rigid-body displacements have been viewed as affine transformations described as homogeneous transformation matrices wherein the linear part is a rotation matrix. In group-theoretic terms, this classical description makes rigid-body motions a semidirect product. The distinction between a rigid-body displacement of Euclidean space and a change in pose from one reference frame to another is usually not articulated well in the literature. Here, we show that, remarkably, when changes in pose are viewed from a space-fixed reference frame, the space of pose changes can be endowed with a direct product group structure, which is different from the semidirect product structure of the space of motions. We then show how this new perspective can be applied more naturally to problems such as monitoring the state of aerial vehicles from the ground, or the cameras in a humanoid robot observing pose changes of its hands.

30 October 2022
Verified
Book Chapter
Closed access
PDF file
YWYuwei Wu
Yuwei Wu
WLWeixiao Liu
Weixiao Liu
SRSipu Ruan
Sipu Ruan
GCGregory S. Chirikjian
Gregory S. Chirikjian

13 July 2022 in IEEE Robotics and Automation Letters
Verified
Journal Article
Open access
SRSipu Ruan
Sipu Ruan
XWXiaoli Wang
Xiaoli Wang
GCGregory S. Chirikjian
Gregory S. Chirikjian
This paper studies the narrow phase collision detection problem for two general unions of convex bodies encapsulated by smooth surfaces. The approach, namely CFC (Closed-Form Contact space), is based on parameterizing their contact space in closed-form. The first body is dilated to form the contact space while the second is shrunk to a point. Then, the collision detection is formulated as finding the closest point on the parametric contact space with the center of the second body. Numerical solutions are proposed based on the point-to-surface distance as well as the common-normal concept. Furthermore, when the two bodies are moving or under linear deformations, their first time of contact is solved continuously along the time-parameterized trajectories. Benchmark studies are conducted for the proposed algorithms in terms of solution stability and computational cost. Applications of the sampling-based motion planning for robot manipulators are demonstrated.