Hostname: page-component-5c6d5d7d68-tdptf Total loading time: 0 Render date: 2024-08-29T18:43:19.700Z Has data issue: false hasContentIssue false
  • English
  • Français

A heuristic approach for local path planning in 3D environments

Published online by Cambridge University Press:  07 May 2002

A. Elnagar
A. Elnagar
Affiliation:
Department of Computer Science, University of Sharjah, P. O. Box 27272, Sharjah, U.A.E.
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we describe a heuristic potential based technique for solving the problem of path planning based on local information for a free flying robot (FFR) in a 3D static environment. A path which maximizes the sum of three functions: (repulsion from obstacles, attraction towards the goal, and level attraction) is chosen. While the repulsive and goal-attraction potentials depend on how close is the FFR from obstacles and goal, respectively, the level-attraction potential maintains a certain altitude at which the FFR should navigate. Two additional heuristics are proposed to overcome the local minima problem and to improve the efficiency of the search process. Simulation results of the proposed technique are presented.

Keywords

Trajectory planningObstacle avoidance3D static environments
Type
Research Article
Information
Robotica , Volume 20 , Issue 3 , May 2002 , pp. 281 - 290
Copyright
2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)