On-line planning for collision avoidance on the nominal path

DOI10.1023/A:1007919920684MaRDI QIDQ1383987zbMATH OpenFDO

Authors A. Tsoularis, C. Kambhampati

Publication date 13 April 1998

Published in Journal of Intelligent \& Robotic Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1007919920684

zbMATH Keywords

collision avoidancelinear quadratic optimal controlmobile robotmotion planningquadratic constraints

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Differential games and control (49N70) Pursuit and evasion games (49N75) Linear systems in control theory (93C05) Discrete-time control/observation systems (93C55) Automated systems (robots, etc.) in control theory (93C85)

Review text

The subject of this paper is the problem of collision avoidance by a mobile robot able to move in the plane. In order to account for physical dimensions of the robot and of the obstacles, all these objects have been approximated by two-dimensional discs. The dynamics of motion of the robot are simplified to the dynamics of a material point moving along a prescribed rectilinear path and subject to a piecewise constant acceleration. Also, the obstacles are assumed to move uniformly along straight lines. The problem considered in the paper is the following: given a nominal path and a nominal velocity of the robot, and knowing positions and velocities of the obstacles, design the robot's motion along this path in such a way that the robot avoids collisions with the obstacles, while its velocity deviation from the nominal one is minimized, respecting at the same time a given upper bound on the robot's velocity. Mathematically, this problem has been formulated as a discrete linear quadratic optimal control problem with additional quadratic constraints reflecting the collision avoidance requirement. Explicit solutions to this problem are presented and two basic motion strategies are proposed to be implemented at the moment when a possibility of collision is detected: an acceleration strategy and a deceleration strategy. Some simulations are provided to illustrate these collision avoidance strategies.

Recommendations

• Optimal and suboptimal motion planning for collision avoidance of mobile robots in non-stationary environments
• Path planning and collision avoidance for robots
• Path-planning with collision avoidance in automotive industry
• scientific article; zbMATH DE number 1160333

Cited in

(14)

• Generalized solutions of the pursuit problem in three-dimensional Euclidean space
• Optimal and suboptimal motion planning for collision avoidance of mobile robots in non-stationary environments
• Networked event-based collision avoidance of mobile objects with trajectory planning based on Bézier curves
• Optimal collision-avoiding deceleration when approaching a stochastically vanishing obstacle
• Collision-free piecewise quadratic spline with regular quadratic obstacles
• scientific article; zbMATH DE number 4074554 (Why is no real title available?)
• Collision-avoidance trajectory planning using tube concept: Analysis and simulation
• scientific article; zbMATH DE number 52637 (Why is no real title available?)
• scientific article; zbMATH DE number 1241277 (Why is no real title available?)
• scientific article; zbMATH DE number 1160333 (Why is no real title available?)
• Path-planning with collision avoidance in automotive industry
• Dynamic obstacle avoidance with simultaneous translational and rotational motion control for autonomous mobile robot
• scientific article; zbMATH DE number 2246340 (Why is no real title available?)
• A case study of the collision-avoidance problem based on Bernstein-Bézier path tracking for multiple robots with known constraints

This page was built for publication: On-line planning for collision avoidance on the nominal path

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383987)