9 results on '"non-holonomic robot"'
Search Results
2. Stationary target localization and circumnavigation by a non‐holonomic differentially driven mobile robot: Algorithms and experiments.
- Author
-
Wang, Lei, Zou, Yao, and Meng, Ziyang
- Subjects
- *
MOBILE robots , *VOYAGES around the world , *ROBOT motion , *CIRCULAR motion , *ALGORITHMS , *ADAPTIVE fuzzy control - Abstract
Summary: This article addresses a surveillance problem where the goal is to achieve a circular motion around a target by a non‐holonomic differentially driven mobile robot. The available information for the mobile robot includes its own position, velocity with respect to the inertial frame, and the bearing angle of the target in its body frame. Since the target position is unavailable, an estimator is first proposed to localize it. Then a two‐step controller is given to drive the mobile robot to move onto a circular trajectory with a desired radius around it. It is shown that the proposed algorithm guarantees the convergence of the estimation error to a small neighborhood of zero and the motion of the robot to a small neighborhood of a designed radius. The performance of the proposed algorithm is first verified by simulations. Then, several experiments on a differentially driven mobile robot, Pioneer 3‐DX, are presented to further validate the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
3. Formation Control and Distributed Goal Assignment for Multi-Agent Non-Holonomic Systems.
- Author
-
Kowalczyk, Wojciech
- Subjects
NONHOLONOMIC dynamical systems ,MULTIAGENT systems ,MOBILE robots ,POTENTIAL functions ,CLOSED loop systems - Abstract
This paper presents control algorithms for multiple non-holonomic mobile robots moving in formation. Trajectory tracking based on linear feedback control is combined with inter-agent collision avoidance. Artificial potential functions (APF) are used to generate a repulsive component of the control. Stability analysis is based on a Lyapunov-like function. Then the presented method is extended to include a goal exchange algorithm that makes the convergence of the formation much more rapid and, in addition, reduces the number of collision avoidance interactions. The extended method is theoretically justified using a Lyapunov-like function. The controller is discontinuous but the set of discontinuity points is of zero measure. The novelty of the proposed method lies in integration of the closed-loop control for non-holonomic mobile robots with the distributed goal assignment, which is usually regarded in the literature as part of trajectory planning problem. A Lyapunov-like function joins both trajectory tracking and goal assignment analyses. It is shown that distributed goal exchange supports stability of the closed-loop control system. Moreover, robots are equipped with a reactive collision avoidance mechanism, which often does not exist in the known algorithms. The effectiveness of the presented method is illustrated by numerical simulations carried out on the large formation of robots. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
4. Formation Control and Distributed Goal Assignment for Multi-Agent Non-Holonomic Systems
- Author
-
Wojciech Kowalczyk
- Subjects
formation of robots ,non-holonomic robot ,stability analysis ,Lyapunov-like function ,target assignment ,goal exchange ,path following ,switching control ,Technology ,Engineering (General). Civil engineering (General) ,TA1-2040 ,Biology (General) ,QH301-705.5 ,Physics ,QC1-999 ,Chemistry ,QD1-999 - Abstract
This paper presents control algorithms for multiple non-holonomic mobile robots moving in formation. Trajectory tracking based on linear feedback control is combined with inter-agent collision avoidance. Artificial potential functions (APF) are used to generate a repulsive component of the control. Stability analysis is based on a Lyapunov-like function. Then the presented method is extended to include a goal exchange algorithm that makes the convergence of the formation much more rapid and, in addition, reduces the number of collision avoidance interactions. The extended method is theoretically justified using a Lyapunov-like function. The controller is discontinuous but the set of discontinuity points is of zero measure. The novelty of the proposed method lies in integration of the closed-loop control for non-holonomic mobile robots with the distributed goal assignment, which is usually regarded in the literature as part of trajectory planning problem. A Lyapunov-like function joins both trajectory tracking and goal assignment analyses. It is shown that distributed goal exchange supports stability of the closed-loop control system. Moreover, robots are equipped with a reactive collision avoidance mechanism, which often does not exist in the known algorithms. The effectiveness of the presented method is illustrated by numerical simulations carried out on the large formation of robots.
- Published
- 2019
- Full Text
- View/download PDF
5. Formation Control and Obstacle Avoidance for Multiple Robots Subject to Wheel-Slip.
- Author
-
Cai Ze-su, Zhao Jie, and Cao Jian
- Subjects
OBSTACLE avoidance (Robotics) ,ROBOTS ,NONHOLONOMIC dynamical systems ,POTENTIAL functions ,UNCERTAINTY (Information theory) ,MOBILE robots ,COLLISIONS (Nuclear physics) - Abstract
An adaptive formation control law for non-holonomic dynamic robots based on an artificial potential function method in the presence of lateral slip and parametric uncertainties is presented to organize multiple robots into formation. It is formulated to achieve the smooth control of the translational and rotational motion of a group of mobile robots while keeping a prescribed formation and avoiding inter-robot and obstacle collisions. In order to improve the formation control method effectively and reduce the distortion shape, the virtual leader-following method is proposed for every robot and an improved optimal assignment algorithm is used to solve multi-targets optimal assignment for the formation problem. Simulation results are provided to validate the theoretical results. [ABSTRACT FROM AUTHOR]
- Published
- 2012
- Full Text
- View/download PDF
6. Self-triggered model predictive control for nonholonomic systems
- Author
-
Eqtami, A., Heshmati-Alamdari, S., Dimarogonas, Dimos V., Kyriakopoulos, K. J., Eqtami, A., Heshmati-Alamdari, S., Dimarogonas, Dimos V., and Kyriakopoulos, K. J.
- Abstract
This paper proposes a Model Predictive Control (MPC) framework combined with a self-triggering mechanism for constrained uncertain systems. Under the proposed scheme, the control input as well as the next control update time are provided at each triggering instant. Between two consecutive triggering instants, the control trajectory given by the MPC is applied to the plant in an open-loop fashion. This results to less frequent computations while preserving stability and convergence of the closed-loop system. A scenario for the stabilization of a nonholonomic robot subject to constraints and disturbances is considered, with the aim of reaching a specific triggering mechanism. The robot under the proposed control framework is driven to a compact set where it is ultimately bounded. The efficiency of the proposed approach is illustrated through a simulated example., QC 20140415
- Published
- 2013
- Full Text
- View/download PDF
7. Multi-robot distributed visual consensus using epipoles
- Author
-
Montijano, E., Thunberg, J., Hu, Xiaoming, Sagues, C., Montijano, E., Thunberg, J., Hu, Xiaoming, and Sagues, C.
- Abstract
In this paper we give a distributed solution to the problem of making a team of non-holonomic robots achieve the same heading (attitude consensus problem) using vision sensors with limited field of view. The use of cameras with constrained field of view limits the information the robots perceive compared to other omnidirectional sensors. This makes the consensus problem more complicated, because the robots will not always be able to observe other robots. By using structure from motion computed from images, the robots can estimate the difference in their headings from common observations of the environment without the necessity of directly observe each other. In this way, the robots achieve the consensus in their headings while observing the environment instead of each other. The contribution of the paper is a new controller that uses the epipoles computed from pairs of images to estimate the misalignment between neighbor robots. In addition, the control is robust to changes in the topology of the network and does not require to know the calibration of the cameras in order to achieve the desired configuration. To the best of our knowledge, this is the first time that the epipoles are used in multi-robot consensus, putting their properties in value., QC 20140908
- Published
- 2011
- Full Text
- View/download PDF
8. A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles
- Author
-
Sylvain Lazard, Jean-Daniel Boissonnat, Geometry, Algorithms and Robotics (PRISME), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Models, algorithms and geometry for computer graphics and vision (ISA), INRIA Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP), and Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)
- Subjects
0209 industrial biotechnology ,[INFO.INFO-OH]Computer Science [cs]/Other [cs.OH] ,0102 computer and information sciences ,02 engineering and technology ,Topology ,01 natural sciences ,mobile robot ,Theoretical Computer Science ,Computer Science::Robotics ,plus courts chemins ,020901 industrial engineering & automation ,TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY ,computational geometry ,planification de trajectoires ,Radius of curvature ,Motion planning ,Time complexity ,Mathematics ,système mécanique non holonome ,shortest paths ,géométrie algorithmique ,robotique mobile ,Applied Mathematics ,Mobile robot ,motion planning ,non-holonomic robot ,Computational Mathematics ,Euclidean shortest path ,Exact algorithm ,Computational Theory and Mathematics ,010201 computation theory & mathematics ,Bounded curvature ,Geometry and Topology ,MathematicsofComputing_DISCRETEMATHEMATICS - Abstract
Article dans revue scientifique avec comité de lecture.; International audience; In this paper, we consider the problem of computing shortest paths of bounded curvature amidst obstacles in the plane. More precisely, given two prescribed initial and final configurations (specifying the location and the direction of travel) and a set of obstacles in the plane, we want to compute a shortest $C^1$ path joining those two configurations, avoiding the obstacles, and with the further constraint that, on each $C^2$ piece, the radius of curvature is at least 1. In this paper, we consider the case of moderate obstacles (as introduced by Agarwal et al.) and present a polynomial-time exact algorithm to solve this problem.
- Published
- 2003
- Full Text
- View/download PDF
9. A Polynomial-Time Algorithm for Computing a Shortest Path of Bounded Curvature Amidst Moderate Obstacles
- Author
-
Boissonnat, Jean-Daniel, Lazard, Sylvain, Geometry, Algorithms and Robotics (PRISME), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), and INRIA
- Subjects
Computer Science::Robotics ,SHORTEST PATHS ,MOTION PLANNING ,TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY ,NON-HOLONOMIC ROBOT ,[INFO.INFO-OH]Computer Science [cs]/Other [cs.OH] ,MOBILE ROBOT ,COMPUTATIONAL GEOMETRY ,MathematicsofComputing_DISCRETEMATHEMATICS - Abstract
In this paper, we consider the problem of computing a shortest path of bounded curvature amidst obstacles in the plane. More precisely, given prescribed initial and final configurations (i.e. positions and orientations) and a set of obstacles in the plane, we want to compute a shortest $C¨$ path joining those two configurations, avoiding the obstacles, and with the further constraint that, on each $C©$ piece, the radius of curvature is at least 1. In this paper, we consider the case of moderate obstacles (as introduced by Agarwal et al.) and present a polynomial-time exact algorithm to solve this problem.
- Published
- 1996
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.