Avoiding moving obstacles by deviation from a mobile robot`s nominal path
- Univ. of Reading, Whiteknights (United Kingdom). Dept. of Cybernetics
This paper deals with the problem of obstacle avoidance by deviation from the nominal path. Deviation is the only option available to the robot when the acceleration or deceleration plan on the nominal path fails to produce a viable avoidance strategy. The obstacle avoidance on the nominal path was dealt with in the authors` previous development, where the robot`s motion was only subject to an upper bound on its speed. When the robot has to deviate, its motion is subject to a maximum steering constraint and a maximum deviation constraint in addition to the maximum speed constraint. The problem is solved geometrically by identifying final states for the robot that are reachable, satisfy all the constraints, and guarantee collision avoidance. The final state-reachability conditions that the authors obtain in the process ensure that no unnecessary deviation plan is initiated. These conditions, along with the simplicity of the geometric arguments they employ, make the scheme an attractive option for on-line implementation. The only significant complexity arises when minimizing the performance index. They have suggested dynamic programming as an optimization took, but any other nonlinear optimization technique can be adopted.
- OSTI ID:
- 354268
- Journal Information:
- International Journal of Robotics Research, Vol. 18, Issue 5; Other Information: PBD: May 1999
- Country of Publication:
- United States
- Language:
- English
Similar Records
Whole arm obstacle avoidance for teleoperated robots
Path planning and obstacle avoidance hybrid system using a connectionist network. (Final report). Master's thesis