Graph and Geometric Algorithms and Efficient Data Structures

book chapter

English

Many NP-complete optimization problems may be approximately solved by stochastic or deterministic heuristic methods and it is necessary to find their efficient data representation to minimize iteration computational time. In this chapter, we will touch the Minimum Steiner Tree Problems in Graphs (or Network Steiner Tree Problem), which can be solved by heuristics based on the Minimum Spanning Tree Problem and/or the Shortest Path Problem using a binary heap that enables to implement a priority queue that substantially increases the algorithm efficiency. We will also show a Delaunay triangulation-based way of finding minimal networks connecting a set of given points in the Euclidean plane using straight lines (minimum spanning tree) and its more general case (Steiner minimum tree) where additional points can be considered. Finally, we will deal with visibility graphs, Voronoi diagrams and rapidly exploring trees and focus on their applications in robot motion planning, where the robot should pass around obstacles from a given starting position to a given target position, touching none of them.

Steiner tree, Voronoi diagram, Delaunay triangulation, visibility graph, rapidly exploring tree, binary heap

ŠEDA, M.

2012

31. 12. 2012

Springer-Verlag

Berlin (Germany)

978-3-642-30503-0

Zelinka, I., Snášel, V., Abraham, A. (eds.): Handbook of Optimization. From Classical to Modern Approach.

Optimisation

1

73

95

23