English
Related papers

Related papers: Complexity of control-affine motion planning

200 papers

In this paper, we study the complexity of the approximation of nonadmissible curves for nonlinear control-affine systems satisfying the strong H{\"o}rmander condition. Focusing on tubular approximation complexities, we provide asymptotic…

Dynamical Systems · Mathematics 2026-01-09 Michele Motta , Dario Prandi

The main objective of this paper is to introduce a new method for qualitative analysis of various designs of robot arms. To this end we define the complexity of a map, examine its main properties and develop some methods of computation. In…

Algebraic Topology · Mathematics 2017-08-03 Petar Pavešić

The problem of tracking an arbitrary curve in the state space is considered for underactuated driftless control-affine systems. This problem is formulated as the stabilization of a time-varying family of sets associated with a neighborhood…

Optimization and Control · Mathematics 2019-08-19 Victoria Grushkovskaya , Alexander Zuyev

The problem of motion planning for affine control systems consists of designing control inputs that drive a system from a well-defined initial to final states in a desired amount of time. For control systems with drift, however,…

Systems and Control · Electrical Eng. & Systems 2020-01-15 Shenyu Liu , Yinai Fan , Mohamed-Ali Belabbas

Motion planning and control are key problems in a collection of robotic applications including the design of autonomous agile vehicles and of minimalist manipulators. These problems can be accurately formalized within the language of affine…

Optimization and Control · Mathematics 2007-05-23 Sonia Martinez , Jorge Cortes , Francesco Bullo

In this paper we study a notion of topological complexity for the motion planning problem. The topological complexity is a number which measures discontinuity of the process of motion planning in the configuration space X. More precisely,…

Algebraic Topology · Mathematics 2007-05-23 Michael Farber

We study motion planning algorithms for collision free control of multiple objects in the presence of moving obstacles. We compute the topological complexity of algorithms solving this problem. We apply topological tools and use information…

Optimization and Control · Mathematics 2007-05-23 Michael Farber , Mark Grant , Sergey Yuzvinsky

In this paper we introduce and study a new concept of parametrised topological complexity, a topological invariant motivated by the motion planning problem of robotics. In the parametrised setting, a motion planning algorithm has high…

Algebraic Topology · Mathematics 2021-09-10 Daniel C. Cohen , Michael Farber , Shmuel Weinberger

Nonlinear control-affine systems with time-varying vector fields are considered in the paper. We propose a unified control design scheme with oscillating inputs for solving the trajectory tracking and stabilization problems. This…

Optimization and Control · Mathematics 2023-10-31 Victoria Grushkovskaya , Alexander Zuyev

We introduce the topological complexity of the work map associated to a robot system. In broad terms, this measures the complexity of any algorithm controlling, not just the motion of the configuration space of the given system, but the…

Algebraic Topology · Mathematics 2019-01-30 Aniceto Murillo , Jie Wu

In this paper we study paramertized motion planning algorithms which provide universal and flexible solutions to diverse motion planning problems. Such algorithms are intended to function under a variety of external conditions which are…

Robotics · Computer Science 2022-02-24 Michael Farber , Shmuel Weinberger

In this series of papers, we present a motion planning framework for planning comfortable and customizable motion of nonholonomic mobile robots such as intelligent wheelchairs and autonomous cars. In Part I, we presented the mathematical…

Robotics · Computer Science 2013-05-23 Shilpa Gulati , Chetan Jhurani , Benjamin Kuipers

It has been observed that the very important motion planning problem of robotics mathematically speaking boils down to the problem of finding a section to the path-space fibration, raising the notion of topological complexity, as introduced…

Algebraic Topology · Mathematics 2018-12-27 Eric Goubault , Michael Farber , Aurélien Sagnier

We establish sharp upper bounds for the topological complexity of motion planning problem in spaces with small fundamental group, i.e. when it is finite of small order or has small cohomological dimension.

Algebraic Topology · Mathematics 2008-06-26 Armindo Costa , Michael Farber

The paper is concerned with mechanical systems which are controlled by implementing a number of time-dependent, frictionless holonomic constraints. The main novelty is due to the presence of additional non-holonomic constraints. We develop…

Dynamical Systems · Mathematics 2012-08-22 Alberto Bressan , Ke Han , Franco Rampazzo

The main theme of the article is the study of discrete systems of material points subjected to constraints not only of a geometric type (holonomic constraints) but also of a kinematic type (nonholonomic constraints). The setting up of the…

Classical Physics · Physics 2023-05-30 Federico Talamucci

In this paper, we propose a new control design scheme for solving the obstacle avoidance problem for nonlinear driftless control-affine systems. The class of systems under consideration satisfies controllability conditions with iterated Lie…

Optimization and Control · Mathematics 2019-02-08 Victoria Grushkovskaya , Alexander Zuyev

In this article, we give a condition for the global controllability of affine nonlinear control systems with drifts on Euclidean spaces. Under regularity assumptions, the condition is necessary and sufficient in the codimension-1 and…

Optimization and Control · Mathematics 2023-09-12 Zhengping Ji , Xiao Zhang , Daizhan Cheng

We design a motion planning algorithm to coordinate the movements of two robots along a figure eight track, in such a way that no collisions occur. We use a topological approach to robot motion planning that relates instabilities in motion…

Robotics · Computer Science 2024-03-19 Cristian Jardon , Brian Sheppard , Veet Zaveri

This is a chapter in the Encyclopedia of Robotics. It is devoted to the study of complexity of complete (or exact) algorithms for robot motion planning. The term ``complete'' indicates that an approach is guaranteed to find the correct…

Robotics · Computer Science 2020-03-31 Kiril Solovey
‹ Prev 1 2 3 10 Next ›