Graph Based Path Planning in Unknown Environments Using Voronoi Diagrams

نویسندگان

  • A. Das
  • P. Mukherjee
  • C. Wang
  • G. Salas
  • S. Bedi
  • S. L. Waslander
چکیده

This work presents a method for online path planning based on graph traversal for autonomous mobile systems. A method using the Voronoi diagrams of obstacle dense areas for efficient planning is proposed. This method creates collision free paths for the vehicle in a receding horizon fashion on a per time-step basis, for environments where no prior map data is available. Simulation results of the proposed method running on a four wheel Ackermann drive vehicle are presented. Furthermore, the method is experimentally shown to produce good results on a custom-made platform in an autonomous circuit-race setting.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs

In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...

متن کامل

Sensor-Based Exploration: The Hierarchical Generalized Voronoi Graph

The hierarchical generalized Voronoi graph (HGVG) is a new roadmap developed for sensor-based exploration in unknown environments. This paper defines the HGVG structure: a robot can plan a path between two locations in its work space or configuration space by simply planning a path onto the HGVG, then along the HGVG, and finally from the HGVG to the goal. Since the bulk of the path planning occ...

متن کامل

Robot Motion Planning Using Generalised Voronoi Diagrams

In robot motion planning in a space with obstacles, the goal is to find a collision-free path of robot from the starting to the target position. There are many fundamentally different approaches, and their modifications, to the solution of this problem depending on types of obstacles, dimensionality of the space and restrictions for robot movements. Among the most frequently used are roadmap me...

متن کامل

Roadmap Methods vs. Cell Decomposition in Robot Motion Planning

The task of planning trajectories plays an important role in transportation, robotics, information systems (sending messages), etc. In robot motion planning, the robot should pass around obstacles from a given starting position to a given target position, touching none of them, i.e. the goal is to find a collision-free path from the starting to the target position. Research on path planning has...

متن کامل

Interactive Motion Planning Using Hardware-Accelerated Computation of Generalized Voronoi Diagrams

We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram computation are applicable to both static and dynamic environments of fairly high complexity. We compute a discrete Voronoi diagram by rendering a three-dimensional distance mesh for each Voronoi site. The sites can be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011