activity
20202026
most citedEfficient Distance-Optimal Tethered Path Planning in Planar Environments: The Workspace Convexity

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

collaborators

6 papers

cs.RO2026

Can a Robot Walk the Robotic Dog: Triple-Zero Collaborative Navigation for Heterogeneous Multi-Agent Systems

Yaxuan Wang, Yifan Xiang, Ke Li +5

We present Triple Zero Path Planning (TZPP), a collaborative framework for heterogeneous multi-robot systems that requires zero training, zero prior knowledge, and zero simulation.…

cs.RO2023★ 1 cited

Sparse Waypoint Validity Checking for Self-Entanglement-Free Tethered Path Planning

Tong Yang, Jiangpin Liu, Yue Wang +1

A novel mechanism to derive self-entanglement-free (SEF) path for tethered differential-driven robots is proposed in this work. The problem is tailored to the deployment of tethere…

cs.RO2022★ 3 cited

Efficient Distance-Optimal Tethered Path Planning in Planar Environments: The Workspace Convexity

Tong Yang, Rong Xiong, Yue Wang

The main contribution of this paper is the proof of the convexity of the omni-directional tethered robot workspace (namely, the set of all tether-length-admissible robot configurat…

cs.RO2022★ 1 cited

Efficient Search of the k Shortest Non-Homotopic Paths by Eliminating Non-k-Optimal Topologies

Tong Yang, Li Huang, Yue Wang +1

An efficient algorithm to solve the shortest non-homotopic path planning (-SNPP) problem in a 2D environment is proposed in this paper. Motivated by accelerating the ineffic…

cs.RO2022

Learning A Simulation-based Visual Policy for Real-world Peg In Unseen Holes

Liang Xie, Hongxiang Yu, Kechun Xu +5

This paper proposes a learning-based visual peg-in-hole that enables training with several shapes in simulation, and adapting to arbitrary unseen shapes in real world with minimal…

cs.RO2020★ 1 cited

Cellular Decomposition for Non-repetitive Coverage Task with Minimum Discontinuities

Tong Yang, Jaime Valls Miro, Qianen Lai +2

A mechanism to derive non-repetitive coverage path solutions with a proven minimal number of discontinuities is proposed in this work, with the aim to avoid unnecessary, costly end…