Search arXivSearch

arXiv · 2202.09869

Redundancy Resolution at Position Level

Abstract

Increasing the degrees of freedom of robotic systems makes them more versatile and flexible. This usually renders the system kinematically redundant: the main manipulation or interaction task does not fully determine its joint maneuvers. Additional constraints or objectives are required to solve the under-determined control and planning problems. The state-of-the-art approaches arrange tasks in a hierarchy and decouple lower from higher priority tasks on velocity or torque level using projectors. We develop an approach to redundancy resolution and decoupling on position level by determining subspaces of the configurations space independent of the primary task. We call them \emph{orthogonal foliations} because they are, in a certain sense, orthogonal to the task self-motion manifolds. The approach provides a better insight into the topological properties of robot kinematics and control problems, allowing a global view. A condition for the existence of orthogonal foliations is derived. If the condition is not satisfied, we will still find approximate solutions by numerical optimization. Coordinates can be defined on these orthogonal foliations and can be used as additional task variables for control. We show in simulations that we can control the system without the need for projectors using these coordinates, and we validate the approach experimentally on a 7-DoF robot.

Explore related subjects

Keep this discovery

BibTeXRIS

Alin Albu-Schäffer, Arne Sachtler. 2023-08-31. Redundancy Resolution at Position Level. https://doi.org/10.1109/tro.2023.3309097

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Multi-Robot Bearing-based Pose Estimation via Angle Rigidity

This letter proposes a novel distributed pose estimator for multi-robot systems evolving on $\mathrm{SE}(3)$. The robots' positions are estimated in $\mathbb{R}^3$ using angles computed from body-frame bearings, without requiring orientation knowledge. The robots' orientations are then recovered in $\mathrm{SO}(3)$ from the estimated positions, together with bearing and bearing-rate measurements. The estimator accommodates directed sensing topologies and requires only infinitesimal angle rigidity (IAR), thereby relaxing the requirement, common in bearing-based approaches, that every robot acquire at least two bearings. Unlike existing angle-based schemes, the proposed method also estimates the robots' orientations. We prove local uniform exponential stability of the observer, assuming that a subset of robots executes persistently exciting motions. These theoretical results are corroborated through numerical simulations.

cs.RO

On Global Regulatability of Robot Manipulators by Classical PID

A long-standing open problem in robot manipulator control is whether global regulation can be achieved by classical PID control. This paper provides an answer to this question for classical PID controllers with triple parameters (k_p,k_i,k_d) in R^3. We find and prove that for one-degree-of-freedom manipulators, the classical PID control guarantees global stability and asymptotic regulation under standard structural assumptions, and further derive explicit quantitative design conditions for the PID gains. However, for multi-degree-of-freedom cases, we can construct a robot manipulator satisfying the same structural assumptions for which no choice of PID gains (k_p,k_i,k_d) can achieve global asymptotic regulation. These results provide a fundamental understanding of the abovementioned open problem, revealing both the fundamental capability and intrinsic limitation of the classical PID control for robot manipulator dynamics.

cs.RO

Provably Safe Decentralized Contingency MPC under State-Only Information and Limited Sensing for Nonlinear Multi-agent Systems

This paper considers decentralized contingency MPC for multi-agent control under a state-only information pattern, with particular focus on limited sensing and plug-and-play operation. The objective is to retain recursive feasibility, safety, and Lyapunov-type convergence while reducing conservatism in local interaction handling. The framework relies on agent-wise fallback regions (safe sets) in which a feasible contingency maneuver to a safe equilibrium is always available. A novel safe-set update mechanism is introduced that supports less conservative decentralized interaction while preserving the underlying guarantees. This, in turn, enables memory-free local interaction and finite sensing ranges without requiring agents to reconstruct the exact neighbor geometry. The resulting scheme remains fully decentralized and preserves the shared-first-input contingency MPC structure. Theoretical guarantees and simulation results illustrate the effectiveness of the approach in dense multi-agent scenarios.

math.OC