2004
DOI: 10.1109/tro.2004.829459
|View full text |Cite
|
Sign up to set email alerts
|

Reactive Path Deformation for Nonholonomic Mobile Robots

Abstract: Abstract-This paper presents a novel and generic approach of path optimization for nonholonomic systems. The approach is applied to the problem of reactive navigation for nonholonomic mobile robots in highly cluttered environments. A collision-free initial path being given for a robot, obstacles detected while following this path can make it in collision. The current path is iteratively deformed in order to ge away from obtacles and satisfy the nonholonomic constraints. The core idea of the approach is to pert… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
89
0
1

Year Published

2006
2006
2017
2017

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 146 publications
(90 citation statements)
references
References 29 publications
(26 reference statements)
0
89
0
1
Order By: Relevance
“…Our method also relates to the trajectory optimization literature in robotics [12], [13], [14], [15], though these methods typically focus on improving a pre-supplied (feasible) trajectory via gradient or higher-order methods. Although in this paper we focus on cases where the initial "plan" supplied to the cubic spline optimization problem is very simple and possibly infeasible, there is nothing that prevents the method from being used to optimize a feasible trajectory generated by a planner, as in the approaches above: in this setting the algorithm could also function as a trajectory optimization approach, specifically using a cubic spline parametrization of the trajectory, and using general convex optimization techniques rather than gradient methods alone.…”
Section: Discussion and Related Workmentioning
confidence: 99%
“…Our method also relates to the trajectory optimization literature in robotics [12], [13], [14], [15], though these methods typically focus on improving a pre-supplied (feasible) trajectory via gradient or higher-order methods. Although in this paper we focus on cases where the initial "plan" supplied to the cubic spline optimization problem is very simple and possibly infeasible, there is nothing that prevents the method from being used to optimize a feasible trajectory generated by a planner, as in the approaches above: in this setting the algorithm could also function as a trajectory optimization approach, specifically using a cubic spline parametrization of the trajectory, and using general convex optimization techniques rather than gradient methods alone.…”
Section: Discussion and Related Workmentioning
confidence: 99%
“…As the moving disk approaches the path, the path is increasingly deformed until it snaps [6]. Although several motion deformation methods have been proposed [6], [7], [8], [9], [10], all deform only the geometric path and ignore the time dimension of a dynamic environment. This is not entirely satisfactory.…”
Section: A Background and Motivationmentioning
confidence: 99%
“…For instance, [15] introduced the elastic bands as a combined planning and control methodology to dynamically deform paths while allowing real time obstacle avoidance. The idea of dynamically deform paths evolved and met important progresses [8], [3] and provided extensions to higher planning instances [5]. Other approaches exist that attempt to increase the planner reliability by embedding realistic simulators on the planner, [11].…”
Section: Introductionmentioning
confidence: 99%