Generic Path Planning for Real-Time Applications

  • Authors:
  • Christoph Niederberger;Dejan Radovic;Markus Gross

  • Affiliations:
  • ETH Zürich;ETH Zürich;ETH Zürich

  • Venue:
  • CGI '04 Proceedings of the Computer Graphics International
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a fast and robust path planning algorithm forgeneric static terrains with polygonal obstacles. Our algorithmfinds shorter, and therefore more intuitive paths than atraditional A* approach with a similar underlying graph. Thepresented algorithm is derived from A* and is modified to circumventundecidable situations and unintuitive results. Additionally,we present two post-processing steps to enhance thequality and visual appearance of the resulting paths. The firstmethod minimizes the number of waypoints in a path whilethe second method takes the slope of the terrain into accountin order to generate visually more pleasing paths. We showthat our algorithm is fast and, therefore, well suited for realtimeapplications, such as games or virtual environments.