Publication result detail

A NOTE ABOUT PSEUDO3D GRID APPROXIMATION OF LANDSCAPE FOR A HOLONOMIC ROBOT PATH PLANNING WITH NAÏVE PATH OPTIMIZATION

KNISPEL, L.; MATOUŠEK, R.; ABBADI, A.; DVOŘÁK, J.

Original Title

A NOTE ABOUT PSEUDO3D GRID APPROXIMATION OF LANDSCAPE FOR A HOLONOMIC ROBOT PATH PLANNING WITH NAÏVE PATH OPTIMIZATION

English Title

A NOTE ABOUT PSEUDO3D GRID APPROXIMATION OF LANDSCAPE FOR A HOLONOMIC ROBOT PATH PLANNING WITH NAÏVE PATH OPTIMIZATION

Type

Scopus Article

Original Abstract

This article presents a simple method of the approximation of the 3D landscape by a weighted Pseudo3D Dijkstra’s Grid and its usage for the path planning of holonomic robots with omnidirectional platforms in known environments with static obstacles. The surveyed problem is relevant to a number of ordinary applications dealing with 3D surfaces in general. Article proposes a different implementation of the given issue by a grid approach to the approximated digital surface model featuring the Dijkstra’s shortest path algorithm with simple custom postprocessing optimization of the final solution. Three experiments in the custom C++ simulation environment RRT Explorer 3.0 are shown using two distinctive densities of the grid thus demonstrating the diverse levels of the landscape approximation. In the conclusion, the advantages and drawbacks of the offered method are discussed.

English abstract

This article presents a simple method of the approximation of the 3D landscape by a weighted Pseudo3D Dijkstra’s Grid and its usage for the path planning of holonomic robots with omnidirectional platforms in known environments with static obstacles. The surveyed problem is relevant to a number of ordinary applications dealing with 3D surfaces in general. Article proposes a different implementation of the given issue by a grid approach to the approximated digital surface model featuring the Dijkstra’s shortest path algorithm with simple custom postprocessing optimization of the final solution. Three experiments in the custom C++ simulation environment RRT Explorer 3.0 are shown using two distinctive densities of the grid thus demonstrating the diverse levels of the landscape approximation. In the conclusion, the advantages and drawbacks of the offered method are discussed.

Keywords

path planning, Dijkstra’s algorithm, holonomic robot, weighted graph, path optimization

Key words in English

path planning, Dijkstra’s algorithm, holonomic robot, weighted graph, path optimization

Authors

KNISPEL, L.; MATOUŠEK, R.; ABBADI, A.; DVOŘÁK, J.

RIV year

2016

Released

23.06.2015

Location

Brno

ISBN

1803-3814

Periodical

Mendel Journal series

Volume

2015

Number

21

State

Czech Republic

Pages from

127

Pages to

130

Pages count

4

Full text in the Digital Library

http://hdl.handle.net/

BibTex

@article{BUT116337,
  author="Radomil {Matoušek} and Lukáš {Knispel} and Ahmad {Abbadi} and Jiří {Dvořák}",
  title="A NOTE ABOUT PSEUDO3D GRID APPROXIMATION OF LANDSCAPE FOR A HOLONOMIC ROBOT PATH PLANNING WITH NAÏVE PATH OPTIMIZATION",
  journal="Mendel Journal series",
  year="2015",
  volume="2015",
  number="21",
  pages="127--130",
  issn="1803-3814"
}